Martin Nllenburg
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
92
Venues
16
Active years
2005–2026
Best venue rank
A*
Where they publish
Papers
92 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | DIAGRAMS | Combined Network and Set Visualization with Hoop and Linear Diagrams. | Markus Wallinger, Peter Chapman, Martin Nllenburg, Peter Rodgers, Andrew Blake |
| 2026 | IWOCA | Realizing Planar Linkages in Polygonal Domains. | Thomas Depian, Carolina Haase, Martin Nllenburg, Andr Schulz |
| 2026 | PacificVis | Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchies. | Alexander Dobler, Son Le Thanh, Martin Nllenburg, Tino Weinkauf |
| 2026 | PacificVis | Clarity and Computational Efficiency of Orbital Boundary Labeling. | Markus Wallinger, Annika Bonerath, Soeren Terziadis, Jules Wulms, Martin Nllenburg |
| 2025 | GD | Visualizing Treewidth. | Alvin Chiu, Thomas Depian, David Eppstein, Michael T. Goodrich, Martin Nllenburg |
| 2025 | GD | Optimizing Wiggle in Storylines. | Alexander Dobler, Tim Hegemann, Martin Nllenburg, Alexander Wolff |
| 2025 | GD | Geometry Matters in Planar Storyplans. | Alexander Dobler, Maximilian Holzmller, Martin Nllenburg |
| 2025 | SOFSEM | Pathways to Tractability for Geometric Thickness. | Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nllenburg |
| 2025 | SOFSEM | Representing Hypergraphs by Point-Line Incidences. | Alexander Dobler, Stephen G. Kobourov, Debajyoti Mondal, Martin Nllenburg |
| 2025 | WADS | Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms. | Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael T. Goodrich, Martin Nllenburg |
| 2025 | WADS | On Minimizing Wiggle in Stacked Area Charts. | Alexander Dobler, Martin Nllenburg |
| 2025 | WG | The Peculiarities of Extending Queue Layouts. | Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nllenburg |
| 2024 | DIAGRAMS | Hoop Diagrams: A Set Visualization Method. | Peter Rodgers, Peter Chapman, Andrew Blake, Martin Nllenburg, Markus Wallinger, Alexander Dobler |
| 2024 | GD | Introducing Fairness in Graph Visualization (Poster Abstract). | Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nllenburg, Tommaso Piselli |
| 2024 | GD | Bundling-Aware Graph Drawing. | Daniel Archambault, Giuseppe Liotta, Martin Nllenburg, Tommaso Piselli, Alessandra Tappini, Markus Wallinger |
| 2024 | GD | Boundary Labeling in a Circular Orbit. | Annika Bonerath, Martin Nllenburg, Soeren Terziadis, Markus Wallinger, Jules Wulms |
| 2024 | GD | The Parameterized Complexity Of Extending Stack Layouts. | Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nllenburg |
| 2024 | GD | Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. | Alexander Dobler, Michael Jnger, Paul J. Jnger, Julian Meffert, Petra Mutzel, Martin Nllenburg |
| 2024 | GD | Minimizing Switches in Cased Graph Drawings (Poster Abstract). | Robert Ganian, Martin Nllenburg, Sebastian Rder |
| 2024 | GD | GdMetriX - A NetworkX Extension For Graph Drawing Metrics (Poster Abstract). | Martin Nllenburg, Sebastian Rder, Markus Wallinger |
| 2024 | ISAAC | Constrained Boundary Labeling. | Thomas Depian, Martin Nllenburg, Soeren Terziadis, Markus Wallinger |
| 2023 | GD | On Families of Planar DAGs with Constant Stack Number. | Martin Nllenburg, Sergey Pupyrev |
| 2023 | GD | Computing Hive Plots: A Combinatorial Framework. | Martin Nllenburg, Markus Wallinger |
| 2023 | PacificVis | MySemCloud: Semantic-aware Word Cloud Editing. | Michael Huber, Martin Nllenburg, Anas Villedieu |
| 2023 | WADS | Block Crossings in One-Sided Tanglegrams. | Alexander Dobler, Martin Nllenburg |
| 2023 | WALCOM | Splitting Plane Graphs to Outerplanarity. | Martin Gronemann, Martin Nllenburg, Anas Villedieu |
| 2022 | DIAGRAMS | On Computing Optimal Linear Diagrams. | Alexander Dobler, Martin Nllenburg |
| 2022 | GD | On the Complexity of the Storyplan Problem. | Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nllenburg, Antonios Symvonis |
| 2022 | GD | Planarizing Graphs and Their Drawings by Vertex Splitting. | Martin Nllenburg, Manuel Sorge, Soeren Terziadis, Anas Villedieu, Hsiang-Yun Wu, Jules Wulms |
| 2022 | ISAAC | Minimum Link Fencing. | Sujoy Bhore, Fabian Klute, Maarten Lffler, Martin Nllenburg, Soeren Terziadis, Anas Villedieu |
| 2022 | LATIN | Multidimensional Manhattan Preferences. | Jiehua Chen, Martin Nllenburg, Sofia Simola, Anas Villedieu, Markus Wallinger |
| 2021 | GD | On the Upward Book Thickness Problem: Combinatorial and Complexity Results. | Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nllenburg |
| 2021 | GD | Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs. | Sujoy Bhore, Maarten Lffler, Soeren Nickel, Martin Nllenburg |
| 2021 | GD | Layered Area-Proportional Rectangle Contact Representations. | Martin Nllenburg, Anas Villedieu, Jules Wulms |
| 2021 | ISAAC | Untangling Circular Drawings: Algorithms and Complexity. | Sujoy Bhore, Guangping Li, Martin Nllenburg, Ignaz Rutter, Hsiang-Yun Wu |
| 2021 | SOFSEM | Balanced Independent and Dominating Sets on Colored Interval Graphs. | Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nllenburg |
| 2020 | DIAGRAMS | Towards Data-Driven Multilinear Metro Maps. | Soeren Nickel, Martin Nllenburg |
| 2020 | ESA | An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. | Sujoy Bhore, Guangping Li, Martin Nllenburg |
| 2020 | GD | Parameterized Algorithms for Queue Layouts. | Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nllenburg |
| 2020 | GD | The Turing Test for Graph Drawing Algorithms. | Helen C. Purchase, Daniel Archambault, Stephen G. Kobourov, Martin Nllenburg, Sergey Pupyrev, Hsiang-Yun Wu |
| 2020 | ICALP | Extending Partial 1-Planar Drawings. | Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nllenburg |
| 2020 | MFCS | Layered Fan-Planar Graph Drawings. | Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nllenburg, Chrysanthi N. Raftopoulou |
| 2020 | MFCS | Extending Nearly Complete 1-Planar Drawings in Polynomial Time. | Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nllenburg |
| 2019 | GD | Parameterized Algorithms for Book Embedding Problems. | Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nllenburg |
| 2019 | GD | Mixed Linear Layouts: Complexity, Heuristics, and Experiments. | Philipp de Col, Fabian Klute, Martin Nllenburg |
| 2019 | GD | On Strict (Outer-)Confluent Graphs. | Henry Frster, Robert Ganian, Fabian Klute, Martin Nllenburg |
| 2019 | GD | Maximizing Ink in Partial Edge Drawings of k-plane Graphs. | Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nllenburg |
| 2019 | GD | Computing Stable Demers Cartograms. | Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nllenburg |
| 2018 | GD | Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. | Evmorfia N. Argyriou, Sabine Cornelsen, Henry Frster, Michael Kaufmann, Martin Nllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff |
| 2018 | GD | Short Plane Supports for Spatial Hypergraphs. | Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nllenburg, Xiaoru Yuan |
| 2017 | GD | Planar Drawings of Fixed-Mobile Bigraphs. | Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nllenburg, Antonios Symvonis, Ioannis G. Tollis |
| 2017 | GD | Planar L-Drawings of Directed Graphs. | Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff |
| 2017 | GD | Lombardi Drawings of Knots and Links. | Philipp Kindermann, Stephen G. Kobourov, Maarten Lffler, Martin Nllenburg, Andr Schulz, Birgit Vogtenhuber |
| 2017 | GD | Experimental Evaluation of Book Drawing Algorithms. | Jonathan Klawitter, Tamara Mchedlidze, Martin Nllenburg |
| 2015 | ATMOS | Towards Realistic Pedestrian Route Planning. | Simeon Andreev, Julian Dibbelt, Martin Nllenburg, Thomas Pajor, Dorothea Wagner |
| 2015 | CIAC | Label Placement in Road Maps. | Andreas Gemsa, Benjamin Niedermann, Martin Nllenburg |
| 2015 | CIAC | Mixed Map Labeling. | Maarten Lffler, Martin Nllenburg, Frank Staals |
| 2015 | GD | On the Readability of Boundary Labeling. | Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nllenburg |
| 2015 | GD | Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. | Jonathan Klawitter, Martin Nllenburg, Torsten Ueckerdt |
| 2015 | GD | Recognizing Weighted Disk Contact Graphs. | Boris Klemz, Martin Nllenburg, Roman Prutkin |
| 2015 | GD | On Minimizing Crossings in Storyline Visualizations. | Irina Kostitsyna, Martin Nllenburg, Valentin Polishchuk, Andr Schulz, Darren Strash |
| 2015 | GD | Drawing Large Graphs by Multilevel Maxent-Stress Optimization. | Henning Meyerhenke, Martin Nllenburg, Christian Schulz |
| 2015 | ISAAC | Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. | Martin Nllenburg, Roman Prutkin, Ignaz Rutter |
| 2014 | GD | Simultaneous Embeddability of Two Partitions. | Jan Christoph Athenstdt, Tanja Hartmann, Martin Nllenburg |
| 2014 | GD | On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. | Martin Nllenburg, Roman Prutkin, Ignaz Rutter |
| 2014 | LATIN | Semantic Word Cloud Representations: Hardness and Approximation Algorithms. | Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff |
| 2013 | ESA | Euclidean Greedy Drawings of Trees. | Martin Nllenburg, Roman Prutkin |
| 2013 | GD | Many-to-One Boundary Labeling with Backbones. | Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nllenburg, Ignaz Rutter, Antonios Symvonis |
| 2013 | GD | Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. | Therese Biedl, Thomas Blsius, Benjamin Niedermann, Martin Nllenburg, Roman Prutkin, Ignaz Rutter |
| 2013 | GD | Strict Confluent Drawing. | David Eppstein, Danny Holten, Maarten Lffler, Martin Nllenburg, Bettina Speckmann, Kevin Verbeek |
| 2013 | GD | Drawing Planar Graphs with a Prescribed Inner Face. | Tamara Mchedlidze, Martin Nllenburg, Ignaz Rutter |
| 2013 | ISAAC | Trajectory-Based Dynamic Map Labeling. | Andreas Gemsa, Benjamin Niedermann, Martin Nllenburg |
| 2012 | GD | Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor. | Jan Christoph Athenstdt, Robert Grke, Marcus Krug, Martin Nllenburg |
| 2012 | GD | Progress on Partial Edge Drawings. | Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nllenburg, Alexander Wolff |
| 2012 | GD | Drawing Metro Maps Using Bzier Curves. | Martin Fink, Herman J. Haverkort, Martin Nllenburg, Maxwell J. Roberts, Julian Schuhmann, Alexander Wolff |
| 2012 | GD | Planar Lombardi Drawings of Outerpaths. | Maarten Lffler, Martin Nllenburg |
| 2012 | GD | Edge-Weighted Contact Representations of Planar Graphs. | Martin Nllenburg, Roman Prutkin, Ignaz Rutter |
| 2012 | GD | On the Usability of Lombardi Graph Drawings. | Helen C. Purchase, John Hamer, Martin Nllenburg, Stephen G. Kobourov |
| 2011 | SOFSEM | On | Andreas Gemsa, Martin Nllenburg, Thomas Pajor, Ignaz Rutter |
| 2011 | WADS | Adjacency-Preserving Spatial Treemaps. | Kevin Buchin, David Eppstein, Maarten Lffler, Martin Nllenburg, Rodrigo I. Silveira |
| 2011 | WADS | Consistent Labeling of Rotating Maps. | Andreas Gemsa, Martin Nllenburg, Ignaz Rutter |
| 2010 | GD | Drawing Trees with Perfect Angular Resolution and Polynomial Area. | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nllenburg |
| 2010 | GD | Lombardi Drawings of Graphs. | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nllenburg |
| 2010 | GD | Optimal 3D Angular Resolution for Low-Degree Graphs. | David Eppstein, Maarten Lffler, Elena Mumford, Martin Nllenburg |
| 2010 | GD | Automatic Generation of Route Sketches. | Andreas Gemsa, Martin Nllenburg, Thomas Pajor, Ignaz Rutter |
| 2009 | ALENEX | Drawing Binary Tanglegrams: An Experimental Evaluation. | Martin Nllenburg, Markus Vlker, Alexander Wolff, Danny Holten |
| 2009 | GD | An Improved Algorithm for the Metro-line Crossing Minimization Problem. | Martin Nllenburg |
| 2008 | GD | Drawing (Complete) Binary Tanglegrams. | Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff |
| 2007 | GD | Cover Contact Graphs. | Nieves Atienza, Natalia de Castro, Carmen Corts, Mara ngeles Garrido, Clara I. Grima, Carlos G. Hernndez, Alberto Mrquez, Auxiliadora Moreno-Gonzlez, Martin Nllenburg, Jos Ramn Portillo, Pedro Reyes, Jesus Valenzuela, Maria Trinidad Villar, Alexander Wolff |
| 2007 | GD | Algorithms for Multi-criteria One-Sided Boundary Labeling. | Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nllenburg |
| 2006 | GD | Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. | Marc Benkert, Martin Nllenburg, Takeaki Uno, Alexander Wolff |
| 2005 | GD | A Mixed-Integer Program for Drawing High-Quality Metro Maps. | Martin Nllenburg, Alexander Wolff |