2019W

• Algorithmic Geometry / VU / 186.122
• Algorithmics / VU / 186.814
• Bachelor Thesis in Computer Science / PR / 186.819
• Project in Computer Science 1 / PR / 186.820
• Project in Computer Science 2 / PR / 186.821
• Project in Software Engineering & Internet Computing / PR / 186.852
• Propädeutikum für Informatik / VU / 180.771
• Seminar in Algorithms Graphs and Geometry / SE / 186.862

• Human-Centered Algorithm Engineering
  2018 – 2022 / Austrian Science Fund (FWF)

2019

• External Labeling Techniques: A Taxonomy and Survey / M. Bekos, B. Niedermann, M. Nöllenburg / Computer Graphics Forum, 38 (2019), 3; 833 - 860
• Metabopolis: scalable network layout for biological pathway diagrams in urban map style / H. Wu, M. Nöllenburg, F. Filipa L. Sousa, I. Viola / BMC Bioinformatics, 20 (2019), 187; 1 - 20
• Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses / A. Nesic, M. Blaicher, T. Hoose, A. Hofmann, M. Lauermann, Y. Kutuvantavida, M. Nöllenburg, S. Randel, W. Freude, C. Koos / Optics Express, 27 (2019), 12; 17402 - 17425
• Guidelines for Experimental Algorithmics: A Case Study in Network Analysis / E. Angriman, A. van der Grinten, M. von Looz, H. Meyerhenke, M. Nöllenburg, M. Predari, C. Tzovas / Algorithms, Volume 12 (2019), Issue 7; 1 - 37
• On the readability of leaders in boundary labeling / L. Barth, A. Gemsa, B. Niedermann, M. Nöllenburg / Information Visualization, 18 (2019), 1; 110 - 132

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
• 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
• 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)
• 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
• 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
• 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)

2017

• 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

• Graph Drawing and Network Visualization 24th International Symposium / Y. Hu, M. Nöllenburg / Springer LNCS, 2016, ISBN: 978-3-319-50105-5
• Extending Convex Partial Drawings of Graphs / T. Mchedlidze, M. Nöllenburg, I. Rutter / Algorithmica, 76 (2016), 47 - 67
• Mixed map labeling / M. Löffler, M. Nöllenburg, F. Staals / Journal of Spatial Information Science, 13 (2016), 1 - 30
• Consistent Labeling Of Rotating Maps / A. Gemsa, M. Nöllenburg, I. Rutter / Journal of Computational Geometry, 7 (2016), 1; 308 - 331
• Evaluation of Labeling Strategies for Rotating Maps / A. Gemsa, M. Nöllenburg, I. Rutter / ACM Journal of Experimental Algorithmics, 21 (2016), 1; 1 - 21
• On Self-Approaching And Increasing-Chord Drawings Of 3-Connected Planar Graphs / M. Nöllenburg, R. Prutkin, I. Rutter / Journal of Computational Geometry, 7 (2016), 1; 47 - 69
• Adjacency-Preserving Spatial Treemaps / K. Buchin, D. Eppstein, M. Löffler, M. Nöllenburg, R. Silveira / Journal of Computational Geometry, 7 (2016), 1; 100 - 122
• Strict Confluent Drawing / D. Eppstein, D. Holten, M. Löffler, M. Nöllenburg, B. Speckmann, K. Verbeek / Journal of Computational Geometry, 7 (2016), 1; 22 - 46
• Temporal map labeling: A new unified framework with experiments. Advances in Geographic Information Systems / L. Barth, B. Niedermann, M. Nöllenburg, D. Strash / in: "Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems", 23; issued by: Acm Dl; ACM, Acm Dl, 2016, ISBN: 978-1-4503-4589-7, 1 - 10
• Software Visualization via Hierarchic Micro/Macro Layouts / M. Nöllenburg, I. Rutter, A. Schuhmacher / Talk: The International Conference on Information Visualization Theory and Applications IVAPP, Rom; 2016-02-27 - 2016-02-29; in: "Information Visualization Theory and Applications Conf IVAPP 2016", (2016), ISBN: 978-989-758-175-5; 153 - 160
• An Algorithmic Framework for Labeling Road Maps / B. Niedermann, M. Nöllenburg / Talk: International Conference on Geographic Information Science, Montreal, Canada; 2016-09-27 - 2016-09-30; in: "Geographic Information Science 9th International Conference", (2016), ISBN: 978-3-319-45737-6; 308 - 322

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

• Algorithms and Drawings for Mixed Linear Layouts of Graphs / Master Thesis by P. de Col / Supervisor: M. Nöllenburg, F. Klute; Institut für Logic and Computation, 2019
• Minimizing wiggles in storyline visualizations / Master Thesis by T. Fröschl / Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2018
• An interactive optimization framework for point feature label placement / Master Thesis by R. Löffler / Supervisor: M. Nöllenburg, F. Klute; Institut für Logic and Computation, 2018
• Graph Embeddings Motivated by Greedy Routing / PhD Thesis by R. Prutkin / Supervisor, Reviewer: D. Wagner, M. Nöllenburg, M Kaufmann; Institut für Theoretische Informatik, KIT, 2017; oral examination: 2017-11-29
• Automatic Label Placement in Maps and Figures: Models, Algorithms and Experiments / PhD Thesis by B. Niedermann / Supervisor, Reviewer: M. Nöllenburg, J. Haunert; Institut für Theoretische Informatik, KIT, 2017; oral examination: 2017-02-02
• Techniques for multiple sink placement in undirected flow networks / Master Thesis by O. Hubmer / Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2017
• Driving-range estimation of electric vehicles using graph algorithms / Master Thesis by F. Gstrein / Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2017