Martin Nöllenburg

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 177

Top Venues

CoRR

Graph Drawing

IEEE Trans. Vis. Comput. Graph.

J. Comput. Geom.

Karlsruhe Institute of Technology (PHD)

Education History

Karlsruhe Institute of Technology

PHD

Publications

Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
On the complexity of the storyplan problem. J. Comput. Syst. Sci. 139 (2024)
Peter Rottmann, Markus Wallinger, Annika Bonerath, Sven Gedicke, Martin Nöllenburg, Jan-Henrik Haunert
MosaicSets: Embedding Set Systems into Grid Graphs. IEEE Trans. Vis. Comput. Graph. 29 (1) (2023)
Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu
Splitting Plane Graphs to Outerplanarity. CoRR (2023)
Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu
Splitting Plane Graphs to Outerplanarity. WALCOM (2023)
Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger
Splitting Vertices in 2-Layer Graph Drawings. CoRR (2023)
Michael Huber, Martin Nöllenburg, Anaïs Villedieu
MySemCloud: Semantic-aware Word Cloud Editing. CoRR (2023)
Martin Held, Martin Nöllenburg, Peter Sanders
Editorial. Comput. Geom. 110 (2023)
Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. CoRR (2023)
Martin Nöllenburg, Markus Wallinger
Computing Hive Plots: A Combinatorial Framework. CoRR (2023)
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable. CoRR (2023)
Martin Nöllenburg, Sergey Pupyrev
On Families of Planar DAGs with Constant Stack Number. GD (1) (2023)
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Untangling circular drawings: Algorithms and complexity. Comput. Geom. 111 (2023)
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms
Worbel: Aggregating Point Labels into Word Clouds. ACM Trans. Spatial Algorithms Syst. 9 (3) (2023)
Markus Wallinger, Alexander Dobler, Martin Nöllenburg
LinSets.zip: Compressing Linear Set Diagrams. IEEE Trans. Vis. Comput. Graph. 29 (6) (2023)
Alexander Dobler, Martin Nöllenburg, Daniel Stojanovic, Anaïs Villedieu, Jules Wulms
Crossing Minimization in Time Interval Storylines. CoRR (2023)
Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms
Transitions in Dynamic Point Labeling. GIScience (2023)
Alexander Dobler, Martin Nöllenburg
Block Crossings in One-Sided Tanglegrams. CoRR (2023)
Markus Wallinger, Alexander Dobler, Martin Nöllenburg
LinSets.zip: Compressing Linear Set Diagrams. CoRR (2023)
Alexander Dobler, Martin Nöllenburg
Block Crossings in One-Sided Tanglegrams. WADS (2023)
Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen G. Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger
Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications 43 (3) (2023)
Michael Huber, Martin Nöllenburg, Anaïs Villedieu
MySemCloud: Semantic-aware Word Cloud Editing. PacificVis (2023)
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
On the upward book thickness problem: Combinatorial and complexity results. Eur. J. Comb. 110 (2023)
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. SoCG (2023)
Martin Nöllenburg, Markus Wallinger
Computing Hive Plots: A Combinatorial Framework. GD (2) (2023)
Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff
Planar L-Drawings of Directed Graphs. Comput. Geom. Topol. 2 (1) (2023)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Queue Layouts. J. Graph Algorithms Appl. 26 (3) (2022)
Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger
Multidimensional Manhattan Preferences. LATIN (2022)
Sujoy Bhore, Guangping Li, Martin Nöllenburg
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. ACM J. Exp. Algorithmics 27 (2022)
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
On the Complexity of the Storyplan Problem. GD (2022)
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu
Minimum Link Fencing. CoRR (2022)
Ladislav Cmolík, Vaclav Pavlovec, Hsiang-Yun Wu, Martin Nöllenburg
Mixed Labeling: Integrating Internal and External Labels. IEEE Trans. Vis. Comput. Graph. 28 (4) (2022)
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu
Minimum Link Fencing. ISAAC (2022)
Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms
Transitions in Dynamic Map Labeling. CoRR (2022)
Peter Rottmann, Markus Wallinger, Annika Bonerath, Sven Gedicke, Martin Nöllenburg, Jan-Henrik Haunert
MosaicSets: Embedding Set Systems into Grid Graphs. CoRR (2022)
Soeren Nickel, Martin Nöllenburg, Manuel Sorge, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms
Planarizing Graphs and their Drawings by Vertex Splitting. CoRR (2022)
Hsiang-Yun Wu, Benjamin Niedermann, Shigeo Takahashi, Martin Nöllenburg
A Survey on Computing Schematic Network Maps: The Challenge to Interactivity. CoRR (2022)
Alexander Dobler, Martin Nöllenburg
On Computing Optimal Linear Diagrams. CoRR (2022)
Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola
Multi-Level Area Balancing of Clustered Graphs. IEEE Trans. Vis. Comput. Graph. 28 (7) (2022)
Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen
Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach. IEEE Trans. Vis. Comput. Graph. 28 (1) (2022)
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
On the Complexity of the Storyplan Problem. CoRR (2022)
Soeren Nickel, Max Sondag, Wouter Meulemans, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg
Multicriteria Optimization for Dynamic Demers Cartograms. IEEE Trans. Vis. Comput. Graph. 28 (6) (2022)
Boris Klemz, Martin Nöllenburg, Roman Prutkin
Recognizing weighted and seeded disk graphs. J. Comput. Geom. 13 (1) (2022)
Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms
Planarizing Graphs and Their Drawings by Vertex Splitting. GD (2022)
Tobias Batik, Soeren Terziadis, Yu-Shuen Wang, Martin Nöllenburg, Hsiang-Yun Wu
Shape-Guided Mixed Metro Map Layout. CoRR (2022)
Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger
Multidimensional Manhattan Preferences. CoRR (2022)
Tobias Batik, Soeren Terziadis, Yu-Shuen Wang, Martin Nöllenburg, Hsiang-Yun Wu
Shape-Guided Mixed Metro Map Layout. Comput. Graph. Forum 41 (7) (2022)
Alexander Dobler, Martin Nöllenburg
On Computing Optimal Linear Diagrams. Diagrams (2022)
Markus Wallinger, Ben Jacobsen, Stephen G. Kobourov, Martin Nöllenburg
On the Readability of Abstract Set Visualizations. CoRR (2021)
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). Dagstuhl Reports 11 (6) (2021)
Martin Nöllenburg, Anaïs Villedieu, Jules Wulms
Layered Area-Proportional Rectangle Contact Representations. CoRR (2021)
Fabian Klute, Maarten Löffler, Martin Nöllenburg
Labeling nonograms: Boundary labeling for curve arrangements. Comput. Geom. 98 (2021)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Geometric planar networks on bichromatic collinear points. Theor. Comput. Sci. 895 (2021)
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. CoRR (2021)
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
On Strict (Outer-)Confluent Graphs. J. Graph Algorithms Appl. 25 (1) (2021)
Ben Jacobsen, Markus Wallinger, Stephen G. Kobourov, Martin Nöllenburg
MetroSets: Visualizing Sets as Metro Maps. IEEE Trans. Vis. Comput. Graph. 27 (2) (2021)
Martin Nöllenburg, Sergey Pupyrev
On Families of Planar DAGs with Constant Stack Number. CoRR (2021)
Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, Alexander Wolff
ClusterSets: Optimizing Planar Clusters in Categorical Point Data. Comput. Graph. Forum 40 (3) (2021)
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
Balanced Independent and Dominating Sets on Colored Interval Graphs. SOFSEM (2021)
Martin Nöllenburg, Anaïs Villedieu, Jules Wulms
Layered Area-Proportional Rectangle Contact Representations. Graph Drawing (2021)
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Untangling Circular Drawings: Algorithms and Complexity. ISAAC (2021)
Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola
Graph Models for Biological Pathway Visualization: State of the Art and Future Challenges. CoRR (2021)
Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs. Graph Drawing (2021)
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms
Worbel: Aggregating Point Labels into Word Clouds. SIGSPATIAL/GIS (2021)
Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen
Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach. CoRR (2021)
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. Graph Drawing (2021)
Markus Wallinger, Ben Jacobsen, Stephen G. Kobourov, Martin Nöllenburg
On the Readability of Abstract Set Visualizations. IEEE Trans. Vis. Comput. Graph. 27 (6) (2021)
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms
Worbel: Aggregating Point Labels into Word Clouds. CoRR (2021)
Sujoy Bhore, Soeren Nickel, Martin Nöllenburg
Recognition of Unit Disk Graphs for Caterpillars, Embedded Trees, and Outerplanar Graphs. CoRR (2021)
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Untangling Circular Drawings: Algorithms and Complexity. CoRR (2021)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Partial 1-Planar Drawings. CoRR (2020)
Sujoy Bhore, Guangping Li, Martin Nöllenburg
Independent Sets of Dynamic Rectangles: Algorithms and Experiments. CoRR (2020)
Man-Kwun Chiu, Jonas Cleve, Martin Nöllenburg
Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard. CoRR (2020)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Queue Layouts. CoRR (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. CoRR (2020)
Therese C. Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
Layered Fan-Planar Graph Drawings. MFCS (2020)
Hsiang-Yun Wu, Benjamin Niedermann, Shigeo Takahashi, Maxwell J. Roberts, Martin Nöllenburg
A Survey on Transit Map Layout - from Design, Machine, and Human Perspectives. Comput. Graph. Forum 39 (3) (2020)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Book Embedding Problems. J. Graph Algorithms Appl. 24 (4) (2020)
Marcelo de Lima Galvão, Jakub Krukar, Martin Nöllenburg, Angela Schwering
Route schematization with landmarks. J. Spatial Inf. Sci. 21 (1) (2020)
Helen C. Purchase, Daniel Archambault, Stephen G. Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu
The Turing Test for Graph Drawing Algorithms. CoRR (2020)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Queue Layouts. Graph Drawing (2020)
Ben Jacobsen, Markus Wallinger, Stephen G. Kobourov, Martin Nöllenburg
MetroSets: Visualizing Sets as Metro Maps. CoRR (2020)
Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
A Unified Model and Algorithms for Temporal Map Labeling. Algorithmica 82 (10) (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. MFCS (2020)
Sujoy Bhore, Guangping Li, Martin Nöllenburg
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. ESA (2020)
Helen C. Purchase, Daniel Archambault, Stephen G. Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu
The Turing Test for Graph Drawing Algorithms. Graph Drawing (2020)
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
Balanced Independent and Dominating Sets on Colored Interval Graphs. CoRR (2020)
Therese C. Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou
On Layered Fan-Planar Graph Drawings. CoRR (2020)
Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
Placing Labels in Road Maps: Algorithms and Complexity. Algorithmica 82 (7) (2020)
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Extending Partial 1-Planar Drawings. ICALP (2020)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Geometric Planar Networks on Bichromatic Points. CALDAM (2020)
Soeren Nickel, Martin Nöllenburg
Towards Data-Driven Multilinear Metro Maps. Diagrams (2020)
Aleksandar Nesic, Matthias Blaicher, Tobias Hoose, Andreas Hofmann, Matthias Lauermann, Yasar Kutuvantavida, Martin Nöllenburg, Sebastian Randel, Wolfgang Freude, Christian Koos
Hybrid 2D/3D photonic integration for non-planar circuit topologies. CoRR (2019)
Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber
Lombardi drawings of knots and links. J. Comput. Geom. 10 (1) (2019)
Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt
Exploring Semi-Automatic Map Labeling. SIGSPATIAL/GIS (2019)
Fabian Klute, Martin Nöllenburg
Minimizing crossings in constrained two-sided circular graph layouts. J. Comput. Geom. 10 (2) (2019)
Philipp de Col, Fabian Klute, Martin Nöllenburg
Mixed Linear Layouts: Complexity, Heuristics, and Experiments. Graph Drawing (2019)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Geometric Planar Networks on Bichromatic Points. CoRR (2019)
Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
On the readability of leaders in boundary labeling. Inf. Vis. 18 (1) (2019)
Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan
Short Plane Supports for Spatial Hypergraphs. J. Graph Algorithms Appl. 23 (3) (2019)
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Parameterized Algorithms for Book Embedding Problems. CoRR (2019)

Martin Nöllenburg.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martin Nöllenburg