Anaïs Villedieu

Address:
Anaïs Villedieu
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Email:	avilledieu@ac.tuwien.ac.at
Web:	http://www.ac.tuwien.ac.at/people/avilledieu/

12 results

2025
[12]	Planarizing Graphs and their Drawings by Vertex Splitting Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms J. Computational Geometry, volume 16, number 1, pages 333–372, 2025. [bibtex] [doi]
2024
[11]	Splitting Plane Graphs to Outerplanarity Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu J. Graph Algorithms Appl., volume 28, number 3, pages 31–48, 2024. [bibtex] [doi]
2023
[10]	Splitting Vertices in 2-Layer Graph Drawings Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger IEEE Computer Graphics and Applications, volume 43, number 3, pages 24–35, 2023. [bibtex] [doi]
[9]	Planarizing Graphs and their Drawings by Vertex Splitting Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 232–246, 2023, Springer. [bibtex] [pdf] [doi]
[8]	MySemCloud: Semantic-aware Word Cloud Editing Michael Huber, Martin Nöllenburg, Anaïs Villedieu Pacific Visualization Symposium (PacificVis'23), pages 147–156, 2023. [bibtex] [pdf] [doi]
[7]	Splitting Plane Graphs to Outerplanarity Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu Algorithms and Computation (WALCOM'23) (Bertrand M. T. Lin, Chun-Cheng Lin, Giuseppe Liotta, eds.), volume 13973 of LNCS, 2023, Springer. [bibtex] [pdf] [doi]
[6]	Crossing Minimization in Time Interval Storylines Alexander Dobler, Martin Nöllenburg, Daniel Stojanovic, Anaïs Villedieu, Jules Wulms European Workshop on Computational Geometry (EuroCG'23) (Clemens Huemer, Carlos Seara, eds.), pages 36:1–36:7, 2023. [bibtex] [pdf]
2022
[5]	Turbocharging Heuristics for Weak Coloring Numbers Alexander Dobler, Manuel Sorge, Anaïs Villedieu European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of LIPIcs, pages 44:1–44:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
[4]	Multidimensional Manhattan Preferences Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger Theoretical Informatics (LATIN'22) (Armando Castañeda, Francisco Rodríguez-Henríquez, eds.), volume 13568 of LNCS, pages 273–289, 2022, Springer. [bibtex] [doi]
[3]	Minimum Link Fencing Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu Algorithms and Computation (ISAAC'22) (Sang Won Bae, Heejin Park, eds.), volume 248 of LIPIcs, pages 34:1–34:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. [bibtex] [doi]
2021
[2]	Layered Area-Proportional Rectangle Contact Representation Martin Nöllenburg, Anaïs Villedieu, Jules Wulms Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 318–326, 2021, Springer. [bibtex] [doi]
2019
[1]	Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks Thomas Fenz, Klaus-Tycho Foerster, Stefan Schmid, Anaïs Villedieu IFIP Networking Conference (Networking'19), pages 1–9, 2019, IEEE. [bibtex] [doi]