Google
Google Scholar
Semantic Scholar
MS Academic
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
- 2020
[j41]Andreas Gemsa, Benjamin Niedermann
, Martin Nöllenburg:
Placing Labels in Road Maps: Algorithms and Complexity. Algorithmica 82(7): 1881-1908 (2020)- [j40]Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
A Unified Model and Algorithms for Temporal Map Labeling. Algorithmica 82(10): 2709-2736 (2020) - [j39]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) - [j38]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. J. Graph Algorithms Appl. 24(4): 603-620 (2020) - [c80]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg:
Geometric Planar Networks on Bichromatic Points. CALDAM 2020: 79-91 - [c79]Soeren Nickel, Martin Nöllenburg:
Towards Data-Driven Multilinear Metro Maps. Diagrams 2020: 153-161 - [c78]Sujoy Bhore, Guangping Li, Martin Nöllenburg:
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. ESA 2020: 19:1-19:24 - [c77]Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg:
Extending Partial 1-Planar Drawings. ICALP 2020: 43:1-43:19 - [c76]Therese C. Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi N. Raftopoulou:
Layered Fan-Planar Graph Drawings. MFCS 2020: 14:1-14:13 - [c75]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 - [p1]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 C. 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) - [c74]Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Computing Stable Demers Cartograms. Graph Drawing 2019: 46-60 - [c73]Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. Graph Drawing 2019: 147-161 - [c72]Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg:
Maximizing Ink in Partial Edge Drawings of k-plane Graphs. Graph Drawing 2019: 323-336 - [c71]Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. Graph Drawing 2019: 365-378 - [c70]Philipp de Col, Fabian Klute, Martin Nöllenburg:
Mixed Linear Layouts: Complexity, Heuristics, and Experiments. Graph Drawing 2019: 460-467 - [c69]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) - [c68]Fabian Klute, Martin Nöllenburg:
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. Symposium on Computational Geometry 2018: 53:1-53:14 - [c67]Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan:
Short Plane Supports for Spatial Hypergraphs. Graph Drawing 2018: 53-66 - [c66]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. Graph Drawing 2018: 509-523 - [c65]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) - [c64]Benjamin Niedermann, Martin Nöllenburg, Ignaz Rutter:
Radial contour labeling with straight leaders. PacificVis 2017: 295-304 - [c63]Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber:
Lombardi Drawings of Knots and Links. Graph Drawing 2017: 113-126 - [c62]Jonathan Klawitter, Tamara Mchedlidze, Martin Nöllenburg:
Experimental Evaluation of Book Drawing Algorithms. Graph Drawing 2017: 224-238 - [c61]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar Drawings of Fixed-Mobile Bigraphs. Graph Drawing 2017: 426-439 - [c60]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. Graph Drawing 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) - [c59]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 - [c58]Benjamin Niedermann, Martin Nöllenburg:
An Algorithmic Framework for Labeling Road Maps. GIScience 2016: 308-322 - [c57]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
- [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) - [c56]Simeon Andreev, Julian Dibbelt, Martin Nöllenburg, Thomas Pajor, Dorothea Wagner:
Towards Realistic Pedestrian Route Planning. ATMOS 2015: 1-15 - [c55]Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
Label Placement in Road Maps. CIAC 2015: 221-234 - [c54]Maarten Löffler, Martin Nöllenburg, Frank Staals:
Mixed Map Labeling. CIAC 2015: 339-351 - [c53]Ujwal Gadiraju, Sebastian Möller, Martin Nöllenburg, Dietmar Saupe, Sebastian Egger-Lampl, Daniel W. Archambault, Brian Fisher:
Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd. Crowdsourcing and Human-Centered Experiments 2015: 6-26 - [c52]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 - [c51]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 - [c50]Henning Meyerhenke, Martin Nöllenburg, Christian Schulz:
Drawing Large Graphs by Multilevel Maxent-Stress Optimization. Graph Drawing 2015: 30-43 - [c49]Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash:
On Minimizing Crossings in Storyline Visualizations. Graph Drawing 2015: 192-198 - [c48]Jonathan Klawitter, Martin Nöllenburg, Torsten Ueckerdt:
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. Graph Drawing 2015: 231-244 - [c47]Boris Klemz, Martin Nöllenburg, Roman Prutkin:
Recognizing Weighted Disk Contact Graphs. Graph Drawing 2015: 433-446 - [c46]Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg:
On the Readability of Boundary Labeling. Graph Drawing 2015: 515-527 - [c45]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) - [c44]Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg:
Simultaneous Embeddability of Two Partitions. Graph Drawing 2014: 64-75 - [c43]Martin Nöllenburg, Roman Prutkin, Ignaz Rutter:
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs. Graph Drawing 2014: 476-487 - [c42]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 - [c41]Boris Klemz, Tamara Mchedlidze, Martin Nöllenburg:
Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams. SWAT 2014: 265-276 - [c40]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) - [c39]Jan-Hinrich Kämper, Stephen G. Kobourov, Martin Nöllenburg:
Circular-arc cartograms. PacificVis 2013: 1-8 - [c38]T. J. Jankun-Kelly, Tim Dwyer, Danny Holten, Christophe Hurter, Martin Nöllenburg, Chris Weaver, Kai Xu:
Scalability Considerations for Multivariate Graph Visualization. Multivariate Network Visualization 2013: 207-235 - [c37]Martin Nöllenburg, Roman Prutkin:
Euclidean Greedy Drawings of Trees. ESA 2013: 767-778 - [c36]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. Graph Drawing 2013: 244-255 - [c35]Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter:
Drawing Planar Graphs with a Prescribed Inner Face. Graph Drawing 2013: 316-327 - [c34]David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek:
Strict Confluent Drawing. Graph Drawing 2013: 352-363 - [c33]Therese C. 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. Graph Drawing 2013: 460-471 - [c32]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 C. 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,