| [1] | Metric Dimension and Geodetic Set Parameterized by Vertex Cover 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, Jena, Germany, March 4-7, 2025 (Olaf Beyersdorff, Michal Pilipczuk, Elaine Pimentel, Kim Thang Nguyen, eds.), pages 33:1–33:20, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [2] | The Computational Complexity of Positive Non-Clashing Teaching in Graphs The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net. |
| [1] | Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable J. Computational Geometry, volume 15, number 2, pages 3–39, 2024. |
| [2] | Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width) 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Julián Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 40:1–40:15, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [3] | Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 66:1–66:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters SIAM J. Discrete Math., 2023. Note: to appear |
| [2] | New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162) Dagstuhl Reports, volume 13, number 4, pages 58–97, 2023. |
| [3] | Consistency Checking Problems: A Gateway to Parameterized Sample Complexity 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 18:1–18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [4] | Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable Computational Geometry (SoCG'23) (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [5] | Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [6] | Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II (Michael A. Bekos, Markus Chimani, eds.), volume 14466 of Lecture Notes in Computer Science, pages 203–217, 2023, Springer. |
| [1] | Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks The Fourteenth International Conference on Learning Representations, ICLR 2026, 2026, OpenReview.net. Note: to appear |
| [1] | Planarizing Graphs and their Drawings by Vertex Splitting J. Computational Geometry, volume 16, number 1, pages 333–372, 2025. |
| [2] | The complexity of cluster vertex splitting and company Discrete Applied Mathematics, volume 365, pages 190–207, 2025. |
| [3] | Optimal Decision Tree Pruning Revisited: Algorithms and Complexity Forty-second International Conference on Machine Learning, ICML 2025, Vancouver, BC, Canada, July 13-19, 2025, 2025, OpenReview.net. |
| [1] | The Complexity of Cluster Vertex Splitting and Company Theory and Practice of Computer Science (SOFSEM'24) (Henning Fernau, Serge Gaspers, Ralf Klasing, eds.), volume 14519 of LNCS, pages 226–239, 2024, Springer. |
| [1] | On Computing Optimal Tree Ensembles International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA (Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, Jonathan Scarlett, eds.), volume 202 of Proceedings of Machine Learning Research, pages 17364–17374, 2023, PMLR. |
| [2] | Planarizing Graphs and their Drawings by Vertex Splitting Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 232–246, 2023, Springer. |
| [3] | The Influence of Dimensions on the Complexity of Computing Decision Trees Conference on Artificial Intelligence (AAAI'23) (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 8343–8350, 2023, AAAI Press. |
| [1] | Threshold Treewidth and Hypertree Width Journal of Artificial Intelligence Research, volume 74, pages 1687–1713, 2022. |
| [2] | Turbocharging Heuristics for Weak Coloring Numbers 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. |
| [1] | Threshold Treewidth and Hypertree Width Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, pages 1898–1904, 2020. |
| [2] | Threshold Treewidth and Hypertree Width 2020, Technical report AC-TR-20-005, Algorithms and Complexity Group, TU Wien. |
| [1] | Revisiting Large Neighborhood Search with On-the-Fly ChargingStation Insertion for the Electric Autonomous Dial-a-Ride Problem ACM Transactions on Evolutionary Learning and Optimization, volume 6, number 2, pages 1–31, 2026. |
| [2] | A Reinforcement Learning Guided Large Neighborhood Search for the Dynamic Electric Autonomous Dial-a-Ride Problem Machine Learning, Optimization, and Data Science – LOD 2025 (Giuseppe Nicosia, Varunand Giesselbach, Sven Ojha, M. Panos Pardalos, Renato Umeton, La Malfa Emanuele, La Malfa Gabriele, eds.), volume 16467 of LNCS, pages 425-439, 2026, Springer. |
| [3] | Determining Destroy Sets in Large Neighborhood Search by Generative Flow Networks Parallel Problem Solving from Nature – PPSN XIX, volume 16985 of LNCS, pages 265–281, 2026, Springer. |
| [4] | Search Space Reduction Through Machine Learning for the Electric Autonomous Dial-A-Ride Problem Machine Learning, Optimization, and Data Science – LOD 2025, volume 16467 of LNCS, pages 185–200, 2026, Springer. |
| [1] | Improvements in Large Neighborhood Search for the Electric Autonomous Dial-a-Ride Problem Computer Aided Systems Theory – EUROCAST 2024 (Alexis Quesada-Arencibia, Michael Affenzeller, Roberto Moreno-Díaz, eds.), volume 15172 of LNCS, pages 211–220, 2025, Springer. |
| [1] | Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion Proceedings of the Genetic and Evolutionary Computation Conference, pages 142–150, 2024, Association for Computing Machinery. Note: best paper award winner of ECOM track |
| [2] | Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Rachid Ellaia, El-Ghazali Talbi, eds.), pages 3–20, 2024, Springer. |
| [1] | Formally Verified Graph Generation with SAT Modulo Symmetries and Lean Automated Reasoning - 13th International Joint Conference, IJCAR 2026, Lisbon, Portugal, July 26–29, 2026, Proceedings, Part I (Armin Biere, Carsten Lutz, Sara Negri, eds.), volume 16688 of Lecture Notes in Computer Science, pages 117–135, 2026, Springer. |
| [2] | Graph Choosability via SAT: Beyond the Nullstellensatz Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 14269–14277, 2026, AAAI Press. |
| [3] | Smart Cubing for Graph Search: A Comparative Study 32nd International Conference on Principles and Practice of Constraint Programming, CP 2026, July 20–23, 2026, Lisbon, Portugal, volume 379 of LIPIcs, pages 33:1–33:19, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: Preprint: CoRR abs/2501.17201, https://arxiv.org/abs/2501.17201 |
| [1] | Breaking Symmetries in Quantified Graph Search: A Comparative Study AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA (Toby Walsh, Julie Shah, Zico Kolter, eds.), pages 11246–11254, 2025, AAAI Press. |
| [1] | SAT Modulo Symmetries for Graph Generation and Enumeration ACM Transactions on Computational Logic, volume 25, number 3, 2024. |
| [2] | Satisfiability Modulo User Propagators Journal of Artificial Intelligence Research, volume 81, pages 989–1017, 2024. |
| [3] | Computing small Rainbow Cycle Numbers with SAT modulo Symmetries The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw, ed.), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 13:1–13:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [2] | Co-Certificate Learning with SAT Modulo Symmetries Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 1944–1953, 2023, ijcai.org. Note: Main Track |
| [3] | IPASIR-UP: User Propagators for CDCL The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 8:1–8:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [4] | SAT-Based Generation of Planar Graphs The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 14:1–14:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation Evolutionary Computation in Combinatorial Optimization – EvoCOP 2022 (Leslie Pérez Cáceres, Sébastien Verel, eds.), volume 13222 of LNCS, pages 127–142, 2022, Springer. Note: best paper award winner |
| [2] | A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation Evolutionary Computation in Combinatorial Optimization - 22nd European Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20-22, 2022, Proceedings (Leslie Pérez Cáceres, Sébastien Vérel, eds.), volume 13222 of Lecture Notes in Computer Science, pages 127–142, 2022, Springer. |
| [3] | A SAT Attack on Rota’s Basis Conjecture 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 4:1–4:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | SAT Modulo Symmetries for Graph Generation Proceeings of CP 2021, the 27th International Conference on Principles and Practice of Constraint Programming (Laurent D. Michel, ed.), pages 39:1–-39:17, 2021, Dagstuhl Publishing. |
| [1] | Bilateral Treewidth for QBF: Where Strategies and Resolution Meet 29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, Lisbon, Portugal, July 20-23, 2026 (Alexey Ignatiev, Stefan Szeider, eds.), volume 377 of LIPIcs, pages 16:1–16:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [2] | Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, 2026, PMLR. Note: to appear |
| [1] | Parameterized Complexity of Asynchronous Border Minimization Algorithmica, volume 81, number 1, pages 201–223, 2019. |
| [1] | Fixed-parameter Tractable Reductions to SAT for Planning Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence, July 25–31, 2015, Buenos Aires, Argentina, 2015. |
| [2] | Parameterized Complexity of Asynchronous Border Minimization Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (Rahul Jain, Sanjay Jain, Frank Stephan, eds.), volume 9076 of Lecture Notes in Computer Science, pages 428–440, 2015, Springer. |
| [3] | Variable-Deletion Backdoors to Planning Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA. (Blai Bonet, Sven Koenig, eds.), pages 3305–3312, 2015, AAAI Press. |
| [1] | Backdoors to Planning Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada. (Carla E. Brodley, Peter Stone, eds.), pages 2300–2307, 2014, AAAI Press. |
| [1] | $F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness IEEE Trans. Vis. Comput. Graph., volume 32, number 1, pages 747–757, 2026. |
| [2] | ARCOL: Aspect Ratio Constrained Orthogonal Layout Comput. Graph. Forum, 2026. |
| [3] | Block Crossings in One-Sided Tanglegrams Algorithmica, volume 88, pages 20:1–20:30, 2026. |
| [4] | Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time Discrete and Computational Geometry, volume 75, pages 391–430, 2026. |
| [5] | Multidimensional Manhattan preferences Discrete Applied Mathematics, volume 395, pages 172–202, 2026. |
| [6] | Representing Hypergraphs by Point-Line Incidences Discret. Math. Theor. Comput. Sci., volume 28, number 3, pages \#3:1–24, 2026. |
| [7] | The Parameterized Complexity Of Extending Stack Layouts Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026. |
| [8] | The Story(line) So Far: A Survey on Storyline Visualization Comput. Graph. Forum, volume 45, number 3, 2026. |
| [9] | Visualizing Treewidth J. Graph Algorithms Appl., volume 30, number 2, pages 199–235, 2026. |
| [10] | Clarity and Computational Efficiency of Orbital Boundary Labeling Pacific Visualization Symposium (PacificVis'26), pages 1–10, 2026. |
| [11] | Combined Network and Set Visualization with Hoop and Linear Diagrams Diagrammatic Representation and Inference (DIAGRAMS'26), 2026, Springer. Note: To appear. |
| [12] | Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchies Pacific Visualization Symposium (PacificVis'26), pages 22–32, 2026. |
| [13] | On the Complexity of Extending Storylines Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [14] | One-Sided Local Crossing Minimization Algorithms and Computation (ISAAC'26) (Nicole Megow, Lin Chen, eds.), volume 399 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear |
| [15] | Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [16] | Realizing Planar Linkages in Polygonal Domains International Workshop on Combinatorial Algorithms (IWOCA'26) (F. Foucaud, A. Parreau, eds.), volume 16587 of LNCS, pages 251–265, 2026, Springer. |
| [17] | The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [18] | The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [19] | The Peculiarities of Extending Queue Layouts Graph-Theoretic Concepts in Computer Science (WG'25) (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of LNCS, pages 177–191, 2026, Springer. |
| [20] | Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms Graph Drawing and Network Visualization (GD'26) (Maarten Löffler, Silvia Miksch, eds.), volume 396 of LIPIcs, 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. |
| [21] | Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms 34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [22] | Using $\beta$-proximity to Reduce Distortion in Bundled Graph Drawings EuroVis 2026 – Short Papers (Jan Byska, Alvitta Ottley, Manuela Waldner, eds.), 2026, Eurographics Association. |
| [1] | An Introduction to and Survey of Biological Network Visualization Computers \& Graphics, volume 126, pages 104115, 2025. |
| [2] | Bundling-Aware Graph Drawing Revisited IEEE Trans. Vis. Comput. Graph., volume 31, number 12, pages 10828–10839, 2025. |
| [3] | Constrained Boundary Labeling Comput. Geom. Theory Appl., volume 129, pages 102191, 2025. |
| [4] | Introducing Fairness in Network Visualization Information Sciences, volume 691, pages 121642, 2025. |
| [5] | Optimizing Staircase Motifs in Biofabric Network Layouts Comput. Graph. Forum, pages e70139, 2025. |
| [6] | Passenger Decision-Making in Mass Transit Systems: Insights From Dual-Process Theories Applied Cognitive Psychology, volume 39, number 5, pages e70112, 2025. |
| [7] | Planarizing Graphs and their Drawings by Vertex Splitting J. Computational Geometry, volume 16, number 1, pages 333–372, 2025. |
| [8] | StorySets: Ordering Curves and Dimensions for Visualizing Uncertain Sets and Multi-Dimensional Discrete Data CoRR, 2025. |
| [9] | Transitions in Dynamic Point Labeling Cartography and Geographic Information Science, pages 1–26, 2025. |
| [10] | Geometry Matters in Planar Storyplans Graph Drawing and Network Visualization (GD'25) (Vida Dujmović, Fabrizio Montecchiani, eds.), volume 357 of LIPIcs, pages 27:1–27:9, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [11] | On Minimizing Wiggle in Stacked Area Charts Algorithms and Data Structures (WADS'25) (Pat Morin, Eunjin Oh, eds.), volume 349 of LIPIcs, pages 22:1–22:14, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [12] | On Planar Unit-Length Linear Linkages in Polygonal Domains European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 55:1–55:9, 2025. |
| [13] | Optimizing Wiggle in Storylines Graph Drawing and Network Visualization (GD'25) (Vida Dujmović, Fabrizio Montecchiani, eds.), volume 357 of LIPIcs, pages 39:1–39:17, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [14] | Partial Level Planarity Parameterized by the Size of the Missing Graph European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 50:1–50:10, 2025. |
| [15] | Pathways to Tractability for Geometric Thickness Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. |
| [16] | Pathways to Tractability for Geometric Thickness (Best Paper Award) SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20-23, 2025, Proceedings, Part I (Rastislav Královic, Vera Kurková, eds.), volume 15538 of Lecture Notes in Computer Science, pages 209–224, 2025, Springer. |
| [17] | Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms Algorithms and Data Structures (WADS'25) (Pat Morin, Eunjin Oh, eds.), volume 349 of LIPIcs, pages 14:1–14:22, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [18] | Representing Hypergraphs by Point-Line Incidences Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 241–254, 2025, Springer. |
| [19] | The Peculiarities of Extending Queue Layouts Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of Lecture Notes in Computer Science, pages 177–191, 2025, Springer. |
| [20] | Visualizing Treewidth Graph Drawing and Network Visualization (GD'25) (Vida Dujmović, Fabrizio Montecchiani, eds.), volume 357 of LIPIcs, pages 17:1–17:20, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [21] | F2Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness 2025, Technical report AC-TR-25-001, Algorithms and Complexity Group, TU Wien. |
| [1] | Computing Data-driven Multilinear Metro Maps The Cartographic Journal, pages 1–16, 2024. |
| [2] | Computing Hive Plots: A Combinatorial Framework J. Graph Algorithms Appl., volume 28, number 2, pages 101–129, 2024. |
| [3] | Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable J. Computational Geometry, volume 15, number 2, pages 3–39, 2024. |
| [4] | Improving Temporal Treemaps by Minimizing Crossings Comput. Graph. Forum, volume 43, number 3, pages e15087, 2024. |
| [5] | On the Complexity of the Storyplan Problem J. Computer and Systems Sciences, volume 139, pages 103466, 2024. |
| [6] | Splitting Plane Graphs to Outerplanarity J. Graph Algorithms Appl., volume 28, number 3, pages 31–48, 2024. |
| [7] | Uncertainty in Humanities Network Visualization Frontiers in Communication, volume 8, pages 1305137, 2024. |
| [8] | Visualizing Extensions of Argumentation Frameworks as Layered Graphs CoRR, volume abs/2409.05457, 2024. |
| [9] | Boundary Labeling in a Circular Orbit Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 22:1–22:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [10] | Bundling-Aware Graph Drawing Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 15:1–15:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [11] | Constrained Boundary Labeling Algorithms and Computation (ISAAC'24) (Julian Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 26:1–26:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [12] | Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time Computational Geometry (SoCG'24) (Wolfgang Mulzer, Jeff M. Phillips, eds.), volume 293 of LIPIcs, pages 19:1–19:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [13] | GdMetriX - A NetworkX Extension For Graph Drawing Metrics Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 45:1–45:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: Poster abstract |
| [14] | Hoop Diagrams: A Set Visualization Method Diagrammatic Representation and Inference (DIAGRAMS'24), volume 14981 of LNCS, pages 377-392, 2024, Springer. |
| [15] | Introducing Fairness in Graph Visualization Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 49:1–49:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: Poster abstract |
| [16] | Introducing Fairness in Graph Visualization via Gradient Descent Machine Learning Methods in Visualisation for Big Data (MLVis'24) (Daniel Archambault, Ian Nabney, Jaakko Peltonen, eds.), pages 1–5, 2024, Eurographics Association. |
| [17] | Minimizing Switches in Cased Graph Drawings Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 43:1–43:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: Poster abstract |
| [18] | Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 31:1–31:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [19] | The Parameterized Complexity of Extending Stack Layouts Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [20] | The Parameterized Complexity Of Extending Stack Layouts 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Faster Edge-Path Bundling Through Graph Spanners Computer Graphics Forum, volume 42, number 6, pages e14789, 2023. |
| [2] | LinSets.zip: Compressing Linear Set Diagrams IEEE Trans. Visualization and Computer Graphics, volume 29, number 6, pages 2875–2887, 2023. |
| [3] | MosaicSets: Embedding Set Systems into Grid Graphs IEEE Trans. Visualization and Computer Graphics, 2023. |
| [4] | New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162) Dagstuhl Reports, volume 13, number 4, pages 58–97, 2023. |
| [5] | On the Upward Book Thickness Problem: Combinatorial and Complexity Results European J. Combinatorics, volume 110, pages 103662, 2023. |
| [6] | Splitting Vertices in 2-Layer Graph Drawings IEEE Computer Graphics and Applications, volume 43, number 3, pages 24–35, 2023. |
| [7] | Untangling Circular Drawings: Algorithms and Complexity Comput. Geom. Theory Appl., volume 111, 2023. |
| [8] | Worbel: Aggregating Point Labels into Word Clouds ACM Trans. Spatial Algorithms and Systems, volume 9, number 3, pages 19:1–19:32, 2023. |
| [9] | Block Crossings in One-Sided Tanglegrams Algorithms and Data Structures (WADS'23) (Pat Morin, Subhash Suri, eds.), volume 14079 of LNCS, pages 386–400, 2023, Springer. |
| [10] | Computing Hive Plots: A Combinatorial Framework Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), volume 14466 of LNCS, pages 153–169, 2023, Springer. |
| [11] | Crossing Minimization in Time Interval Storylines European Workshop on Computational Geometry (EuroCG'23) (Clemens Huemer, Carlos Seara, eds.), pages 36:1–36:7, 2023. |
| [12] | Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable Computational Geometry (SoCG'23) (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [13] | Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [14] | MySemCloud: Semantic-aware Word Cloud Editing Pacific Visualization Symposium (PacificVis'23), pages 147–156, 2023. |
| [15] | On Families of Planar DAGs with Constant Stack Number Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), volume 14465 of LNCS, pages 135–151, 2023, Springer. |
| [16] | On the Complexity of the Storyplan Problem Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 304–318, 2023, Springer. |
| [17] | Planarizing Graphs and their Drawings by Vertex Splitting Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 232–246, 2023, Springer. |
| [18] | Splitting Plane Graphs to Outerplanarity Algorithms and Computation (WALCOM'23) (Bertrand M. T. Lin, Chun-Cheng Lin, Giuseppe Liotta, eds.), volume 13973 of LNCS, 2023, Springer. |
| [19] | Transitions in Dynamic Point Labeling Geographic Information Science (GIScience'23) (Roger Beecham, Jed A. Long, Dianna Smith, Qunshan Zhao, Sarah Wise, eds.), volume 277 of LIPIcs, pages 2:1–2:19, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [1] | An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling ACM J. Experimental Algorithmics, volume 27, pages 1.8:1–1.8:36, 2022. |
| [2] | Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach IEEE Trans. Visualization and Computer Graphics, volume 28, number 1, pages 313–323, 2022. |
| [3] | Mixed Labeling: Integrating Internal and External Labels IEEE Trans. Visualization and Computer Graphics, volume 28, number 4, pages 1848–1861, 2022. |
| [4] | Multi-level Area Balancing of Clustered Graphs IEEE Trans. Visualization and Computer Graphics, volume 28, number 7, pages 2682–2696, 2022. |
| [5] | Multicriteria Optimization for Dynamic Demers Cartograms IEEE Trans. Visualization and Computer Graphics, volume 28, number 6, pages 2376–2387, 2022. Note: TVCG Replicability Stamp |
| [6] | Parameterized Algorithms for Queue Layouts J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022. |
| [7] | Parameterized Algorithms for Queue Layouts J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022. |
| [8] | Recognizing Weighted and Seeded Disk Graphs J. Computational Geometry, volume 13, number 1, pages 327–376, 2022. |
| [9] | Shape-Guided Mixed Metro Map Layout Computer Graphics Forum, volume 41, number 7, pages 495–506, 2022. |
| [10] | Minimum Link Fencing 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. |
| [11] | Multidimensional Manhattan Preferences Theoretical Informatics (LATIN'22) (Armando Castañeda, Francisco Rodríguez-Henríquez, eds.), volume 13568 of LNCS, pages 273–289, 2022, Springer. |
| [12] | On Computing Optimal Linear Diagrams Diagrammatic Representation and Inference (DIAGRAMS'22) (Valeria Giardino, Sven Linker, Richard Burns, Francesco Bellucci, Jean-Michel Boucheix, Petrucio Viana, eds.), volume 13462 of LNAI, pages 20–36, 2022, Springer. |
| [1] | ClusterSets: Optimizing Planar Clusters in Categorical Point Data Computer Graphics Forum, volume 40, number 3, pages 471–481, 2021. |
| [2] | Geometric Planar Networks on Bichromatic Collinear Points Theoretical Computer Science, volume 895, pages 124–136, 2021. |
| [3] | Labeling Nonograms: Boundary Labeling for Curve Arrangements Comput. Geom. Theory Appl., volume 98, pages 101791, 2021. |
| [4] | MetroSets: Visualizing Sets as Metro Maps IEEE Trans. Visualization and Computer Graphics, volume 27, number 2, pages 1257–1267, 2021. |
| [5] | On Strict (Outer-)Confluent Graphs J. Graph Algorithms Appl., 2021. |
| [6] | On the Readability of Abstract Set Visualizations IEEE Trans. Visualization and Computer Graphics, volume 27, number 6, pages 2821–2832, 2021. |
| [7] | Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Dagstuhl Reports, volume 11, number 6, pages 82–123, 2021. |
| [8] | Balanced Independent and Dominating Sets on Colored Interval Graphs Theory and Practice of Computer Science (SOFSEM'21) (Tomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdziński, Claus Pahl, Florian Sikora, Prudence Wong, eds.), volume 12607 of LNCS, pages 89–103, 2021, Springer. |
| [9] | Disjoint Box Covering in a Rectilinear Polygon European Workshop on Computational Geometry (EuroCG'21), pages 71:1–71:7, 2021. |
| [10] | Layered Area-Proportional Rectangle Contact Representation Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 318–326, 2021, Springer. |
| [11] | On the Upward Book Thickness Problem: Combinatorial and Complexity Results Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 242–256, 2021, Springer. |
| [12] | Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 304–317, 2021, Springer. |
| [13] | Untangling Circular Drawings: Algorithms and Complexity Algorithms and Computation (ISAAC'21) (Hee-Kap Ahn, Kunihiko Sadakane, eds.), volume 212 of LIPIcs, pages 19:1–19:17, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [14] | Worbel: Aggregating Point Labels into Word Clouds Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256–267, 2021, ACM. |
| [15] | External Labeling: Fundamental Concepts and Algorithmic Techniques 2021, Morgan \& Claypool. |
| [1] | A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives Computer Graphics Forum, volume 39, number 3, pages 619–646, 2020. |
| [2] | A Unified Model and Algorithms for Temporal Map Labeling Algorithmica, volume 82, pages 2709–2736, 2020. |
| [3] | Parameterized Algorithms for Book Embedding Problems J. Graph Algorithms Appl., volume 24, number 4, pages 603–620, 2020. |
| [4] | Placing Labels in Road Maps: Algorithms and Complexity Algorithmica, volume 82, pages 1881–1908, 2020. |
| [5] | Route Schematization with Landmarks J. Spatial Information Science, volume 21, 2020. |
| [6] | An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling Algorithms (ESA'20) (Fabrizio Grandoni, Peter Sanders, Grzegorz Herman, eds.), volume 173 of LIPIcs, pages 19:1–19:24, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [7] | Balanced Independent and Dominating Sets on Colored Interval Graphs European Workshop on Computational Geometry (EuroCG'20), pages 66:1–66:6, 2020. |
| [8] | Extending Nearly Complete 1-Planar Drawings in Polynomial Time Mathematical Foundations of Computer Science (MFCS'20) (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [9] | Extending Nearly Complete 1-Planar Drawings in Polynomial Time 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [10] | Extending Partial 1-Planar Drawings Automata, Languages, and Programming (ICALP'20) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik. |
| [11] | Extending Partial 1-Planar Drawings 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [12] | Geometric Planar Networks on Bichromatic Points Algorithms and Discrete Applied Mathematics (CALDAM'20) (Manoj Changat, Sandip Das, eds.), volume 12016 of LNCS, pages 79–91, 2020, Springer. |
| [13] | Labeling Nonograms European Workshop on Computational Geometry (EuroCG'20), pages 71:1–71:8, 2020. |
| [14] | Layered Fan-Planar Graph Drawings Mathematical Foundations of Computer Science (MFCS'20) (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 14:1–14:13, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. |
| [15] | Parameterized Algorithms for Queue Layouts Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 40–54, 2020, Springer. |
| [16] | Parameterized Algorithms for Queue Layouts Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers (David Auber, Pavel Valtr, eds.), volume 12590 of Lecture Notes in Computer Science, pages 40–54, 2020, Springer. |
| [17] | The Turing Test for Graph Drawing Algorithms Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 466–481, 2020, Springer. |
| [18] | Towards Data-Driven Multilinear Metro Maps Diagrammatic Representation and Inference (DIAGRAMS'20) (Ahti-Veikko Pietarinen, Peter Chapman, Leonie Bosveld de Smet, Valeria Giardino, James Corter, Sven Linker, eds.), volume 12169 of LNAI, pages 153–161, 2020, Springer. |
| [19] | Crossing Layout in Non-planar Graphs Chapter in Beyond Planar Graphs (Seok-Hee Hong, Takeshi Tokuyama, eds.), pages 187–209, 2020, Springer Nature Singapore. |
| [1] | External Labeling Techniques: A Taxonomy and Survey Computer Graphics Forum, volume 38, number 3, pages 833–860, 2019. |
| [2] | Guidelines for Experimental Algorithmics: A Case Study in Network Analysis Algorithms, volume 12, number 7, pages 127:1–127:37, 2019. |
| [3] | Lombardi Drawings of Knots and Links J. Computational Geometry, volume 10, number 1, pages 444–476, 2019. |
| [4] | Metabopolis: scalable network layout for biological pathway diagrams in urban map style BMC Bioinformatics, volume 20, pages 187, 2019. |
| [5] | Minimizing crossings in constrained two-sided circular graph layouts J. Computational Geometry, volume 10, number 2, pages 45–69, 2019. |
| [6] | On the Readability of Leaders in Boundary Labeling Information Visualization, volume 18, number 1, pages 110–132, 2019. |
| [7] | Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses Optics Express, volume 27, number 12, pages 17402–17425, 2019. |
| [8] | Planar Drawings of Fixed-Mobile Bigraphs Theoretical Computer Science, volume 795, pages 408–419, 2019. |
| [9] | Short Plane Supports for Spatial Hypergraphs J. Graph Algorithms Appl., volume 23, number 3, pages 463–498, 2019. |
| [10] | Computing Stable Demers Cartograms Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 46–60, 2019, Springer. |
| [11] | Exploring Semi-Automatic Map Labeling Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13–22, 2019, ACM. |
| [12] | Maximizing Ink in Partial Edge Drawings of k-plane Graphs Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 323–336, 2019, Springer. |
| [13] | Mixed Linear Layouts: Complexity, Heuristics, and Experiments Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 460–467, 2019, Springer. |
| [14] | On Strict (Outer-)Confluent Graphs Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 147–161, 2019, Springer. |
| [15] | On Strict (Outer-)Confluent Graphs Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 147–161, 2019, Springer. |
| [16] | Parameterized Algorithms for Book Embedding Problems Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 365–378, 2019, Springer. |
| [17] | Parameterized Algorithms for Book Embedding Problems Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 365–378, 2019, Springer. |
| [1] | Drawing Large Graphs by Multilevel Maxent-Stress Optimization IEEE Trans. Visualization and Computer Graphics, volume 24, number 5, pages 1814–1827, 2018. |
| [2] | Planar and poly-arc Lombardi drawings J. Computational Geometry, volume 9, number 1, pages 328–355, 2018. |
| [3] | Scalable Set Visualizations (Dagstuhl Seminar 17332) Dagstuhl Reports, volume 7, number 8, pages 1–22, 2018. |
| [4] | A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways Eurographics Conference on Visualization (EuroVis'18) – Posters (Anna Puig, Renata Raidou, eds.), pages 57–59, 2018. |
| [5] | Experimental Evaluation of Book Drawing Algorithms Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 224–238, 2018, Springer. |
| [6] | Lombardi Drawings of Knots and Links Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 113–126, 2018, Springer. |
| [7] | Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts Computational Geometry (SoCG'18) (Bettina Speckmann, Csaba D. Tóth, eds.), pages 53:1–53:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [8] | Minimzing Wiggles in Storyline Visualizations Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 585–587, 2018, Springer. |
| [9] | Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity Graph Drawing and Network Visualization (GD'18) (Therese Biedl, Andreas Kerren, eds.), volume 11282 of LNCS, pages 509–523, 2018, Springer International Publishing. |
| [10] | Planar Drawings of Fixed-Mobile Bigraphs Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 426–439, 2018, Springer. |
| [11] | Planar L-Drawings of Directed Graphs Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 465–478, 2018, Springer. |
| [12] | Short Plane Supports for Spatial Hypergraphs Graph Drawing and Network Visualization (GD'18) (Therese Biedl, Andreas Kerren, eds.), volume 11282 of LNCS, pages 53–66, 2018, Springer International Publishing. |
| [13] | Towards Characterizing Strict Outerconfluent Graphs Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 612–614, 2018, Springer. |
| [14] | Graph Visualization Chapter in Encyclopedia of Big Data Technologies (Sherif Sakr, Albert Zomaya, eds.), 2018, Springer International Publishing. |
| [1] | Euclidean Greedy Drawings of Trees Discrete and Computational Geometry, volume 58, number 3, pages 543–579, 2017. |
| [2] | Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions International Journal of Computational Geometry and Applications, volume 27, number 1–2, pages 121–158, 2017. |
| [3] | Progress on Partial Edge Drawings J. Graph Algorithms Appl., volume 21, number 4, pages 757–786, 2017. |
| [4] | Minimizing crossings in constrained two-sided circular graph layouts European Workshop on Computational Geometry (EuroCG'17), pages 265–268, April 2017. |
| [5] | Radial Contour Labeling with Straight Leaders IEEE Pacific Visualization Symposium (PacificVis'17), pages 295–304, 2017. |
| [6] | Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd Chapter in Evaluation in the Crowd. Crowdsourcing and Human-Centered Experiments (Daniel Archambault, Helen Purchase, Tobias Hoßfeld, eds.), volume 10264 of LNCS, pages 6–26, 2017, Springer International Publishing. |
| [1] | Adjacency-Preserving Spatial Treemaps J. Computational Geometry, volume 7, number 1, pages 100-122, 2016. |
| [2] | Consistent Labeling of Rotating Maps J. Computational Geometry, volume 7, number 1, pages 308–331, 2016. |
| [3] | Evaluation of Labeling Strategies for Rotating Maps ACM J. Experimental Algorithmics, volume 21, number 1, pages 1.4:1–1.4:21, 2016. |
| [4] | Extending Convex Partial Drawings of Graphs Algorithmica, volume 76, number 1, pages 47–67, 2016. |
| [5] | Mixed Map Labeling J. Spatial Information Science, volume 13, pages 3–32, 2016. |
| [6] | On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs J. Computational Geometry, volume 7, number 1, pages 47–69, 2016. |
| [7] | Strict Confluent Drawing J. Computational Geometry, volume 7, number 1, pages 22–46, 2016. |
| [8] | An Algorithmic Framework for Labeling Road Maps Geographic Information Science (GIScience '16) (Jennifer A. Miller, David O'Sullivan, Nancy Wiegand, eds.), volume 9927 of LNCS, pages 308–322, 2016, Springer International Publishing. |
| [9] | Software Visualization via Hierarchic Micro/Macro Layouts Information Visualization Theory and Applications (IVAPP'16) (Lars Linsen, Alexandru C. Telea, eds.), pages 153–160, 2016, SciTePress. |
| [10] | Temporal Map Labeling: A New Unified Framework with Experiments Advances in Geographic Information Systems (SIGSPATIAL'16), pages 23:1–23:10, 2016. |
| [1] | Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052) Dagstuhl Reports, volume 5, number 1, pages 243–258, 2015. |
| [2] | Many-to-One Boundary Labeling with Backbones J. Graph Algorithms Appl., volume 19, number 3, pages 779–816, 2015. |
| [3] | Multi-Row Boundary-Labeling Algorithms for Panorama Images ACM Trans. Spatial Algorithms and Systems, volume 1, number 1, pages 1:1–1:30, 2015. |
| [4] | Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 231–244, 2015, Springer International Publishing. |
| [5] | Drawing Large Graphs by Multilevel Maxent-Stress Optimization Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 30–43, 2015, Springer International Publishing. |
| [6] | Label Placement in Road Maps Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 221–234, 2015, Springer International Publishing. |
| [7] | Mixed Map Labeling Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 339–351, 2015, Springer International Publishing. |
| [8] | On Minimizing Crossings in Storyline Visualizations Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 192–198, 2015, Springer International Publishing. |
| [9] | On the Readability of Boundary Labeling Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 515–527, 2015, Springer International Publishing. |
| [10] | Operating Power Grids with Few Flow Control Buses Future Energy Systems (e-Energy'15), pages 289–294, 2015, ACM. |
| [11] | Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions Algorithms and Computation (ISAAC'15) (Khaled Elbassioni, Kazuhisa Makino, eds.), volume 9472 of LNCS, pages 637–649, 2015, Springer Berlin Heidelberg. |
| [12] | Recognizing Weighted Disk Contact Graphs Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 433–446, 2015, Springer International Publishing. |
| [13] | Towards Realistic Flow Control in Power Grid Operation Energy Informatics (EI'15) (Sebastian Gottwalt, Lukas König, Hartmut Schmeck, eds.), volume 9424 of LNCS, pages 192–199, 2015, Springer International Publishing. |
| [14] | Towards Realistic Pedestrian Route Planning Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'15) (Giuseppe F. Italiano, Marie Schmidt, eds.), volume 48 of OpenAccess Series in Informatics (OASIcs), pages 1–15, 2015, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [1] | On d-regular schematization of embedded paths Comput. Geom. Theory Appl., volume 47, number 3A, pages 381–406, 2014. |
| [2] | A survey on automated metro map layout methods Schematic Mapping Workshop, April 2014. |
| [3] | Evaluation of Labeling Strategies for Rotating Maps Experimental Algorithms (SEA'14) (Joachim Gudmundsson, J. Katajainen, eds.), volume 8504 of LNCS, pages 235–246, 2014, Springer International Publishing. |
| [4] | Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams Algorithm Theory (SWAT'14) (R. Ravi, I. L. Gørtz, eds.), volume 8503 of LNCS, pages 253–264, 2014, Springer International Publishing. |
| [5] | On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 476–487, 2014, Springer Berlin Heidelberg. |
| [6] | PIGRA – A Tool for Pixelated Graph Representations Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 513–514, 2014, Springer Berlin Heidelberg. Note: Poster abstract |
| [7] | Semantic Word Cloud Representations: Hardness and Approximation Algorithms Theoretical Informatics (LATIN'14) (Alfredo Viola, ed.), volume 8392 of LNCS, pages 514–525, 2014, Springer Berlin Heidelberg. |
| [8] | Simultaneous Embeddability of Two Partitions Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 64–75, 2014, Springer Berlin Heidelberg. |
| [9] | Scalability Considerations for Multivariate Graph Visualization Chapter in Multivariate Network Visualization (Andreas Kerren, Helen C. Purchase, Matthew O. Ward, eds.), volume 8380 of LNCS, pages 207–235, 2014, Springer International Publishing. |
| [1] | Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151) Dagstuhl Reports, volume 3, number 4, pages 34–68, 2013. |
| [2] | Drawing Trees with Perfect Angular Resolution and Polynomial Area Discrete and Computational Geometry, volume 49, number 2, pages 157–182, 2013. |
| [3] | Edge-weighted contact representations of planar graphs J. Graph Algorithms Appl., volume 17, number 4, pages 441–473, 2013. |
| [4] | Optimal 3D Angular Resolution for Low-Degree Graphs J. Graph Algorithms Appl., volume 17, number 3, pages 173–200, 2013. |
| [5] | Circular-Arc Cartograms IEEE Pacific Visualization Symposium (PacificVis'13), pages 1–8, 2013, IEEE. |
| [6] | Drawing Metro Maps using Bézier Curves Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 463–474, 2013, Springer Berlin Heidelberg. |
| [7] | Drawing Planar Graphs with a Prescribed Inner Face Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 316–327, 2013, Springer Berlin Heidelberg. |
| [8] | Edge-weighted contact representations of planar graphs Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 224–235, 2013, Springer Berlin Heidelberg. |
| [9] | Euclidean Greedy Drawings of Trees Algorithms (ESA'13) (H. L. Bodlaender, G. F. Italiano, eds.), volume 8125 of LNCS, pages 767–778, 2013, Springer Berlin Heidelberg. |
| [10] | Many-to-One Boundary Labeling with Backbones Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 244–255, 2013, Springer Berlin Heidelberg. |
| [11] | On The Usability of Lombardi Graph Drawings Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 451–462, 2013, Springer Berlin Heidelberg. |
| [12] | Planar Lombardi Drawings of Outerpaths Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 561–562, 2013, Springer Berlin Heidelberg. Note: Poster abstract |
| [13] | Progress on Partial Edge Drawings Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 67–78, 2013, Springer Berlin Heidelberg. |
| [14] | Strict Confluent Drawing Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 352–363, 2013, Springer Berlin Heidelberg. |
| [15] | Trajectory-Based Dynamic Map Labeling Algorithms and Computation (ISAAC'13) (Leizhen Cai, Siu-Wing Cheng, Tak-Wah Lam, eds.), volume 8283 of LNCS, pages 413–423, 2013, Springer Berlin Heidelberg. |
| [16] | Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 460–471, 2013, Springer Berlin Heidelberg. |
| [17] | Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 553–554, 2013, Springer Berlin Heidelberg. Note: Poster abstract |
| [1] | Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes Computer Vision and Image Understanding, volume 116, number 7, pages 803–814, 2012. |
| [2] | Cover Contact Graphs J. Computational Geometry, volume 3, number 1, pages 102–131, 2012. |
| [3] | Drawing (Complete) Binary Tanglegrams Algorithmica, volume 62, number 1–2, pages 309–332, 2012. |
| [4] | Lombardi Drawings of Graphs J. Graph Algorithms Appl., volume 16, number 1, pages 85–108, 2012. |
| [1] | Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming IEEE Trans. Visualization and Computer Graphics, volume 17, number 5, pages 626-641, 2011. |
| [2] | Adjacency-Preserving Spatial Treemaps Algorithms and Data Structures (WADS'11) (Frank Dehne, John Iacono, Jörg-Rüdiger Sack, eds.), volume 6844 of LNCS, pages 159–170, 2011, Springer Berlin Heidelberg. |
| [3] | Automatic Generation of Route Sketches Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 391–392, 2011, Springer Berlin Heidelberg. Note: Poster abstract |
| [4] | Boundary-Labeling Algorithms for Panorama Images Advances in Geographic Information Systems (SIGSPATIAL'11), pages 289–298, 2011, ACM. |
| [5] | Connecting Two Trees with Optimal Routing Cost Canadian Conference on Computational Geometry (CCCG '11), pages 43–47, 2011, University of Toronto. |
| [6] | Consistent Labeling of Rotating Maps Algorithms and Data Structures (WADS'11) (Frank Dehne, John Iacono, Jörg-Rüdiger Sack, eds.), volume 6844 of LNCS, pages 451–462, 2011, Springer Berlin Heidelberg. |
| [7] | Drawing Trees with Perfect Angular Resolution and Polynomial Area Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 183–194, 2011, Springer Berlin Heidelberg. |
| [8] | Lombardi Drawings of Graphs Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 195–207, 2011, Springer Berlin Heidelberg. |
| [9] | On d-regular Schematization of Embedded Paths Theory and Practice of Computer Science (SOFSEM'11), volume 6543 of LNCS, pages 260–271, 2011, Springer Berlin Heidelberg. |
| [10] | Optimal 3D Angular Resolution for Low-Degree Graphs Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 208-219, 2011, Springer Berlin Heidelberg. |
| [11] | Sliding Labels for Dynamic Point Labeling Canadian Conference on Computational Geometry (CCCG '11), pages 205–210, 2011, University of Toronto. |
| [1] | Boundary Labeling with Octilinear Leaders Algorithmica, volume 57, pages 436–461, 2010. |
| [2] | Optimizing Active Ranges for Consistent Dynamic Map Labeling Comput. Geom. Theory Appl., volume 43, number 3, pages 312–328, 2010. |
| [3] | An Improved Algorithm for the Metro-Line Crossing Minimization Problem Graph Drawing (GD'09) (David Eppstein, Emden R. Gansner, eds.), volume 5849 of LNCS, pages 381–392, 2010, Springer Berlin Heidelberg. |
| [4] | Dynamic One-Sided Boundary Labeling Advances in Geographic Information Systems (SIGSPATIAL'10), pages 310–319, 2010, ACM. |
| [5] | Path Schematization for Route Sketches Algorithm Theory (SWAT'10) (H. Kaplan, ed.), volume 6139 of LNCS, pages 285–296, 2010, Springer Berlin Heidelberg. |
| [6] | Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling Canadian Conference on Computational Geometry (CCCG '10), pages 203–206, 2010, University of Manitoba. |
| [7] | Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexität Chapter in Ausgezeichnete Informatikdissertationen 2009 (Steffen Hölldobler, ed.), volume D-10 of Lecture Notes in Informatics (LNI), 2010, Gesellschaft für Informatik e.V. (GI). |
| [1] | Algorithms for Multi-Criteria Boundary Labeling J. Graph Algorithms Appl., volume 13, number 3, pages 289-317, 2009. |
| [2] | Consistent Digital Rays Discrete and Computational Geometry, volume 42, number 3, pages 359–378, 2009. |
| [3] | Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability Graph Drawing (GD'08) (Ioannis G. Tollis, Maurizio Patrignani, eds.), volume 5417 of LNCS, pages 324–335, 2009, Springer Berlin Heidelberg. |
| [4] | Drawing Binary Tanglegrams: An Experimental Evaluation Algorithm Engineering and Experiments (ALENEX'09) (Irene Finocchi, John Hershberger, eds.), pages 106–119, 2009, SIAM. |
| [5] | Network Visualization: Algorithms, Applications, and Complexity February 2009, PhD thesis, Fakultät für Informatik, Universität Karlsruhe (TH). |
| [1] | Morphing Polylines: A Step Towards Continuous Generalization Computers, Environment and Urban Systems, volume 32, number 4, pages 248–260, 2008. |
| [2] | Algorithms for Multi-Criteria One-Sided Boundary Labeling Graph Drawing (GD'07) (Seok-Hee Hong, Takao Nishizeki, eds.), volume 4875 of LNCS, pages 243–254, 2008, Springer Berlin Heidelberg. |
| [3] | Boundary Labeling with Octilinear Leaders Algorithm Theory (SWAT'08) (Joachim Gudmundsson, ed.), volume 5124 of LNCS, pages 234–245, 2008, Springer Berlin Heidelberg. |
| [4] | Consistent Digital Rays Computational Geometry (SoCG'08), pages 355–364, 2008, ACM. |
| [5] | Cover Contact Graphs Graph Drawing (GD'07) (Seok-Hee Hong, Takao Nishizeki, eds.), volume 4875 of LNCS, pages 171–182, 2008, Springer Berlin Heidelberg. |
| [6] | Optimizing Active Ranges for Consistent Dynamic Map Labeling Computational Geometry (SoCG'08), pages 10–19, 2008, ACM. |
| [1] | Improved Algorithms for Length-Minimal One-Sided Boundary Labeling European Workshop on Computational Geometry (EuroCG'07), pages 190–193, March 2007. |
| [2] | Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps Graph Drawing (GD'06) (M. Kaufmann, D. Wagner, eds.), volume 4372 of LNCS, pages 270-281, 2007, Springer-Verlag. |
| [3] | Morphing Polygonal Lines: A Step Towards Continuous Generalization Geographic Information Science Research Conference UK (GISRUK'07) (Adam Winstanley, ed.), pages 390–399, 2007. |
| [4] | Geographic Visualization Chapter in Human-Centered Visualization Environments (Andreas Kerren, Achim Ebert, Joerg Meyer, eds.), volume 4417 of LNCS, pages 257-294, 2007, Springer Berlin Heidelberg. |
| [1] | A Mixed-Integer Program for Drawing High-Quality Metro Maps Graph Drawing (GD'05) (Patrick Healy, Nikola S. Nikolov, eds.), volume 3843 of LNCS, pages 321–333, 2006, Springer Berlin Heidelberg. |
| [1] | Automated Drawing of Metro Maps August 2005, Master's thesis, Fakultät für Informatik, Universität Karlsruhe (TH). |
| [2] | Automated Drawing of Metro Maps 2005, Technical report 2005-25, Fakultät für Informatik, Universität Karlsruhe. |
| [1] | Validation in the Cluster Analysis of Gene Expression Data Workshop Fuzzy-Systeme und Computational Intelligence (R. Mikut, M. Reischl, eds.), pages 13-32, 2004, Universitätsverlag Karlsruhe. |
| [1] | Computing Twin-Width via Treedepth and Vertex Integrity 43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026, Grenoble, France, March 9-13, 2026 (Meena Mahajan, Florin Manea, Annabelle McIver, Kim Thang Nguyen, eds.), volume 364 of LIPIcs, pages 42:1–42:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity SIAM J. Discret. Math., volume 39, number 4, pages 2102–2141, 2025. |
| [2] | PACE Solver Description: Bad Dominating Set Maker 20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025 (Akanksha Agrawal, Erik Jan van Leeuwen, eds.), pages 35:1–35:5, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [3] | The Computational Complexity of Positive Non-Clashing Teaching in Graphs The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net. |
| [4] | Training One-Dimensional Graph Neural Networks is NP-Hard The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net. |
| [1] | Computing Twin-Width Parameterized by the Feedback Edge Number 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov, eds.), volume 289 of LIPIcs, pages 7:1–7:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [2] | The Parameterized Complexity Landscape of the Unsplittable Flow Problem Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers (Daniel Král, Martin Milanic, eds.), volume 14760 of Lecture Notes in Computer Science, pages 220–235, 2024, Springer. |
| [3] | Twin-Width Meets Feedback Edges and Vertex Integrity 19th International Symposium on Parameterized and Exact Computation, IPEC 2024, September 4-6, 2024, Royal Holloway, University of London, Egham, United Kingdom (Édouard Bonnet, Pawel Rzazewski, eds.), volume 321 of LIPIcs, pages 3:1–3:22, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | New Complexity-Theoretic Frontiers of Tractability for Neural Network Training Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023, 2023. |
| [2] | PACE Solver Description: Touiouidth Parameterized and Exact Computation (IPEC'2023) (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 38:1–38:4, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [1] | Formally Verified Graph Generation with SAT Modulo Symmetries and Lean Automated Reasoning - 13th International Joint Conference, IJCAR 2026, Lisbon, Portugal, July 26–29, 2026, Proceedings, Part I (Armin Biere, Carsten Lutz, Sara Negri, eds.), volume 16688 of Lecture Notes in Computer Science, pages 117–135, 2026, Springer. |
| [1] | A Parameterized-Complexity Framework for Finding Local Optima 17th Innovations in Theoretical Computer Science Conference, ITCS 2026, Bocconi University, Milan, Italy, January 27-30, 2026 (Shubhangi Saraf, ed.), volume 362 of LIPIcs, pages 66:1–66:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [2] | Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026 (Sayan Bhattacharya, Danupon Nanongkai, Michael Benedikt, Gabriele Puppis, eds.), volume 374 of LIPIcs, pages 38:1–38:14, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [3] | Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig, Chad Jenkins, Matthew E. Taylor, eds.), pages 19108–19116, 2026, AAAI Press. |
| [4] | Not All Degree Constraints Are Created Equal when Computing Spanning Trees 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [5] | Parameterized Complexity of Efficient Sortation 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026), 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear |
| [1] | Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs Algorithmica, volume 86, number 7, pages 2250–2288, 2024. |
| [2] | Generating All Invertible Matrices by Row Operations 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Julián Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 35:1–35:14, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [3] | The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k \(\geq\) 5 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 84:1–84:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |