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
[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)- 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) - [c109]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 - [c108]Peter Rodgers, Peter Chapman, Andrew Blake, Martin Nöllenburg, Markus Wallinger, Alexander Dobler:
Hoop Diagrams: A Set Visualization Method. Diagrams 2024: 377-392 - [c107]Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg:
The Parameterized Complexity Of Extending Stack Layouts. GD 2024: 12:1-12:17 - [c106]Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, Markus Wallinger:
Bundling-Aware Graph Drawing. GD 2024: 15:1-15:19 - [c105]Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, Jules Wulms:
Boundary Labeling in a Circular Orbit. GD 2024: 22:1-22:17 - [c104]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 - [c103]Robert Ganian, Martin Nöllenburg, Sebastian Röder:
Minimizing Switches in Cased Graph Drawings (Poster Abstract). GD 2024: 43:1-43:3 - [c102]Martin Nöllenburg, Sebastian Röder, Markus Wallinger:
GdMetriX - A NetworkX Extension For Graph Drawing Metrics (Poster Abstract). GD 2024: 45:1-45:3 - [c101]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 - [c100]Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger:
Constrained Boundary Labeling. ISAAC 2024: 26:1-26:16 - [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]