Martin Nöllenburg
Univ.Prof. Dipl.-Inform. Dr.rer.nat.
Research Focus
- Logic and Computation: 80%
- Visual Computing and Human-Centered Technology: 20%
Research Areas
- algorithms, algorithm engineering, Computational Geometry, Graph Algorithms, Information Visualization, combinatorial optimization, graph drawing
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 -
Curriculum Coordinator
Bachelor Informatics / Specialization Theoretical Informatics + Logic -
Faculty Council
Principal Member -
Curriculum Commission for Informatics
Substitute Member
Courses
2022W
- Algorithmic Geometry / 192.133 / VU
- Algorithmics / 186.814 / VU
- Bachelor Thesis in Computer Science / 186.819 / PR
- Geometric Spanner Networks / 199.104 / VU
- Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
- Project in Computer Science 1 / 186.820 / PR
- Project in Computer Science 2 / 186.821 / PR
- Project in CS1: Team-Based Research in Algorithmics / 192.105 / PR
- Project in Software Engineering & Internet Computing / 186.852 / PR
- Project in Visual Computing / 192.090 / PR
- Propädeutikum für Informatik / 180.771 / VU
- Scientific Research and Writing / 193.052 / SE
- Seminar for Master Students in Software Engineering & Internet Computing / 180.777 / SE
- Seminar for PhD candidates / 186.199 / SE
- Seminar in Algorithms Graphs and Geometry / 186.862 / SE
2023S
- Algorithms and Data Structures / 186.866 / VU
- Bachelor Thesis in Computer Science / 186.819 / PR
- Graph Drawing Algorithms / 192.053 / VU
- Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
- Project in Computer Science 1 / 186.820 / PR
- Project in Computer Science 2 / 186.821 / PR
- Project in CS1: Team-Based Research in Algorithmics / 192.105 / PR
- Scientific Research and Writing / 193.052 / SE
- Seminar for PhD candidates / 186.199 / SE
Projects
-
Engineering Linear Ordering Algorithms for Optimizing Data Visualizations
2020 – 2024 / Vienna Science and Technology Fund (WWTF) -
Human-Centered Algorithm Engineering
2018 – 2023 / Austrian Science Fund (FWF)
Publications
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
- Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach / M. Wallinger, D. Archambault, D. Auber, M. Nöllenburg, J. Peltonen / IEEE Transactions on Visualization and Computer Graphics, 28 (2022), 1; 313 - 323
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
- An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling / S. Bhore, G. Li, M. Nöllenburg / Talk: European Symposium on Algorithms, Pisa, Italien; 2020-09-07 - 2020-09-09; in: "28th Annual European Symposium on Algorithms (ESA 2020)", LIPICS, 173 (2020), ISBN: 978-3-95977-162-7; 1 - 24
- Layered Fan-Planar Graph Drawings / T. Biedl, S. Chaplick, M Kaufmann, F. Montecchiani, M. Nöllenburg, C. Raftopoulou / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Prag, Tschechien; 2020-08-24 - 2020-08-28; in: "45th International Symposium on Mathematical Foundations of Computer Science", LIPICS, 170 (2020), ISBN: 978-3-95977-159-7; 1 - 13
- Extending Nearly Complete 1-Planar Drawings in Polynomial Time / E. Eiben, R. Ganian, T. Hamm, F. Klute, M. Nöllenburg / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Prag, Tschechien; 2020-08-24 - 2020-08-28; in: "45th International Symposium on Mathematical Foundations of Computer Science", LIPIcs, 170 (2020), ISBN: 978-3-95977-159-7; 1 - 16
- Towards Data-Driven Multilinear Metro Maps / S. Nickel, M. Nöllenburg / Talk: International Conference on Theory and Application of Diagrams, Tallinn, Estonia; 2020-08-24 - 2020-08-28; in: "Proceedings International Conference on Theory and Application of Diagrams", LNAI, 12169 (2020), ISBN: 978-3-030-54248-1; 153 - 161
- Extending Partial 1-Planar Drawings / E. Eiben, R. Ganian, T. Hamm, F. Klute, M. Nöllenburg / Talk: International Colloquium on Automata, Languages and Programming (ICALP), Saarbrücken, Germany; 2020-07-08 - 2020-07-11; in: "47th International Colloquium on Automata, Languages, and Programming", Leibniz International Proceedings in Informatics, 168 (2020), ISBN: 978-3-95977-138-2; 1 - 19
- Labeling Nonograms / M. Löffler, M. Nöllenburg / Talk: EuroCG, Würzburg, Deutschland; 2020-03-16 - 2020-03-18
- Balanced Independent and Dominating Sets onColored Interval Graphs / S. Bhore, J. Haunert, F. Klute, G. Li, M. Nöllenburg / Talk: EuroCG, Würzburg, Deutschland; 2020-03-16 - 2020-03-18
- Geometric Planar Networks on Bichromatic Points / S. Bandyapadhyay, A. Banik, S. Bhore, M. Nöllenburg / Talk: CALDAM, Hyderabad , Indien; 2020-02-13 - 2020-02-15; in: "CALDAM: Conference on Algorithms and Discrete Applied Mathematics", LNCS, 12016 (2020), ISBN: 978-3-030-39218-5; 79 - 91
- Crossing Layout in Non-planar Graph Drawings / M. Nöllenburg / in: "Beyond Planar Graphs", issued by: Hong SH., Tokuyama T.; Springer, Singapore, 2020, ISBN: 978-981-15-6532-8, 187 - 209
- A Unified Model and Algorithms for Temporal Map Labeling / A. Gemsa, B. Niedermann, M. Nöllenburg / Algorithmica (online), 82 (2020), 2709 - 2736
- Route schematization with landmarks / M. Galvão, J. Krukar, M. Nöllenburg, A. Schwering / Journal of Spatial Information Science, 21 (2020)
- Parameterized Algorithms for Book Embedding Problems / S. Bhore, R. Ganian, F. Montecchiani, M. Nöllenburg / Journal of Graph Algorithms and Applications, 24 (2020), 4; 603 - 620
- Multi-level Area Balancing of Clustered Graphs / H. Wu, M. Nöllenburg, I. Viola / IEEE Transactions on Visualization and Computer Graphics, 12 (2020), 12; 1 - 12
- Placing Labels in Road Maps: Algorithms and Complexity / A. Gemsa, B. Niedermann, M. Nöllenburg / Algorithmica (online), 82 (2020), 1881 - 1908
- A Survey on Transit Map Layout - from Design, Machine, and Human Perspectives / H. Wu, B. Niedermann, S. Takahashi, M. Roberts, M. Nöllenburg / Computer Graphics Forum, 39 (2020), 3; 619 - 646
- Mixed Labeling: Integrating Internal and External Labels / L. Cmolik, V. Pavlovec, H. Wu, M. Nöllenburg / in: "IEEE Transactions on Visualization and Computer Graphics (TVCG)", K. Schmid (ed.); IEEE Computer Society Press, 2020, 1 - 14
2019
- Exploring Semi-Automatic Map Labeling / F. Klute, G. Li, R. Löffler, M. Nöllenburg, M. Schmidt / Talk: ACM SIGSPATIAL international conference on Advances in geographic information systems, Chicago, USA; 2019-11-05 - 2019-11-08; in: "Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems", (2019), ISBN: 978-1-4503-6909-1; 13 - 22
- World map of recipes / G. Li, S. Nickel, M. Nöllenburg, I. Viola, H. Wu / Poster: Graph Drawing Contest, unknown; 2019-10-19
- Mixed Linear Layouts: Complexity, Heuristics, and Experiments / P. de Col, F. Klute, M. Nöllenburg / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 460 - 467
- On Strict (Outer-)Confluent Graphs / H. Förster, R. Ganian, F. Klute, M. Nöllenburg / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 147 - 161
- Maximizing Ink in Partial Edge Drawings of k-plane Graphs / M. Hummel, F. Klute, S. Nickel, M. Nöllenburg / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 323 - 336
- Computing Stable Demers Cartograms / S. Nickel, M. Sondag, W. Meulemans, M. Chimani, S.G. Kobourov, J. Peltonen, M. Nöllenburg / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 46 - 60
- Parameterized Algorithms for Book Embedding Problems / S. Bhore, R. Ganian, F. Montecchiani, M. Nöllenburg / Talk: Graph Drawing and Network Visualization, Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 365 - 378
- A Survey on Computing Schematic Network Maps: The Challenge to Interactivity / H. Wu, B. Niedermann, S. Takahashi, M. Nöllenburg / Talk: 2nd Schematic Mapping Workshop, TU Wien, Vienna; 2019-04-11 - 2019-04-12
- Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard / M. Chiu, J. Cleve, M. Nöllenburg / Talk: EuroCG, Utrecht, Niederlande; 2019-03-18 - 2019-03-20; in: "Extended abstract of EuroCG 2019", (2019), 1 - 9
- Short Plane Supports for Spatial Hypergraphs / T. Castermans, M. van Garderen, W. Meulemans, M. Nöllenburg, X. Yuan / Journal of Graph Algorithms and Applications, 23 (2019), 3; 463 - 498
- Planar drawings of fixed-mobile bigraphs / M. Bekos, F. De Luca, W. Didimo, T. Mchedlidze, M. Nöllenburg, A. Symvonis, I. Tollis / Theoretical Computer Science, 795 (2019), 408 - 419
- Lombardi Drawings Of Knots And Links / P. Kindermann, S.G. Kobourov, M. Löffler, M. Nöllenburg, A. Schulz, B. Vogtenhuber / Journal of Computational Geometry, 10 (2019), 1; 444 - 476
- Minimizing Crossings In Constrained Two-Sided Circular Graph Layouts / F. Klute, M. Nöllenburg / Journal of Computational Geometry, 10 (2019), 2; 45 - 69
- 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
- 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
- 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
- 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
- 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
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
Supervisions
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.
- Evaluierung der Nutzer-Aufmerksamkeit für dynamische Kartenbeschriftung / Master Thesis by V. Zernpfennig / Supervisor: M. Nöllenburg, M. Pohl; Institut für Logic and Computation, 2020; final examination: 2020-09-30
- Visualizing Set Data with the Metro Map Metaphor / Master Thesis by M. Wallinger / Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2020; final examination: 2020-06-26
- Avoiding Crossings in Non-Planar Graph Layouts / Doctoral Thesis by F. Klute / Supervisor, Reviewer: M. Nöllenburg, F. Frati, S.G. Kobourov; Institut für Logic and Computation, 2020; oral examination: 2020-03-13
- Engineering an Algorithm for Strict Outerconfluent Graph Drawings / Master Thesis by M. Buchta / Supervisor: M. Nöllenburg, F. Klute; Institut für Logic and Computation, 2019
- Generating Stable Demers Cartograms and Iso-Hexagon Cartograms / Master Thesis by S. Nickel / Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2019
- 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 / Doctoral 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 / Doctoral 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