Publications: Martin Nöllenburg

2026

[1]	$F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness Tommaso Piselli, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Sara Di Bartolomeo IEEE Trans. Vis. Comput. Graph., volume 32, number 1, pages 747–757, 2026. [bibtex] [pdf] [doi]
[2]	ARCOL: Aspect Ratio Constrained Orthogonal Layout Zainab Alsuwaykit, Yousef Loay Rajeh, Alexandre Kouyoumdjian, Steve Kieffer, Dominik Engel, Sara Di Bartolomeo, Martin Nöllenburg, Ivan Viola Comput. Graph. Forum, 2026. [bibtex] [doi]
[3]	Block Crossings in One-Sided Tanglegrams Alexander Dobler, Martin Nöllenburg Algorithmica, volume 88, pages 20:1–20:30, 2026. [bibtex] [doi]
[4]	Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms Discrete and Computational Geometry, volume 75, pages 391–430, 2026. [bibtex] [doi]
[5]	Multidimensional Manhattan preferences Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger Discrete Applied Mathematics, volume 395, pages 172–202, 2026. [bibtex] [doi]
[6]	Representing Hypergraphs by Point-Line Incidences Alexander Dobler, Stephen G. Kobourov, Debajyoti Mondal, Martin Nöllenburg Discret. Math. Theor. Comput. Sci., volume 28, number 3, pages \#3:1–24, 2026. [bibtex] [pdf] [doi]
[7]	The Parameterized Complexity Of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Journal of Graph Algorithms and Applications, volume 29, number 3, pages 39–78, 2026. [bibtex] [doi]
[8]	The Story(line) So Far: A Survey on Storyline Visualization Sara Di Bartolomeo, Alexander Dobler, Velitchko Filipov, Martin Nöllenburg, Henry Ehlers Comput. Graph. Forum, volume 45, number 3, 2026. [bibtex] [doi]
[9]	Visualizing Treewidth Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nöllenburg J. Graph Algorithms Appl., volume 30, number 2, pages 199–235, 2026. [bibtex] [doi]
[10]	Clarity and Computational Efficiency of Orbital Boundary Labeling Markus Wallinger, Annika Bonerath, Soeren Terziadis, Jules Wulms, Martin Nöllenburg Pacific Visualization Symposium (PacificVis'26), pages 1–10, 2026. [bibtex] [doi]
[11]	Combined Network and Set Visualization with Hoop and Linear Diagrams Markus Wallinger, Peter Chapman, Martin Nöllenburg, Peter Rodgers, Andrew Blake Diagrammatic Representation and Inference (DIAGRAMS'26), 2026, Springer. Note: To appear. [bibtex]
[12]	Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchies Alexander Dobler, Son Le Thanh, Martin Nöllenburg, Tino Weinkauf Pacific Visualization Symposium (PacificVis'26), pages 22–32, 2026. [bibtex] [doi]
[13]	On the Complexity of Extending Storylines Alexander Dobler, Siddharth Gupta, Philipp Kindermann, Fabrizio Montecchiani, Martin Nöllenburg 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. [bibtex] [pdf]
[14]	One-Sided Local Crossing Minimization Panos Giannopoulos, Miriam Goetze, Grzegorz Gutowski, Maarten Löffler, Martin Nöllenburg, Yuto Okada, Jonathan Rollin, Birgit Vogtenhuber, Alexander Wolff 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 [bibtex] [doi]
[15]	Paged Geophylogenies: A Coloring Approach to External Labeling with Tree Constraints Thomas Depian, Thomas C. van Dijk, Martin Nöllenburg 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. [bibtex] [pdf]
[16]	Realizing Planar Linkages in Polygonal Domains Thomas Depian, Carolina Haase, Martin Nöllenburg, André Schulz International Workshop on Combinatorial Algorithms (IWOCA'26) (F. Foucaud, A. Parreau, eds.), volume 16587 of LNCS, pages 251–265, 2026, Springer. [bibtex] [doi]
[17]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen, Michael Lampis, eds.), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. Note: To appear. [bibtex]
[18]	The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper 21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[19]	The Peculiarities of Extending Queue Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg Graph-Theoretic Concepts in Computer Science (WG'25) (Henning Fernau, Philipp Kindermann, eds.), volume 16124 of LNCS, pages 177–191, 2026, Springer. [bibtex] [doi]
[20]	Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms Alexander Firbas, Robert Ganian, Sylvain Meunier, Martin Nöllenburg 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. [bibtex] [pdf]
[21]	Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms Alexander Firbas, Robert Ganian, Sylvain Meunier, Martin Nöllenburg 34th International Symposium on Graph Drawing and Network Visualization, GD 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Note: to appear [bibtex]
[22]	Using $\beta$-proximity to Reduce Distortion in Bundled Graph Drawings Markus Wallinger, Tommaso Piselli, Alessandra Tappini, Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg EuroVis 2026 – Short Papers (Jan Byska, Alvitta Ottley, Manuela Waldner, eds.), 2026, Eurographics Association. [bibtex] [doi]

2025

[1]	An Introduction to and Survey of Biological Network Visualization Henry Ehlers, Nicolas Brich, Jiacheng Yu, Michael Krone, Martin Nöllenburg, Hiroaki Natsukawa, Xiaoru Yuan, Hsiang-Yun Wu Computers \& Graphics, volume 126, pages 104115, 2025. [bibtex] [doi]
[2]	Bundling-Aware Graph Drawing Revisited Markus Wallinger, Tommaso Piselli, Alessandra Tappini, Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg IEEE Trans. Vis. Comput. Graph., volume 31, number 12, pages 10828–10839, 2025. [bibtex] [doi]
[3]	Constrained Boundary Labeling Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger Comput. Geom. Theory Appl., volume 129, pages 102191, 2025. [bibtex] [doi]
[4]	Introducing Fairness in Network Visualization Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli, Stephen Wismath Information Sciences, volume 691, pages 121642, 2025. [bibtex] [doi]
[5]	Optimizing Staircase Motifs in Biofabric Network Layouts Sara Di Bartolomeo, Markus Wallinger, Martin Nöllenburg Comput. Graph. Forum, pages e70139, 2025. [bibtex] [doi]
[6]	Passenger Decision-Making in Mass Transit Systems: Insights From Dual-Process Theories Archana Prabhakar, Elise Grison, Simone Morgagni, Martin Nöllenburg, Valérie Gyselinck Applied Cognitive Psychology, volume 39, number 5, pages e70112, 2025. [bibtex] [doi]
[7]	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]
[8]	StorySets: Ordering Curves and Dimensions for Visualizing Uncertain Sets and Multi-Dimensional Discrete Data Markus Wallinger, Annika Bonerath, Wouter Meulemans, Martin Nöllenburg, Stephen Kobourov, Alexander Wolff CoRR, 2025. [bibtex] [doi]
[9]	Transitions in Dynamic Point Labeling Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms Cartography and Geographic Information Science, pages 1–26, 2025. [bibtex] [doi]
[10]	Geometry Matters in Planar Storyplans Alexander Dobler, Maximilian Holzmüller, Martin Nöllenburg 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. [bibtex] [doi]
[11]	On Minimizing Wiggle in Stacked Area Charts Alexander Dobler, Martin Nöllenburg 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. [bibtex] [doi]
[12]	On Planar Unit-Length Linear Linkages in Polygonal Domains Thomas Depian, Carolina Haase, Martin Nöllenburg, André Schulz European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 55:1–55:9, 2025. [bibtex]
[13]	Optimizing Wiggle in Storylines Alexander Dobler, Tim Hegemann, Martin Nöllenburg, Alexander Wolff 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. [bibtex] [doi]
[14]	Partial Level Planarity Parameterized by the Size of the Missing Graph Thomas Depian, Simon D. Fink, Boris Klemz, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper European Workshop on Computational Geometry (EuroCG'25) (Jan Kratochvíl, Giuseppe Liotta, eds.), pages 50:1–50:10, 2025. [bibtex]
[15]	Pathways to Tractability for Geometric Thickness Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 209–224, 2025, Springer. [bibtex] [doi]
[16]	Pathways to Tractability for Geometric Thickness (Best Paper Award) Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg 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. [bibtex] [pdf] [doi]
[17]	Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael Goodrich, Martin Nöllenburg 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. [bibtex] [doi]
[18]	Representing Hypergraphs by Point-Line Incidences Alexander Dobler, Stephen G. Kobourov, Debajyoti Mondal, Martin Nöllenburg Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 241–254, 2025, Springer. [bibtex] [doi]
[19]	The Peculiarities of Extending Queue Layouts Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg 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. [bibtex] [pdf] [doi]
[20]	Visualizing Treewidth Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nöllenburg 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. [bibtex] [doi]
[21]	F2Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness Tommaso Piselli, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Sara Di Bartolomeo 2025, Technical report AC-TR-25-001, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]

2024

[1]	Computing Data-driven Multilinear Metro Maps Martin Nöllenburg, Soeren Terziadis The Cartographic Journal, pages 1–16, 2024. [bibtex] [doi]
[2]	Computing Hive Plots: A Combinatorial Framework Martin Nöllenburg, Markus Wallinger J. Graph Algorithms Appl., volume 28, number 2, pages 101–129, 2024. [bibtex] [doi]
[3]	Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg J. Computational Geometry, volume 15, number 2, pages 3–39, 2024. [bibtex] [doi]
[4]	Improving Temporal Treemaps by Minimizing Crossings Alexander Dobler, Martin Nöllenburg Comput. Graph. Forum, volume 43, number 3, pages e15087, 2024. [bibtex] [doi]
[5]	On the Complexity of the Storyplan Problem Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis J. Computer and Systems Sciences, volume 139, pages 103466, 2024. [bibtex] [doi]
[6]	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]
[7]	Uncertainty in Humanities Network Visualization Melanie Conroy, Christina Gillmann, Francis Harvey, Tamara Mchedlidze, Sara Irina Fabrikant, Florian Windhager, Gerik Scheuermann, Timothy R. Tangherlini, Christopher N. Warren, Scott B. Weingart, Malte Rehbein, Katy Börner, Kimmo Elo, Stefan Jänicke, Andreas Kerren, Martin Nöllenburg, Tim Dwyer, Øyvind Eide, Stephen Kobourov, Gregor Betz Frontiers in Communication, volume 8, pages 1305137, 2024. [bibtex] [doi]
[8]	Visualizing Extensions of Argumentation Frameworks as Layered Graphs Martin Nöllenburg, Christian Pirker, Anna Rapberger, Stefan Woltran, Jules Wulms CoRR, volume abs/2409.05457, 2024. [bibtex] [doi]
[9]	Boundary Labeling in a Circular Orbit Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, Jules Wulms 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. [bibtex] [pdf] [doi]
[10]	Bundling-Aware Graph Drawing Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, Markus Wallinger 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. [bibtex] [doi]
[11]	Constrained Boundary Labeling Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger 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. [bibtex] [pdf] [doi]
[12]	Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms 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. [bibtex] [doi]
[13]	GdMetriX - A NetworkX Extension For Graph Drawing Metrics Martin Nöllenburg, Sebastian Röder, Markus Wallinger 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 [bibtex] [doi]
[14]	Hoop Diagrams: A Set Visualization Method Peter Rodgers, Peter Chapman, Andrew Blake, Martin Nöllenburg, Markus Wallinger, Alexander Dobler Diagrammatic Representation and Inference (DIAGRAMS'24), volume 14981 of LNCS, pages 377-392, 2024, Springer. [bibtex] [doi]
[15]	Introducing Fairness in Graph Visualization Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli 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 [bibtex] [doi]
[16]	Introducing Fairness in Graph Visualization via Gradient Descent Fabrizio Montecchiani, Giuseppe Liotta, Martin Nöllenburg, Seok-Hee Hong, Tommaso Piselli Machine Learning Methods in Visualisation for Big Data (MLVis'24) (Daniel Archambault, Ian Nabney, Jaakko Peltonen, eds.), pages 1–5, 2024, Eurographics Association. [bibtex] [doi]
[17]	Minimizing Switches in Cased Graph Drawings Robert Ganian, Martin Nöllenburg, Sebastian Röder 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 [bibtex] [doi]
[18]	Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, Martin Nöllenburg 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. [bibtex] [pdf] [doi]
[19]	The Parameterized Complexity of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg 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. [bibtex] [pdf] [doi]
[20]	The Parameterized Complexity Of Extending Stack Layouts Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg 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. [bibtex] [pdf] [doi]

2023

[1]	Faster Edge-Path Bundling Through Graph Spanners Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen Computer Graphics Forum, volume 42, number 6, pages e14789, 2023. [bibtex] [doi]
[2]	LinSets.zip: Compressing Linear Set Diagrams Markus Wallinger, Alexander Dobler, Martin Nöllenburg IEEE Trans. Visualization and Computer Graphics, volume 29, number 6, pages 2875–2887, 2023. [bibtex] [doi]
[3]	MosaicSets: Embedding Set Systems into Grid Graphs Peter Rottmann, Markus Wallinger, Annika Bonerath, Sven Gedicke, Martin Nöllenburg, Jan-Henrik Haunert IEEE Trans. Visualization and Computer Graphics, 2023. [bibtex] [pdf]
[4]	New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162) Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya Dagstuhl Reports, volume 13, number 4, pages 58–97, 2023. [bibtex] [doi]
[5]	On the Upward Book Thickness Problem: Combinatorial and Complexity Results Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg European J. Combinatorics, volume 110, pages 103662, 2023. [bibtex] [doi]
[6]	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]
[7]	Untangling Circular Drawings: Algorithms and Complexity Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu Comput. Geom. Theory Appl., volume 111, 2023. [bibtex] [doi]
[8]	Worbel: Aggregating Point Labels into Word Clouds Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms ACM Trans. Spatial Algorithms and Systems, volume 9, number 3, pages 19:1–19:32, 2023. [bibtex] [doi]
[9]	Block Crossings in One-Sided Tanglegrams Alexander Dobler, Martin Nöllenburg Algorithms and Data Structures (WADS'23) (Pat Morin, Subhash Suri, eds.), volume 14079 of LNCS, pages 386–400, 2023, Springer. [bibtex] [pdf] [doi]
[10]	Computing Hive Plots: A Combinatorial Framework Martin Nöllenburg, Markus Wallinger Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), volume 14466 of LNCS, pages 153–169, 2023, Springer. [bibtex] [pdf] [doi]
[11]	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]
[12]	Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg 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. [bibtex] [doi]
[13]	Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg 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. [bibtex] [pdf] [doi]
[14]	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]
[15]	On Families of Planar DAGs with Constant Stack Number Martin Nöllenburg, Sergey Pupyrev Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), volume 14465 of LNCS, pages 135–151, 2023, Springer. [bibtex] [pdf] [doi]
[16]	On the Complexity of the Storyplan Problem Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 304–318, 2023, Springer. [bibtex] [doi]
[17]	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]
[18]	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]
[19]	Transitions in Dynamic Point Labeling Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms 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. [bibtex] [pdf] [doi]

2022

[1]	An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling Sujoy Bhore, Guangping Li, Martin Nöllenburg ACM J. Experimental Algorithmics, volume 27, pages 1.8:1–1.8:36, 2022. [bibtex] [doi]
[2]	Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen IEEE Trans. Visualization and Computer Graphics, volume 28, number 1, pages 313–323, 2022. [bibtex] [doi]
[3]	Mixed Labeling: Integrating Internal and External Labels Ladislav Čmolík, Václav Pavlovec, Hsiang-Yun Wu, Martin Nöllenburg IEEE Trans. Visualization and Computer Graphics, volume 28, number 4, pages 1848–1861, 2022. [bibtex] [pdf] [doi]
[4]	Multi-level Area Balancing of Clustered Graphs Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola IEEE Trans. Visualization and Computer Graphics, volume 28, number 7, pages 2682–2696, 2022. [bibtex] [doi]
[5]	Multicriteria Optimization for Dynamic Demers Cartograms Soeren Nickel, Max Sondag, Wouter Meulemans, Stephen Kobourov, Jaakko Peltonen, Martin Nöllenburg IEEE Trans. Visualization and Computer Graphics, volume 28, number 6, pages 2376–2387, 2022. Note: TVCG Replicability Stamp [bibtex] [doi]
[6]	Parameterized Algorithms for Queue Layouts Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022. [bibtex] [pdf] [doi]
[7]	Parameterized Algorithms for Queue Layouts Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022. [bibtex] [doi]
[8]	Recognizing Weighted and Seeded Disk Graphs Boris Klemz, Martin Nöllenburg, Roman Prutkin J. Computational Geometry, volume 13, number 1, pages 327–376, 2022. [bibtex] [doi]
[9]	Shape-Guided Mixed Metro Map Layout Tobias Batik, Soeren Terziadis, Yu-Shuen Wang, Martin Nöllenburg, Hsiang-Yun Wu Computer Graphics Forum, volume 41, number 7, pages 495–506, 2022. [bibtex] [doi]
[10]	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]
[11]	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]
[12]	On Computing Optimal Linear Diagrams Alexander Dobler, Martin Nöllenburg 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. [bibtex] [pdf] [doi]

2021

[1]	ClusterSets: Optimizing Planar Clusters in Categorical Point Data Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, Alexander Wolff Computer Graphics Forum, volume 40, number 3, pages 471–481, 2021. [bibtex] [pdf] [doi]
[2]	Geometric Planar Networks on Bichromatic Collinear Points Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg Theoretical Computer Science, volume 895, pages 124–136, 2021. [bibtex] [doi]
[3]	Labeling Nonograms: Boundary Labeling for Curve Arrangements Fabian Klute, Maarten Löffler, Martin Nöllenburg Comput. Geom. Theory Appl., volume 98, pages 101791, 2021. [bibtex] [doi]
[4]	MetroSets: Visualizing Sets as Metro Maps Ben Jacobsen, Markus Wallinger, Stephen Kobourov, Martin Nöllenburg IEEE Trans. Visualization and Computer Graphics, volume 27, number 2, pages 1257–1267, 2021. [bibtex] [pdf] [doi]
[5]	On Strict (Outer-)Confluent Graphs Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg J. Graph Algorithms Appl., 2021. [bibtex] [pdf]
[6]	On the Readability of Abstract Set Visualizations Markus Wallinger, Ben Jacobsen, Stephen Kobourov, Martin Nöllenburg IEEE Trans. Visualization and Computer Graphics, volume 27, number 6, pages 2821–2832, 2021. [bibtex] [doi]
[7]	Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi Dagstuhl Reports, volume 11, number 6, pages 82–123, 2021. [bibtex] [doi]
[8]	Balanced Independent and Dominating Sets on Colored Interval Graphs Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg 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. [bibtex] [doi]
[9]	Disjoint Box Covering in a Rectilinear Polygon Sujoy Bhore, Guangping Li, Martin Nöllenburg, Jules Wulms European Workshop on Computational Geometry (EuroCG'21), pages 71:1–71:7, 2021. [bibtex] [pdf]
[10]	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]
[11]	On the Upward Book Thickness Problem: Combinatorial and Complexity Results Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 242–256, 2021, Springer. [bibtex] [pdf] [doi]
[12]	Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 304–317, 2021, Springer. [bibtex] [pdf] [doi]
[13]	Untangling Circular Drawings: Algorithms and Complexity Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu 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. [bibtex] [doi]
[14]	Worbel: Aggregating Point Labels into Word Clouds Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256–267, 2021, ACM. [bibtex] [pdf] [doi]
[15]	External Labeling: Fundamental Concepts and Algorithmic Techniques Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg 2021, Morgan \& Claypool. [bibtex] [doi]

2020

[1]	A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives Hsiang-Yun Wu, Benjamin Niedermann, Shigeo Takahashi, Maxwell J. Roberts, Martin Nöllenburg Computer Graphics Forum, volume 39, number 3, pages 619–646, 2020. [bibtex] [pdf] [doi]
[2]	A Unified Model and Algorithms for Temporal Map Labeling Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg Algorithmica, volume 82, pages 2709–2736, 2020. [bibtex] [doi]
[3]	Parameterized Algorithms for Book Embedding Problems Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg J. Graph Algorithms Appl., volume 24, number 4, pages 603–620, 2020. [bibtex] [doi]
[4]	Placing Labels in Road Maps: Algorithms and Complexity Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg Algorithmica, volume 82, pages 1881–1908, 2020. [bibtex] [doi]
[5]	Route Schematization with Landmarks Marcelo Galvão, Jakub Krukar, Martin Nöllenburg, Angela Schwering J. Spatial Information Science, volume 21, 2020. [bibtex] [pdf] [doi]
[6]	An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling Sujoy Bhore, Guangping Li, Martin Nöllenburg 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. [bibtex] [pdf] [doi]
[7]	Balanced Independent and Dominating Sets on Colored Interval Graphs Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg European Workshop on Computational Geometry (EuroCG'20), pages 66:1–66:6, 2020. [bibtex] [pdf]
[8]	Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg 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. [bibtex] [pdf] [doi]
[9]	Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg 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. [bibtex] [pdf]
[10]	Extending Partial 1-Planar Drawings Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg 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. [bibtex] [pdf] [doi]
[11]	Extending Partial 1-Planar Drawings Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg 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. [bibtex] [pdf]
[12]	Geometric Planar Networks on Bichromatic Points Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg Algorithms and Discrete Applied Mathematics (CALDAM'20) (Manoj Changat, Sandip Das, eds.), volume 12016 of LNCS, pages 79–91, 2020, Springer. [bibtex] [pdf] [doi]
[13]	Labeling Nonograms Maarten Löffler, Martin Nöllenburg European Workshop on Computational Geometry (EuroCG'20), pages 71:1–71:8, 2020. [bibtex] [pdf]
[14]	Layered Fan-Planar Graph Drawings Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi Raftopoulou 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. [bibtex] [pdf] [doi]
[15]	Parameterized Algorithms for Queue Layouts Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 40–54, 2020, Springer. [bibtex] [pdf] [doi]
[16]	Parameterized Algorithms for Queue Layouts Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg 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. [bibtex] [pdf]
[17]	The Turing Test for Graph Drawing Algorithms Helen C. Purchase, Daniel Archambault, Stephen Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 466–481, 2020, Springer. [bibtex] [pdf] [doi]
[18]	Towards Data-Driven Multilinear Metro Maps Soeren Nickel, Martin Nöllenburg 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. [bibtex] [pdf] [doi]
[19]	Crossing Layout in Non-planar Graphs Martin Nöllenburg Chapter in Beyond Planar Graphs (Seok-Hee Hong, Takeshi Tokuyama, eds.), pages 187–209, 2020, Springer Nature Singapore. [bibtex] [doi]

2019

[1]	External Labeling Techniques: A Taxonomy and Survey Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg Computer Graphics Forum, volume 38, number 3, pages 833–860, 2019. [bibtex] [pdf] [doi]
[2]	Guidelines for Experimental Algorithmics: A Case Study in Network Analysis Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas Algorithms, volume 12, number 7, pages 127:1–127:37, 2019. [bibtex] [pdf] [doi]
[3]	Lombardi Drawings of Knots and Links Philipp Kindermann, Stephen Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber J. Computational Geometry, volume 10, number 1, pages 444–476, 2019. [bibtex] [doi]
[4]	Metabopolis: scalable network layout for biological pathway diagrams in urban map style Hsiang-Yun Wu, Martin Nöllenburg, Filipa L. Sousa, Ivan Viola BMC Bioinformatics, volume 20, pages 187, 2019. [bibtex] [doi]
[5]	Minimizing crossings in constrained two-sided circular graph layouts Fabian Klute, Martin Nöllenburg J. Computational Geometry, volume 10, number 2, pages 45–69, 2019. [bibtex] [doi]
[6]	On the Readability of Leaders in Boundary Labeling Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg Information Visualization, volume 18, number 1, pages 110–132, 2019. [bibtex] [doi]
[7]	Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses Aleksandar Nesic, Matthias Blaicher, Tobias Hoose, Andreas Hofmann, Matthias Lauermann, Yasar Kutuvantavida, Martin Nöllenburg, Sebastian Randel, Wolfgang Freude, Christian Koos Optics Express, volume 27, number 12, pages 17402–17425, 2019. [bibtex] [doi]
[8]	Planar Drawings of Fixed-Mobile Bigraphs Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis Tollis Theoretical Computer Science, volume 795, pages 408–419, 2019. [bibtex] [doi]
[9]	Short Plane Supports for Spatial Hypergraphs Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan J. Graph Algorithms Appl., volume 23, number 3, pages 463–498, 2019. [bibtex] [doi]
[10]	Computing Stable Demers Cartograms Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen Kobourov, Jaakko Peltonen, Martin Nöllenburg Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 46–60, 2019, Springer. [bibtex] [pdf] [doi]
[11]	Exploring Semi-Automatic Map Labeling Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13–22, 2019, ACM. [bibtex] [pdf] [doi]
[12]	Maximizing Ink in Partial Edge Drawings of k-plane Graphs Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 323–336, 2019, Springer. [bibtex] [pdf] [doi]
[13]	Mixed Linear Layouts: Complexity, Heuristics, and Experiments Philipp de Col, Fabian Klute, Martin Nöllenburg Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 460–467, 2019, Springer. [bibtex] [pdf] [doi]
[14]	On Strict (Outer-)Confluent Graphs Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 147–161, 2019, Springer. [bibtex] [pdf] [doi]
[15]	On Strict (Outer-)Confluent Graphs Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg 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. [bibtex] [pdf]
[16]	Parameterized Algorithms for Book Embedding Problems Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 365–378, 2019, Springer. [bibtex] [pdf] [doi]
[17]	Parameterized Algorithms for Book Embedding Problems Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg 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. [bibtex] [pdf]

2018

[1]	Drawing Large Graphs by Multilevel Maxent-Stress Optimization Henning Meyerhenke, Martin Nöllenburg, Christian Schulz IEEE Trans. Visualization and Computer Graphics, volume 24, number 5, pages 1814–1827, 2018. [bibtex] [doi]
[2]	Planar and poly-arc Lombardi drawings Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg J. Computational Geometry, volume 9, number 1, pages 328–355, 2018. [bibtex] [doi]
[3]	Scalable Set Visualizations (Dagstuhl Seminar 17332) Yifan Hu, Luana Micallef, Martin Nöllenburg, Peter Rodgers Dagstuhl Reports, volume 7, number 8, pages 1–22, 2018. [bibtex] [doi]
[4]	A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola Eurographics Conference on Visualization (EuroVis'18) – Posters (Anna Puig, Renata Raidou, eds.), pages 57–59, 2018. [bibtex] [doi]
[5]	Experimental Evaluation of Book Drawing Algorithms Jonathan Klawitter, Tamara Mchedlidze, Martin Nöllenburg Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 224–238, 2018, Springer. [bibtex] [pdf] [doi]
[6]	Lombardi Drawings of Knots and Links Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 113–126, 2018, Springer. [bibtex] [pdf] [doi]
[7]	Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts Fabian Klute, Martin Nöllenburg Computational Geometry (SoCG'18) (Bettina Speckmann, Csaba D. Tóth, eds.), pages 53:1–53:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. [bibtex] [pdf] [doi]
[8]	Minimzing Wiggles in Storyline Visualizations Theresa Fröschl, Martin Nöllenburg Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 585–587, 2018, Springer. [bibtex] [pdf]
[9]	Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity Evmorfia Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi Raftopoulou, Alexander Wolff Graph Drawing and Network Visualization (GD'18) (Therese Biedl, Andreas Kerren, eds.), volume 11282 of LNCS, pages 509–523, 2018, Springer International Publishing. [bibtex] [pdf] [doi]
[10]	Planar Drawings of Fixed-Mobile Bigraphs Michael Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 426–439, 2018, Springer. [bibtex] [pdf] [doi]
[11]	Planar L-Drawings of Directed Graphs Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 465–478, 2018, Springer. [bibtex] [pdf] [doi]
[12]	Short Plane Supports for Spatial Hypergraphs Thom Casterman, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan Graph Drawing and Network Visualization (GD'18) (Therese Biedl, Andreas Kerren, eds.), volume 11282 of LNCS, pages 53–66, 2018, Springer International Publishing. [bibtex] [pdf] [doi]
[13]	Towards Characterizing Strict Outerconfluent Graphs Fabian Klute, Martin Nöllenburg Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 612–614, 2018, Springer. [bibtex] [pdf]
[14]	Graph Visualization Yifan Hu, Martin Nöllenburg Chapter in Encyclopedia of Big Data Technologies (Sherif Sakr, Albert Zomaya, eds.), 2018, Springer International Publishing. [bibtex] [pdf] [doi]

2017

[1]	Euclidean Greedy Drawings of Trees Martin Nöllenburg, Roman Prutkin Discrete and Computational Geometry, volume 58, number 3, pages 543–579, 2017. [bibtex] [doi]
[2]	Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions Martin Nöllenburg, Roman Prutkin, Ignaz Rutter International Journal of Computational Geometry and Applications, volume 27, number 1–2, pages 121–158, 2017. [bibtex] [doi]
[3]	Progress on Partial Edge Drawings Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff J. Graph Algorithms Appl., volume 21, number 4, pages 757–786, 2017. [bibtex] [doi]
[4]	Minimizing crossings in constrained two-sided circular graph layouts Fabian Klute, Martin Nöllenburg European Workshop on Computational Geometry (EuroCG'17), pages 265–268, April 2017. [bibtex] [pdf]
[5]	Radial Contour Labeling with Straight Leaders Benjamin Niedermann, Martin Nöllenburg, Ignaz Rutter IEEE Pacific Visualization Symposium (PacificVis'17), pages 295–304, 2017. [bibtex] [pdf] [doi]
[6]	Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd Ujwal Gadiraju, Sebastian Möller, Martin Nöllenburg, Dietmar Saupe, Sebastian Egger-Lampl, Daniel Archambault, Brian Fisher 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. [bibtex] [doi]

2016

[1]	Adjacency-Preserving Spatial Treemaps Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira J. Computational Geometry, volume 7, number 1, pages 100-122, 2016. [bibtex] [pdf]
[2]	Consistent Labeling of Rotating Maps Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter J. Computational Geometry, volume 7, number 1, pages 308–331, 2016. [bibtex] [pdf]
[3]	Evaluation of Labeling Strategies for Rotating Maps Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter ACM J. Experimental Algorithmics, volume 21, number 1, pages 1.4:1–1.4:21, 2016. [bibtex] [pdf] [doi]
[4]	Extending Convex Partial Drawings of Graphs Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter Algorithmica, volume 76, number 1, pages 47–67, 2016. [bibtex] [doi]
[5]	Mixed Map Labeling Maarten Löffler, Martin Nöllenburg, Frank Staals J. Spatial Information Science, volume 13, pages 3–32, 2016. [bibtex] [doi]
[6]	On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs Martin Nöllenburg, Roman Prutkin, Ignaz Rutter J. Computational Geometry, volume 7, number 1, pages 47–69, 2016. [bibtex] [pdf]
[7]	Strict Confluent Drawing David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek J. Computational Geometry, volume 7, number 1, pages 22–46, 2016. [bibtex] [pdf]
[8]	An Algorithmic Framework for Labeling Road Maps Benjamin Niedermann, Martin Nöllenburg 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. [bibtex] [pdf] [doi]
[9]	Software Visualization via Hierarchic Micro/Macro Layouts Martin Nöllenburg, Ignaz Rutter, Alfred Schuhmacher Information Visualization Theory and Applications (IVAPP'16) (Lars Linsen, Alexandru C. Telea, eds.), pages 153–160, 2016, SciTePress. [bibtex] [doi]
[10]	Temporal Map Labeling: A New Unified Framework with Experiments Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, Darren Strash Advances in Geographic Information Systems (SIGSPATIAL'16), pages 23:1–23:10, 2016. [bibtex] [pdf] [doi]

2015

[1]	Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052) Ulrik Brandes, Irene Finocchi, Martin Nöllenburg, Aaron Quigley Dagstuhl Reports, volume 5, number 1, pages 243–258, 2015. [bibtex] [pdf] [doi]
[2]	Many-to-One Boundary Labeling with Backbones Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis J. Graph Algorithms Appl., volume 19, number 3, pages 779–816, 2015. [bibtex] [pdf] [doi]
[3]	Multi-Row Boundary-Labeling Algorithms for Panorama Images Andreas Gemsa, Jan-Henrik Haunert, Martin Nöllenburg ACM Trans. Spatial Algorithms and Systems, volume 1, number 1, pages 1:1–1:30, 2015. [bibtex] [pdf] [doi]
[4]	Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem Jonathan Klawitter, Martin Nöllenburg, Torsten Ueckerdt Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 231–244, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[5]	Drawing Large Graphs by Multilevel Maxent-Stress Optimization Henning Meyerhenke, Martin Nöllenburg, Christian Schulz Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 30–43, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[6]	Label Placement in Road Maps Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 221–234, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[7]	Mixed Map Labeling Maarten Löffler, Martin Nöllenburg, Frank Staals Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 339–351, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[8]	On Minimizing Crossings in Storyline Visualizations Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 192–198, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[9]	On the Readability of Boundary Labeling Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 515–527, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[10]	Operating Power Grids with Few Flow Control Buses Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner Future Energy Systems (e-Energy'15), pages 289–294, 2015, ACM. [bibtex] [pdf] [doi]
[11]	Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions Martin Nöllenburg, Roman Prutkin, Ignaz Rutter Algorithms and Computation (ISAAC'15) (Khaled Elbassioni, Kazuhisa Makino, eds.), volume 9472 of LNCS, pages 637–649, 2015, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[12]	Recognizing Weighted Disk Contact Graphs Boris Klemz, Martin Nöllenburg, Roman Prutkin Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 433–446, 2015, Springer International Publishing. [bibtex] [pdf] [doi]
[13]	Towards Realistic Flow Control in Power Grid Operation Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner, Franziska Wegner Energy Informatics (EI'15) (Sebastian Gottwalt, Lukas König, Hartmut Schmeck, eds.), volume 9424 of LNCS, pages 192–199, 2015, Springer International Publishing. [bibtex] [doi]
[14]	Towards Realistic Pedestrian Route Planning Simeon Andreev, Julian Dibbelt, Martin Nöllenburg, Thomas Pajor, Dorothea Wagner 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. [bibtex] [pdf] [doi]

2014

[1]	On d-regular schematization of embedded paths Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter Comput. Geom. Theory Appl., volume 47, number 3A, pages 381–406, 2014. [bibtex] [doi]
[2]	A survey on automated metro map layout methods Martin Nöllenburg Schematic Mapping Workshop, April 2014. [bibtex] [pdf]
[3]	Evaluation of Labeling Strategies for Rotating Maps Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter Experimental Algorithms (SEA'14) (Joachim Gudmundsson, J. Katajainen, eds.), volume 8504 of LNCS, pages 235–246, 2014, Springer International Publishing. [bibtex] [pdf] [doi]
[4]	Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams Boris Klemz, Tamara Mchedlidze, Martin Nöllenburg Algorithm Theory (SWAT'14) (R. Ravi, I. L. Gørtz, eds.), volume 8503 of LNCS, pages 253–264, 2014, Springer International Publishing. [bibtex] [doi]
[5]	On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs Martin Nöllenburg, Roman Prutkin, Ignaz Rutter Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 476–487, 2014, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[6]	PIGRA – A Tool for Pixelated Graph Representations Thomas Bläsius, Fabian Klute, Benjamin Niedermann, Martin Nöllenburg Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 513–514, 2014, Springer Berlin Heidelberg. Note: Poster abstract [bibtex] [pdf]
[7]	Semantic Word Cloud Representations: Hardness and Approximation Algorithms Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff Theoretical Informatics (LATIN'14) (Alfredo Viola, ed.), volume 8392 of LNCS, pages 514–525, 2014, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[8]	Simultaneous Embeddability of Two Partitions Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 64–75, 2014, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[9]	Scalability Considerations for Multivariate Graph Visualization T. J. Jankun-Kelly, Tim Dwyer, Danny Holten, Christophe Hurter, Martin Nöllenburg, Chris Weaver, Kai Xu 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. [bibtex] [doi]

2013

[1]	Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151) Stephen Kobourov, Martin Nöllenburg, Monique Teillaud Dagstuhl Reports, volume 3, number 4, pages 34–68, 2013. [bibtex] [pdf] [doi]
[2]	Drawing Trees with Perfect Angular Resolution and Polynomial Area Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg Discrete and Computational Geometry, volume 49, number 2, pages 157–182, 2013. [bibtex] [doi]
[3]	Edge-weighted contact representations of planar graphs Martin Nöllenburg, Roman Prutkin, Ignaz Rutter J. Graph Algorithms Appl., volume 17, number 4, pages 441–473, 2013. [bibtex] [doi]
[4]	Optimal 3D Angular Resolution for Low-Degree Graphs David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg J. Graph Algorithms Appl., volume 17, number 3, pages 173–200, 2013. [bibtex] [doi]
[5]	Circular-Arc Cartograms Jan-Hinrich Kämper, Stephen G. Kobourov, Martin Nöllenburg IEEE Pacific Visualization Symposium (PacificVis'13), pages 1–8, 2013, IEEE. [bibtex] [pdf] [doi]
[6]	Drawing Metro Maps using Bézier Curves Martin Fink, Herman Haverkort, Martin Nöllenburg, Maxwell J. Roberts, Julian Schuhmann, Alexander Wolff Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 463–474, 2013, Springer Berlin Heidelberg. [bibtex] [doi]
[7]	Drawing Planar Graphs with a Prescribed Inner Face Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 316–327, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[8]	Edge-weighted contact representations of planar graphs Martin Nöllenburg, Roman Prutkin, Ignaz Rutter Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 224–235, 2013, Springer Berlin Heidelberg. [bibtex] [doi]
[9]	Euclidean Greedy Drawings of Trees Martin Nöllenburg, Roman Prutkin Algorithms (ESA'13) (H. L. Bodlaender, G. F. Italiano, eds.), volume 8125 of LNCS, pages 767–778, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[10]	Many-to-One Boundary Labeling with Backbones Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 244–255, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[11]	On The Usability of Lombardi Graph Drawings Helen C. Purchase, John Hamer, Martin Nöllenburg, Stephen G. Kobourov Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 451–462, 2013, Springer Berlin Heidelberg. [bibtex] [doi]
[12]	Planar Lombardi Drawings of Outerpaths Maarten Löffler, Martin Nöllenburg Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 561–562, 2013, Springer Berlin Heidelberg. Note: Poster abstract [bibtex] [doi]
[13]	Progress on Partial Edge Drawings Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 67–78, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[14]	Strict Confluent Drawing David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 352–363, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[15]	Trajectory-Based Dynamic Map Labeling Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg 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. [bibtex] [pdf] [doi]
[16]	Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 460–471, 2013, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[17]	Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor Jan Christoph Athenstädt, Robert Görke, Marcus Krug, Martin Nöllenburg Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 553–554, 2013, Springer Berlin Heidelberg. Note: Poster abstract [bibtex] [doi]

2012

[1]	Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes Jinhee Chun, Natsuda Kaothanthong, Ryosei Kasai, Matias Korman, Takeshi Tokuyama, Martin Nöllenburg Computer Vision and Image Understanding, volume 116, number 7, pages 803–814, 2012. [bibtex] [doi]
[2]	Cover Contact Graphs Nieves Atienza, Natalia de Castro, Carmen Cortés, M. Ángeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno, Martin Nöllenburg, José Ramón Portillo, Pedro Reyes, Jesús Valenzuela, Maria Trinidad Villar, Alexander Wolff J. Computational Geometry, volume 3, number 1, pages 102–131, 2012. [bibtex] [pdf]
[3]	Drawing (Complete) Binary Tanglegrams Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo Silveira, Alexander Wolff Algorithmica, volume 62, number 1–2, pages 309–332, 2012. [bibtex] [doi]
[4]	Lombardi Drawings of Graphs Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg J. Graph Algorithms Appl., volume 16, number 1, pages 85–108, 2012. [bibtex] [doi]

2011

[1]	Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming Martin Nöllenburg, Alexander Wolff IEEE Trans. Visualization and Computer Graphics, volume 17, number 5, pages 626-641, 2011. [bibtex] [doi]
[2]	Adjacency-Preserving Spatial Treemaps Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira 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. [bibtex] [pdf] [doi]
[3]	Automatic Generation of Route Sketches Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 391–392, 2011, Springer Berlin Heidelberg. Note: Poster abstract [bibtex] [doi]
[4]	Boundary-Labeling Algorithms for Panorama Images Andreas Gemsa, Jan-Henrik Haunert, Martin Nöllenburg Advances in Geographic Information Systems (SIGSPATIAL'11), pages 289–298, 2011, ACM. [bibtex] [pdf] [doi]
[5]	Connecting Two Trees with Optimal Routing Cost Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner Canadian Conference on Computational Geometry (CCCG '11), pages 43–47, 2011, University of Toronto. [bibtex] [pdf]
[6]	Consistent Labeling of Rotating Maps Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter 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. [bibtex] [pdf] [doi]
[7]	Drawing Trees with Perfect Angular Resolution and Polynomial Area Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 183–194, 2011, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[8]	Lombardi Drawings of Graphs Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 195–207, 2011, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[9]	On d-regular Schematization of Embedded Paths Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter Theory and Practice of Computer Science (SOFSEM'11), volume 6543 of LNCS, pages 260–271, 2011, Springer Berlin Heidelberg. [bibtex] [doi]
[10]	Optimal 3D Angular Resolution for Low-Degree Graphs David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 208-219, 2011, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[11]	Sliding Labels for Dynamic Point Labeling Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter Canadian Conference on Computational Geometry (CCCG '11), pages 205–210, 2011, University of Toronto. [bibtex] [pdf]

2010

[1]	Boundary Labeling with Octilinear Leaders Michael Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis Algorithmica, volume 57, pages 436–461, 2010. [bibtex] [doi]
[2]	Optimizing Active Ranges for Consistent Dynamic Map Labeling Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff Comput. Geom. Theory Appl., volume 43, number 3, pages 312–328, 2010. [bibtex] [doi]
[3]	An Improved Algorithm for the Metro-Line Crossing Minimization Problem Martin Nöllenburg Graph Drawing (GD'09) (David Eppstein, Emden R. Gansner, eds.), volume 5849 of LNCS, pages 381–392, 2010, Springer Berlin Heidelberg. [bibtex] [doi]
[4]	Dynamic One-Sided Boundary Labeling Martin Nöllenburg, Valentin Polishchuk, Mikko Sysikaski Advances in Geographic Information Systems (SIGSPATIAL'10), pages 310–319, 2010, ACM. [bibtex] [pdf] [doi]
[5]	Path Schematization for Route Sketches Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor Algorithm Theory (SWAT'10) (H. Kaplan, ed.), volume 6139 of LNCS, pages 285–296, 2010, Springer Berlin Heidelberg. [bibtex] [doi]
[6]	Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling Maarten Löffler, Martin Nöllenburg Canadian Conference on Computational Geometry (CCCG '10), pages 203–206, 2010, University of Manitoba. [bibtex] [pdf]
[7]	Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexität Martin Nöllenburg 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). [bibtex]

2009

[1]	Algorithms for Multi-Criteria Boundary Labeling Marc Benkert, Herman Haverkort, Moritz Kroll, Martin Nöllenburg J. Graph Algorithms Appl., volume 13, number 3, pages 289-317, 2009. [bibtex] [doi]
[2]	Consistent Digital Rays Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama Discrete and Computational Geometry, volume 42, number 3, pages 359–378, 2009. [bibtex] [doi]
[3]	Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff Graph Drawing (GD'08) (Ioannis G. Tollis, Maurizio Patrignani, eds.), volume 5417 of LNCS, pages 324–335, 2009, Springer Berlin Heidelberg. [bibtex] [pdf] [doi]
[4]	Drawing Binary Tanglegrams: An Experimental Evaluation Martin Nöllenburg, Markus Völker, Alexander Wolff, Danny Holten Algorithm Engineering and Experiments (ALENEX'09) (Irene Finocchi, John Hershberger, eds.), pages 106–119, 2009, SIAM. [bibtex] [pdf] [doi]
[5]	Network Visualization: Algorithms, Applications, and Complexity Martin Nöllenburg February 2009, PhD thesis, Fakultät für Informatik, Universität Karlsruhe (TH). [pdf]

2008

[1]	Morphing Polylines: A Step Towards Continuous Generalization Martin Nöllenburg, Damian Merrick, Alexander Wolff, Marc Benkert Computers, Environment and Urban Systems, volume 32, number 4, pages 248–260, 2008. [bibtex] [doi]
[2]	Algorithms for Multi-Criteria One-Sided Boundary Labeling Marc Benkert, Herman Haverkort, Moritz Kroll, Martin Nöllenburg Graph Drawing (GD'07) (Seok-Hee Hong, Takao Nishizeki, eds.), volume 4875 of LNCS, pages 243–254, 2008, Springer Berlin Heidelberg. [bibtex] [doi]
[3]	Boundary Labeling with Octilinear Leaders Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis Algorithm Theory (SWAT'08) (Joachim Gudmundsson, ed.), volume 5124 of LNCS, pages 234–245, 2008, Springer Berlin Heidelberg. [bibtex] [doi]
[4]	Consistent Digital Rays Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama Computational Geometry (SoCG'08), pages 355–364, 2008, ACM. [bibtex] [pdf] [doi]
[5]	Cover Contact Graphs Nieves Atienza, Natalia de Castro, Carmen Cortés, M. Ángeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno, Martin Nöllenburg, José Ramon Portillo, Pedro Reyes, Jesús Valenzuela, Maria Trinidad Villar, Alexander Wolff Graph Drawing (GD'07) (Seok-Hee Hong, Takao Nishizeki, eds.), volume 4875 of LNCS, pages 171–182, 2008, Springer Berlin Heidelberg. [bibtex] [doi]
[6]	Optimizing Active Ranges for Consistent Dynamic Map Labeling Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff Computational Geometry (SoCG'08), pages 10–19, 2008, ACM. [bibtex] [pdf] [doi]

2007

[1]	Improved Algorithms for Length-Minimal One-Sided Boundary Labeling Marc Benkert, Martin Nöllenburg European Workshop on Computational Geometry (EuroCG'07), pages 190–193, March 2007. [bibtex]
[2]	Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff Graph Drawing (GD'06) (M. Kaufmann, D. Wagner, eds.), volume 4372 of LNCS, pages 270-281, 2007, Springer-Verlag. [bibtex] [doi]
[3]	Morphing Polygonal Lines: A Step Towards Continuous Generalization Damian Merrick, Martin Nöllenburg, Alexander Wolff, Marc Benkert Geographic Information Science Research Conference UK (GISRUK'07) (Adam Winstanley, ed.), pages 390–399, 2007. [bibtex] [pdf]
[4]	Geographic Visualization Martin Nöllenburg Chapter in Human-Centered Visualization Environments (Andreas Kerren, Achim Ebert, Joerg Meyer, eds.), volume 4417 of LNCS, pages 257-294, 2007, Springer Berlin Heidelberg. [bibtex] [doi]

2006

[1]	A Mixed-Integer Program for Drawing High-Quality Metro Maps Martin Nöllenburg, Alexander Wolff Graph Drawing (GD'05) (Patrick Healy, Nikola S. Nikolov, eds.), volume 3843 of LNCS, pages 321–333, 2006, Springer Berlin Heidelberg. [bibtex] [doi]

2005

[1]	Automated Drawing of Metro Maps Martin Nöllenburg August 2005, Master's thesis, Fakultät für Informatik, Universität Karlsruhe (TH). [pdf]
[2]	Automated Drawing of Metro Maps Martin Nöllenburg 2005, Technical report 2005-25, Fakultät für Informatik, Universität Karlsruhe. [bibtex] [doi]

2004

[1]	Validation in the Cluster Analysis of Gene Expression Data Jens Jäkel, Martin Nöllenburg Workshop Fuzzy-Systeme und Computational Intelligence (R. Mikut, M. Reischl, eds.), pages 13-32, 2004, Universitätsverlag Karlsruhe. [bibtex] [pdf]

Publications: Martin Nöllenburg

2026

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

AC Admin