default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnaïs Villedieu
Person information
- affiliation: Technische Universität Wien, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j5]Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann:
The complexity of cluster vertex splitting and company. Discret. Appl. Math. 365: 190-207 (2025)- 2024
- [j4]Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu:
Splitting Plane Graphs to Outerplanarity. J. Graph Algorithms Appl. 28(3): 31-48 (2024) - 2023
- [j3]Henry Ehlers
, Anaïs Villedieu, Renata G. Raidou, Hsiang-Yun Wu:
Improving readability of static, straight-line graph drawings: A first look at edge crossing resolution through iterative vertex splitting. Comput. Graph. 116: 448-463 (2023) - [j2]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications 43(3): 24-35 (2023) - 2020
- [j1]Thomas Fenz, Klaus-Tycho Foerster, Stefan Schmid, Anaïs Villedieu:
Efficient non-segregated routing for reconfigurable demand-aware networks. Comput. Commun. 164: 138-147 (2020)
Conference and Workshop Papers
- 2024
- [c10]Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu:
On 1-Bend Upward Point-Set Embeddings of st-Digraphs. LATIN (1) 2024: 3-18 - [c9]Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann:
The Complexity of Cluster Vertex Splitting and Company. SOFSEM 2024: 226-239 - 2023
- [c8]Michael Huber, Martin Nöllenburg, Anaïs Villedieu:
MySemCloud: Semantic-aware Word Cloud Editing. PacificVis 2023: 147-156 - [c7]Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu:
Splitting Plane Graphs to Outerplanarity. WALCOM 2023: 217-228 - 2022
- [c6]Alexander Dobler, Manuel Sorge, Anaïs Villedieu:
Turbocharging Heuristics for Weak Coloring Numbers. ESA 2022: 44:1-44:18 - [c5]Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms:
Planarizing Graphs and Their Drawings by Vertex Splitting. GD 2022: 232-246 - [c4]Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu:
Minimum Link Fencing. ISAAC 2022: 34:1-34:14 - [c3]Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger:
Multidimensional Manhattan Preferences. LATIN 2022: 273-289 - 2021
- [c2]Martin Nöllenburg, Anaïs Villedieu, Jules Wulms:
Layered Area-Proportional Rectangle Contact Representations. GD 2021: 318-326 - 2019
- [c1]Thomas Fenz, Klaus-Tycho Foerster, Stefan Schmid, Anaïs Villedieu:
Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks. Networking 2019: 1-9
Informal and Other Publications
- 2024
- [i11]Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu:
On 1-bend Upward Point-set Embeddings of st-digraphs. CoRR abs/2401.03226 (2024) - 2023
- [i10]Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu:
Splitting Plane Graphs to Outerplanarity. CoRR abs/2301.09440 (2023) - [i9]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger:
Splitting Vertices in 2-Layer Graph Drawings. CoRR abs/2301.10872 (2023) - [i8]Alexander Dobler, Martin Nöllenburg, Daniel Stojanovic, Anaïs Villedieu, Jules Wulms:
Crossing Minimization in Time Interval Storylines. CoRR abs/2302.14213 (2023) - [i7]Michael Huber, Martin Nöllenburg, Anaïs Villedieu:
MySemCloud: Semantic-aware Word Cloud Editing. CoRR abs/2306.12759 (2023) - [i6]Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann:
The Complexity of Cluster Vertex Splitting and Company. CoRR abs/2309.00504 (2023) - 2022
- [i5]Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger:
Multidimensional Manhattan Preferences. CoRR abs/2201.09691 (2022) - [i4]Soeren Nickel, Martin Nöllenburg, Manuel Sorge, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms:
Planarizing Graphs and their Drawings by Vertex Splitting. CoRR abs/2202.12293 (2022) - [i3]Alexander Dobler, Manuel Sorge, Anaïs Villedieu:
Turbocharging Heuristics for Weak Coloring Numbers. CoRR abs/2203.03358 (2022) - [i2]Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu:
Minimum Link Fencing. CoRR abs/2209.14804 (2022) - 2021
- [i1]Martin Nöllenburg, Anaïs Villedieu, Jules Wulms:
Layered Area-Proportional Rectangle Contact Representations. CoRR abs/2108.10711 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-19 01:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
