A Mixed-Integer Program for Drawing High-Quality Metro Maps. - Martin Nöllenburg; Alexander Wolff 001 (GD, 2005)

Geographic Visualization. - Martin Nöllenburg (Human-Centered Visualization Environments, 2006)

Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. - Marc Benkert; Martin Nöllenburg; Takeaki Uno; Alexander Wolff 001 (GD, 2006)

Algorithms for Multi-criteria One-Sided Boundary Labeling. - Marc Benkert; Herman J. Haverkort; Moritz Kroll; Martin Nöllenburg (GD, 2007)

Drawing (Complete) Binary Tanglegrams. - Kevin Buchin; Maike Buchin; Jaroslaw Byrka; Martin Nöllenburg; Yoshio Okamoto; Rodrigo I. Silveira; Alexander Wolff 001 (GD, 2008)

Morphing polylines: A step towards continuous generalization. - Martin Nöllenburg; Damian Merrick; Alexander Wolff 001; Marc Benkert (Comput. Environ. Urban Syst., 2008)

Drawing Binary Tanglegrams: An Experimental Evaluation. - Martin Nöllenburg; Markus Völker; Alexander Wolff 001; Danny Holten (ALENEX, 2009)

An Improved Algorithm for the Metro-line Crossing Minimization Problem. - Martin Nöllenburg (GD, 2009)

Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexität. - Martin Nöllenburg (Ausgezeichnete Informatikdissertationen, 2009)

Consistent Digital Rays. - Jinhee Chun; Matias Korman; Martin Nöllenburg; Takeshi Tokuyama (Discret. Comput. Geom., 2009)

Algorithms for Multi-Criteria Boundary Labeling. - Marc Benkert; Herman J. Haverkort; Moritz Kroll; Martin Nöllenburg (J. Graph Algorithms Appl., 2009)

Network Visualization: Algorithms, Applications, and Complexity. - Martin Nöllenburg (2009)

Shooting bricks with orthogonal laser beams: A first step towards internal/external map labeling. - Maarten Löffler; Martin Nöllenburg (CCCG, 2010)

Automatic Generation of Route Sketches. - Andreas Gemsa; Martin Nöllenburg; Thomas Pajor; Ignaz Rutter (GD, 2010)

Dynamic one-sided boundary labeling. - Martin Nöllenburg; Valentin Polishchuk; Mikko Sysikaski (GIS, 2010)

Path Schematization for Route Sketches. - Daniel Delling; Andreas Gemsa; Martin Nöllenburg; Thomas Pajor (SWAT, 2010)

Boundary Labeling with Octilinear Leaders. - Michael A. Bekos; Michael Kaufmann 001; Martin Nöllenburg; Antonios Symvonis (Algorithmica, 2010)

Optimizing active ranges for consistent dynamic map labeling. - Ken Been; Martin Nöllenburg; Sheung-Hung Poon; Alexander Wolff 001 (Comput. Geom., 2010)

Sliding labels for dynamic point labeling. - Andreas Gemsa; Martin Nöllenburg; Ignaz Rutter (CCCG, 2011)

Connecting Two Trees with Optimal Routing Cost. - Mong-Jen Kao; Bastian Katz; Marcus Krug; D. T. Lee; Martin Nöllenburg; Ignaz Rutter; Dorothea Wagner (CCCG, 2011)

Boundary-labeling algorithms for panorama images. - Andreas Gemsa; Jan-Henrik Haunert; Martin Nöllenburg (GIS, 2011)

On d-Regular Schematization of Embedded Paths. - Andreas Gemsa; Martin Nöllenburg; Thomas Pajor; Ignaz Rutter (SOFSEM, 2011)

Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming. - Martin Nöllenburg; Alexander Wolff 001 (IEEE Trans. Vis. Comput. Graph., 2011)

Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor. - Jan Christoph Athenstädt; Robert Görke; Marcus Krug; Martin Nöllenburg (GD, 2012)

Drawing Metro Maps Using Bézier Curves. - Martin Fink 001; Herman J. Haverkort; Martin Nöllenburg; Maxwell J. Roberts; Julian Schuhmann; Alexander Wolff 001 (GD, 2012)

Planar Lombardi Drawings of Outerpaths. - Maarten Löffler; Martin Nöllenburg (GD, 2012)

On the Usability of Lombardi Graph Drawings. - Helen C. Purchase; John Hamer; Martin Nöllenburg; Stephen G. Kobourov (GD, 2012)

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 001 (Algorithmica, 2012)

Algorithms for computing the maximum weight region decomposable into elementary shapes. - Jinhee Chun; Natsuda Kaothanthong; Ryosei Kasai; Matias Korman; Martin Nöllenburg; Takeshi Tokuyama (Comput. Vis. Image Underst., 2012)

Lombardi Drawings of Graphs. - Christian A. Duncan; David Eppstein; Michael T. Goodrich; Stephen G. Kobourov; Martin Nöllenburg (J. Graph Algorithms Appl., 2012)

Cover Contact Graphs. - Nieves Atienza; Natalia de Castro; Carmen Cortés; María Ángeles Garrido 001; Clara I. Grima; Carlos G. Hernández; Alberto Márquez 001; Auxiliadora Moreno-González; Martin Nöllenburg; José Ramón Portillo; Pedro Reyes; Jesus Valenzuela; et al. (J. Comput. Geom., 2012)

Circular-arc cartograms. - Jan-Hinrich Kämper; Stephen G. Kobourov; Martin Nöllenburg (PacificVis, 2013)

Scalability Considerations for Multivariate Graph Visualization. - T. J. Jankun-Kelly; Tim Dwyer; Danny Holten; Christophe Hurter; Martin Nöllenburg; Chris E. Weaver; Kai Xu 003 (Multivariate Network Visualization, 2013)

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 (GD, 2013)

Drawing Planar Graphs with a Prescribed Inner Face. - Tamara Mchedlidze; Martin Nöllenburg; Ignaz Rutter (GD, 2013)

Trajectory-Based Dynamic Map Labeling. - Andreas Gemsa; Benjamin Niedermann; Martin Nöllenburg (ISAAC, 2013)

Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151). - Stephen G. Kobourov; Martin Nöllenburg; Monique Teillaud (Dagstuhl Reports, 2013)

Drawing Trees with Perfect Angular Resolution and Polynomial Area. - Christian A. Duncan; David Eppstein; Michael T. Goodrich; Stephen G. Kobourov; Martin Nöllenburg (Discret. Comput. Geom., 2013)

Optimal 3D Angular Resolution for Low-Degree Graphs. - David Eppstein; Maarten Löffler; Elena Mumford; Martin Nöllenburg (J. Graph Algorithms Appl., 2013)

Edge-weighted contact representations of planar graphs. - Martin Nöllenburg; Roman Prutkin; Ignaz Rutter (J. Graph Algorithms Appl., 2013)

Simultaneous Embeddability of Two Partitions. - Jan Christoph Athenstädt; Tanja Hartmann; Martin Nöllenburg (GD, 2014)

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 001 (LATIN, 2014)

Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams. - Boris Klemz; Tamara Mchedlidze; Martin Nöllenburg (SWAT, 2014)

On d-regular schematization of embedded paths. - Daniel Delling; Andreas Gemsa; Martin Nöllenburg; Thomas Pajor; Ignaz Rutter (Comput. Geom., 2014)

Towards Realistic Pedestrian Route Planning. - Simeon Andreev; Julian Dibbelt; Martin Nöllenburg; Thomas Pajor; Dorothea Wagner (ATMOS, 2015)

Label Placement in Road Maps. - Andreas Gemsa; Benjamin Niedermann; Martin Nöllenburg (CIAC, 2015)

Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd. - Ujwal Gadiraju; Sebastian Möller 001; Martin Nöllenburg; Dietmar Saupe; Sebastian Egger-Lampl; Daniel Archambault; Brian D. Fisher (Crowdsourcing and Human-Centered Experiments, 2015)

Operating Power Grids with Few Flow Control Buses. - Thomas Leibfried; Tamara Mchedlidze; Nico Meyer-Hübner; Martin Nöllenburg; Ignaz Rutter; Peter Sanders 001; Dorothea Wagner; Franziska Wegner (e-Energy, 2015)

Towards Realistic Flow Control in Power Grid Operation. - Tamara Mchedlidze; Martin Nöllenburg; Ignaz Rutter; Dorothea Wagner; Franziska Wegner (D-A-CH EI, 2015)

On the Readability of Boundary Labeling. - Lukas Barth; Andreas Gemsa; Benjamin Niedermann; Martin Nöllenburg (GD, 2015)

Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. - Jonathan Klawitter; Martin Nöllenburg; Torsten Ueckerdt (GD, 2015)

Recognizing Weighted Disk Contact Graphs. - Boris Klemz; Martin Nöllenburg; Roman Prutkin (GD, 2015)

On Minimizing Crossings in Storyline Visualizations. - Irina Kostitsyna; Martin Nöllenburg; Valentin Polishchuk; André Schulz 001; Darren Strash (GD, 2015)

Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052). - Ulrik Brandes; Irene Finocchi; Martin Nöllenburg; Aaron J. Quigley (Dagstuhl Reports, 2015)

Many-to-One Boundary Labeling with Backbones. - Michael A. Bekos; Sabine Cornelsen; Martin Fink 001; Seok-Hee Hong 001; Michael Kaufmann 001; Martin Nöllenburg; Ignaz Rutter; Antonios Symvonis (J. Graph Algorithms Appl., 2015)

Multirow Boundary-Labeling Algorithms for Panorama Images. - Andreas Gemsa; Jan-Henrik Haunert; Martin Nöllenburg (ACM Trans. Spatial Algorithms Syst., 2015)

Visualization of Graphs and Maps - An Algorithmic Perspective - Martin Nöllenburg (2015)

Temporal map labeling: a new unified framework with experiments. - Lukas Barth; Benjamin Niedermann; Martin Nöllenburg; Darren Strash (SIGSPATIAL/GIS, 2016)

An Algorithmic Framework for Labeling Road Maps. - Benjamin Niedermann; Martin Nöllenburg (GIScience, 2016)

Software Visualization via Hierarchic Micro/Macro Layouts. - Martin Nöllenburg; Ignaz Rutter; Alfred Schuhmacher (VISIGRAPP (2: IVAPP), 2016)

Extending Convex Partial Drawings of Graphs. - Tamara Mchedlidze; Martin Nöllenburg; Ignaz Rutter (Algorithmica, 2016)

Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016). - Yifan Hu 001; Martin Nöllenburg (CoRR, 2016)

Evaluation of Labeling Strategies for Rotating Maps. - Andreas Gemsa; Martin Nöllenburg; Ignaz Rutter (ACM J. Exp. Algorithmics, 2016)

Adjacency-preserving spatial treemaps. - Kevin Buchin; David Eppstein; Maarten Löffler; Martin Nöllenburg; Rodrigo I. Silveira (J. Comput. Geom., 2016)

Strict confluent drawing. - David Eppstein; Danny Holten; Maarten Löffler; Martin Nöllenburg; Bettina Speckmann; Kevin Verbeek (J. Comput. Geom., 2016)

Consistent labeling of rotating maps. - Andreas Gemsa; Martin Nöllenburg; Ignaz Rutter (J. Comput. Geom., 2016)

On self-approaching and increasing-chord drawings of 3-connected planar graphs. - Martin Nöllenburg; Roman Prutkin; Ignaz Rutter (J. Comput. Geom., 2016)

Mixed Map Labeling. - Maarten Löffler; Martin Nöllenburg; Frank Staals (J. Spatial Inf. Sci., 2016)

Radial contour labeling with straight leaders. - Benjamin Niedermann; Martin Nöllenburg; Ignaz Rutter (PacificVis, 2017)

Experimental Evaluation of Book Drawing Algorithms. - Jonathan Klawitter; Tamara Mchedlidze; Martin Nöllenburg (GD, 2017)

Scalable Set Visualizations (Dagstuhl Seminar 17332). - Yifan Hu 001; Luana Micallef; Martin Nöllenburg; Peter J. Rodgers (Dagstuhl Reports, 2017)

Euclidean Greedy Drawings of Trees. - Martin Nöllenburg; Roman Prutkin (Discret. Comput. Geom., 2017)

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. - Martin Nöllenburg; Roman Prutkin; Ignaz Rutter (Int. J. Comput. Geom. Appl., 2017)

Progress on Partial Edge Drawings. - Till Bruckdorfer; Sabine Cornelsen; Carsten Gutwenger; Michael Kaufmann 001; Fabrizio Montecchiani; Martin Nöllenburg; Alexander Wolff 001 (J. Graph Algorithms Appl., 2017)

Guest editors' foreword. - Yifan Hu 001; Martin Nöllenburg (J. Graph Algorithms Appl., 2017)

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. - Evmorfia N. Argyriou; Sabine Cornelsen; Henry Förster; Michael Kaufmann 001; Martin Nöllenburg; Yoshio Okamoto; Chrysanthi N. Raftopoulou; Alexander Wolff 001 (GD, 2018)

A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways. - Hsiang-Yun Wu; Martin Nöllenburg; Ivan Viola (EuroVis (Posters), 2018)

Planar and poly-arc Lombardi drawings. - Christian A. Duncan; David Eppstein; Michael T. Goodrich; Stephen G. Kobourov; Maarten Löffler; Martin Nöllenburg (J. Comput. Geom., 2018)

Drawing Large Graphs by Multilevel Maxent-Stress Optimization. - Henning Meyerhenke; Martin Nöllenburg; Christian Schulz 003 (IEEE Trans. Vis. Comput. Graph., 2018)

Mixed Linear Layouts: Complexity, Heuristics, and Experiments. - Philipp de Col; Fabian Klute; Martin Nöllenburg (GD, 2019)

Maximizing Ink in Partial Edge Drawings of k-plane Graphs. - Matthias Hummel; Fabian Klute; Soeren Nickel; Martin Nöllenburg (GD, 2019)

Computing Stable Demers Cartograms. - Soeren Nickel; Max Sondag; Wouter Meulemans; Markus Chimani; Stephen G. Kobourov; Jaakko Peltonen; Martin Nöllenburg (GD, 2019)

Exploring Semi-Automatic Map Labeling. - Fabian Klute; Guangping Li 001; Raphael Löffler; Martin Nöllenburg; Manuela Schmidt (SIGSPATIAL/GIS, 2019)

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, 2019)

Metabopolis: scalable network layout for biological pathway diagrams in urban map style. - Hsiang-Yun Wu; Martin Nöllenburg; Filipa L. Sousa; Ivan Viola (BMC Bioinform., 2019)

External Labeling Techniques: A Taxonomy and Survey. - Michael A. Bekos; Benjamin Niedermann; Martin Nöllenburg (Comput. Graph. Forum, 2019)

Hybrid 2D/3D photonic integration for non-planar circuit topologies. - Aleksandar Nesic; Matthias Blaicher; Tobias Hoose; Andreas Hofmann; Matthias Lauermann; Yasar Kutuvantavida; Martin Nöllenburg; Sebastian Randel; Wolfgang Freude; Christian Koos (CoRR, 2019)

Drawing k-linear Metro Maps. - Soeren Nickel; Martin Nöllenburg (CoRR, 2019)

Guidelines for Experimental Algorithmics in Network Analysis. - Eugenio Angriman; Alexander van der Grinten; Moritz von Looz; Henning Meyerhenke; Martin Nöllenburg; Maria Predari; Charilaos Tzovas (CoRR, 2019)

On the readability of leaders in boundary labeling. - Lukas Barth; Andreas Gemsa; Benjamin Niedermann; Martin Nöllenburg (Inf. Vis., 2019)

Short Plane Supports for Spatial Hypergraphs. - Thom Castermans; Mereke van Garderen; Wouter Meulemans; Martin Nöllenburg; Xiaoru Yuan (J. Graph Algorithms Appl., 2019)

Lombardi drawings of knots and links. - Philipp Kindermann; Stephen G. Kobourov; Maarten Löffler; Martin Nöllenburg; André Schulz 001; Birgit Vogtenhuber (J. Comput. Geom., 2019)

Minimizing crossings in constrained two-sided circular graph layouts. - Fabian Klute; Martin Nöllenburg (J. Comput. Geom., 2019)

Planar drawings of fixed-mobile bigraphs. - Michael A. Bekos; Felice De Luca; Walter Didimo; Tamara Mchedlidze; Martin Nöllenburg; Antonios Symvonis; Ioannis G. Tollis (Theor. Comput. Sci., 2019)

Graph Visualization. - Yifan Hu 001; Martin Nöllenburg (Encyclopedia of Big Data Technologies, 2019)

Crossing Layout in Non-planar Graph Drawings. - Martin Nöllenburg (Beyond Planar Graphs, 2020)

Geometric Planar Networks on Bichromatic Points. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore; Martin Nöllenburg (CALDAM, 2020)

Towards Data-Driven Multilinear Metro Maps. - Soeren Nickel; Martin Nöllenburg (Diagrams, 2020)

The Turing Test for Graph Drawing Algorithms. - Helen C. Purchase; Daniel Archambault; Stephen G. Kobourov; Martin Nöllenburg; Sergey Pupyrev; Hsiang-Yun Wu (GD, 2020)

Extending Partial 1-Planar Drawings. - Eduard Eiben; Robert Ganian; Thekla Hamm; Fabian Klute; Martin Nöllenburg (ICALP, 2020)

Layered Fan-Planar Graph Drawings. - Therese Biedl; Steven Chaplick; Michael Kaufmann 001; Fabrizio Montecchiani; Martin Nöllenburg; Chrysanthi N. Raftopoulou (MFCS, 2020)

Extending Nearly Complete 1-Planar Drawings in Polynomial Time. - Eduard Eiben; Robert Ganian; Thekla Hamm; Fabian Klute; Martin Nöllenburg (MFCS, 2020)

Placing Labels in Road Maps: Algorithms and Complexity. - Andreas Gemsa; Benjamin Niedermann; Martin Nöllenburg (Algorithmica, 2020)

A Unified Model and Algorithms for Temporal Map Labeling. - Andreas Gemsa; Benjamin Niedermann; Martin Nöllenburg (Algorithmica, 2020)

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 (Comput. Graph. Forum, 2020)

Independent Sets of Dynamic Rectangles: Algorithms and Experiments. - Sujoy Bhore; Guangping Li 001; Martin Nöllenburg (CoRR, 2020)

On Layered Fan-Planar Graph Drawings. - Therese Biedl; Steven Chaplick; Jirí Fiala 001; Michael Kaufmann 001; Fabrizio Montecchiani; Martin Nöllenburg; Chrysanthi N. Raftopoulou (CoRR, 2020)

Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard. - Man-Kwun Chiu; Jonas Cleve; Martin Nöllenburg (CoRR, 2020)

Parameterized Algorithms for Book Embedding Problems. - Sujoy Bhore; Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg (J. Graph Algorithms Appl., 2020)

Route schematization with landmarks. - Marcelo de Lima Galvão; Jakub Krukar; Martin Nöllenburg; Angela Schwering (J. Spatial Inf. Sci., 2020)

Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs. - Sujoy Bhore; Maarten Löffler; Soeren Nickel; Martin Nöllenburg (GD, 2021)

Layered Area-Proportional Rectangle Contact Representations. - Martin Nöllenburg; Anaïs Villedieu; Jules Wulms (GD, 2021)

Balanced Independent and Dominating Sets on Colored Interval Graphs. - Sujoy Bhore; Jan-Henrik Haunert; Fabian Klute; Guangping Li 001; Martin Nöllenburg (SOFSEM, 2021)

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 001 (Comput. Graph. Forum, 2021)

Labeling nonograms: Boundary labeling for curve arrangements. - Fabian Klute; Maarten Löffler; Martin Nöllenburg (Comput. Geom., 2021)

Recognition of Unit Disk Graphs for Caterpillars, Embedded Trees, and Outerplanar Graphs. - Sujoy Bhore; Soeren Nickel; Martin Nöllenburg (CoRR, 2021)

Graph Models for Biological Pathway Visualization: State of the Art and Future Challenges. - Hsiang-Yun Wu; Martin Nöllenburg; Ivan Viola (CoRR, 2021)

Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). - Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg; Meirav Zehavi (Dagstuhl Reports, 2021)

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

Geometric planar networks on bichromatic collinear points. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore; Martin Nöllenburg (Theor. Comput. Sci., 2021)

MetroSets: Visualizing Sets as Metro Maps. - Ben Jacobsen; Markus Wallinger; Stephen G. Kobourov; Martin Nöllenburg (IEEE Trans. Vis. Comput. Graph., 2021)

On the Readability of Abstract Set Visualizations. - Markus Wallinger; Ben Jacobsen; Stephen G. Kobourov; Martin Nöllenburg (IEEE Trans. Vis. Comput. Graph., 2021)

External Labeling: Fundamental Concepts and Algorithmic Techniques - Michael A. Bekos; Benjamin Niedermann; Martin Nöllenburg (External Labeling, 2021)

On Computing Optimal Linear Diagrams. - Alexander Dobler; Martin Nöllenburg (Diagrams, 2022)

Planarizing Graphs and Their Drawings by Vertex Splitting. - Martin Nöllenburg; Manuel Sorge; Soeren Terziadis; Anaïs Villedieu; Hsiang-Yun Wu; Jules Wulms (GD, 2022)

Minimum Link Fencing. - Sujoy Bhore; Fabian Klute; Maarten Löffler; Martin Nöllenburg; Soeren Terziadis; Anaïs Villedieu (ISAAC, 2022)

Multidimensional Manhattan Preferences. - Jiehua Chen 001; Martin Nöllenburg; Sofia Simola; Anaïs Villedieu; Markus Wallinger (LATIN, 2022)

Transitions in Dynamic Map Labeling. - Thomas Depian; Guangping Li 001; Martin Nöllenburg; Jules Wulms (CoRR, 2022)

A Survey on Computing Schematic Network Maps: The Challenge to Interactivity. - Hsiang-Yun Wu; Benjamin Niedermann; Shigeo Takahashi; Martin Nöllenburg (CoRR, 2022)

An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. - Sujoy Bhore; Guangping Li 001; Martin Nöllenburg (ACM J. Exp. Algorithmics, 2022)

Parameterized Algorithms for Queue Layouts. - Sujoy Bhore; Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg (J. Graph Algorithms Appl., 2022)

Recognizing weighted and seeded disk graphs. - Boris Klemz; Martin Nöllenburg; Roman Prutkin (J. Comput. Geom., 2022)

Mixed Labeling: Integrating Internal and External Labels. - Ladislav Cmolík; Vaclav Pavlovec; Hsiang-Yun Wu; Martin Nöllenburg (IEEE Trans. Vis. Comput. Graph., 2022)

Multicriteria Optimization for Dynamic Demers Cartograms. - Soeren Nickel; Max Sondag; Wouter Meulemans; Stephen G. Kobourov; Jaakko Peltonen; Martin Nöllenburg (IEEE Trans. Vis. Comput. Graph., 2022)

Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach. - Markus Wallinger; Daniel Archambault; David Auber; Martin Nöllenburg; Jaakko Peltonen (IEEE Trans. Vis. Comput. Graph., 2022)

Multi-Level Area Balancing of Clustered Graphs. - Hsiang-Yun Wu; Martin Nöllenburg; Ivan Viola (IEEE Trans. Vis. Comput. Graph., 2022)

Shape-Guided Mixed Metro Map Layout. - Tobias Batik; Soeren Terziadis; Yu-Shuen Wang; Martin Nöllenburg; Hsiang-Yun Wu (Comput. Graph. Forum, 2022)

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. - Sujoy Bhore; Robert Ganian; Liana Khazaliya; Fabrizio Montecchiani; Martin Nöllenburg (SoCG, 2023)

On Families of Planar DAGs with Constant Stack Number. - Martin Nöllenburg; Sergey Pupyrev (GD (1), 2023)

Transitions in Dynamic Point Labeling. - Thomas Depian; Guangping Li 001; Martin Nöllenburg; Jules Wulms (GIScience, 2023)

MySemCloud: Semantic-aware Word Cloud Editing. - Michael Huber; Martin Nöllenburg; Anaïs Villedieu (PacificVis, 2023)

Block Crossings in One-Sided Tanglegrams. - Alexander Dobler; Martin Nöllenburg (WADS, 2023)

Splitting Vertices in 2-Layer Graph Drawings. - Abu Reyan Ahmed; Patrizio Angelini; Michael A. Bekos; Giuseppe Di Battista; Michael Kaufmann 001; Philipp Kindermann; Stephen G. Kobourov; Martin Nöllenburg; Antonios Symvonis; Anaïs Villedieu; Markus Wallinger (IEEE Computer Graphics and Applications, 2023)

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 001 (Comput. Geom. Topol., 2023)

Editorial. - Martin Held; Martin Nöllenburg; Peter Sanders 001 (Comput. Geom., 2023)

Crossing Minimization in Time Interval Storylines. - Alexander Dobler; Martin Nöllenburg; Daniel Stojanovic; Anaïs Villedieu; Jules Wulms (CoRR, 2023)

New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162). - Robert Ganian; Fabrizio Montecchiani; Martin Nöllenburg; Meirav Zehavi; Liana Khazaliya (Dagstuhl Reports, 2023)

MosaicSets: Embedding Set Systems into Grid Graphs. - Peter Rottmann; Markus Wallinger; Annika Bonerath; Sven Gedicke; Martin Nöllenburg; Jan-Henrik Haunert (IEEE Trans. Vis. Comput. Graph., 2023)

Untangling circular drawings: Algorithms and complexity. - Sujoy Bhore; Guangping Li 001; Martin Nöllenburg; Ignaz Rutter; Hsiang-Yun Wu (Comput. Geom., 2023)

On the upward book thickness problem: Combinatorial and complexity results. - Sujoy Bhore; Giordano Da Lozzo; Fabrizio Montecchiani; Martin Nöllenburg (Eur. J. Comb., 2023)

LinSets.zip: Compressing Linear Set Diagrams. - Markus Wallinger; Alexander Dobler; Martin Nöllenburg (IEEE Trans. Vis. Comput. Graph., 2023)

Faster Edge-Path Bundling through Graph Spanners. - Markus Wallinger; Daniel Archambault; David Auber; Martin Nöllenburg; Jaakko Peltonen (Comput. Graph. Forum, 2023)

Worbel: Aggregating Point Labels into Word Clouds. - Sujoy Bhore; Robert Ganian; Guangping Li 001; Martin Nöllenburg; Jules Wulms (ACM Trans. Spatial Algorithms Syst., 2023)

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. - Sujoy Bhore; Martin Nöllenburg; Csaba D. Tóth; Jules Wulms (SoCG, 2024)

Hoop Diagrams: A Set Visualization Method. - Peter Rodgers 001; Peter Chapman; Andrew Blake 002; Martin Nöllenburg; Markus Wallinger; Alexander Dobler (Diagrams, 2024)

Introducing Fairness in Graph Visualization (Poster Abstract). - Seok-Hee Hong 001; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Tommaso Piselli (GD, 2024)

Bundling-Aware Graph Drawing. - Daniel Archambault; Giuseppe Liotta; Martin Nöllenburg; Tommaso Piselli; Alessandra Tappini; Markus Wallinger (GD, 2024)

Boundary Labeling in a Circular Orbit. - Annika Bonerath; Martin Nöllenburg; Soeren Terziadis; Markus Wallinger; Jules Wulms (GD, 2024)

The Parameterized Complexity Of Extending Stack Layouts. - Thomas Depian; Simon D. Fink; Robert Ganian; Martin Nöllenburg (GD, 2024)

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 (GD, 2024)

Minimizing Switches in Cased Graph Drawings (Poster Abstract). - Robert Ganian; Martin Nöllenburg; Sebastian Röder (GD, 2024)

GdMetriX - A NetworkX Extension For Graph Drawing Metrics (Poster Abstract). - Martin Nöllenburg; Sebastian Röder; Markus Wallinger (GD, 2024)

Introducing Fairness in Graph Visualization via Gradient Descent. - Seok-Hee Hong 001; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Tommaso Piselli (MLVis@EuroVis, 2024)

Improving Temporal Treemaps by Minimizing Crossings. - Alexander Dobler; Martin Nöllenburg (Comput. Graph. Forum, 2024)

Graph drawing applications in combinatorial theory of maturity models. - Spela Kajzer; Alexander Dobler; Janja Jerebic; Martin Nöllenburg; Joachim Orthaber; Drago Bokal (CoRR, 2024)

On Orbital Labeling with Circular Contours. - Annika Bonerath; Martin Nöllenburg; Soeren Terziadis; Markus Wallinger; Jules Wulms (CoRR, 2024)

Visualizing Extensions of Argumentation Frameworks as Layered Graphs. - Martin Nöllenburg; Christian Pirker; Anna Rapberger; Stefan Woltran; Jules Wulms (CoRR, 2024)

Splitting Plane Graphs to Outerplanarity. - Martin Gronemann; Martin Nöllenburg; Anaïs Villedieu (J. Graph Algorithms Appl., 2024)

Computing Hive Plots: A Combinatorial Framework. - Martin Nöllenburg; Markus Wallinger (J. Graph Algorithms Appl., 2024)

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. Comput. Syst. Sci., 2024)

Pathways to Tractability for Geometric Thickness. - Thomas Depian; Simon Dominik Fink; Alexander Firbas; Robert Ganian; Martin Nöllenburg (SOFSEM (1), 2025)

Representing Hypergraphs by Point-Line Incidences. - Alexander Dobler; Stephen G. Kobourov; Debajyoti Mondal; Martin Nöllenburg (SOFSEM (1), 2025)

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms. - Susanna Caroppo; Giordano Da Lozzo; Giuseppe Di Battista; Michael T. Goodrich; Martin Nöllenburg (WADS, 2025)

On Minimizing Wiggle in Stacked Area Charts. - Alexander Dobler; Martin Nöllenburg (WADS, 2025)

An introduction to and survey of biological network visualization. - Henry Ehlers; Nicolas Brich; Michael Krone; Martin Nöllenburg; Jiacheng Yu; Hiroaki Natsukawa; Xiaoru Yuan; Hsiang-Yun Wu (Comput. Graph., 2025)

Optimizing Staircase Motifs in Biofabric Network Layouts. - Sara Di Bartolomeo; Markus Wallinger; Martin Nöllenburg (Comput. Graph. Forum, 2025)

Constrained boundary labeling. - Thomas Depian; Martin Nöllenburg; Soeren Terziadis; Markus Wallinger (Comput. Geom., 2025)

Introducing fairness in network visualization. - Peter Eades; Seokhee Hong 001; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Tommaso Piselli; Stephen K. Wismath (Inf. Sci., 2025)

StorySets: Ordering Curves and Dimensions for Visualizing Uncertain Sets and Multi-Dimensional Discrete Data. - Markus Wallinger; Annika Bonerath; Wouter Meulemans; Martin Nöllenburg; Stephen G. Kobourov; Alexander Wolff 001 (CoRR, 2025)

The Peculiarities of Extending Queue Layouts. - Thomas Depian; Simon D. Fink; Robert Ganian; Martin Nöllenburg (CoRR, 2025)

Geometry Matters in Planar Storyplans. - Alexander Dobler; Maximilian Holzmüller; Martin Nöllenburg (CoRR, 2025)