default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Nöllenburg
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j71]Henry Ehlers
, Nicolas Brich, Michael Krone, Martin Nöllenburg, Jiacheng Yu, Hiroaki Natsukawa, Xiaoru Yuan, Hsiang-Yun Wu:
An introduction to and survey of biological network visualization. Comput. Graph. 126: 104115 (2025)- [j70]Peter Eades, Seokhee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli, Stephen K. Wismath:
Introducing fairness in network visualization. Inf. Sci. 691: 121642 (2025) - [c112]Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg:
Pathways to Tractability for Geometric Thickness. SOFSEM (1) 2025: 209-224 - [c111]Alexander Dobler, Stephen G. Kobourov, Debajyoti Mondal, Martin Nöllenburg:
Representing Hypergraphs by Point-Line Incidences. SOFSEM (1) 2025: 241-254 - 2024
- [j69]Alexander Dobler, Martin Nöllenburg:
Improving Temporal Treemaps by Minimizing Crossings. Comput. Graph. Forum 43(3) (2024) - [j68]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: 103466 (2024) - [j67]Martin Nöllenburg, Markus Wallinger:
Computing Hive Plots: A Combinatorial Framework. J. Graph Algorithms Appl. 28(2): 101-129 (2024) - [j66]Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu:
Splitting Plane Graphs to Outerplanarity. J. Graph Algorithms Appl. 28(3): 31-48 (2024) - [c110]Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms:
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. SoCG 2024: 19:1-19:16 - [c109]Peter Rodgers, Peter Chapman, Andrew Blake, Martin Nöllenburg, Markus Wallinger, Alexander Dobler:
Hoop Diagrams: A Set Visualization Method. Diagrams 2024: 377-392 - [c108]Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg:
The Parameterized Complexity Of Extending Stack Layouts. GD 2024: 12:1-12:17 - [c107]Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, Markus Wallinger:
Bundling-Aware Graph Drawing. GD 2024: 15:1-15:19 - [c106]Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, Jules Wulms:
Boundary Labeling in a Circular Orbit. GD 2024: 22:1-22:17 - [c105]Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, Martin Nöllenburg:
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. GD 2024: 31:1-31:19 - [c104]Robert Ganian, Martin Nöllenburg, Sebastian Röder:
Minimizing Switches in Cased Graph Drawings (Poster Abstract). GD 2024: 43:1-43:3 - [c103]Martin Nöllenburg, Sebastian Röder, Markus Wallinger:
GdMetriX - A NetworkX Extension For Graph Drawing Metrics (Poster Abstract). GD 2024: 45:1-45:3 - [c102]Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli:
Introducing Fairness in Graph Visualization (Poster Abstract). GD 2024: 49:1-49:3 - [c101]Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger:
Constrained Boundary Labeling. ISAAC 2024: 26:1-26:16 - [c100]Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli:
Introducing Fairness in Graph Visualization via Gradient Descent. MLVis@EuroVis 2024 - [i100]Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger:
Constrained Boundary Labeling. CoRR abs/2402.12245 (2024) - [i99]Spela Kajzer, Alexander Dobler, Janja Jerebic, Martin Nöllenburg, Joachim Orthaber, Drago Bokal:
Graph drawing applications in combinatorial theory of maturity models. CoRR abs/2403.02026 (2024) - [i98]Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, Jules Wulms:
On Orbital Labeling with Circular Contours. CoRR abs/2403.19052 (2024) - [i97]Peter Rodgers, Peter Chapman, Andrew Blake, Martin Nöllenburg, Markus Wallinger, Alexander Dobler:
Hoop Diagrams: A Set Visualization Method. CoRR abs/2406.13260 (2024) - [i96]Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg:
The Parameterized Complexity of Extending Stack Layouts. CoRR abs/2409.02833 (2024) - [i95]Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, Martin Nöllenburg:
Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. CoRR abs/2409.02858 (2024) - [i94]Martin Nöllenburg, Christian Pirker, Anna Rapberger, Stefan Woltran, Jules Wulms:
Visualizing Extensions of Argumentation Frameworks as Layered Graphs. CoRR abs/2409.05457 (2024) - [i93]Alexander Dobler, Stephen G. Kobourov, Debajyoti Mondal, Martin Nöllenburg:
Representing Hypergraphs by Point-Line Incidences. CoRR abs/2411.13985 (2024) - [i92]Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg:
Pathways to Tractability for Geometric Thickness. CoRR abs/2411.15864 (2024) - 2023
- [j65]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): 24-35 (2023) - [j64]Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen:
Faster Edge-Path Bundling through Graph Spanners. Comput. Graph. Forum 42(6) (2023) - [j63]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): 7:1-7:15 (2023) - [j62]Martin Held, Martin Nöllenburg, Peter Sanders:
Editorial. Comput. Geom. 110: 101950 (2023) - [j61]Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
Untangling circular drawings: Algorithms and complexity. Comput. Geom. 111: 101975 (2023) - [j60]Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
On the upward book thickness problem: Combinatorial and complexity results. Eur. J. Comb. 110: 103662 (2023) - [j59]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): 19:1-19:32 (2023) - [j58]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): 875-885 (2023) - [j57]Markus Wallinger, Alexander Dobler, Martin Nöllenburg:
LinSets.zip: Compressing Linear Set Diagrams. IEEE Trans. Vis. Comput. Graph. 29(6): 2875-2887 (2023) - [c99]Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg:
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. SoCG 2023: 18:1-18:16 - [c98]Martin Nöllenburg, Sergey Pupyrev:
On Families of Planar DAGs with Constant Stack Number. GD (1) 2023: 135-151 - [c97]Martin Nöllenburg, Markus Wallinger:
Computing Hive Plots: A Combinatorial Framework. GD (2) 2023: 153-169 - [c96]Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms:
Transitions in Dynamic Point Labeling. GIScience 2023: 2:1-2:19 - [c95]Michael Huber, Martin Nöllenburg, Anaïs Villedieu:
MySemCloud: Semantic-aware Word Cloud Editing. PacificVis 2023: 147-156 - [c94]Alexander Dobler, Martin Nöllenburg:
Block Crossings in One-Sided Tanglegrams. WADS 2023: 386-400 - [c93]Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu:
Splitting Plane Graphs to Outerplanarity. WALCOM 2023: 217-228 - [i91]Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu:
Splitting Plane Graphs to Outerplanarity. CoRR abs/2301.09440 (2023) - [i90]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. CoRR abs/2301.10872 (2023) - [i89]Markus Wallinger, Alexander Dobler, Martin Nöllenburg:
LinSets.zip: Compressing Linear Set Diagrams. CoRR abs/2302.08401 (2023) - [i88]Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg:
Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable. CoRR abs/2302.10046 (2023) - [i87]Alexander Dobler, Martin Nöllenburg, Daniel Stojanovic, Anaïs Villedieu, Jules Wulms:
Crossing Minimization in Time Interval Storylines. CoRR abs/2302.14213 (2023) - [i86]Alexander Dobler, Martin Nöllenburg:
Block Crossings in One-Sided Tanglegrams. CoRR abs/2305.04682 (2023) - [i85]Michael Huber, Martin Nöllenburg, Anaïs Villedieu:
MySemCloud: Semantic-aware Word Cloud Editing. CoRR abs/2306.12759 (2023) - [i84]Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms:
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. CoRR abs/2308.00979 (2023) - [i83]Martin Nöllenburg, Markus Wallinger:
Computing Hive Plots: A Combinatorial Framework. CoRR abs/2309.02273 (2023) - [i82]Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya:
New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162). Dagstuhl Reports 13(4): 58-97 (2023) - 2022
- [j56]Tobias Batik, Soeren Terziadis, Yu-Shuen Wang, Martin Nöllenburg, Hsiang-Yun Wu:
Shape-Guided Mixed Metro Map Layout. Comput. Graph. Forum 41(7): 495-506 (2022) - [j55]Sujoy Bhore, Guangping Li, Martin Nöllenburg:
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. ACM J. Exp. Algorithmics 27: 1.8:1-1.8:36 (2022) - [j54]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. J. Graph Algorithms Appl. 26(3): 335-352 (2022) - [j53]Boris Klemz, Martin Nöllenburg, Roman Prutkin:
Recognizing weighted and seeded disk graphs. J. Comput. Geom. 13(1): 327-376 (2022) - [j52]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): 313-323 (2022) - [j51]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): 1848-1861 (2022) - [j50]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): 2376-2387 (2022) - [j49]Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola:
Multi-Level Area Balancing of Clustered Graphs. IEEE Trans. Vis. Comput. Graph. 28(7): 2682-2696 (2022) - [c92]Alexander Dobler, Martin Nöllenburg:
On Computing Optimal Linear Diagrams. Diagrams 2022: 20-36 - [c91]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: 232-246 - [c90]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: 304-318 - [c89]Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu:
Minimum Link Fencing. ISAAC 2022: 34:1-34:14 - [c88]Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger:
Multidimensional Manhattan Preferences. LATIN 2022: 273-289 - [i81]Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger:
Multidimensional Manhattan Preferences. CoRR abs/2201.09691 (2022) - [i80]Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms:
Transitions in Dynamic Map Labeling. CoRR abs/2202.11562 (2022) - [i79]Soeren Nickel, Martin Nöllenburg, Manuel Sorge, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms:
Planarizing Graphs and their Drawings by Vertex Splitting. CoRR abs/2202.12293 (2022) - [i78]Alexander Dobler, Martin Nöllenburg:
On Computing Optimal Linear Diagrams. CoRR abs/2206.08631 (2022) - [i77]Hsiang-Yun Wu, Benjamin Niedermann, Shigeo Takahashi, Martin Nöllenburg:
A Survey on Computing Schematic Network Maps: The Challenge to Interactivity. CoRR abs/2208.07301 (2022) - [i76]Peter Rottmann, Markus Wallinger, Annika Bonerath, Sven Gedicke, Martin Nöllenburg, Jan-Henrik Haunert:
MosaicSets: Embedding Set Systems into Grid Graphs. CoRR abs/2208.07982 (2022) - [i75]Tobias Batik, Soeren Terziadis, Yu-Shuen Wang, Martin Nöllenburg, Hsiang-Yun Wu:
Shape-Guided Mixed Metro Map Layout. CoRR abs/2208.14261 (2022) - [i74]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 abs/2209.00453 (2022) - [i73]Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu:
Minimum Link Fencing. CoRR abs/2209.14804 (2022) - 2021
- [b3]Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg:
External Labeling: Fundamental Concepts and Algorithmic Techniques. Synthesis Lectures on Visualization, Morgan & Claypool Publishers 2021, ISBN 978-3-031-01481-9, pp. 1-130 - [j48]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): 471-481 (2021) - [j47]Fabian Klute, Maarten Löffler, Martin Nöllenburg:
Labeling nonograms: Boundary labeling for curve arrangements. Comput. Geom. 98: 101791 (2021) - [j46]Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. J. Graph Algorithms Appl. 25(1): 481-512 (2021) - [j45]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg:
Geometric planar networks on bichromatic collinear points. Theor. Comput. Sci. 895: 124-136 (2021) - [j44]Ben Jacobsen, Markus Wallinger, Stephen G. Kobourov, Martin Nöllenburg:
MetroSets: Visualizing Sets as Metro Maps. IEEE Trans. Vis. Comput. Graph. 27(2): 1257-1267 (2021) - [j43]Markus Wallinger, Ben Jacobsen, Stephen G. Kobourov, Martin Nöllenburg:
On the Readability of Abstract Set Visualizations. IEEE Trans. Vis. Comput. Graph. 27(6): 2821-2832 (2021) - [c87]Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. GD 2021: 242-256 - [c86]Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg:
Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs. GD 2021: 304-317 - [c85]Martin Nöllenburg, Anaïs Villedieu, Jules Wulms:
Layered Area-Proportional Rectangle Contact Representations. GD 2021: 318-326 - [c84]Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms:
Worbel: Aggregating Point Labels into Word Clouds. SIGSPATIAL/GIS 2021: 256-267 - [c83]Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
Untangling Circular Drawings: Algorithms and Complexity. ISAAC 2021: 19:1-19:17 - [c82]Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg:
Balanced Independent and Dominating Sets on Colored Interval Graphs. SOFSEM 2021: 89-103 - [i72]Markus Wallinger, Ben Jacobsen, Stephen G. Kobourov, Martin Nöllenburg:
On the Readability of Abstract Set Visualizations. CoRR abs/2101.08155 (2021) - [i71]Sujoy Bhore, Soeren Nickel, Martin Nöllenburg:
Recognition of Unit Disk Graphs for Caterpillars, Embedded Trees, and Outerplanar Graphs. CoRR abs/2103.08416 (2021) - [i70]Martin Nöllenburg, Sergey Pupyrev:
On Families of Planar DAGs with Constant Stack Number. CoRR abs/2107.13658 (2021) - [i69]Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen:
Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach. CoRR abs/2108.05467 (2021) - [i68]Martin Nöllenburg, Anaïs Villedieu, Jules Wulms:
Layered Area-Proportional Rectangle Contact Representations. CoRR abs/2108.10711 (2021) - [i67]Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg:
On the Upward Book Thickness Problem: Combinatorial and Complexity Results. CoRR abs/2108.12327 (2021) - [i66]Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms:
Worbel: Aggregating Point Labels into Word Clouds. CoRR abs/2109.04368 (2021) - [i65]Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola:
Graph Models for Biological Pathway Visualization: State of the Art and Future Challenges. CoRR abs/2110.04808 (2021) - [i64]Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu:
Untangling Circular Drawings: Algorithms and Complexity. CoRR abs/2111.09766 (2021) - [i63]Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi:
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293). Dagstuhl Reports 11(6): 82-123 (2021) - 2020
- [j42]Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
Placing Labels in Road Maps: Algorithms and Complexity. Algorithmica 82(7): 1881-1908 (2020) - [j41]Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
A Unified Model and Algorithms for Temporal Map Labeling. Algorithmica 82(10): 2709-2736 (2020) - [j40]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): 619-646 (2020) - [j39]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. J. Graph Algorithms Appl. 24(4): 603-620 (2020) - [j38]Marcelo de Lima Galvão, Jakub Krukar, Martin Nöllenburg, Angela Schwering:
Route schematization with landmarks. J. Spatial Inf. Sci. 21(1): 99-136 (2020) - [c81]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg:
Geometric Planar Networks on Bichromatic Points. CALDAM 2020: 79-91 - [c80]Soeren Nickel, Martin Nöllenburg:
Towards Data-Driven Multilinear Metro Maps. Diagrams 2020: 153-161 - [c79]Sujoy Bhore, Guangping Li, Martin Nöllenburg:
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. ESA 2020: 19:1-19:24 - [c78]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. GD 2020: 40-54 - [c77]Helen C. Purchase, Daniel Archambault, Stephen G. Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu:
The Turing Test for Graph Drawing Algorithms. GD 2020: 466-481 - [c76]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Partial 1-Planar Drawings. ICALP 2020: 43:1-43:19 - [c75]Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou:
Layered Fan-Planar Graph Drawings. MFCS 2020: 14:1-14:13 - [c74]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. MFCS 2020: 31:1-31:16 - [p2]Martin Nöllenburg:
Crossing Layout in Non-planar Graph Drawings. Beyond Planar Graphs 2020: 187-209 - [i62]Sujoy Bhore, Guangping Li, Martin Nöllenburg:
Independent Sets of Dynamic Rectangles: Algorithms and Experiments. CoRR abs/2002.07611 (2020) - [i61]Therese Biedl, Steven Chaplick, Jirí Fiala, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou:
On Layered Fan-Planar Graph Drawings. CoRR abs/2002.09597 (2020) - [i60]Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg:
Balanced Independent and Dominating Sets on Colored Interval Graphs. CoRR abs/2003.05289 (2020) - [i59]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Partial 1-Planar Drawings. CoRR abs/2004.12222 (2020) - [i58]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Nearly Complete 1-Planar Drawings in Polynomial Time. CoRR abs/2007.05346 (2020) - [i57]Helen C. Purchase, Daniel Archambault, Stephen G. Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu:
The Turing Test for Graph Drawing Algorithms. CoRR abs/2008.04869 (2020) - [i56]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. CoRR abs/2008.08288 (2020) - [i55]Ben Jacobsen, Markus Wallinger, Stephen G. Kobourov, Martin Nöllenburg:
MetroSets: Visualizing Sets as Metro Maps. CoRR abs/2008.09367 (2020) - [i54]Man-Kwun Chiu, Jonas Cleve, Martin Nöllenburg:
Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard. CoRR abs/2010.01881 (2020)
2010 – 2019
- 2019
- [j37]Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas:
Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. Algorithms 12(7): 127 (2019) - [j36]Hsiang-Yun Wu, Martin Nöllenburg, Filipa L. Sousa, Ivan Viola:
Metabopolis: scalable network layout for biological pathway diagrams in urban map style. BMC Bioinform. 20(1): 187:1-187:20 (2019) - [j35]Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg:
External Labeling Techniques: A Taxonomy and Survey. Comput. Graph. Forum 38(3): 833-860 (2019) - [j34]Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
On the readability of leaders in boundary labeling. Inf. Vis. 18(1) (2019) - [j33]Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan:
Short Plane Supports for Spatial Hypergraphs. J. Graph Algorithms Appl. 23(3): 463-498 (2019) - [j32]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): 444-476 (2019) - [j31]Fabian Klute, Martin Nöllenburg:
Minimizing crossings in constrained two-sided circular graph layouts. J. Comput. Geom. 10(2): 45-69 (2019) - [j30]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar drawings of fixed-mobile bigraphs. Theor. Comput. Sci. 795: 408-419 (2019) - [c73]Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Computing Stable Demers Cartograms. GD 2019: 46-60 - [c72]Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. GD 2019: 147-161 - [c71]Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg:
Maximizing Ink in Partial Edge Drawings of k-plane Graphs. GD 2019: 323-336 - [c70]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. GD 2019: 365-378 - [c69]Philipp de Col, Fabian Klute, Martin Nöllenburg:
Mixed Linear Layouts: Complexity, Heuristics, and Experiments. GD 2019: 460-467 - [c68]Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt:
Exploring Semi-Automatic Map Labeling. SIGSPATIAL/GIS 2019: 13-22 - [r1]Yifan Hu, Martin Nöllenburg:
Graph Visualization. Encyclopedia of Big Data Technologies 2019 - [i53]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 abs/1901.08309 (2019) - [i52]Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg:
External Labeling Techniques: A Taxonomy and Survey. CoRR abs/1902.01454 (2019) - [i51]Soeren Nickel, Martin Nöllenburg:
Drawing k-linear Metro Maps. CoRR abs/1904.03039 (2019) - [i50]Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas:
Guidelines for Experimental Algorithmics in Network Analysis. CoRR abs/1904.04690 (2019) - [i49]Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. CoRR abs/1908.05345 (2019) - [i48]Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Computing Stable Demers Cartograms. CoRR abs/1908.07291 (2019) - [i47]Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg:
Maximizing Ink in Partial Edge Drawings of k-plane Graphs. CoRR abs/1908.08905 (2019) - [i46]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. CoRR abs/1908.08911 (2019) - [i45]Philipp de Col, Fabian Klute, Martin Nöllenburg:
Mixed Linear Layouts: Complexity, Heuristics, and Experiments. CoRR abs/1908.08938 (2019) - [i44]Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt:
Exploring Semi-Automatic Map Labeling. CoRR abs/1910.07799 (2019) - [i43]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg:
Geometric Planar Networks on Bichromatic Points. CoRR abs/1911.08924 (2019) - 2018
- [j29]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg:
Planar and poly-arc Lombardi drawings. J. Comput. Geom. 9(1): 328-355 (2018) - [j28]Henning Meyerhenke, Martin Nöllenburg, Christian Schulz:
Drawing Large Graphs by Multilevel Maxent-Stress Optimization. IEEE Trans. Vis. Comput. Graph. 24(5): 1814-1827 (2018) - [c67]Fabian Klute, Martin Nöllenburg:
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. SoCG 2018: 53:1-53:14 - [c66]Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan:
Short Plane Supports for Spatial Hypergraphs. GD 2018: 53-66 - [c65]Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff:
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. GD 2018: 509-523 - [c64]Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola:
A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways. EuroVis (Posters) 2018: 57-59 - [i42]Fabian Klute, Martin Nöllenburg:
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. CoRR abs/1803.05705 (2018) - [i41]Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan:
Short Plane Supports for Spatial Hypergraphs. CoRR abs/1808.09729 (2018) - [i40]Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff:
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. CoRR abs/1808.10536 (2018) - 2017
- [j27]Martin Nöllenburg, Roman Prutkin:
Euclidean Greedy Drawings of Trees. Discret. Comput. Geom. 58(3): 543-579 (2017) - [j26]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. Int. J. Comput. Geom. Appl. 27(1-2): 121- (2017) - [j25]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff:
Progress on Partial Edge Drawings. J. Graph Algorithms Appl. 21(4): 757-786 (2017) - [j24]Yifan Hu, Martin Nöllenburg:
Guest editors' foreword. J. Graph Algorithms Appl. 21(5): 787-789 (2017) - [c63]Benjamin Niedermann, Martin Nöllenburg, Ignaz Rutter:
Radial contour labeling with straight leaders. PacificVis 2017: 295-304 - [c62]Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber:
Lombardi Drawings of Knots and Links. GD 2017: 113-126 - [c61]Jonathan Klawitter, Tamara Mchedlidze, Martin Nöllenburg:
Experimental Evaluation of Book Drawing Algorithms. GD 2017: 224-238 - [c60]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar Drawings of Fixed-Mobile Bigraphs. GD 2017: 426-439 - [c59]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. GD 2017: 465-478 - [i39]Benjamin Niedermann, Martin Nöllenburg, Ignaz Rutter:
Radial Contour Labeling with Straight Leaders. CoRR abs/1702.01799 (2017) - [i38]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. CoRR abs/1708.09107 (2017) - [i37]Jonathan Klawitter, Tamara Mchedlidze, Martin Nöllenburg:
Experimental Evaluation of Book Drawing Algorithms. CoRR abs/1708.09221 (2017) - [i36]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar Drawings of Fixed-Mobile Bigraphs. CoRR abs/1708.09238 (2017) - [i35]Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber:
Lombardi Drawings of Knots and Links. CoRR abs/1708.09819 (2017) - [i34]Yifan Hu, Luana Micallef, Martin Nöllenburg, Peter J. Rodgers:
Scalable Set Visualizations (Dagstuhl Seminar 17332). Dagstuhl Reports 7(8): 1-22 (2017) - 2016
- [j23]Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter:
Extending Convex Partial Drawings of Graphs. Algorithmica 76(1): 47-67 (2016) - [j22]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Evaluation of Labeling Strategies for Rotating Maps. ACM J. Exp. Algorithmics 21(1): 1.4:1-1.4:21 (2016) - [j21]David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek:
Strict confluent drawing. J. Comput. Geom. 7(1): 22-46 (2016) - [j20]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
On self-approaching and increasing-chord drawings of 3-connected planar graphs. J. Comput. Geom. 7(1): 47-69 (2016) - [j19]Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira:
Adjacency-preserving spatial treemaps. J. Comput. Geom. 7(1): 100-122 (2016) - [j18]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Consistent labeling of rotating maps. J. Comput. Geom. 7(1): 308-331 (2016) - [j17]Maarten Löffler, Martin Nöllenburg, Frank Staals:
Mixed Map Labeling. J. Spatial Inf. Sci. 13(1): 3-32 (2016) - [c58]Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, Darren Strash:
Temporal map labeling: a new unified framework with experiments. SIGSPATIAL/GIS 2016: 23:1-23:10 - [c57]Benjamin Niedermann, Martin Nöllenburg:
An Algorithmic Framework for Labeling Road Maps. GIScience 2016: 308-322 - [c56]Martin Nöllenburg, Ignaz Rutter, Alfred Schuhmacher:
Software Visualization via Hierarchic Micro/Macro Layouts. VISIGRAPP (2: IVAPP) 2016: 155-162 - [e1]Yifan Hu, Martin Nöllenburg:
Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers. Lecture Notes in Computer Science 9801, Springer 2016, ISBN 978-3-319-50105-5 [contents] - [i33]Benjamin Niedermann, Martin Nöllenburg:
An Algorithmic Framework for Labeling Road Maps. CoRR abs/1605.04265 (2016) - [i32]Yifan Hu, Martin Nöllenburg:
Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016). CoRR abs/1609.02443 (2016) - [i31]Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, Darren Strash:
Temporal Map Labeling: A New Unified Framework with Experiments. CoRR abs/1609.06327 (2016) - 2015
- [b2]Martin Nöllenburg:
Visualization of Graphs and Maps - An Algorithmic Perspective. Karlsruhe University, Germany, 2015 - [j16]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. J. Graph Algorithms Appl. 19(3): 779-816 (2015) - [j15]Andreas Gemsa, Jan-Henrik Haunert, Martin Nöllenburg:
Multirow Boundary-Labeling Algorithms for Panorama Images. ACM Trans. Spatial Algorithms Syst. 1(1): 1:1-1:30 (2015) - [c55]Simeon Andreev, Julian Dibbelt, Martin Nöllenburg, Thomas Pajor, Dorothea Wagner:
Towards Realistic Pedestrian Route Planning. ATMOS 2015: 1-15 - [c54]Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
Label Placement in Road Maps. CIAC 2015: 221-234 - [c53]Maarten Löffler, Martin Nöllenburg, Frank Staals:
Mixed Map Labeling. CIAC 2015: 339-351 - [c52]Ujwal Gadiraju, Sebastian Möller, Martin Nöllenburg, Dietmar Saupe, Sebastian Egger-Lampl, Daniel Archambault, Brian D. Fisher:
Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd. Crowdsourcing and Human-Centered Experiments 2015: 6-26 - [c51]Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner:
Operating Power Grids with Few Flow Control Buses. e-Energy 2015: 289-294 - [c50]Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner, Franziska Wegner:
Towards Realistic Flow Control in Power Grid Operation. D-A-CH EI 2015: 192-199 - [c49]Henning Meyerhenke, Martin Nöllenburg, Christian Schulz:
Drawing Large Graphs by Multilevel Maxent-Stress Optimization. GD 2015: 30-43 - [c48]Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash:
On Minimizing Crossings in Storyline Visualizations. GD 2015: 192-198 - [c47]Jonathan Klawitter, Martin Nöllenburg, Torsten Ueckerdt:
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. GD 2015: 231-244 - [c46]Boris Klemz, Martin Nöllenburg, Roman Prutkin:
Recognizing Weighted Disk Contact Graphs. GD 2015: 433-446 - [c45]Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
On the Readability of Boundary Labeling. GD 2015: 515-527 - [c44]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. ISAAC 2015: 637-649 - [i30]Maarten Löffler, Martin Nöllenburg, Frank Staals:
Mixed Map Labeling. CoRR abs/1501.06813 (2015) - [i29]Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
Label Placement in Road Maps. CoRR abs/1501.07188 (2015) - [i28]Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner:
Operating Power Grids with Few Flow Control Buses. CoRR abs/1505.05747 (2015) - [i27]Henning Meyerhenke, Martin Nöllenburg, Christian Schulz:
Drawing Large Graphs by Multilevel Maxent-Stress Optimization. CoRR abs/1506.04383 (2015) - [i26]Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
On the Readability of Boundary Labeling. CoRR abs/1509.00379 (2015) - [i25]Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash:
On Minimizing Crossings in Storyline Visualizations. CoRR abs/1509.00442 (2015) - [i24]Boris Klemz, Martin Nöllenburg, Roman Prutkin:
Recognizing Weighted Disk Contact Graphs. CoRR abs/1509.00720 (2015) - [i23]Jonathan Klawitter, Martin Nöllenburg, Torsten Ueckerdt:
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. CoRR abs/1509.00835 (2015) - [i22]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. CoRR abs/1509.05635 (2015) - [i21]Ulrik Brandes, Irene Finocchi, Martin Nöllenburg, Aaron J. Quigley:
Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052). Dagstuhl Reports 5(1): 243-258 (2015) - 2014
- [j14]Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
On d-regular schematization of embedded paths. Comput. Geom. 47(3): 381-406 (2014) - [c43]Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg:
Simultaneous Embeddability of Two Partitions. GD 2014: 64-75 - [c42]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. GD 2014: 476-487 - [c41]Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff:
Semantic Word Cloud Representations: Hardness and Approximation Algorithms. LATIN 2014: 514-525 - [c40]Boris Klemz, Tamara Mchedlidze, Martin Nöllenburg:
Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams. SWAT 2014: 265-276 - [c39]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Evaluation of Labeling Strategies for Rotating Maps. SEA 2014: 235-246 - [i20]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Evaluation of Labeling Strategies for Rotating Maps. CoRR abs/1404.1849 (2014) - [i19]Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg:
Simultaneous Embeddability of Two Partitions. CoRR abs/1408.6019 (2014) - [i18]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. CoRR abs/1409.0315 (2014) - 2013
- [j13]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Drawing Trees with Perfect Angular Resolution and Polynomial Area. Discret. Comput. Geom. 49(2): 157-182 (2013) - [j12]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg:
Optimal 3D Angular Resolution for Low-Degree Graphs. J. Graph Algorithms Appl. 17(3): 173-200 (2013) - [j11]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Edge-weighted contact representations of planar graphs. J. Graph Algorithms Appl. 17(4): 441-473 (2013) - [c38]Jan-Hinrich Kämper, Stephen G. Kobourov, Martin Nöllenburg:
Circular-arc cartograms. PacificVis 2013: 1-8 - [c37]T. J. Jankun-Kelly, Tim Dwyer, Danny Holten, Christophe Hurter, Martin Nöllenburg, Chris E. Weaver, Kai Xu:
Scalability Considerations for Multivariate Graph Visualization. Multivariate Network Visualization 2013: 207-235 - [c36]Martin Nöllenburg, Roman Prutkin:
Euclidean Greedy Drawings of Trees. ESA 2013: 767-778 - [c35]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. GD 2013: 244-255 - [c34]Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter:
Drawing Planar Graphs with a Prescribed Inner Face. GD 2013: 316-327 - [c33]David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek:
Strict Confluent Drawing. GD 2013: 352-363 - [c32]Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. GD 2013: 460-471 - [c31]Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
Trajectory-Based Dynamic Map Labeling. ISAAC 2013: 413-423 - [i17]Martin Nöllenburg, Roman Prutkin:
Euclidean Greedy Drawings of Trees. CoRR abs/1306.5224 (2013) - [i16]Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter:
Drawing Planar Graphs with a Prescribed Inner Face. CoRR abs/1308.3370 (2013) - [i15]Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings. CoRR abs/1308.6778 (2013) - [i14]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. CoRR abs/1308.6801 (2013) - [i13]David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek:
Strict Confluent Drawing. CoRR abs/1308.6824 (2013) - [i12]Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
Trajectory-Based Dynamic Map Labeling. CoRR abs/1309.3963 (2013) - [i11]Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff:
Semantic Word Cloud Representations: Hardness and Approximation Algorithms. CoRR abs/1311.4778 (2013) - [i10]Stephen G. Kobourov, Martin Nöllenburg, Monique Teillaud:
Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151). Dagstuhl Reports 3(4): 34-68 (2013) - 2012
- [j10]Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff:
Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. Algorithmica 62(1-2): 309-332 (2012) - [j9]Jinhee Chun, Natsuda Kaothanthong, Ryosei Kasai, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama:
Algorithms for computing the maximum weight region decomposable into elementary shapes. Comput. Vis. Image Underst. 116(7): 803-814 (2012) - [j8]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Lombardi Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 85-108 (2012) - [j7]Nieves Atienza, Natalia de Castro, Carmen Cortés, María Ángeles Garrido, Clara I. Grima, Carlos G. Hernández, Alberto Márquez, Auxiliadora Moreno-González, Martin Nöllenburg, José Ramón Portillo, Pedro Reyes, Jesus Valenzuela, Maria Trinidad Villar, Alexander Wolff:
Cover Contact Graphs. J. Comput. Geom. 3(1): 102-131 (2012) - [c30]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff:
Progress on Partial Edge Drawings. GD 2012: 67-78 - [c29]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
Edge-Weighted Contact Representations of Planar Graphs. GD 2012: 224-235 - [c28]Helen C. Purchase, John Hamer, Martin Nöllenburg, Stephen G. Kobourov:
On the Usability of Lombardi Graph Drawings. GD 2012: 451-462 - [c27]Martin Fink, Herman J. Haverkort, Martin Nöllenburg, Maxwell J. Roberts, Julian Schuhmann, Alexander Wolff:
Drawing Metro Maps Using Bézier Curves. GD 2012: 463-474 - [c26]Jan Christoph Athenstädt, Robert Görke, Marcus Krug, Martin Nöllenburg:
Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor. GD 2012: 553-554 - [c25]Maarten Löffler, Martin Nöllenburg:
Planar Lombardi Drawings of Outerpaths. GD 2012: 561-562 - [i9]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff:
Progress on Partial Edge Drawings. CoRR abs/1209.0830 (2012) - 2011
- [j6]Martin Nöllenburg, Alexander Wolff:
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming. IEEE Trans. Vis. Comput. Graph. 17(5): 626-641 (2011) - [c24]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Sliding labels for dynamic point labeling. CCCG 2011 - [c23]Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner:
Connecting Two Trees with Optimal Routing Cost. CCCG 2011 - [c22]Andreas Gemsa, Jan-Henrik Haunert, Martin Nöllenburg:
Boundary-labeling algorithms for panorama images. GIS 2011: 289-298 - [c21]Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
On d-Regular Schematization of Embedded Paths. SOFSEM 2011: 260-271 - [c20]Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira:
Adjacency-Preserving Spatial Treemaps. WADS 2011: 159-170 - [c19]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Consistent Labeling of Rotating Maps. WADS 2011: 451-462 - [i8]Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter:
Consistent Labeling of Rotating Maps. CoRR abs/1104.5634 (2011) - [i7]Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira:
Adjacency-Preserving Spatial Treemaps. CoRR abs/1105.0398 (2011) - [i6]Jan-Hinrich Kämper, Stephen G. Kobourov, Martin Nöllenburg:
Circular-Arc Cartograms. CoRR abs/1112.4626 (2011) - 2010
- [j5]Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis:
Boundary Labeling with Octilinear Leaders. Algorithmica 57(3): 436-461 (2010) - [j4]Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff:
Optimizing active ranges for consistent dynamic map labeling. Comput. Geom. 43(3): 312-328 (2010) - [c18]Maarten Löffler, Martin Nöllenburg:
Shooting bricks with orthogonal laser beams: A first step towards internal/external map labeling. CCCG 2010: 203-206 - [c17]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Drawing Trees with Perfect Angular Resolution and Polynomial Area. GD 2010: 183-194 - [c16]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Lombardi Drawings of Graphs. GD 2010: 195-207 - [c15]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg:
Optimal 3D Angular Resolution for Low-Degree Graphs. GD 2010: 208-219 - [c14]Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter:
Automatic Generation of Route Sketches. GD 2010: 391-392 - [c13]Martin Nöllenburg, Valentin Polishchuk, Mikko Sysikaski:
Dynamic one-sided boundary labeling. GIS 2010: 310-319 - [c12]Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor:
Path Schematization for Route Sketches. SWAT 2010: 285-296 - [i5]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg:
Optimal 3D Angular Resolution for Low-Degree Graphs. CoRR abs/1009.0045 (2010) - [i4]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Lombardi Drawings of Graphs. CoRR abs/1009.0579 (2010) - [i3]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Drawing Trees with Perfect Angular Resolution and Polynomial Area. CoRR abs/1009.0581 (2010)
2000 – 2009
- 2009
- [b1]Martin Nöllenburg:
Network Visualization: Algorithms, Applications, and Complexity. Karlsruhe Institute of Technology, 2009 - [j3]Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama:
Consistent Digital Rays. Discret. Comput. Geom. 42(3): 359-378 (2009) - [j2]Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg:
Algorithms for Multi-Criteria Boundary Labeling. J. Graph Algorithms Appl. 13(3): 289-317 (2009) - [c11]Martin Nöllenburg, Markus Völker, Alexander Wolff, Danny Holten:
Drawing Binary Tanglegrams: An Experimental Evaluation. ALENEX 2009: 106-119 - [c10]Martin Nöllenburg:
An Improved Algorithm for the Metro-line Crossing Minimization Problem. GD 2009: 381-392 - [p1]Martin Nöllenburg:
Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexität. Ausgezeichnete Informatikdissertationen 2009: 161-170 - 2008
- [j1]Martin Nöllenburg, Damian Merrick, Alexander Wolff, Marc Benkert:
Morphing polylines: A step towards continuous generalization. Comput. Environ. Urban Syst. 32(4): 248-260 (2008) - [c9]Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff:
Optimizing active ranges for consistent dynamic map labeling. SCG 2008: 10-19 - [c8]Jinhee Chun, Matias Korman, Martin Nöllenburg, Takeshi Tokuyama:
Consistent digital rays. SCG 2008: 355-364 - [c7]Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff:
Drawing (Complete) Binary Tanglegrams. GD 2008: 324-335 - [c6]Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis:
Boundary Labeling with Octilinear Leaders. SWAT 2008: 234-245 - [i2]Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff:
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. CoRR abs/0806.0920 (2008) - [i1]Martin Nöllenburg, Danny Holten, Markus Völker, Alexander Wolff:
Drawing Binary Tanglegrams: An Experimental Evaluation. CoRR abs/0806.0928 (2008) - 2007
- [c5]Nieves Atienza, Natalia de Castro, Carmen Cortés, María Ángeles Garrido, Clara I. Grima, Carlos G. Hernández, Alberto Márquez, Auxiliadora Moreno-González, Martin Nöllenburg, José Ramón Portillo, Pedro Reyes, Jesus Valenzuela, Maria Trinidad Villar, Alexander Wolff:
Cover Contact Graphs. GD 2007: 171-182 - [c4]Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg:
Algorithms for Multi-criteria One-Sided Boundary Labeling. GD 2007: 243-254 - 2006
- [c3]Martin Nöllenburg:
Geographic Visualization. Human-Centered Visualization Environments 2006: 257-294 - [c2]Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff:
Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. GD 2006: 270-281 - 2005
- [c1]Martin Nöllenburg, Alexander Wolff:
A Mixed-Integer Program for Drawing High-Quality Metro Maps. GD 2005: 321-333
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-14 17:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
