Publications: Martin Nöllenburg

⬅️ Zurück zum Profil

2026

ARCOL: Aspect Ratio Constrained Orthogonal Layout
Zainab Alsuwaykit, Yousef Loay Rajeh, Alexandre Kouyoumdjian, Kieffer, Steve, Engel, Dominik, Di Bartolomeo, Sara, Nöllenburg, Martin, Viola, Ivan
Comput. Graph. Forum, 2026.
Note: Accepted at EuroVIS 2026. To appear.
[details]

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
Bhore, Sujoy, Nöllenburg, Martin, Tóth, Csaba D., Wulms, Jules
Discrete and Computational Geometry, volume 75, pages 391-430, 2026.
[doi] [details]

The Peculiarities of Extending Queue Layouts
Depian, Thomas, Fink, Simon D., Ganian, Robert, Nöllenburg, Martin
Graph-Theoretic Concepts in Computer Science (WG'25) (Fernau, Henning and Kindermann, Philipp), volume 16124 of LNCS, pages 177-191, 2026, Springer.
[doi] [details]

Realizing Planar Linkages in Polygonal Domains
Depian, Thomas, Haase, Carolina, Nöllenburg, Martin, Schulz, André
International Workshop on Combinatorial Algorithms (IWOCA'26), 2026.
Note: To appear.
[details]

Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchies
Dobler, Alexander, Le Thanh, Son, Nöllenburg, Martin, Weinkauf, Tino
Pacific Visualization Symposium (PacificVis'26), 2026.
Note: To appear.
[details]

Block Crossings in One-Sided Tanglegrams
Dobler, Alexander, Nöllenburg, Martin
Algorithmica, volume 88, pages 20:1-20:30, 2026.
[doi] [details]

$F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness
Piselli, Tommaso, Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Di Bartolomeo, Sara
IEEE Trans. Vis. Comput. Graph., volume 32, number 1, pages 747-757, 2026.
[pdf] [doi] [details]

Clarity and Computational Efficiency of Orbital Boundary Labeling
Wallinger, Markus, Bonerath, Annika, Terziadis, Soeren, Wulms, Jules, Nöllenburg, Martin
Pacific Visualization Symposium (PacificVis'26), 2026.
Note: To appear.
[details]

Using $β$-proximity to Reduce Distortion in Bundled Graph Drawings
Wallinger, Markus, Piselli, Tommaso, Tappini, Alessandra, Archambault, Daniel, Liotta, Giuseppe, Nöllenburg, Martin
EuroVis 2026 – Short Papers, 2026, Eurographics Association.
Note: To appear.
[details]

2025

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
Caroppo, Susanna, Da Lozzo, Giordano, Di Battista, Giuseppe, Goodrich, Michael, Nöllenburg, Martin
Algorithms and Data Structures (WADS'25) (Morin, Pat and Oh, Eunjin), volume 349 of LIPIcs, pages 14:1-14:22, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[doi] [details]

Visualizing Treewidth
Chiu, Alvin, Depian, Thomas, Eppstein, David, Goodrich, Michael T., Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'25) (Dujmović, Vida and Montecchiani, Fabrizio), volume 357 of LIPIcs, pages 17:1-17:20, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[doi] [details]

Pathways to Tractability for Geometric Thickness
Depian, Thomas, Fink, Simon D., Firbas, Alexander, Ganian, Robert, Nöllenburg, Martin
Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic and Vera Kurková), volume 15538 of LNCS, pages 209-224, 2025, Springer.
[doi] [details]

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, 2025.
[details]

Partial Level Planarity Parameterized by the Size of the Missing Graph
Depian, Thomas, Fink, Simon D., Klemz, Boris, Ganian, Robert, Nöllenburg, Martin, Sieper, Marie Diana
European Workshop on Computational Geometry (EuroCG'25) (Kratochvíl, Jan and Liotta, Giuseppe), pages 50:1-50:10, 2025.
[details]

Geometry Matters in Planar Storyplans
Dobler, Alexander, Holzmüller, Maximilian, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'25) (Dujmović, Vida and Montecchiani, Fabrizio), volume 357 of LIPIcs, pages 27:1-27:9, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[doi] [details]

On Planar Unit-Length Linear Linkages in Polygonal Domains
Depian, Thomas, Haase, Carolina, Nöllenburg, Martin, Schulz, André
European Workshop on Computational Geometry (EuroCG'25) (Kratochvíl, Jan and Liotta, Giuseppe), pages 55:1-55:9, 2025.
[details]

Optimizing Wiggle in Storylines
Dobler, Alexander, Hegemann, Tim, Nöllenburg, Martin, Wolff, Alexander
Graph Drawing and Network Visualization (GD'25) (Dujmović, Vida and Montecchiani, Fabrizio), volume 357 of LIPIcs, pages 39:1-39:17, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[doi] [details]

Representing Hypergraphs by Point-Line Incidences
Dobler, Alexander, Kobourov, Stephen G., Mondal, Debajyoti, Nöllenburg, Martin
Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic and Vera Kurková), volume 15538 of LNCS, pages 241-254, 2025, Springer.
[doi] [details]

Transitions in Dynamic Point Labeling
Depian, Thomas, Li, Guangping, Nöllenburg, Martin, Wulms, Jules
Cartography and Geographic Information Science, pages 1-26, 2025.
[doi] [details]

On Minimizing Wiggle in Stacked Area Charts
Dobler, Alexander, Nöllenburg, Martin
Algorithms and Data Structures (WADS'25) (Morin, Pat and Oh, Eunjin), volume 349 of LIPIcs, pages 22:1-22:14, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[doi] [details]

Constrained Boundary Labeling
Depian, Thomas, Nöllenburg, Martin, Terziadis, Soeren, Wallinger, Markus
Comput. Geom. Theory Appl., volume 129, pages 102191, 2025.
[doi] [details]

Optimizing Staircase Motifs in Biofabric Network Layouts
Di Bartolomeo, Sara, Wallinger, Markus, Nöllenburg, Martin
Comput. Graph. Forum, pages e70139, 2025.
[doi] [details]

An Introduction to and Survey of Biological Network Visualization
Ehlers, Henry, Brich, Nicolas, Yu, Jiacheng, Krone, Michael, Nöllenburg, Martin, Natsukawa, Hiroaki, Yuan, Xiaoru, Wu, Hsiang-Yun
Computers & Graphics, volume 126, pages 104115, 2025.
[doi] [details]

Introducing Fairness in Network Visualization
Eades, Peter, Hong, Seok-Hee, Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Piselli, Tommaso, Wismath, Stephen
Information Sciences, volume 691, pages 121642, 2025.
[doi] [details]

Planarizing Graphs and their Drawings by Vertex Splitting
Nöllenburg, Martin, Sorge, Manuel, Terziadis, Soeren, Villedieu, Anaïs, Wu, Hsiang-Yun, Wulms, Jules
J. Computational Geometry, volume 16, number 1, pages 333-372, 2025.
[doi] [details]

Passenger Decision-Making in Mass Transit Systems: Insights From Dual-Process Theories
Prabhakar, Archana, Grison, Elise, Morgagni, Simone, Nöllenburg, Martin, Gyselinck, Valérie
Applied Cognitive Psychology, volume 39, number 5, pages e70112, 2025.
[doi] [details]

F2Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness
Tommaso Piselli, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Di Bartolomeo, Sara
2025, Technical report AC-TR-25-001, Algorithms and Complexity Group, TU Wien.
[pdf] [details]

Bundling-Aware Graph Drawing Revisited
Wallinger, Markus, Piselli, Tommaso, Tappini, Alessandra, Archambault, Daniel, Liotta, Giuseppe, Nöllenburg, Martin
IEEE Trans. Vis. Comput. Graph., volume 31, number 12, pages 10828-10839, 2025.
[doi] [details]

2024

Bundling-Aware Graph Drawing
Archambault, Daniel, Liotta, Giuseppe, Nöllenburg, Martin, Piselli, Tommaso, Tappini, Alessandra, Wallinger, Markus
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 15:1-15:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[doi] [details]

On the Complexity of the Storyplan Problem
Binucci, Carla, Di Giacomo, Emilio, Lenhart, William J., Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Symvonis, Antonios
J. Computer and Systems Sciences, volume 139, pages 103466, 2024.
[doi] [details]

Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable
Bhore, Sujoy, Ganian, Robert, Khazaliya, Liana, Montecchiani, Fabrizio, Nöllenburg, Martin
J. Computational Geometry, volume 15, number 2, pages 3-39, 2024.
[doi] [details]

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
Bhore, Sujoy, Nöllenburg, Martin, Tóth, Csaba D., Wulms, Jules
Computational Geometry (SoCG'24) (Mulzer, Wolfgang and Phillips, Jeff M.), volume 293 of LIPIcs, pages 19:1-19:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[doi] [details]

Boundary Labeling in a Circular Orbit
Bonerath, Annika, Nöllenburg, Martin, Terziadis, Soeren, Wallinger, Markus, Wulms, Jules
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 22:1-22:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[pdf] [doi] [details]

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.
[doi] [details]

The Parameterized Complexity of Extending Stack Layouts
Depian, Thomas, Fink, Simon D., Ganian, Robert, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 12:1-12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[pdf] [doi] [details]

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
Dobler, Alexander, Jünger, Michael, Jünger, Paul J., Meffert, Julian, Mutzel, Petra, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 31:1-31:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[pdf] [doi] [details]

Improving Temporal Treemaps by Minimizing Crossings
Dobler, Alexander, Nöllenburg, Martin
Comput. Graph. Forum, volume 43, number 3, pages e15087, 2024.
[doi] [details]

Constrained Boundary Labeling
Depian, Thomas, Nöllenburg, Martin, Terziadis, Soeren, Wallinger, Markus
Algorithms and Computation (ISAAC'24) (Mestre, Julian and Wirth, Anthony), volume 322 of LIPIcs, pages 26:1-26:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[pdf] [doi] [details]

Minimizing Switches in Cased Graph Drawings
Ganian, Robert, Nöllenburg, Martin, Röder, Sebastian
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 43:1-43:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: Poster abstract
[doi] [details]

Splitting Plane Graphs to Outerplanarity
Gronemann, Martin, Nöllenburg, Martin, Villedieu, Anaïs
J. Graph Algorithms Appl., volume 28, number 3, pages 31-48, 2024.
[doi] [details]

Introducing Fairness in Graph Visualization
Hong, Seok-Hee, Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Piselli, Tommaso
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 49:1-49:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: Poster abstract
[doi] [details]

Introducing Fairness in Graph Visualization via Gradient Descent
Montecchiani, Fabrizio, Liotta, Giuseppe, Nöllenburg, Martin, Hong, Seok-Hee, Piselli, Tommaso
Machine Learning Methods in Visualisation for Big Data (MLVis'24) (Archambault, Daniel and Nabney, Ian and Peltonen, Jaakko), pages 1-5, 2024, Eurographics Association.
[doi] [details]

Visualizing Extensions of Argumentation Frameworks as Layered Graphs
Nöllenburg, Martin, Pirker, Christian, Rapberger, Anna, Woltran, Stefan, Wulms, Jules
CoRR, volume abs/2409.05457, 2024.
[doi] [details]

GdMetriX - A NetworkX Extension For Graph Drawing Metrics
Nöllenburg, Martin, Röder, Sebastian, Wallinger, Markus
Graph Drawing and Network Visualization (GD'24) (Felsner, Stefan and Klein, Karsten), volume 320 of LIPIcs, pages 45:1-45:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: Poster abstract
[doi] [details]

Computing Data-driven Multilinear Metro Maps
Nöllenburg, Martin, Terziadis, Soeren
The Cartographic Journal, pages 1-16, 2024.
[doi] [details]

Computing Hive Plots: A Combinatorial Framework
Nöllenburg, Martin, Wallinger, Markus
J. Graph Algorithms Appl., volume 28, number 2, pages 101-129, 2024.
[doi] [details]

Hoop Diagrams: A Set Visualization Method
Rodgers, Peter, Chapman, Peter, Blake, Andrew, Nöllenburg, Martin, Wallinger, Markus, Dobler, Alexander
Diagrammatic Representation and Inference (DIAGRAMS'24), volume 14981 of LNCS, pages 377-392, 2024, Springer.
[doi] [details]

2023

Splitting Vertices in 2-Layer Graph Drawings
Ahmed, Reyan, Angelini, Patrizio, Bekos, Michael A., Di Battista, Giuseppe, Kaufmann, Michael, Kindermann, Philipp, Kobourov, Stephen, Nöllenburg, Martin, Symvonis, Antonios, Villedieu, Anaïs, Wallinger, Markus
IEEE Computer Graphics and Applications, volume 43, number 3, pages 24-35, 2023.
[doi] [details]

On the Complexity of the Storyplan Problem
Binucci, Carla, Di Giacomo, Emilio, Lenhart, William J., Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Symvonis, Antonios
Graph Drawing and Network Visualization (GD'22) (Angelini, Patrizio and von Hanxleden, Reinhard), volume 13764 of LNCS, pages 304-318, 2023, Springer.
[doi] [details]

On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Bhore, Sujoy, Da Lozzo, Giordano, Montecchiani, Fabrizio, Nöllenburg, Martin
European J. Combinatorics, volume 110, pages 103662, 2023.
[doi] [details]

Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
Bhore, Sujoy, Ganian, Robert, Khazaliya, Liana, Montecchiani, Fabrizio, Nöllenburg, Martin
Computational Geometry (SoCG'23) (Chambers, Erin W. and Gudmundsson, Joachim), volume 258 of LIPIcs, pages 18:1-18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[doi] [details]

Worbel: Aggregating Point Labels into Word Clouds
Bhore, Sujoy, Ganian, Robert, Li, Guangping, Nöllenburg, Martin, Wulms, Jules
ACM Trans. Spatial Algorithms and Systems, volume 9, number 3, pages 19:1-19:32, 2023.
[doi] [details]

Untangling Circular Drawings: Algorithms and Complexity
Bhore, Sujoy, Li, Guangping, Nöllenburg, Martin, Rutter, Ignaz, Wu, Hsiang-Yun
Comput. Geom. Theory Appl., volume 111, 2023.
[doi] [details]

Transitions in Dynamic Point Labeling
Depian, Thomas, Li, Guangping, Nöllenburg, Martin, Wulms, Jules
Geographic Information Science (GIScience'23) (Roger Beecham and Long, Jed A. and Dianna Smith and Qunshan Zhao and Sarah Wise), volume 277 of LIPIcs, pages 2:1-2:19, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[pdf] [doi] [details]

Block Crossings in One-Sided Tanglegrams
Dobler, Alexander, Nöllenburg, Martin
Algorithms and Data Structures (WADS'23) (Morin, Pat and Suri, Subhash), volume 14079 of LNCS, pages 386-400, 2023, Springer.
[pdf] [doi] [details]

Crossing Minimization in Time Interval Storylines
Dobler, Alexander, Nöllenburg, Martin, Stojanovic, Daniel, Villedieu, Anaïs, Wulms, Jules
European Workshop on Computational Geometry (EuroCG'23) (Clemens Huemer and Carlos Seara), pages 36:1-36:7, 2023.
[pdf] [details]

New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)
Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin, Zehavi, Meirav, Khazaliya, Liana
Dagstuhl Reports, volume 13, number 4, pages 58-97, 2023.
[doi] [details]

Splitting Plane Graphs to Outerplanarity
Gronemann, Martin, Nöllenburg, Martin, Villedieu, Anaïs
Algorithms and Computation (WALCOM'23) (Lin, Bertrand M. T. and Lin, Chun-Cheng and Liotta, Giuseppe), volume 13973 of LNCS, 2023, Springer.
[pdf] [doi] [details]

MySemCloud: Semantic-aware Word Cloud Editing
Huber, Michael, Nöllenburg, Martin, Villedieu, Anaïs
Pacific Visualization Symposium (PacificVis'23), pages 147-156, 2023.
[pdf] [doi] [details]

On Families of Planar DAGs with Constant Stack Number
Nöllenburg, Martin, Pupyrev, Sergey
Graph Drawing and Network Visualization (GD'23) (Bekos, Michael and Chimani, Markus), volume 14465 of LNCS, pages 135-151, 2023, Springer.
[pdf] [doi] [details]

Planarizing Graphs and their Drawings by Vertex Splitting
Nöllenburg, Martin, Sorge, Manuel, Terziadis, Soeren, Villedieu, Anaïs, Wu, Hsiang-Yun, Wulms, Jules
Graph Drawing and Network Visualization (GD'22) (Angelini, Patrizio and von Hanxleden, Reinhard), volume 13764 of LNCS, pages 232-246, 2023, Springer.
[pdf] [doi] [details]

Computing Hive Plots: A Combinatorial Framework
Nöllenburg, Martin, Wallinger, Markus
Graph Drawing and Network Visualization (GD'23) (Bekos, Michael and Chimani, Markus), volume 14466 of LNCS, pages 153-169, 2023, Springer.
[pdf] [doi] [details]

MosaicSets: Embedding Set Systems into Grid Graphs
Rottmann, Peter, Wallinger, Markus, Bonerath, Annika, Gedicke, Sven, Nöllenburg, Martin, Haunert, Jan-Henrik
IEEE Trans. Visualization and Computer Graphics, 2023.
[pdf] [details]

Faster Edge-Path Bundling Through Graph Spanners
Wallinger, Markus, Archambault, Daniel, Auber, David, Nöllenburg, Martin, Peltonen, Jaakko
Computer Graphics Forum, volume 42, number 6, pages e14789, 2023.
[doi] [details]

LinSets.zip: Compressing Linear Set Diagrams
Wallinger, Markus, Dobler, Alexander, Nöllenburg, Martin
IEEE Trans. Visualization and Computer Graphics, volume 29, number 6, pages 2875-2887, 2023.
[doi] [details]

2022

Parameterized Algorithms for Queue Layouts
Sujoy Bhore and Robert Ganian and Fabrizio Montecchiani and Martin Nöllenburg
J. Graph Algorithms Appl., volume 26, number 3, pages 335-352, 2022.
[pdf] [doi] [details]

Parameterized Algorithms for Queue Layouts
Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin
J. Graph Algorithms Appl., volume 26, number 3, pages 335-352, 2022.
[doi] [details]

Minimum Link Fencing
Bhore, Sujoy, Klute, Fabian, Löffler, Maarten, Nöllenburg, Martin, Terziadis, Soeren, Villedieu, Anaïs
Algorithms and Computation (ISAAC'22) (Bae, Sang Won and Park, Heejin), volume 248 of LIPIcs, pages 34:1-34:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[doi] [details]

An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
Bhore, Sujoy, Li, Guangping, Nöllenburg, Martin
ACM J. Experimental Algorithmics, volume 27, pages 1.8:1-1.8:36, 2022.
[doi] [details]

Shape-Guided Mixed Metro Map Layout
Batik, Tobias, Terziadis, Soeren, Wang, Yu-Shuen, Nöllenburg, Martin, Wu, Hsiang-Yun
Computer Graphics Forum, volume 41, number 7, pages 495-506, 2022.
[doi] [details]

Multidimensional Manhattan Preferences
Chen, Jiehua, Nöllenburg, Martin, Simola, Sofia, Villedieu, Anaïs, Wallinger, Markus
Theoretical Informatics (LATIN'22) (Castañeda, Armando and Rodríguez-Henríquez, Francisco), volume 13568 of LNCS, pages 273-289, 2022, Springer.
[doi] [details]

Mixed Labeling: Integrating Internal and External Labels
Čmolík, Ladislav, Pavlovec, Václav, Wu, Hsiang-Yun, Nöllenburg, Martin
IEEE Trans. Visualization and Computer Graphics, volume 28, number 4, pages 1848-1861, 2022.
[pdf] [doi] [details]

On Computing Optimal Linear Diagrams
Dobler, Alexander, Nöllenburg, Martin
Diagrammatic Representation and Inference (DIAGRAMS'22) (Giardino, Valeria and Linker, Sven and Burns, Richard and Bellucci, Francesco and Boucheix, Jean-Michel and Viana, Petrucio), volume 13462 of LNAI, pages 20-36, 2022, Springer.
[pdf] [doi] [details]

Recognizing Weighted and Seeded Disk Graphs
Klemz, Boris, Nöllenburg, Martin, Prutkin, Roman
J. Computational Geometry, volume 13, number 1, pages 327-376, 2022.
[doi] [details]

Multicriteria Optimization for Dynamic Demers Cartograms
Nickel, Soeren, Sondag, Max, Meulemans, Wouter, Kobourov, Stephen, Peltonen, Jaakko, Nöllenburg, Martin
IEEE Trans. Visualization and Computer Graphics, volume 28, number 6, pages 2376-2387, 2022.
Note: TVCG Replicability Stamp
[doi] [details]

Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach
Wallinger, Markus, Archambault, Daniel, Auber, David, Nöllenburg, Martin, Peltonen, Jaakko
IEEE Trans. Visualization and Computer Graphics, volume 28, number 1, pages 313-323, 2022.
[doi] [details]

Multi-level Area Balancing of Clustered Graphs
Wu, Hsiang-Yun, Nöllenburg, Martin, Viola, Ivan
IEEE Trans. Visualization and Computer Graphics, volume 28, number 7, pages 2682-2696, 2022.
[doi] [details]

2021

Geometric Planar Networks on Bichromatic Collinear Points
Bandyapadhyay, Sayan, Banik, Aritra, Bhore, Sujoy, Nöllenburg, Martin
Theoretical Computer Science, volume 895, pages 124-136, 2021.
[doi] [details]

On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Bhore, Sujoy, Da Lozzo, Giordano, Montecchiani, Fabrizio, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'21) (Purchase, Helen and Rutter, Ignaz), volume 12868 of LNCS, pages 242-256, 2021, Springer.
[pdf] [doi] [details]

Worbel: Aggregating Point Labels into Word Clouds
Bhore, Sujoy, Ganian, Robert, Li, Guangping, Nöllenburg, Martin, Wulms, Jules
Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256-267, 2021, ACM.
[pdf] [doi] [details]

Balanced Independent and Dominating Sets on Colored Interval Graphs
Bhore, Sujoy, Haunert, Jan-Henrik, Klute, Fabian, Li, Guangping, Nöllenburg, Martin
Theory and Practice of Computer Science (SOFSEM'21) (Bureš, Tomáš and Dondi, Riccardo and Gamper, Johann and Guerrini, Giovanna and Jurdziński, Tomasz and Pahl, Claus and Sikora, Florian and Wong, Prudence), volume 12607 of LNCS, pages 89-103, 2021, Springer.
[doi] [details]

Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
Bhore, Sujoy, Löffler, Maarten, Nickel, Soeren, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'21) (Purchase, Helen and Rutter, Ignaz), volume 12868 of LNCS, pages 304-317, 2021, Springer.
[pdf] [doi] [details]

Untangling Circular Drawings: Algorithms and Complexity
Bhore, Sujoy, Li, Guangping, Nöllenburg, Martin, Rutter, Ignaz, Wu, Hsiang-Yun
Algorithms and Computation (ISAAC'21) (Ahn, Hee-Kap and Sadakane, Kunihiko), volume 212 of LIPIcs, pages 19:1-19:17, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[doi] [details]

Disjoint Box Covering in a Rectilinear Polygon
Bhore, Sujoy, Li, Guangping, Nöllenburg, Martin, Wulms, Jules
European Workshop on Computational Geometry (EuroCG'21), pages 71:1-71:7, 2021.
[pdf] [details]

External Labeling: Fundamental Concepts and Algorithmic Techniques
Bekos, Michael A., Niedermann, Benjamin, Nöllenburg, Martin
2021, Morgan & Claypool.
[doi] [details]

On Strict (Outer-)Confluent Graphs
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
J. Graph Algorithms Appl., 2021.
[pdf] [details]

ClusterSets: Optimizing Planar Clusters in Categorical Point Data
Geiger, Jakob, Cornelsen, Sabine, Haunert, Jan-Henrik, Kindermann, Philipp, Mchedlidze, Tamara, Nöllenburg, Martin, Okamoto, Yoshio, Wolff, Alexander
Computer Graphics Forum, volume 40, number 3, pages 471-481, 2021.
[pdf] [doi] [details]

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)
Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin, Zehavi, Meirav
Dagstuhl Reports, volume 11, number 6, pages 82-123, 2021.
[doi] [details]

MetroSets: Visualizing Sets as Metro Maps
Jacobsen, Ben, Wallinger, Markus, Kobourov, Stephen, Nöllenburg, Martin
IEEE Trans. Visualization and Computer Graphics, volume 27, number 2, pages 1257-1267, 2021.
[pdf] [doi] [details]

Labeling Nonograms: Boundary Labeling for Curve Arrangements
Klute, Fabian, Löffler, Maarten, Nöllenburg, Martin
Comput. Geom. Theory Appl., volume 98, pages 101791, 2021.
[doi] [details]

Layered Area-Proportional Rectangle Contact Representation
Nöllenburg, Martin, Villedieu, Anaïs, Wulms, Jules
Graph Drawing and Network Visualization (GD'21) (Purchase, Helen and Rutter, Ignaz), volume 12868 of LNCS, pages 318-326, 2021, Springer.
[doi] [details]

On the Readability of Abstract Set Visualizations
Wallinger, Markus, Jacobsen, Ben, Kobourov, Stephen, Nöllenburg, Martin
IEEE Trans. Visualization and Computer Graphics, volume 27, number 6, pages 2821-2832, 2021.
[doi] [details]

2020

Geometric Planar Networks on Bichromatic Points
Bandyapadhyay, Sayan, Banik, Aritra, Bhore, Sujoy, Nöllenburg, Martin
Algorithms and Discrete Applied Mathematics (CALDAM'20) (Changat, Manoj and Das, Sandip), volume 12016 of LNCS, pages 79-91, 2020, Springer.
[pdf] [doi] [details]

Layered Fan-Planar Graph Drawings
Biedl, Therese, Chaplick, Steven, Kaufmann, Michael, Montecchiani, Fabrizio, Nöllenburg, Martin, Raftopoulou, Chrysanthi
Mathematical Foundations of Computer Science (MFCS'20) (Esparza, Javier and Král’, Daniel), volume 170 of LIPIcs, pages 14:1-14:13, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[pdf] [doi] [details]

Parameterized Algorithms for Book Embedding Problems
Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin
J. Graph Algorithms Appl., volume 24, number 4, pages 603-620, 2020.
[doi] [details]

Parameterized Algorithms for Queue Layouts
Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'20) (Auber, David and Valtr, Pavel), volume 12590 of LNCS, pages 40-54, 2020, Springer.
[pdf] [doi] [details]

Balanced Independent and Dominating Sets on Colored Interval Graphs
Bhore, Sujoy, Haunert, Jan-Henrik, Klute, Fabian, Li, Guangping, Nöllenburg, Martin
European Workshop on Computational Geometry (EuroCG'20), pages 66:1-66:6, 2020.
[pdf] [details]

Parameterized Algorithms for Queue Layouts
Sujoy Bhore and Robert Ganian and Fabrizio Montecchiani and 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 and Pavel Valtr), volume 12590 of Lecture Notes in Computer Science, pages 40-54, 2020, Springer.
[pdf] [details]

An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
Bhore, Sujoy, Li, Guangping, Nöllenburg, Martin
Algorithms (ESA'20) (Grandoni, Fabrizio and Sanders, Peter and Herman, Grzegorz), volume 173 of LIPIcs, pages 19:1-19:24, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[pdf] [doi] [details]

Extending Nearly Complete 1-Planar Drawings in Polynomial Time
Eiben, Eduard, Ganian, Robert, Hamm, Thekla, Klute, Fabian, Nöllenburg, Martin
Mathematical Foundations of Computer Science (MFCS'20) (Esparza, Javier and Král’, Daniel), volume 170 of LIPIcs, pages 31:1-31:16, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[pdf] [doi] [details]

Extending Partial 1-Planar Drawings
Eiben, Eduard, Ganian, Robert, Hamm, Thekla, Klute, Fabian, Nöllenburg, Martin
Automata, Languages, and Programming (ICALP'20) (Artur Czumaj and Anuj Dawar and Emanuela Merelli), volume 168 of LIPIcs, pages 43:1-43:19, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
[pdf] [doi] [details]

Extending Nearly Complete 1-Planar Drawings in Polynomial Time
Eduard Eiben and Robert Ganian and Thekla Hamm and Fabian Klute and Martin Nöllenburg
45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (Javier Esparza and Daniel Král’), volume 170 of LIPIcs, pages 31:1-31:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[pdf] [details]

Extending Partial 1-Planar Drawings
Eduard Eiben and Robert Ganian and Thekla Hamm and Fabian Klute and Martin Nöllenburg
47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (Artur Czumaj and Anuj Dawar and Emanuela Merelli), volume 168 of LIPIcs, pages 43:1-43:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[pdf] [details]

Route Schematization with Landmarks
Galvão, Marcelo, Krukar, Jakub, Nöllenburg, Martin, Schwering, Angela
J. Spatial Information Science, volume 21, 2020.
[pdf] [doi] [details]

Placing Labels in Road Maps: Algorithms and Complexity
Gemsa, Andreas, Niedermann, Benjamin, Nöllenburg, Martin
Algorithmica, volume 82, pages 1881-1908, 2020.
[doi] [details]

A Unified Model and Algorithms for Temporal Map Labeling
Gemsa, Andreas, Niedermann, Benjamin, Nöllenburg, Martin
Algorithmica, volume 82, pages 2709-2736, 2020.
[doi] [details]

Labeling Nonograms
Löffler, Maarten, Nöllenburg, Martin
European Workshop on Computational Geometry (EuroCG'20), pages 71:1-71:8, 2020.
[pdf] [details]

Crossing Layout in Non-planar Graphs
Nöllenburg, Martin
Chapter in Beyond Planar Graphs (Hong, Seok-Hee and Tokuyama, Takeshi), pages 187-209, 2020, Springer Nature Singapore.
[doi] [details]

Towards Data-Driven Multilinear Metro Maps
Nickel, Soeren, Nöllenburg, Martin
Diagrammatic Representation and Inference (DIAGRAMS'20) (Pietarinen, Ahti-Veikko and Chapman, Peter and Bosveld de Smet, Leonie and Giardino, Valeria and Corter, James and Linker, Sven), volume 12169 of LNAI, pages 153-161, 2020, Springer.
[pdf] [doi] [details]

The Turing Test for Graph Drawing Algorithms
Purchase, Helen C., Archambault, Daniel, Kobourov, Stephen, Nöllenburg, Martin, Pupyrev, Sergey, Wu, Hsiang-Yun
Graph Drawing and Network Visualization (GD'20) (Auber, David and Valtr, Pavel), volume 12590 of LNCS, pages 466-481, 2020, Springer.
[pdf] [doi] [details]

A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives
Wu, Hsiang-Yun, Niedermann, Benjamin, Takahashi, Shigeo, Roberts, Maxwell J., Nöllenburg, Martin
Computer Graphics Forum, volume 39, number 3, pages 619-646, 2020.
[pdf] [doi] [details]

2019

Guidelines for Experimental Algorithmics: A Case Study in Network Analysis
Eugenio Angriman, van der Grinten, Alexander, von Looz, Moritz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas
Algorithms, volume 12, number 7, pages 127:1-127:37, 2019.
[pdf] [doi] [details]

Planar Drawings of Fixed-Mobile Bigraphs
Bekos, Michael A., De Luca, Felice, Didimo, Walter, Mchedlidze, Tamara, Nöllenburg, Martin, Symvonis, Antonios, Tollis, Ioannis
Theoretical Computer Science, volume 795, pages 408-419, 2019.
[doi] [details]

Parameterized Algorithms for Book Embedding Problems
Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 365-378, 2019, Springer.
[pdf] [doi] [details]

Parameterized Algorithms for Book Embedding Problems
Sujoy Bhore and Robert Ganian and Fabrizio Montecchiani and Martin Nöllenburg
Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault and Csaba D. Tóth), volume 11904 of Lecture Notes in Computer Science, pages 365-378, 2019, Springer.
[pdf] [details]

External Labeling Techniques: A Taxonomy and Survey
Bekos, Michael A., Niedermann, Benjamin, Nöllenburg, Martin
Computer Graphics Forum, volume 38, number 3, pages 833-860, 2019.
[pdf] [doi] [details]

On the Readability of Leaders in Boundary Labeling
Barth, Lukas, Gemsa, Andreas, Niedermann, Benjamin, Nöllenburg, Martin
Information Visualization, volume 18, number 1, pages 110-132, 2019.
[doi] [details]

Short Plane Supports for Spatial Hypergraphs
Castermans, Thom, van Garderen, Mereke, Meulemans, Wouter, Nöllenburg, Martin, Yuan, Xiaoru
J. Graph Algorithms Appl., volume 23, number 3, pages 463-498, 2019.
[doi] [details]

Mixed Linear Layouts: Complexity, Heuristics, and Experiments
de Col, Philipp, Klute, Fabian, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 460-467, 2019, Springer.
[pdf] [doi] [details]

On Strict (Outer-)Confluent Graphs
Förster, Henry, Ganian, Robert, Klute, Fabian, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 147-161, 2019, Springer.
[pdf] [doi] [details]

On Strict (Outer-)Confluent Graphs
Henry Förster and Robert Ganian and Fabian Klute and Martin Nöllenburg
Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault and Csaba D. Tóth), volume 11904 of Lecture Notes in Computer Science, pages 147-161, 2019, Springer.
[pdf] [details]

Exploring Semi-Automatic Map Labeling
Klute, Fabian, Li, Guangping, Löffler, Raphael, Nöllenburg, Martin, Schmidt, Manuela
Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13-22, 2019, ACM.
[pdf] [doi] [details]

Maximizing Ink in Partial Edge Drawings of k-plane Graphs
Hummel, Matthias, Klute, Fabian, Nickel, Soeren, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 323-336, 2019, Springer.
[pdf] [doi] [details]

Lombardi Drawings of Knots and Links
Kindermann, Philipp, Kobourov, Stephen, Löffler, Maarten, Nöllenburg, Martin, Schulz, André, Vogtenhuber, Birgit
J. Computational Geometry, volume 10, number 1, pages 444-476, 2019.
[doi] [details]

Minimizing crossings in constrained two-sided circular graph layouts
Klute, Fabian, Nöllenburg, Martin
J. Computational Geometry, volume 10, number 2, pages 45-69, 2019.
[doi] [details]

Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses
Nesic, Aleksandar, Blaicher, Matthias, Hoose, Tobias, Hofmann, Andreas, Lauermann, Matthias, Kutuvantavida, Yasar, Nöllenburg, Martin, Randel, Sebastian, Freude, Wolfgang, Koos, Christian
Optics Express, volume 27, number 12, pages 17402-17425, 2019.
[doi] [details]

Computing Stable Demers Cartograms
Nickel, Soeren, Sondag, Max, Meulemans, Wouter, Chimani, Markus, Kobourov, Stephen, Peltonen, Jaakko, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'19) (Archambault, Daniel and Tóth, Csaba D.), volume 11904 of LNCS, pages 46-60, 2019, Springer.
[pdf] [doi] [details]

Metabopolis: scalable network layout for biological pathway diagrams in urban map style
Wu, Hsiang-Yun, Nöllenburg, Martin, Sousa, Filipa L., Viola, Ivan
BMC Bioinformatics, volume 20, pages 187, 2019.
[doi] [details]

2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
Argyriou, Evmorfia, Cornelsen, Sabine, Förster, Henry, Kaufmann, Michael, Nöllenburg, Martin, Okamoto, Yoshio, Raftopoulou, Chrysanthi, Wolff, Alexander
Graph Drawing and Network Visualization (GD'18) (Biedl, Therese and Kerren, Andreas), volume 11282 of LNCS, pages 509-523, 2018, Springer International Publishing.
[pdf] [doi] [details]

Planar Drawings of Fixed-Mobile Bigraphs
Bekos, Michael, De Luca, Felice, Didimo, Walter, Mchedlidze, Tamara, Nöllenburg, Martin, Symvonis, Antonios, Tollis, Ioannis G.
Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 426-439, 2018, Springer.
[pdf] [doi] [details]

Planar L-Drawings of Directed Graphs
Chaplick, Steven, Chimani, Markus, Cornelsen, Sabine, Da Lozzo, Giordano, Nöllenburg, Martin, Patrignani, Maurizio, Tollis, Ioannis G., Wolff, Alexander
Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 465-478, 2018, Springer.
[pdf] [doi] [details]

Short Plane Supports for Spatial Hypergraphs
Casterman, Thom, van Garderen, Mereke, Meulemans, Wouter, Nöllenburg, Martin, Yuan, Xiaoru
Graph Drawing and Network Visualization (GD'18) (Biedl, Therese and Kerren, Andreas), volume 11282 of LNCS, pages 53-66, 2018, Springer International Publishing.
[pdf] [doi] [details]

Planar and poly-arc Lombardi drawings
Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Löffler, Maarten, Nöllenburg, Martin
J. Computational Geometry, volume 9, number 1, pages 328-355, 2018.
[doi] [details]

Minimzing Wiggles in Storyline Visualizations
Fröschl, Theresa, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 585-587, 2018, Springer.
[pdf] [details]

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.
[doi] [details]

Graph Visualization
Hu, Yifan, Nöllenburg, Martin
Chapter in Encyclopedia of Big Data Technologies (Sakr, Sherif and Zomaya, Albert), 2018, Springer International Publishing.
[pdf] [doi] [details]

Lombardi Drawings of Knots and Links
Kindermann, Philipp, Kobourov, Stephen G., Löffler, Maarten, Nöllenburg, Martin, Schulz, André, Vogtenhuber, Birgit
Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 113-126, 2018, Springer.
[pdf] [doi] [details]

Experimental Evaluation of Book Drawing Algorithms
Klawitter, Jonathan, Mchedlidze, Tamara, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 224-238, 2018, Springer.
[pdf] [doi] [details]

Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts
Klute, Fabian, Nöllenburg, Martin
Computational Geometry (SoCG'18) (Speckmann, Bettina and Tóth, Csaba D.), pages 53:1-53:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[pdf] [doi] [details]

Towards Characterizing Strict Outerconfluent Graphs
Klute, Fabian, Nöllenburg, Martin
Graph Drawing and Network Visualization (GD'17) (Frati, Fabrizio and Ma, Kwan-Liu), volume 10692 of LNCS, pages 612-614, 2018, Springer.
[pdf] [details]

Drawing Large Graphs by Multilevel Maxent-Stress Optimization
Meyerhenke, Henning, Nöllenburg, Martin, Schulz, Christian
IEEE Trans. Visualization and Computer Graphics, volume 24, number 5, pages 1814-1827, 2018.
[doi] [details]

A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways
Wu, Hsiang-Yun, Nöllenburg, Martin, Viola, Ivan
Eurographics Conference on Visualization (EuroVis'18) – Posters (Puig, Anna and Raidou, Renata), pages 57-59, 2018.
[doi] [details]

2017

Progress on Partial Edge Drawings
Bruckdorfer, Till, Cornelsen, Sabine, Gutwenger, Carsten, Kaufmann, Michael, Montecchiani, Fabrizio, Nöllenburg, Martin, Wolff, Alexander
J. Graph Algorithms Appl., volume 21, number 4, pages 757-786, 2017.
[doi] [details]

Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd
Gadiraju, Ujwal, Möller, Sebastian, Nöllenburg, Martin, Saupe, Dietmar, Egger-Lampl, Sebastian, Archambault, Daniel, Fisher, Brian
Chapter in Evaluation in the Crowd. Crowdsourcing and Human-Centered Experiments (Archambault, Daniel and Purchase, Helen and Hoßfeld, Tobias), volume 10264 of LNCS, pages 6-26, 2017, Springer International Publishing.
[doi] [details]

Minimizing crossings in constrained two-sided circular graph layouts
Klute, Fabian, Nöllenburg, Martin
European Workshop on Computational Geometry (EuroCG'17), pages 265-268, April 2017.
[pdf] [details]

Radial Contour Labeling with Straight Leaders
Niedermann, Benjamin, Nöllenburg, Martin, Rutter, Ignaz
IEEE Pacific Visualization Symposium (PacificVis'17), pages 295-304, 2017.
[pdf] [doi] [details]

Euclidean Greedy Drawings of Trees
Nöllenburg, Martin, Prutkin, Roman
Discrete and Computational Geometry, volume 58, number 3, pages 543-579, 2017.
[doi] [details]

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz
International Journal of Computational Geometry and Applications, volume 27, number 1–2, pages 121-158, 2017.
[doi] [details]

2016

Adjacency-Preserving Spatial Treemaps
Buchin, Kevin, Eppstein, David, Löffler, Maarten, Nöllenburg, Martin, Silveira, Rodrigo I.
J. Computational Geometry, volume 7, number 1, pages 100-122, 2016.
[pdf] [details]

Temporal Map Labeling: A New Unified Framework with Experiments
Barth, Lukas, Niedermann, Benjamin, Nöllenburg, Martin, Strash, Darren
Advances in Geographic Information Systems (SIGSPATIAL'16), pages 23:1-23:10, 2016.
[pdf] [doi] [details]

Strict Confluent Drawing
Eppstein, David, Holten, Danny, Löffler, Maarten, Nöllenburg, Martin, Speckmann, Bettina, Verbeek, Kevin
J. Computational Geometry, volume 7, number 1, pages 22-46, 2016.
[pdf] [details]

Consistent Labeling of Rotating Maps
Gemsa, Andreas, Nöllenburg, Martin, Rutter, Ignaz
J. Computational Geometry, volume 7, number 1, pages 308-331, 2016.
[pdf] [details]

Evaluation of Labeling Strategies for Rotating Maps
Gemsa, Andreas, Nöllenburg, Martin, Rutter, Ignaz
ACM J. Experimental Algorithmics, volume 21, number 1, pages 1.4:1-1.4:21, 2016.
[pdf] [doi] [details]

Mixed Map Labeling
Löffler, Maarten, Nöllenburg, Martin, Staals, Frank
J. Spatial Information Science, volume 13, pages 3-32, 2016.
[doi] [details]

Extending Convex Partial Drawings of Graphs
Mchedlidze, Tamara, Nöllenburg, Martin, Rutter, Ignaz
Algorithmica, volume 76, number 1, pages 47-67, 2016.
[doi] [details]

An Algorithmic Framework for Labeling Road Maps
Niedermann, Benjamin, Nöllenburg, Martin
Geographic Information Science (GIScience ‘16) (Miller, Jennifer A. and O’Sullivan, David and Wiegand, Nancy), volume 9927 of LNCS, pages 308-322, 2016, Springer International Publishing.
[pdf] [doi] [details]

On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz
J. Computational Geometry, volume 7, number 1, pages 47-69, 2016.
[pdf] [details]

Software Visualization via Hierarchic Micro/Macro Layouts
Nöllenburg, Martin, Rutter, Ignaz, Schuhmacher, Alfred
Information Visualization Theory and Applications (IVAPP'16) (Linsen, Lars and Telea, Alexandru C.), pages 153-160, 2016, SciTePress.
[doi] [details]

2015

Towards Realistic Pedestrian Route Planning
Andreev, Simeon, Dibbelt, Julian, Nöllenburg, Martin, Pajor, Thomas, Wagner, Dorothea
Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'15) (Italiano, Giuseppe F. and Schmidt, Marie), volume 48 of OpenAccess Series in Informatics (OASIcs), pages 1-15, 2015, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[pdf] [doi] [details]

Many-to-One Boundary Labeling with Backbones
Bekos, Michael, Cornelsen, Sabine, Fink, Martin, Hong, Seok-Hee, Kaufmann, Michael, Nöllenburg, Martin, Rutter, Ignaz, Symvonis, Antonios
J. Graph Algorithms Appl., volume 19, number 3, pages 779-816, 2015.
[pdf] [doi] [details]

Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052)
Brandes, Ulrik, Finocchi, Irene, Nöllenburg, Martin, Quigley, Aaron
Dagstuhl Reports, volume 5, number 1, pages 243-258, 2015.
[pdf] [doi] [details]

On the Readability of Boundary Labeling
Barth, Lukas, Gemsa, Andreas, Niedermann, Benjamin, Nöllenburg, Martin
Graph Drawing (GD'15) (Di Giacomo, Emilio and Lubiw, Anna), volume 9411 of LNCS, pages 515-527, 2015, Springer International Publishing.
[pdf] [doi] [details]

Multi-Row Boundary-Labeling Algorithms for Panorama Images
Gemsa, Andreas, Haunert, Jan-Henrik, Nöllenburg, Martin
ACM Trans. Spatial Algorithms and Systems, volume 1, number 1, pages 1:1-1:30, 2015.
[pdf] [doi] [details]

Label Placement in Road Maps
Gemsa, Andreas, Niedermann, Benjamin, Nöllenburg, Martin
Algorithms and Complexity (CIAC'15) (Paschos, V. Th. and Widmayer, Peter), volume 9079 of LNCS, pages 221-234, 2015, Springer International Publishing.
[pdf] [doi] [details]

Recognizing Weighted Disk Contact Graphs
Klemz, Boris, Nöllenburg, Martin, Prutkin, Roman
Graph Drawing (GD'15) (Di Giacomo, Emilio and Lubiw, Anna), volume 9411 of LNCS, pages 433-446, 2015, Springer International Publishing.
[pdf] [doi] [details]

On Minimizing Crossings in Storyline Visualizations
Kostitsyna, Irina, Nöllenburg, Martin, Polishchuk, Valentin, Schulz, André, Strash, Darren
Graph Drawing (GD'15) (Di Giacomo, Emilio and Lubiw, Anna), volume 9411 of LNCS, pages 192-198, 2015, Springer International Publishing.
[pdf] [doi] [details]

Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem
Klawitter, Jonathan, Nöllenburg, Martin, Ueckerdt, Torsten
Graph Drawing (GD'15) (Di Giacomo, Emilio and Lubiw, Anna), volume 9411 of LNCS, pages 231-244, 2015, Springer International Publishing.
[pdf] [doi] [details]

Operating Power Grids with Few Flow Control Buses
Leibfried, Thomas, Mchedlidze, Tamara, Meyer-Hübner, Nico, Nöllenburg, Martin, Rutter, Ignaz, Sanders, Peter, Wagner, Dorothea, Wegner, Franziska
Future Energy Systems (e-Energy'15), pages 289-294, 2015, ACM.
[pdf] [doi] [details]

Mixed Map Labeling
Löffler, Maarten, Nöllenburg, Martin, Staals, Frank
Algorithms and Complexity (CIAC'15) (Paschos, V. Th. and Widmayer, Peter), volume 9079 of LNCS, pages 339-351, 2015, Springer International Publishing.
[pdf] [doi] [details]

Towards Realistic Flow Control in Power Grid Operation
Mchedlidze, Tamara, Nöllenburg, Martin, Rutter, Ignaz, Wagner, Dorothea, Wegner, Franziska
Energy Informatics (EI'15) (Gottwalt, Sebastian and König, Lukas and Schmeck, Hartmut), volume 9424 of LNCS, pages 192-199, 2015, Springer International Publishing.
[doi] [details]

Drawing Large Graphs by Multilevel Maxent-Stress Optimization
Meyerhenke, Henning, Nöllenburg, Martin, Schulz, Christian
Graph Drawing (GD'15) (Di Giacomo, Emilio and Lubiw, Anna), volume 9411 of LNCS, pages 30-43, 2015, Springer International Publishing.
[pdf] [doi] [details]

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz
Algorithms and Computation (ISAAC'15) (Elbassioni, Khaled and Makino, Kazuhisa), volume 9472 of LNCS, pages 637-649, 2015, Springer Berlin Heidelberg.
[pdf] [doi] [details]

2014

Simultaneous Embeddability of Two Partitions
Athenstädt, Jan Christoph, Hartmann, Tanja, Nöllenburg, Martin
Graph Drawing (GD'14) (Duncan, Christian A. and Symvonis, Antonios), volume 8871 of LNCS, pages 64-75, 2014, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Semantic Word Cloud Representations: Hardness and Approximation Algorithms
Barth, Lukas, Fabrikant, Sara Irina, Kobourov, Stephen G., Lubiw, Anna, Nöllenburg, Martin, Okamoto, Yoshio, Pupyrev, Sergey, Squarcella, Claudio, Ueckerdt, Torsten, Wolff, Alexander
Theoretical Informatics (LATIN'14) (Viola, Alfredo), volume 8392 of LNCS, pages 514-525, 2014, Springer Berlin Heidelberg.
[pdf] [doi] [details]

PIGRA – A Tool for Pixelated Graph Representations
Bläsius, Thomas, Klute, Fabian, Niedermann, Benjamin, Nöllenburg, Martin
Graph Drawing (GD'14) (Duncan, Christian A. and Symvonis, Antonios), volume 8871 of LNCS, pages 513-514, 2014, Springer Berlin Heidelberg.
Note: Poster abstract
[pdf] [details]

On d-regular schematization of embedded paths
Delling, Daniel, Gemsa, Andreas, Nöllenburg, Martin, Pajor, Thomas, Rutter, Ignaz
Comput. Geom. Theory Appl., volume 47, number 3A, pages 381-406, 2014.
[doi] [details]

Evaluation of Labeling Strategies for Rotating Maps
Gemsa, Andreas, Nöllenburg, Martin, Rutter, Ignaz
Experimental Algorithms (SEA'14) (Gudmundsson, Joachim and Katajainen, J.), volume 8504 of LNCS, pages 235-246, 2014, Springer International Publishing.
[pdf] [doi] [details]

Scalability Considerations for Multivariate Graph Visualization
Jankun-Kelly, T. J., Dwyer, Tim, Holten, Danny, Hurter, Christophe, Nöllenburg, Martin, Weaver, Chris, Xu, Kai
Chapter in Multivariate Network Visualization (Kerren, Andreas and Purchase, Helen C. and Ward, Matthew O.), volume 8380 of LNCS, pages 207-235, 2014, Springer International Publishing.
[doi] [details]

Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams
Klemz, Boris, Mchedlidze, Tamara, Nöllenburg, Martin
Algorithm Theory (SWAT'14) (Ravi, R. and Gørtz, I. L.), volume 8503 of LNCS, pages 253-264, 2014, Springer International Publishing.
[doi] [details]

A survey on automated metro map layout methods
Nöllenburg, Martin
Schematic Mapping Workshop, April 2014.
[pdf] [details]

On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz
Graph Drawing (GD'14) (Duncan, Christian A. and Symvonis, Antonios), volume 8871 of LNCS, pages 476-487, 2014, Springer Berlin Heidelberg.
[pdf] [doi] [details]

2013

Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor
Athenstädt, Jan Christoph, Görke, Robert, Krug, Marcus, Nöllenburg, Martin
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 553-554, 2013, Springer Berlin Heidelberg.
Note: Poster abstract
[doi] [details]

Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
Biedl, Therese, Bläsius, Thomas, Niedermann, Benjamin, Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz
Graph Drawing (GD'13) (Wismath, Stephen and Wolff, Alexander), volume 8242 of LNCS, pages 460-471, 2013, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Many-to-One Boundary Labeling with Backbones
Bekos, Michael, Cornelsen, Sabine, Fink, Martin, Hong, Seok-Hee, Kaufmann, Michael, Nöllenburg, Martin, Rutter, Ignaz, Symvonis, Antonios
Graph Drawing (GD'13) (Wismath, Stephen and Wolff, Alexander), volume 8242 of LNCS, pages 244-255, 2013, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Progress on Partial Edge Drawings
Bruckdorfer, Till, Cornelsen, Sabine, Gutwenger, Carsten, Kaufmann, Michael, Montecchiani, Fabrizio, Nöllenburg, Martin, Wolff, Alexander
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 67-78, 2013, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Drawing Trees with Perfect Angular Resolution and Polynomial Area
Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Nöllenburg, Martin
Discrete and Computational Geometry, volume 49, number 2, pages 157-182, 2013.
[doi] [details]

Strict Confluent Drawing
Eppstein, David, Holten, Danny, Löffler, Maarten, Nöllenburg, Martin, Speckmann, Bettina, Verbeek, Kevin
Graph Drawing (GD'13) (Wismath, Stephen and Wolff, Alexander), volume 8242 of LNCS, pages 352-363, 2013, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Optimal 3D Angular Resolution for Low-Degree Graphs
Eppstein, David, Löffler, Maarten, Mumford, Elena, Nöllenburg, Martin
J. Graph Algorithms Appl., volume 17, number 3, pages 173-200, 2013.
[doi] [details]

Drawing Metro Maps using Bézier Curves
Fink, Martin, Haverkort, Herman, Nöllenburg, Martin, Roberts, Maxwell J., Schuhmann, Julian, Wolff, Alexander
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 463-474, 2013, Springer Berlin Heidelberg.
[doi] [details]

Trajectory-Based Dynamic Map Labeling
Gemsa, Andreas, Niedermann, Benjamin, Nöllenburg, Martin
Algorithms and Computation (ISAAC'13) (Cai, Leizhen and Cheng, Siu-Wing and Lam, Tak-Wah), volume 8283 of LNCS, pages 413-423, 2013, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Circular-Arc Cartograms
Kämper, Jan-Hinrich, Kobourov, Stephen G., Nöllenburg, Martin
IEEE Pacific Visualization Symposium (PacificVis'13), pages 1-8, 2013, IEEE.
[pdf] [doi] [details]

Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151)
Kobourov, Stephen, Nöllenburg, Martin, Teillaud, Monique
Dagstuhl Reports, volume 3, number 4, pages 34-68, 2013.
[pdf] [doi] [details]

Planar Lombardi Drawings of Outerpaths
Löffler, Maarten, Nöllenburg, Martin
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 561-562, 2013, Springer Berlin Heidelberg.
Note: Poster abstract
[doi] [details]

Drawing Planar Graphs with a Prescribed Inner Face
Mchedlidze, Tamara, Nöllenburg, Martin, Rutter, Ignaz
Graph Drawing (GD'13) (Wismath, Stephen and Wolff, Alexander), volume 8242 of LNCS, pages 316-327, 2013, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Euclidean Greedy Drawings of Trees
Nöllenburg, Martin, Prutkin, Roman
Algorithms (ESA'13) (Bodlaender, H. L. and Italiano, G. F.), volume 8125 of LNCS, pages 767-778, 2013, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Edge-weighted contact representations of planar graphs
Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 224-235, 2013, Springer Berlin Heidelberg.
[doi] [details]

Edge-weighted contact representations of planar graphs
Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz
J. Graph Algorithms Appl., volume 17, number 4, pages 441-473, 2013.
[doi] [details]

On The Usability of Lombardi Graph Drawings
Purchase, Helen C., Hamer, John, Nöllenburg, Martin, Kobourov, Stephen G.
Graph Drawing (GD'12) (Didimo, Walter and Patrignani, Maurizio), volume 7704 of LNCS, pages 451-462, 2013, Springer Berlin Heidelberg.
[doi] [details]

2012

Cover Contact Graphs
Atienza, Nieves, de Castro, Natalia, Cortés, Carmen, Garrido, M. Ángeles, Grima, Clara I., Hernández, Gregorio, Márquez, Alberto, Moreno, Auxiliadora, Nöllenburg, Martin, Portillo, José Ramón, Reyes, Pedro, Valenzuela, Jesús, Villar, Maria Trinidad, Wolff, Alexander
J. Computational Geometry, volume 3, number 1, pages 102-131, 2012.
[pdf] [details]

Drawing (Complete) Binary Tanglegrams
Buchin, Kevin, Buchin, Maike, Byrka, Jaroslaw, Nöllenburg, Martin, Okamoto, Yoshio, Silveira, Rodrigo, Wolff, Alexander
Algorithmica, volume 62, number 1–2, pages 309-332, 2012.
[doi] [details]

Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
Chun, Jinhee, Kaothanthong, Natsuda, Kasai, Ryosei, Korman, Matias, Tokuyama, Takeshi, Nöllenburg, Martin
Computer Vision and Image Understanding, volume 116, number 7, pages 803-814, 2012.
[doi] [details]

Lombardi Drawings of Graphs
Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Nöllenburg, Martin
J. Graph Algorithms Appl., volume 16, number 1, pages 85-108, 2012.
[doi] [details]

2011

Adjacency-Preserving Spatial Treemaps
Buchin, Kevin, Eppstein, David, Löffler, Maarten, Nöllenburg, Martin, Silveira, Rodrigo I.
Algorithms and Data Structures (WADS'11) (Dehne, Frank and Iacono, John and Sack, Jörg-Rüdiger), volume 6844 of LNCS, pages 159-170, 2011, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Drawing Trees with Perfect Angular Resolution and Polynomial Area
Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Nöllenburg, Martin
Graph Drawing (GD'10) (Brandes, Ulrik and Cornelsen, Sabine), volume 6502 of LNCS, pages 183-194, 2011, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Lombardi Drawings of Graphs
Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Nöllenburg, Martin
Graph Drawing (GD'10) (Brandes, Ulrik and Cornelsen, Sabine), volume 6502 of LNCS, pages 195-207, 2011, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Optimal 3D Angular Resolution for Low-Degree Graphs
Eppstein, David, Löffler, Maarten, Mumford, Elena, Nöllenburg, Martin
Graph Drawing (GD'10) (Brandes, Ulrik and Cornelsen, Sabine), volume 6502 of LNCS, pages 208-219, 2011, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Boundary-Labeling Algorithms for Panorama Images
Gemsa, Andreas, Haunert, Jan-Henrik, Nöllenburg, Martin
Advances in Geographic Information Systems (SIGSPATIAL'11), pages 289-298, 2011, ACM.
[pdf] [doi] [details]

Automatic Generation of Route Sketches
Gemsa, Andreas, Nöllenburg, Martin, Pajor, Thomas, Rutter, Ignaz
Graph Drawing (GD'10) (Brandes, Ulrik and Cornelsen, Sabine), volume 6502 of LNCS, pages 391-392, 2011, Springer Berlin Heidelberg.
Note: Poster abstract
[doi] [details]

On d-regular Schematization of Embedded Paths
Gemsa, Andreas, Nöllenburg, Martin, Pajor, Thomas, Rutter, Ignaz
Theory and Practice of Computer Science (SOFSEM'11), volume 6543 of LNCS, pages 260-271, 2011, Springer Berlin Heidelberg.
[doi] [details]

Consistent Labeling of Rotating Maps
Gemsa, Andreas, Nöllenburg, Martin, Rutter, Ignaz
Algorithms and Data Structures (WADS'11) (Dehne, Frank and Iacono, John and Sack, Jörg-Rüdiger), volume 6844 of LNCS, pages 451-462, 2011, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Sliding Labels for Dynamic Point Labeling
Gemsa, Andreas, Nöllenburg, Martin, Rutter, Ignaz
Canadian Conference on Computational Geometry (CCCG ‘11), pages 205-210, 2011, University of Toronto.
[pdf] [details]

Connecting Two Trees with Optimal Routing Cost
Kao, Mong-Jen, Katz, Bastian, Krug, Marcus, Lee, D. T., Nöllenburg, Martin, Rutter, Ignaz, Wagner, Dorothea
Canadian Conference on Computational Geometry (CCCG ‘11), pages 43-47, 2011, University of Toronto.
[pdf] [details]

Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
Nöllenburg, Martin, Wolff, Alexander
IEEE Trans. Visualization and Computer Graphics, volume 17, number 5, pages 626-641, 2011.
[doi] [details]

2010

Boundary Labeling with Octilinear Leaders
Bekos, Michael, Kaufmann, Michael, Nöllenburg, Martin, Symvonis, Antonios
Algorithmica, volume 57, pages 436-461, 2010.
[doi] [details]

Optimizing Active Ranges for Consistent Dynamic Map Labeling
Been, Ken, Nöllenburg, Martin, Poon, Sheung-Hung, Wolff, Alexander
Comput. Geom. Theory Appl., volume 43, number 3, pages 312-328, 2010.
[doi] [details]

Path Schematization for Route Sketches
Delling, Daniel, Gemsa, Andreas, Nöllenburg, Martin, Pajor, Thomas
Algorithm Theory (SWAT'10) (Kaplan, H.), volume 6139 of LNCS, pages 285-296, 2010, Springer Berlin Heidelberg.
[doi] [details]

Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling
Löffler, Maarten, Nöllenburg, Martin
Canadian Conference on Computational Geometry (CCCG ‘10), pages 203-206, 2010, University of Manitoba.
[pdf] [details]

An Improved Algorithm for the Metro-Line Crossing Minimization Problem
Nöllenburg, Martin
Graph Drawing (GD'09) (Eppstein, David and Gansner, Emden R.), volume 5849 of LNCS, pages 381-392, 2010, Springer Berlin Heidelberg.
[doi] [details]

Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexität
Nöllenburg, Martin
Chapter in Ausgezeichnete Informatikdissertationen 2009 (Hölldobler, Steffen), volume D-10 of Lecture Notes in Informatics (LNI), 2010, Gesellschaft für Informatik e.V. (GI).
[details]

Dynamic One-Sided Boundary Labeling
Nöllenburg, Martin, Polishchuk, Valentin, Sysikaski, Mikko
Advances in Geographic Information Systems (SIGSPATIAL'10), pages 310-319, 2010, ACM.
[pdf] [doi] [details]

2009

Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
Buchin, Kevin, Buchin, Maike, Byrka, Jaroslaw, Nöllenburg, Martin, Okamoto, Yoshio, Silveira, Rodrigo I., Wolff, Alexander
Graph Drawing (GD'08) (Tollis, Ioannis G. and Patrignani, Maurizio), volume 5417 of LNCS, pages 324-335, 2009, Springer Berlin Heidelberg.
[pdf] [doi] [details]

Algorithms for Multi-Criteria Boundary Labeling
Benkert, Marc, Haverkort, Herman, Kroll, Moritz, Nöllenburg, Martin
J. Graph Algorithms Appl., volume 13, number 3, pages 289-317, 2009.
[doi] [details]

Consistent Digital Rays
Chun, Jinhee, Korman, Matias, Nöllenburg, Martin, Tokuyama, Takeshi
Discrete and Computational Geometry, volume 42, number 3, pages 359-378, 2009.
[doi] [details]

Network Visualization: Algorithms, Applications, and Complexity
Nöllenburg, Martin
February 2009, PhD thesis, Fakultät für Informatik, Universität Karlsruhe (TH).
[pdf] [details]

Drawing Binary Tanglegrams: An Experimental Evaluation
Nöllenburg, Martin, Völker, Markus, Wolff, Alexander, Holten, Danny
Algorithm Engineering and Experiments (ALENEX'09) (Finocchi, Irene and Hershberger, John), pages 106-119, 2009, SIAM.
[pdf] [doi] [details]

2008

Cover Contact Graphs
Atienza, Nieves, de Castro, Natalia, Cortés, Carmen, Garrido, M. Ángeles, Grima, Clara I., Hernández, Gregorio, Márquez, Alberto, Moreno, Auxiliadora, Nöllenburg, Martin, Portillo, José Ramon, Reyes, Pedro, Valenzuela, Jesús, Villar, Maria Trinidad, Wolff, Alexander
Graph Drawing (GD'07) (Hong, Seok-Hee and Nishizeki, Takao), volume 4875 of LNCS, pages 171-182, 2008, Springer Berlin Heidelberg.
[doi] [details]

Algorithms for Multi-Criteria One-Sided Boundary Labeling
Benkert, Marc, Haverkort, Herman, Kroll, Moritz, Nöllenburg, Martin
Graph Drawing (GD'07) (Hong, Seok-Hee and Nishizeki, Takao), volume 4875 of LNCS, pages 243-254, 2008, Springer Berlin Heidelberg.
[doi] [details]

Boundary Labeling with Octilinear Leaders
Bekos, Michael A., Kaufmann, Michael, Nöllenburg, Martin, Symvonis, Antonios
Algorithm Theory (SWAT'08) (Gudmundsson, Joachim), volume 5124 of LNCS, pages 234-245, 2008, Springer Berlin Heidelberg.
[doi] [details]

Optimizing Active Ranges for Consistent Dynamic Map Labeling
Been, Ken, Nöllenburg, Martin, Poon, Sheung-Hung, Wolff, Alexander
Computational Geometry (SoCG'08), pages 10-19, 2008, ACM.
[pdf] [doi] [details]

Consistent Digital Rays
Chun, Jinhee, Korman, Matias, Nöllenburg, Martin, Tokuyama, Takeshi
Computational Geometry (SoCG'08), pages 355-364, 2008, ACM.
[pdf] [doi] [details]

Morphing Polylines: A Step Towards Continuous Generalization
Nöllenburg, Martin, Merrick, Damian, Wolff, Alexander, Benkert, Marc
Computers, Environment and Urban Systems, volume 32, number 4, pages 248-260, 2008.
[doi] [details]

2007

Improved Algorithms for Length-Minimal One-Sided Boundary Labeling
Benkert, Marc, Nöllenburg, Martin
European Workshop on Computational Geometry (EuroCG'07), pages 190-193, March 2007.
[details]

Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps
Benkert, Marc, Nöllenburg, Martin, Uno, Takeaki, Wolff, Alexander
Graph Drawing (GD'06) (Kaufmann, M. and Wagner, D.), volume 4372 of LNCS, pages 270-281, 2007, Springer-Verlag.
[doi] [details]

Morphing Polygonal Lines: A Step Towards Continuous Generalization
Merrick, Damian, Nöllenburg, Martin, Wolff, Alexander, Benkert, Marc
Geographic Information Science Research Conference UK (GISRUK'07) (Winstanley, Adam), pages 390-399, 2007.
[pdf] [details]

Geographic Visualization
Nöllenburg, Martin
Chapter in Human-Centered Visualization Environments (Kerren, Andreas and Ebert, Achim and Meyer, Joerg), volume 4417 of LNCS, pages 257-294, 2007, Springer Berlin Heidelberg.
[doi] [details]

2006

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

2005

Automated Drawing of Metro Maps
Nöllenburg, Martin
August 2005, Master’s thesis, Fakultät für Informatik, Universität Karlsruhe (TH).
[pdf] [details]

Automated Drawing of Metro Maps
Nöllenburg, Martin
2005, Technical report 2005-25, Fakultät für Informatik, Universität Karlsruhe.
[doi] [details]

2004

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