| Efficient non-segregated routing for reconfigurable demand-aware networks T Fenz, KT Foerster, S Schmid, A Villedieu Computer Communications 164, 138-147, 2020 | 33 | 2020 |
| Planarizing graphs and their drawings by vertex splitting M Nöllenburg, M Sorge, S Terziadis, A Villedieu, HY Wu, J Wulms International Symposium on Graph Drawing and Network Visualization, 232-246, 2022 | 14 | 2022 |
| Splitting vertices in 2-layer graph drawings R Ahmed, P Angelini, MA Bekos, G Di Battista, M Kaufmann, ... IEEE Computer Graphics and Applications 43 (3), 24-35, 2023 | 8 | 2023 |
| Multidimensional Manhattan Preferences J Chen, M Nöllenburg, S Simola, A Villedieu, M Wallinger Latin American Symposium on Theoretical Informatics, 273-289, 2022 | 6 | 2022 |
| The complexity of cluster vertex splitting and company A Firbas, A Dobler, F Holzer, J Schafellner, M Sorge, A Villedieu, ... Discrete Applied Mathematics 365, 190-207, 2025 | 5 | 2025 |
| Turbocharging heuristics for weak coloring numbers A Dobler, M Sorge, A Villedieu arXiv preprint arXiv:2203.03358, 2022 | 4 | 2022 |
| Improving readability of static, straight-line graph drawings: A first look at edge crossing resolution through iterative vertex splitting H Ehlers, A Villedieu, RG Raidou, HY Wu Computers & Graphics 116, 448-463, 2023 | 3 | 2023 |
| MySemCloud: Semantic-aware Word Cloud Editing M Huber, M Nöllenburg, A Villedieu 2023 IEEE 16th Pacific Visualization Symposium (PacificVis), 147-156, 2023 | 3 | 2023 |
| Crossing minimization in time interval storylines A Dobler, M Nöllenburg, D Stojanovic, A Villedieu, J Wulms arXiv preprint arXiv:2302.14213, 2023 | 2 | 2023 |
| Layered area-proportional rectangle contact representations M Nöllenburg, A Villedieu, J Wulms International Symposium on Graph Drawing and Network Visualization, 318-326, 2021 | 2 | 2021 |
| On 1-Bend Upward Point-Set Embeddings of st-Digraphs E Di Giacomo, H Förster, D Kokhovich, T Mchedlidze, F Montecchiani, ... Latin American Symposium on Theoretical Informatics, 3-18, 2024 | 1 | 2024 |
| Splitting Plane Graphs to Outerplanarity M Gronemann, M Nöllenburg, A Villedieu International Conference and Workshops on Algorithms and Computation, 217-228, 2023 | 1 | 2023 |
| Minimum link fencing S Bhore, F Klute, M Löffler, M Nöllenburg, S Terziadis, A Villedieu arXiv preprint arXiv:2209.14804, 2022 | 1 | 2022 |
| Splitting Plane Graphs to Outerplanarity M Gronemann, M Nöllenburg, A Villedieu Journal of Graph Algorithms and Applications 28 (3), 31-48, 2024 | | 2024 |
| Splitting Vertices in 2-Layer Graph Drawings M Kaufmann, R Ahmed, P Angelini, MA Bekos, G Di Battista, ... IEEE Computer Graphics and Applications 43 (3), 2023 | | 2023 |
| Engineering human-in-the-loop graph drawing algorithms A Villedieu Technische Universität Wien, 2023 | | 2023 |
