TU Wien Informatics

Martin Nöllenburg

Univ.Prof. Dipl.-Inform. Dr.rer.nat.

Research Focus

Research Areas

  • algorithms, algorithm engineering, Computational Geometry, Graph Algorithms, Information Visualization, combinatorial optimization, graph drawing
Martin Nöllenburg

About

  • design and analysis of algorithms
  • algorithm engineering
  • graph drawing and graph algorithms
  • computational geometry
  • information visualization and geovisualization

Roles

  • Full Professor
    Algorithms and Complexity, E192-01
  • Faculty Council
    Substitute Member
  • Curriculum Commission for Informatics
    Substitute Member

Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once APIs for the new database have been released, everything will be up to date again.

2022

2021

  • Untangling Circular Drawings: Algorithms and Complexity / S. Bhore, G. Li, M. Nöllenburg, I. Rutter, H. Wu / Talk: International Symposium on Algorithms and Computation (ISAAC), Fukuoka, Japan; 2021-12-06 - 2021-12-08; in: "32nd International Symposium on Algorithms and Computation (ISAAC 2021)", LIPICS, 212 (2021), ISBN: 978-3-95977-214-3; 1 - 17
  • Worbel: Aggregating Point Labels intoWord Clouds / S. Bhore, R. Ganian, G. Li, M. Nöllenburg, J. Wulms / Talk: ACM SIGSPATIAL international conference on Advances in geographic information systems, Beijing, China; 2021-11-02 - 2021-11-05; in: "SIGSPATIAL '21: Proceedings of the 29th International Conference on Advances in Geographic Information Systems", ACM, (2021), ISBN: 978-1-4503-8664-7; 256 - 267
  • Mixed Metro Maps with User-Specied Motifs / T. Batik, M. Nöllenburg, Y. Wang, H. Wu / Poster: International Symposium on Graph Drawing and Network Visualization, Tübingen; 2021-09-14 - 2021-09-17; in: "29th International Symposium on Graph Drawing and Network Visualization", (2021), 1 - 4
  • On the Upward Book Thickness Problem: Combinatorial and Complexity Results / S. Bhore, G. Da Lozzo, F. Montecchiani, M. Nöllenburg / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Tübingen, Germany; 2021-09-14 - 2021-09-17; in: "International Symposium on Graph Drawing and Network Visualization-GD2021", LNCS / Springer, 12868 (2021), ISBN: 978-3-030-92930-5; 242 - 256
  • Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs / S. Bhore, M. Löffler, S. Nickel, M. Nöllenburg / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Tübingen, Germany; 2021-09-14 - 2021-09-17; in: "International Symposium on Graph Drawing and Network Visualization-GD2021", LNCS / Springer, 12868 (2021), ISBN: 978-3-030-92930-5; 304 - 317
  • Layered Area-Proportional Rectangle Contact Representations / M. Nöllenburg, A. Villedieu, J. Wulms / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Tübingen, Germany; 2021-09-14 - 2021-09-17; in: "International Symposium on Graph Drawing and Network Visualization-GD2021", LNCS / Springer, 12868 (2021), ISBN: 978-3-030-92930-5; 318 - 326
  • Parameterized Complexity in Graph Drawing / R. Ganian, F. Montecchiani, M. Nöllenburg, M. Zehavi / Talk: Dagstuhl Seminar 21293, Dagstuhl, Deutschland; 2021-07-18 - 2021-07-23; in: "Seminar on Parameterized Complexity in Graph Drawing", Dagstuhl Reports, 11/06 (2021), ISSN: 2192-5283; 82 - 123
  • ClusterSets: Optimizing Planar Clusters in Categorical Point Data / J. Geiger, S. Cornelsen, J. Haunert, P. Kindermann, T. Mchedlidze, M. Nöllenburg, Y. Okamoto, A. Wolff / Talk: EuroVis, Zürich, Schweiz; 2021-06-14 - 2021-06-18; in: "Proceedings of the EuroVIS 2021", 40/3 (2021), 471 - 481
  • Balanced Independent and Dominating Sets on Colored Interval Graphs / S. Bhore, J. Haunert, F. Klute, G. Li, M. Nöllenburg / Talk: International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Bozen, Italy; 2021-01-25 - 2021-01-29; in: "SOFSEM 2021: Theory and Practice of Computer Science", Springer, LNCS 12607 (2021), ISBN: 978-3-030-67730-5; 89 - 103
  • External Labeling: Fundamental Concepts and Algorithmic Techniques / M. Bekos, B. Niedermann, M. Nöllenburg / Morgan & Claypool, 2021, ISBN: 9781636392042; 130 pages
  • Geometric planar networks on bichromatic collinear points / S. Bandyapadhyay, A. Banik, S. Bhore, M. Nöllenburg / Theoretical Computer Science, 895 (2021), 124 - 136
  • MetroSets: Visualizing Sets as Metro Maps / B. Jacobsen, M. Wallinger, S.G. Kobourov, M. Nöllenburg / IEEE Transactions on Visualization and Computer Graphics, 27 (2021), 2; 1257 - 1267
  • On the Readability of Abstract Set Visualizations / M. Wallinger, B. Jacobsen, S.G. Kobourov, M. Nöllenburg / IEEE Transactions on Visualization and Computer Graphics, 27 (2021), 6; 2821 - 2832
  • Labeling nonograms: Boundary labeling for curve arrangements / F. Klute, M. Löffler, M. Nöllenburg / Computational Geometry - Theory and Applications, 98 (2021), 1 - 17
  • On Strict (Outer-)Confluent Graphs / H. Förster, R. Ganian, F. Klute, M. Nöllenburg / Journal of Graph Algorithms and Applications, 25 (2021), 1; 481 - 512

2020

2019

2018

  • Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity / E. Argyriou, S. Cornelsen, H. Förster, M Kaufmann, M. Nöllenburg, Y. Okamoto, C. Raftopoulou, A. Wolff / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Barcelona; 2018-09-26 - 2018-09-28; in: "Graph Drawing and Network Visualization (GD'2018)", T. Biedl, A. Kerren (ed.); Springer Lecture Notes in Computer Science, 11282 (2018), 509 - 523
  • Short Plane Supports for Spatial Hypergraphs / T. Castermans, M. van Garderen, W. Meulemans, M. Nöllenburg, X. Yuan / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Barcelona; 2018-09-26 - 2018-09-28; in: "Graph Drawing and Network Visualization (GD'2018)", T. Biedl, A. Kerren (ed.); Springer Lecture Notes in Computer Science, 11282 (2018), 53 - 66
  • Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts / F. Klute, M. Nöllenburg / Talk: International Symposium on Computational Geometry (SoCG), Budapest; 2018-06-11 - 2018-06-14; in: "34th International Symposium on Computational Geometry", B. Speckmann, C. Tóth (ed.); LIPICS, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, 99 (2018), ISBN: 978-3-95977-066-8; 53:1 - 53:14
  • A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways / H. Wu, I. Viola, M. Nöllenburg / Poster: Eurographics Conference on Visualization (EuroVis 2018), Brno (invited); 2018-06-04 - 2018-06-08; in: "Proceedings of EuroVis 2018", Eurographics / VGTC, (2018)
  • The Travel of a Metabolite / H. Wu, M. Nöllenburg, I. Viola / Talk: IEEE Pacific Visualization Symposium (PacificVis), Kobe, Japan (invited); 2018-04-10 - 2018-04-13; in: "Proceedings of PacificVis 2018 Data Story Telling Contest", (2018)
  • Maximizing Ink in Symmetric Partial Edge Drawings of k-plane Graphs / M. Höller, F. Klute, S. Nickel, M. Nöllenburg, B. Schreiber / Talk: European Workshop on Computational Geometry (EuroCG'18), Berlin; 2018-03-21 - 2018-03-23
  • Graph Visualization / Y. Hu, M. Nöllenburg / in: "Encyclopedia of Big Data Technologies", S. Sakr, A. Zomaya (ed.); Springer International Publishing, Cham, 2018, (invited), ISBN: 978-3-319-63962-8, 1 - 9
  • Scalable Set Visualizations (Dagstuhl Seminar 17332) / Y. Hu, L. Micallef, M. Nöllenburg, P. Rodgers / in series "Dagstuhl Reports", series editor: Y. Hu, L. Micallef, M. Nöllenburg, P. Rodgers; Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2018, ISSN: 2192-5283, 22 pages
  • Planar and poly-arc Lombardi drawings / C. Duncan, D. Eppstein, M.T. Goodrich, S.G. Kobourov, M. Löffler, M. Nöllenburg / Journal of Computational Geometry, 9 (2018), 1; 328 - 355
  • Drawing Large Graphs by Multilevel Maxent-Stress Optimization / C. Schulz, M. Nöllenburg, H. Meyerhenke / IEEE Transactions on Visualization and Computer Graphics, 24 (2018), 5; 1814 - 1827

2017

  • Towards Characterizing Strict Outerconfluent Graphs / F. Klute, M. Nöllenburg / Poster: International Symposium on Graph Drawing and Network Visualization (GD), Boston; 2017-09-25 - 2017-09-27; in: "Graph Drawing and Network Visualization (GD 2017)", F. Frati, K.-L. Ma (ed.); Springer Lecture Notes in Computer Science, 10692 (2018), ISBN: 978-3-319-73914-4; 612 - 614
  • Minimizing Wiggles in Storyline Visualizations / T. Fröschl, M. Nöllenburg / Poster: International Symposium on Graph Drawing and Network Visualization (GD), Boston; 2017-09-25 - 2017-09-27; in: "Graph Drawing and Network Visualization (GD 2017)", F. Frati, K.-L. Ma (ed.); Springer Lecture Notes in Computer Science, 10692 (2018), ISBN: 978-3-319-73914-4; 585 - 587
  • Planar L-Drawings of Directed Graphs / S. Chaplick, M. Chimani, S. Cornelsen, G. Da Lozzo, M. Nöllenburg, M. Patrignani, I. Tollis, A. Wolff / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Boston; 2017-09-25 - 2017-09-27; in: "Graph Drawing and Network Visualization (GD 2017)", F. Frati, K.-L. Ma (ed.); Springer Lecture Notes in Computer Science, 10692 (2018), ISBN: 978-3-319-73914-4; 465 - 478
  • Experimental Evaluation of Book Drawing Algorithms / J. Klawitter, T. Mchedlidze, M. Nöllenburg / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Boston; 2017-09-25 - 2017-09-27; in: "Graph Drawing and Network Visualization (GD 2017)", F. Frati, K.-L. Ma (ed.); Springer Lecture Notes in Computer Science, 10692 (2018), ISBN: 978-3-319-73914-4; 224 - 238
  • Planar Drawings of Fixed-Mobile Bigraphs / M. Bekos, F. De Luca, W. Didimo, T. Mchedlidze, M. Nöllenburg, A. Symvonis, I. Tollis / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Boston; 2017-09-25 - 2017-09-27; in: "Graph Drawing and Network Visualization (GD 2017)", F. Frati, K.-L. Ma (ed.); Springer Lecture Notes in Computer Science, 10692 (2018), ISBN: 978-3-319-73914-4; 426 - 439
  • Lombardi Drawings of Knots and Links / P. Kindermann, S.G. Kobourov, M. Löffler, M. Nöllenburg, A. Schulz, B. Vogtenhuber / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Boston; 2017-09-25 - 2017-09-27; in: "Graph Drawing and Network Visualization (GD 2017)", F. Frati, K.-L. Ma (ed.); Springer Lecture Notes in Computer Science, 10692 (2018), ISBN: 978-3-319-73914-4; 113 - 126
  • Minimizing crossings in constrained two-sided circular graph layouts / F. Klute, M. Nöllenburg / Talk: EuroCG17, Schweden (invited); 2017-05-05
  • Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd / U. Gadiraju, S. Möller, M. Nöllenburg, D Saupe, S. Egger-Lampl, D. Archambault, B. Fisher / in: "Evaluation in the Crowd. Crowdsourcing and Human-Centered Experiments", 10264; D. Archambault, H. Purchase, T. Hossfeld (ed.); Springer International Publishing, 2017, ISBN: 978-3-319-66434-7, 6 - 26
  • Progress on Partial Edge Drawings / T. Bruckdorfer, S. Cornelsen, C. Gutwenger, M Kaufmann, F. Montecchiani, M. Nöllenburg, A. Wolff / Journal of Graph Algorithms and Applications, 21 (2017), 4; 757 - 786
  • Euclidean Greedy Drawings of Trees / R. Prutkin, M. Nöllenburg / Discrete & Computational Geometry, 58 (2017), 3; 543 - 579
  • Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions / M. Nöllenburg, R. Prutkin, I. Rutter / International Journal of Computational Geometry & Applications, 27 (2017), 1+2; 121 - 158
  • Radial Contour Labeling with Straight Leaders / M. Nöllenburg, B. Niedermann, I. Rutter / in: "2017 IEEE Pacific Visualization Symposium", IEEE, 2017, 295 - 304

2016

2015

  • Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions / M. Nöllenburg, R. Prutkin, I. Rutter / Talk: Algorithms and Computation (ISAAC´15), Nagoya, Japan; 2015-12-09 - 2015-12-11; in: "Algorithms and Computation", K. Elbassioni, K. Makino (ed.); LNCS, 9472 (2015), ISBN: 978-3-662-48971-0; 637 - 649
  • On the Readability of Boundary Labeling / M. Nöllenburg, L. Barth, B. Niedermann, A. Gemsa / Talk: Graph Drawing and Network Visualization (GD´15), Los Angeles, USA; 2015-09-24 - 2015-09-26; in: "Graph Drawing and Network Visualization (GD'15)", E. Di Giacomo, A. Lubiw (ed.); Springer, LNCS 9411 (2015), ISBN: 978-3-319-27260-3; 515 - 527
  • Recognizing Weighted Disk Contact Graphs / M. Nöllenburg, B. Klemz, R. Prutkin / Talk: Graph Drawing and Network Visualization (GD´15), Los Angeles, USA; 2015-09-24 - 2015-09-26; in: "Graph Drawing and Network Visualization (GD'15)", E. Di Giacomo, A. Lubiw (ed.); Springer, LNCS 9411 (2015), ISBN: 978-3-319-27260-3; 433 - 446
  • Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem / M. Nöllenburg, J. Klawitter, T. Ueckerdt / Talk: Graph Drawing and Network Visualization (GD´15), Los Angeles, USA; 2015-09-24 - 2015-09-26; in: "Graph Drawing and Network Visualization (GD'15)", E. Di Giacomo, A. Lubiw (ed.); Springer, LNCS 9411 (2015), ISBN: 978-3-319-27260-3; 231 - 244
  • On Minimizing Crossings in Storyline Visualizations / M. Nöllenburg, I. Kostitsyna, V. Polishchuk, A. Schulz, D. Strash / Talk: Graph Drawing and Network Visualization (GD´15), Los Angeles, USA; 2015-09-24 - 2015-09-26; in: "Graph Drawing and Network Visualization (GD'15)", E. Di Giacomo, A. Lubiw (ed.); Springer, LNCS 9411 (2015), ISBN: 978-3-319-27260-3; 192 - 198
  • Drawing Large Graphs by Multilevel Maxent-Stress Optimization / M. Nöllenburg, H. Meyerhenke, C. Schulz / Talk: Graph Drawing and Network Visualization (GD´15), Los Angeles, USA; 2015-09-24 - 2015-09-26; in: "Graph Drawing and Network Visualization (GD'15)", Springer, LNCS 9411 (2015), ISBN: 978-3-319-27260-3; 30 - 43

 

Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once APIs for the new database have been released, everything will be up to date again.