TU Wien Informatics

20 Years
Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

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
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
  • Curriculum Coordinator
    Bachelor Informatics / Specialization Theoretical Informatics + Logic
  • Data Protection and Privacy
    Coordinator
  • Faculty Council
    Substitute Member
  • Curriculum Commission for Informatics
    Substitute Member

Contact

2024W

2025S

 

2024

  • Splitting Plane Graphs to Outerplanarity / Gronemann, M., Nöllenburg, M., & Villedieu, A. (2024). Splitting Plane Graphs to Outerplanarity. Journal of Graph Algorithms and Applications, 28(3), 31–48. https://doi.org/10.7155/jgaa.v28i3.2970
  • Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time / Bhore, S., Nöllenburg, M., Tóth, C. D., & Wulms, J. (2024). Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. In 40th International Symposium on Computational Geometry (SoCG 2024). 40th International Symposium on Computational Geometry (SoCG 2024), Athens, Greece. https://doi.org/10.4230/LIPIcs.SoCG.2024.19
  • Improving Temporal Treemaps by Minimizing Crossings / Dobler, A., & Nöllenburg, M. (2024). Improving Temporal Treemaps by Minimizing Crossings. Computer Graphics Forum, 43(3), Article e15087. https://doi.org/10.1111/cgf.15087
  • On the complexity of the storyplan problem / Binucci, C., Di Giacomo, E., Lenhart, W., Liotta, G., Montecchiani, F., Nöllenburg, M., & Symvonis, A. (2024). On the complexity of the storyplan problem. Journal of Computer and System Sciences, 139, Article 103466. https://doi.org/10.1016/j.jcss.2023.103466
    Download: PDF (590 KB)
  • Hoop Diagrams: A Set Visualization Method / Rodgers, P., Chapman, P., Blake, A., Nöllenburg, M., Wallinger, M., & Dobler, A. (2024). Hoop Diagrams: A Set Visualization Method. In Diagrammatic Representation and Inference (pp. 377–392). Springer, Cham.

2023

  • Transitions in Dynamic Point Labeling / Depian, T., Li, G., Nöllenburg, M., & Wulms, J. (2023). Transitions in Dynamic Point Labeling. In 12th International Conference on Geographic Information Science (GIScience 2023). 12th International Conference on Geographic Information Science (GIScience 2023), United Kingdom of Great Britain and Northern Ireland (the). Schloss-Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.GIScience.2023.2
    Download: PDF (1.29 MB)
    Projects: Engineering Linear Ordering Algorithms for Optimizing Data Visualizations (2020–2025) / HumAlgo (2018–2023)
  • Worbel: aggregating point labels into word clouds / Bhore, S., Ganian, R., Li, G., Nöllenburg, M., & Wulms, J. (2023). Worbel: aggregating point labels into word clouds. ACM Transactions on Spatial Algorithms and Systems, 9(3), Article 19. https://doi.org/10.1145/3603376
    Download: PDF (6.17 MB)
    Projects: HumAlgo (2018–2023) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026)
  • Faster edge‐path bundling through graph spanners / Wallinger, M., Archambault, D., Auber, D., Nöllenburg, M., & Peltonen, J. (2023). Faster edge‐path bundling through graph spanners. Computer Graphics Forum, 42(6), Article e14789. https://doi.org/10.1111/cgf.14789
    Download: PDF (1.81 MB)
  • LinSets.zip: Compressing Linear Set Diagrams / Wallinger, M., Dobler, A., & Nöllenburg, M. (2023). LinSets.zip: Compressing Linear Set Diagrams. IEEE Transactions on Visualization and Computer Graphics, 29(6), 2875–2887. https://doi.org/10.1109/TVCG.2023.3261934
  • On the upward book thickness problem: Combinatorial and complexity results / Bhore, S., Da Lozzo, G., Montecchiani, F., & Nöllenburg, M. (2023). On the upward book thickness problem: Combinatorial and complexity results. European Journal of Combinatorics, 110, Article 103662. https://doi.org/10.1016/j.ejc.2022.103662
  • Untangling circular drawings: Algorithms and complexity / Bhore, S., Li, G., Nöllenburg, M., Rutter, I., & Wu, H.-Y. (2023). Untangling circular drawings: Algorithms and complexity. Computational Geometry, 111, Article 101975. https://doi.org/10.1016/j.comgeo.2022.101975
    Download: PDF (499 KB)
    Project: HumAlgo (2018–2023)
  • Planar L-drawings of directed graphs / Chaplick, S., Cornelsen, S., Nöllenburg, M., Tollis, I. G., Chimani, M., Da Lozzo, G., Patrignani, M., & Wolf, A. (2023). Planar L-drawings of directed graphs. Computing in Geometry and Topology, 2(1), 7:1-7:15. https://doi.org/10.34726/5407
    Download: PDF (794 KB)
  • Planarizing Graphs and Their Drawings by Vertex Splitting / Nöllenburg, M., Sorge, M., Terziadis, S., Villedieu, A., Wu, H.-Y., & Wulms, J. (2023). Planarizing Graphs and Their Drawings by Vertex Splitting. In P. Angelini & R. von Haxleden (Eds.), Graph Drawing and Network Visualization. GD 2022 (pp. 232–246). Springer. https://doi.org/10.1007/978-3-031-22203-0_17
  • On the Complexity of the Storyplan Problem / Binucci, C., Di Giacomo, E., Lenhart, W. J., Liotta, G., Montecchiani, F., Nöllenburg, M., & Symvonis, A. (2023). On the Complexity of the Storyplan Problem. In P. Angelini & R. von Haxleden (Eds.), Graph Drawing and Network Visualization. GD 2022 (pp. 304–318). Springer. https://doi.org/10.1007/978-3-031-22203-0_22
  • Splitting Vertices in 2-Layer Graph Drawings / Ahmed, R., Angelini, P., Bekos, M. A., Battista, G. D., Kaufmann, M., Kindermann, P., Kobourov, S., Nöllenburg, M., Symvonis, A., Villedieu, A., & Wallinger, M. (2023). Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications, 43(3), 24–35. https://doi.org/10.1109/MCG.2023.3264244
  • Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable / Bhore, S., Ganian, R., Khazaliya, L., Montecchiani, F., & Nöllenburg, M. (2023). Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. In E. Chambers & J. Gudmundsson (Eds.), 39th International Symposium on Computational Geometry (pp. 1–16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2023.18
  • MosaicSets: Embedding Set Systems into Grid Graphs / Rottmann, P., Wallinger, M., Bonerath, A., Gedicke, S., Nöllenburg, M., & Haunert, J.-H. (2023). MosaicSets: Embedding Set Systems into Grid Graphs. IEEE Transactions on Visualization and Computer Graphics, 29(1), 875–885. https://doi.org/10.1109/TVCG.2022.3209485
  • MySemCloud: Semantic-aware Word Cloud Editing / Huber, M., Nöllenburg, M., & Villedieu, A. (2023). MySemCloud: Semantic-aware Word Cloud Editing. In 2023 IEEE 16th Pacific Visualization Symposium (PacificVis) (pp. 147–156). IEEE. https://doi.org/10.1109/PacificVis56936.2023.00024
  • On Families of Planar DAGs with Constant Stack Number / Nöllenburg, M., & Pupyrev, S. (2023). On Families of Planar DAGs with Constant Stack Number. In M. A. Bekos & M. Chimani (Eds.), Graph Drawing and Network Visualization : 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20–22, 2023, Revised Selected Papers, Part II (pp. 135–151). Springer. https://doi.org/10.1007/978-3-031-49272-3_10
  • Computing Hive Plots: A Combinatorial Framework / Nöllenburg, M., & Wallinger, M. (2023). Computing Hive Plots: A Combinatorial Framework. In M. A. Bekos & M. Chimani (Eds.), Graph Drawing and Network Visualization : 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20–22, 2023, Revised Selected Papers, Part II (pp. 153–169). Springer. https://doi.org/10.1007/978-3-031-49275-4_11
  • Block Crossings in One-Sided Tanglegrams / Dobler, A., & Nöllenburg, M. (2023). Block Crossings in One-Sided Tanglegrams. In P. Morin & S. Suri (Eds.), Algorithms and Data Structures : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings (pp. 386–400). Springer. https://doi.org/10.1007/978-3-031-38906-1_25
  • Crossing Minimization in Time Interval Storylines / Dobler, A., Nöllenburg, M., Stojanovic, D., Villedieu, A., & Wulms, J. (2023). Crossing Minimization in Time Interval Storylines. In 39th European Workshop on Computational Geometry : EuroCG2023 : Book of Abstracts (pp. 36–37).
    Download: PDF (1.35 MB)
  • Splitting Plane Graphs to Outerplanarity / Gronemann, M., Nöllenburg, M., & Villedieu, A. (2023). Splitting Plane Graphs to Outerplanarity. In C.-C. Lin, B. M. T. Lin, & G. Liotta (Eds.), WALCOM: Algorithms and Computation : 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023, Proceedings (pp. 217–228). Springer. https://doi.org/10.1007/978-3-031-27051-2_19

2022

2021

  • Parameterized Complexity in Graph Drawing / Ganian, R., Montecchiani, F., Nöllenburg, M., & Zehavi, M. (2021). Parameterized Complexity in Graph Drawing. In Seminar on Parameterized Complexity in Graph Drawing (pp. 82–123). Dagstuhl Reports. https://doi.org/10.4230/DagRep.11.6.82
  • Balanced Independent and Dominating Sets on Colored Interval Graphs / Bhore, S., Haunert, J.-H., Klute, F., Li, G., & Nöllenburg, M. (2021). Balanced Independent and Dominating Sets on Colored Interval Graphs. In SOFSEM 2021: Theory and Practice of Computer Science (pp. 89–103). Springer. https://doi.org/10.1007/978-3-030-67731-2_7
  • Worbel: Aggregating Point Labels intoWord Clouds / Bhore, S., Ganian, R., Li, G., Nöllenburg, M., & Wulms, J. (2021). Worbel: Aggregating Point Labels intoWord Clouds. In Proceedings of the 29th International Conference on Advances in Geographic Information Systems. SIGSPATIAL ’21: 29th International Conference on Advances in Geographic Information Systems, Beijing, China. ACM. https://doi.org/10.1145/3474717.3483959
  • Untangling Circular Drawings: Algorithms and Complexity / Bhore, S., Li, G., Nöllenburg, M., Rutter, I., & Wu, H.-Y. (2021). Untangling Circular Drawings: Algorithms and Complexity. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021) (pp. 1–17). LIPICS. https://doi.org/10.4230/LIPIcs.ISAAC.2021.19
  • On the Upward Book Thickness Problem: Combinatorial and Complexity Results / Bhore, S., Da Lozzo, G., Montecchiani, F., & Nöllenburg, M. (2021). On the Upward Book Thickness Problem: Combinatorial and Complexity Results. In Graph Drawing and Network Visualization. GD 2021 (pp. 242–256). Springer. https://doi.org/10.1007/978-3-030-92931-2_18
  • ClusterSets: Optimizing Planar Clusters in Categorical Point Data / Geiger, J., Cornelsen, S., Haunert, J. ‐H., Kindermann, P., Mchedlidze, T., Nöllenburg, M., Okamoto, Y., & Wolff, A. (2021). ClusterSets: Optimizing Planar Clusters in Categorical Point Data. In Computer Graphics Forum (pp. 471–481). https://doi.org/10.1111/cgf.14322
  • Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs / Bhore, S., Löffler, M., Nickel, S., & Nöllenburg, M. (2021). Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs. In Graph Drawing and Network Visualization. GD 2021 (pp. 304–317). Springer. https://doi.org/10.1007/978-3-030-92931-2_22
  • Layered Area-Proportional Rectangle Contact Representations / Nöllenburg, M., Villedieu, A., & Wulms, J. (2021). Layered Area-Proportional Rectangle Contact Representations. In Graph Drawing and Network Visualization. GD 2021 (pp. 318–326). Springer. https://doi.org/10.1007/978-3-030-92931-2_23
  • Mixed Metro Maps with User-Specied Motifs / Batik, T., Terziadis, S., Nöllenburg, M., Wang, Y.-S., & Wu, H.-Y. (2021). Mixed Metro Maps with User-Specied Motifs. In 29th International Symposium on Graph Drawing and Network Visualization (GD 2021) (pp. 1–4). http://hdl.handle.net/20.500.12708/55642
  • Geometric planar networks on bichromatic collinear points / Bandyapadhyay, S., Banik, A., Bhore, S., & Nöllenburg, M. (2021). Geometric planar networks on bichromatic collinear points. Theoretical Computer Science, 895, 124–136. https://doi.org/10.1016/j.tcs.2021.09.035
  • Labeling nonograms: Boundary labeling for curve arrangements / Klute, F., Löffler, M., & Nöllenburg, M. (2021). Labeling nonograms: Boundary labeling for curve arrangements. Computational Geometry, 98(101791), 101791. https://doi.org/10.1016/j.comgeo.2021.101791
  • On Strict (Outer-)Confluent Graphs / Förster, H., Ganian, R., Klute, F., & Nöllenburg, M. (2021). On Strict (Outer-)Confluent Graphs. Journal of Graph Algorithms and Applications, 25(1), 481–512. https://doi.org/10.7155/jgaa.00568
  • On the Readability of Abstract Set Visualizations / Wallinger, M., Jacobsen, B., Kobourov, S. G., & Nöllenburg, M. (2021). On the Readability of Abstract Set Visualizations. IEEE Transactions on Visualization and Computer Graphics, 27(6), 2821–2832. https://doi.org/10.1109/tvcg.2021.3074615
  • MetroSets: Visualizing Sets as Metro Maps / Jacobsen, B., Wallinger, M., Kobourov, S. G., & Nöllenburg, M. (2021). MetroSets: Visualizing Sets as Metro Maps. IEEE Transactions on Visualization and Computer Graphics, 27(2), 1257–1267. https://doi.org/10.1109/tvcg.2020.3030475
  • External Labeling: Fundamental Concepts and Algorithmic Techniques / Bekos, M. A., Niedermann, B., & Nöllenburg, M. (2021). External Labeling: Fundamental Concepts and Algorithmic Techniques. In Synthesis Lectures on Visualization (p. 130). Morgan & Claypool. https://doi.org/10.2200/s01115ed1v01y202107vis014

2020

  • Towards Data-Driven Multilinear Metro Maps / Nickel, S., & Nöllenburg, M. (2020). Towards Data-Driven Multilinear Metro Maps. In Diagrammatic Representation and Inference (pp. 153–161). LNAI. https://doi.org/10.1007/978-3-030-54249-8_12
  • Geometric Planar Networks on Bichromatic Points / Bandyapadhyay, S., Banik, A., Bhore, S., & Nöllenburg, M. (2020). Geometric Planar Networks on Bichromatic Points. In Algorithms and Discrete Applied Mathematics. CALDAM 2020, Hyderabad, India. LNCS. https://doi.org/10.1007/978-3-030-39219-2_7
  • Balanced Independent and Dominating Sets onColored Interval Graphs / Bhore, S., Haunert, J.-H., Klute, F., Li, G., & Nöllenburg, M. (2020). Balanced Independent and Dominating Sets onColored Interval Graphs. EuroCG, Utrecht, Netherlands (the). http://hdl.handle.net/20.500.12708/87063
  • Labeling Nonograms / Löffler, M., & Nöllenburg, M. (2020). Labeling Nonograms. EuroCG, Utrecht, Netherlands (the). http://hdl.handle.net/20.500.12708/87064
  • Extending Partial 1-Planar Drawings / Eiben, E., Ganian, R., Hamm, T., Klute, F., & Nöllenburg, M. (2020). Extending Partial 1-Planar Drawings. In 47th International Colloquium on Automata, Languages, and Programming (pp. 1–19). Leibniz International Proceedings in Informatics. https://doi.org/10.4230/LIPIcs.ICALP.2020.0
  • An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling / Bhore, S., Li, G., & Nöllenburg, M. (2020). An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. In 28th Annual European Symposium on Algorithms (ESA 2020) (pp. 1–24). LIPICS. https://doi.org/10.4230/LIPIcs.ESA.2020.19
  • Route schematization with landmarks / Galvão, M. D. L., Krukar, J., Nöllenburg, M., & Schwering, A. (2020). Route schematization with landmarks. Journal of Spatial Information Science, 21. https://doi.org/10.5311/josis.2020.21.589
  • Crossing Layout in Non-planar Graph Drawings / Nöllenburg, M. (2020). Crossing Layout in Non-planar Graph Drawings. In Beyond Planar Graphs (pp. 187–209). Springer, Singapore. https://doi.org/10.1007/978-981-15-6533-5_11
  • Parameterized Algorithms for Book Embedding Problems / Bhore, S., Ganian, R., Montecchiani, F., & Nöllenburg, M. (2020). Parameterized Algorithms for Book Embedding Problems. Journal of Graph Algorithms and Applications, 24(4), 603–620. https://doi.org/10.7155/jgaa.00526
  • A Survey on Transit Map Layout - from Design, Machine, and Human Perspectives / Wu, H., Niedermann, B., Takahashi, S., Roberts, M. J., & Nöllenburg, M. (2020). A Survey on Transit Map Layout - from Design, Machine, and Human Perspectives. Computer Graphics Forum, 39(3), 619–646. https://doi.org/10.1111/cgf.14030
  • Extending Nearly Complete 1-Planar Drawings in Polynomial Time / Eiben, E., Ganian, R., Hamm, T., Klute, F., & Nöllenburg, M. (2020). Extending Nearly Complete 1-Planar Drawings in Polynomial Time. In 45th International Symposium on Mathematical Foundations of Computer Science (pp. 1–16). LIPIcs. https://doi.org/10.4230/LIPIcs.MFCS.2020.31
  • Multi-level Area Balancing of Clustered Graphs / Wu, H.-Y., Nöllenburg, M., & Viola, I. (2020). Multi-level Area Balancing of Clustered Graphs. IEEE Transactions on Visualization and Computer Graphics, 28(7), 2682–2696. https://doi.org/10.1109/tvcg.2020.3038154
  • Placing Labels in Road Maps: Algorithms and Complexity / Gemsa, A., Niedermann, B., & Nöllenburg, M. (2020). Placing Labels in Road Maps: Algorithms and Complexity. Algorithmica, 82(7), 1881–1908. https://doi.org/10.1007/s00453-020-00678-7
  • A Unified Model and Algorithms for Temporal Map Labeling / Gemsa, A., Niedermann, B., & Nöllenburg, M. (2020). A Unified Model and Algorithms for Temporal Map Labeling. Algorithmica, 82(10), 2709–2736. https://doi.org/10.1007/s00453-020-00694-7
  • Mixed Labeling: Integrating Internal and External Labels / Cmolik, L., Pavlovec, V., Wu, H.-Y., & Nöllenburg, M. (2020). Mixed Labeling: Integrating Internal and External Labels. In K. Schmid (Ed.), IEEE Transactions on Visualization and Computer Graphics (pp. 1848–1861). IEEE Computer Society Press. https://doi.org/10.1109/tvcg.2020.3027368
  • Layered Fan-Planar Graph Drawings / Biedl, T., Chaplick, S., Kaufmann, M., Montecchiani, F., Nöllenburg, M., & Raftopoulou, C. (2020). Layered Fan-Planar Graph Drawings. In 45th International Symposium on Mathematical Foundations of Computer Science (pp. 1–13). LIPICS. https://doi.org/10.4230/LIPIcs.MFCS.2020.14

2019

  • Lombardi drawings of knots and links / Kindermann, P., Kobourov, S., Löffler, M., Nöllenburg, M., Schulz, A., & Vogtenhuber, B. (2019). Lombardi drawings of knots and links. Journal of Computational Geometry, 10(1), 444–476. https://doi.org/10.20382/jocg.v10i1
  • Exploring Semi-Automatic Map Labeling / Klute, F., Li, G., Löffler, R., Nöllenburg, M., & Schmidt, M. (2019). Exploring Semi-Automatic Map Labeling. In Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM SIGSPATIAL international conference on Advances in geographic information systems, Chicago, Illinois, United States of America (the). https://doi.org/10.1145/3347146.3359359
  • World map of recipes / Li, G., Nickel, S., Nöllenburg, M., Viola, I., & Wu, H.-Y. (2019). World map of recipes. Graph Drawing Contest, unknown, Unknown. http://hdl.handle.net/20.500.12708/86915
  • Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard / Chiu, M.-K., Cleve, J., & Nöllenburg, M. (2019). Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard. In Extended abstract of EuroCG 2019 (pp. 1–9). http://hdl.handle.net/20.500.12708/57989
  • Computing Stable Demers Cartograms / Nickel, S., Sondag, M., Meulemans, W., Chimani, M., Kobourov, S., Peltonen, J., & Nöllenburg, M. (2019). Computing Stable Demers Cartograms. In Graph Drawing and Network Visualization. GD 2019 (pp. 46–60). Springer. https://doi.org/10.1007/978-3-030-35802-0_4
  • External Labeling Techniques: A Taxonomy and Survey / Bekos, M. A., Niedermann, B., & Nöllenburg, M. (2019). External Labeling Techniques: A Taxonomy and Survey. Computer Graphics Forum, 38(3), 833–860. https://doi.org/10.1111/cgf.13729
  • On Strict (Outer-)Confluent Graphs / Förster, H., Ganian, R., Klute, F., & Nöllenburg, M. (2019). On Strict (Outer-)Confluent Graphs. In Graph Drawing and Network Visualization. GD 2019 (pp. 147–161). Springer. https://doi.org/10.1007/978-3-030-35802-0_12
  • Mixed Linear Layouts: Complexity, Heuristics, and Experiments / de Col, P., Klute, F., & Nöllenburg, M. (2019). Mixed Linear Layouts: Complexity, Heuristics, and Experiments. In Graph Drawing and Network Visualization. GD 2019 (pp. 460–467). Springer. https://doi.org/10.1007/978-3-030-35802-0_35
  • Maximizing Ink in Partial Edge Drawings of k-plane Graphs / Hummel, M., Klute, F., Nickel, S., & Nöllenburg, M. (2019). Maximizing Ink in Partial Edge Drawings of k-plane Graphs. In Graph Drawing and Network Visualization. GD 2019 (pp. 323–336). Springer. https://doi.org/10.1007/978-3-030-35802-0_25
  • Parameterized Algorithms for Book Embedding Problems / Bhore, S., Ganian, R., Montecchiani, F., & Nöllenburg, M. (2019). Parameterized Algorithms for Book Embedding Problems. In Graph Drawing and Network Visualization. GD 2019 (pp. 365–378). Springer. https://doi.org/10.1007/978-3-030-35802-0_28
  • Short Plane Supports for Spatial Hypergraphs / Castermans, T., van Garderen, M., Meulemans, W., Nöllenburg, M., & Yuan, X. (2019). Short Plane Supports for Spatial Hypergraphs. Journal of Graph Algorithms and Applications, 23(3), 463–498. https://doi.org/10.7155/jgaa.00499
  • Minimizing Crossings In Constrained Two-Sided Circular Graph Layouts / Klute, F., & Nöllenburg, M. (2019). Minimizing Crossings In Constrained Two-Sided Circular Graph Layouts. Journal of Computational Geometry, 10(2), 45–69. https://doi.org/10.20382/jocg.v10i2
  • Guidelines for Experimental Algorithmics: A Case Study in Network Analysis / Angriman, E., Grinten, A. van der, Looz, M. von, Meyerhenke, H., Nöllenburg, M., Predari, M., & Tzovas, C. (2019). Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. Algorithms, 12(7), 127. https://doi.org/10.3390/a12070127
  • Planar drawings of fixed-mobile bigraphs / Bekos, M. A., De Luca, F., Didimo, W., Mchedlidze, T., Nöllenburg, M., Symvonis, A., & Tollis, I. (2019). Planar drawings of fixed-mobile bigraphs. Theoretical Computer Science, 795, 408–419. https://doi.org/10.1016/j.tcs.2019.07.025
  • Metabopolis: scalable network layout for biological pathway diagrams in urban map style / Wu, H.-Y., Nöllenburg, M., Sousa, F. L., & Viola, I. (2019). Metabopolis: scalable network layout for biological pathway diagrams in urban map style. BMC Bioinformatics, 20(187). https://doi.org/10.1186/s12859-019-2779-4
  • Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses / Nesic, A., Blaicher, M., Hoose, T., Hofmann, A., Lauermann, M., Kutuvantavida, Y., Nöllenburg, M., Randel, S., Freude, W., & Koos, C. (2019). Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses. Optics Express, 27(12), 17402. https://doi.org/10.1364/oe.27.017402
  • On the readability of leaders in boundary labeling / Barth, L., Gemsa, A., Niedermann, B., & Nöllenburg, M. (2019). On the readability of leaders in boundary labeling. Information Visualization, 18(1), 110–132. https://doi.org/10.1177/1473871618799500
  • A Survey on Computing Schematic Network Maps: The Challenge to Interactivity / Wu, H.-Y., Niedermann, B., Takahashi, S., & Nöllenburg, M. (2019). A Survey on Computing Schematic Network Maps: The Challenge to Interactivity. 2nd Schematic Mapping Workshop, TU Wien, Vienna, Austria. http://hdl.handle.net/20.500.12708/86926

2018

  • Planar and poly-arc Lombardi drawings / Duncan, C. A., Eppstein, D., Goodrich, M. T., Kobourov, S. G., Löffler, M., & Nöllenburg, M. (2018). Planar and poly-arc Lombardi drawings. Journal of Computational Geometry (JOCG), 9(1), 328–355. https://doi.org/10.20382/jocg.v9i1a11
  • Planar L-Drawings of Directed Graphs / Chaplick, S., Chimani, M., Cornelsen, S., Da Lozzo, G., Nöllenburg, M., Patrignani, M., Tollis, I. G., & Wolff, A. (2018). Planar L-Drawings of Directed Graphs. In F. Frati & K.-L. Ma (Eds.), Graph Drawing and Network Visualization. GD 2018 (pp. 465–478). Springer. https://doi.org/10.1007/978-3-319-73915-1_36
  • Graph Visualization / Hu, Y., & Nöllenburg, M. (2018). Graph Visualization. In S. Sakr & A. Y. Zomaya (Eds.), Encyclopedia of Big Data Technologies (pp. 1–9). Springer International Publishing. https://doi.org/10.1007/978-3-319-63962-8_324-1
  • Minimizing Wiggles in Storyline Visualizations / Fröschl, T., & Nöllenburg, M. (2018). Minimizing Wiggles in Storyline Visualizations. In F. Frati & K.-L. Ma (Eds.), Graph Drawing and Network Visualization. GD 2017 (pp. 585–587). Springer. http://hdl.handle.net/20.500.12708/57516
  • Towards Characterizing Strict Outerconfluent Graphs / Klute, F., & Nöllenburg, M. (2018). Towards Characterizing Strict Outerconfluent Graphs. In F. Frati & K.-L. Ma (Eds.), Graph Drawing and Network Visualization. GD 2017 (pp. 612–614). Springer. http://hdl.handle.net/20.500.12708/57517
  • Short Plane Supports for Spatial Hypergraphs / Castermans, T., van Garderen, M., Meulemans, W., Nöllenburg, M., & Yuan, X. (2018). Short Plane Supports for Spatial Hypergraphs. In T. Biedl & A. Kerren (Eds.), Graph Drawing and Network Visualization. GD 2018 (pp. 53–66). Springer. https://doi.org/10.1007/978-3-030-04414-5_4
  • Planar Drawings of Fixed-Mobile Bigraphs / Bekos, M. A., De Luca, F., Didimo, W., Mchedlidze, T., Nöllenburg, M., Symvonis, A., & Tollis, I. G. (2018). Planar Drawings of Fixed-Mobile Bigraphs. In F. Frati & K.-L. Ma (Eds.), Graph Drawing and Network Visualization. GD 2018 (pp. 426–439). Springer. https://doi.org/10.1007/978-3-319-73915-1_33
  • Lombardi Drawings of Knots and Links / Kindermann, P., Kobourov, S., Löffler, M., Nöllenburg, M., Schulz, A., & Vogtenhuber, B. (2018). Lombardi Drawings of Knots and Links. In F. Frati & K.-L. Ma (Eds.), Graph Drawing and Network Visualization. GD 2018 (pp. 113–126). Springer. https://doi.org/10.1007/978-3-319-73915-1_10
  • Experimental Evaluation of Book Drawing Algorithms / Klawitter, J., Mchedlidze, T., & Nöllenburg, M. (2018). Experimental Evaluation of Book Drawing Algorithms. In F. Frati & K.-L. Ma (Eds.), Graph Drawing and Network Visualization. GD 2018 (pp. 224–238). Springer. https://doi.org/10.1007/978-3-319-73915-1_19
  • Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity / Argyriou, E., Cornelsen, S., Förster, H., Kaufmann, M., Nöllenburg, M., Okamoto, Y., Raftopoulou, C., & Wolff, A. (2018). Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. In T. Biedl & A. Kerren (Eds.), Graph Drawing and Network Visualization. GD 2018 (pp. 509–523). Springer. https://doi.org/10.1007/978-3-030-04414-5_36
  • Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts / Klute, F., & Nöllenburg, M. (2018). Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. In B. Speckmann & C. D. Tóth (Eds.), 34th International Symposium on Computational Geometry (pp. 53:1-53:14). LIPICS, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.SoCG.2018.53
  • Drawing Large Graphs by Multilevel Maxent-Stress Optimization / Meyerhenke, H., Nöllenburg, M., & Schulz, C. (2018). Drawing Large Graphs by Multilevel Maxent-Stress Optimization. IEEE Transactions on Visualization and Computer Graphics, 24(5), 1814–1827. https://doi.org/10.1109/tvcg.2017.2689016
  • Maximizing Ink in Symmetric Partial Edge Drawings of k-plane Graphs / Höller, M., Klute, F., Nickel, S., Nöllenburg, M., & Schreiber, B. (2018). Maximizing Ink in Symmetric Partial Edge Drawings of k-plane Graphs. European Workshop on Computational Geometry (EuroCG’18), Berlin, EU. http://hdl.handle.net/20.500.12708/86882
  • Scalable Set Visualizations (Dagstuhl Seminar 17332) / Hu, Y., Micallef, L., Nöllenburg, M., & Rodgers, P. (Eds.). (2018). Scalable Set Visualizations (Dagstuhl Seminar 17332). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. https://doi.org/10.4230/DagRep.7.8.1
  • The Travel of a Metabolite / Wu, H.-Y., Nöllenburg, M., & Viola, I. (2018). The Travel of a Metabolite. In Proceedings of PacificVis 2018 Data Story Telling Contest. IEEE Pacific Visualization Symposium (PacificVis), Yokohama, Non-EU. http://hdl.handle.net/20.500.12708/57386
  • A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways / Wu, H.-Y., Viola, I., & Nöllenburg, M. (2018). A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways. In Proceedings of EuroVis 2018. Eurographics Conference on Visualization (EuroVis 2018), Brno, Czech Republic, EU. Eurographics / VGTC. http://hdl.handle.net/20.500.12708/57354

2017

  • Euclidean Greedy Drawings of Trees / Nöllenburg, M., & Prutkin, R. (2017). Euclidean Greedy Drawings of Trees. Discrete and Computational Geometry, 58(3), 543–579. https://doi.org/10.1007/s00454-017-9913-8
  • Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd / Gadiraju, U., Möller, S., Nöllenburg, M., Saupe, D., Egger-Lampl, S., Archambault, D., & Fisher, B. (2017). Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd. In D. Archambault, H. Purchase, & T. Hossfeld (Eds.), Evaluation in the Crowd. Crowdsourcing and Human-Centered Experiments (pp. 6–26). Springer International Publishing. https://doi.org/10.1007/978-3-319-66435-4_2
  • Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions / Nöllenburg, M., Prutkin, R., & Rutter, I. (2017). Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. International Journal of Computational Geometry and Applications, 27(01n02), 121–158. https://doi.org/10.1142/s0218195917600068
  • Progress on Partial Edge Drawings / Bruckdorfer, T., Cornelsen, S., Gutwenger, C., Kaufmann, M., Montecchiani, F., Nöllenburg, M., & Wolff, A. (2017). Progress on Partial Edge Drawings. Journal of Graph Algorithms and Applications, 21(4), 757–786. https://doi.org/10.7155/jgaa.00438
  • Minimizing crossings in constrained two-sided circular graph layouts / Klute, F., & Nöllenburg, M. (2017). Minimizing crossings in constrained two-sided circular graph layouts. EuroCG17, Schweden, EU. http://hdl.handle.net/20.500.12708/86553
  • Radial contour labeling with straight leaders / Nöllenburg, M., Niedermann, B., & Rutter, I. (2017). Radial contour labeling with straight leaders. In 2017 IEEE Pacific Visualization Symposium (PacificVis). IEEE. https://doi.org/10.1109/pacificvis.2017.8031608

2016

  • Adjacency-preserving spatial treemaps / Buchin, K., Eppstein, D., Löffler, M., Nöllenburg, M., & Silveira, R. I. (2016). Adjacency-preserving spatial treemaps. Journal of Computational Geometry, 7(1), 100–122. https://doi.org/10.20382/jocg.v7i1a6
  • Consistent labeling of rotating maps / Gemsa, A., Nöllenburg, M., & Rutter, I. (2016). Consistent labeling of rotating maps. Journal of Computational Geometry, 7(1), 308–331. https://doi.org/10.20382/jocg.v7i1a15
  • Graph Drawing and Network Visualization / Hu, Y., & Nöllenburg, M. (Eds.). (2016). Graph Drawing and Network Visualization (Vol. 9801). Springer. https://doi.org/10.1007/978-3-319-50106-2
  • Robust Genealogy Drawings / Klute, F. (2016). Robust Genealogy Drawings. In Y. Hu & M. Nöllenburg (Eds.), Graph Drawing and Network Visualization. GD 2016 (pp. 637–639). Springer. http://hdl.handle.net/20.500.12708/55449
  • Extending Convex Partial Drawings of Graphs / Mchedlidze, T., Nöllenburg, M., & Rutter, I. (2016). Extending Convex Partial Drawings of Graphs. Algorithmica, 76(1), 47–67. https://doi.org/10.1007/s00453-015-0018-6
  • On Self-Approaching And Increasing-Chord Drawings Of 3-Connected Planar Graphs / Nöllenburg, M., Prutkin, R., & Rutter, I. (2016). On Self-Approaching And Increasing-Chord Drawings Of 3-Connected Planar Graphs. Journal of Computational Geometry, 7(1), 47–69. http://hdl.handle.net/20.500.12708/148588
  • Strict Confluent Drawing / Eppstein, D., Holten, D., Löffler, M., Nöllenburg, M., Speckmann, B., & Verbeek, K. (2016). Strict Confluent Drawing. Journal of Computational Geometry, 7(1), 22–46. http://hdl.handle.net/20.500.12708/148586
  • Evaluation of Labeling Strategies for Rotating Maps / Gemsa, A., Nöllenburg, M., & Rutter, I. (2016). Evaluation of Labeling Strategies for Rotating Maps. ACM Journal on Experimental Algorithmics, 21, 1–21. https://doi.org/10.1145/2851493
  • Mixed map labeling / Löffler, M., Nöllenburg, M., & Staals, F. (2016). Mixed map labeling. Journal of Spatial Information Science, 13. https://doi.org/10.5311/josis.2016.13.264
  • Temporal map labeling / Barth, L., Niedermann, B., Nöllenburg, M., & Strash, D. (2016). Temporal map labeling. In Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. Acm Dl, Austria. ACM. https://doi.org/10.1145/2996913.2996957
  • Software Visualization via Hierarchic Micro/Macro Layouts / Nöllenburg, M., Rutter, I., & Schuhmacher, A. (2016). Software Visualization via Hierarchic Micro/Macro Layouts. In Information Visualization Theory and Applications Conf IVAPP 2016 (pp. 153–160). http://hdl.handle.net/20.500.12708/56855
  • An Algorithmic Framework for Labeling Road Maps / Niedermann, B., & Nöllenburg, M. (2016). An Algorithmic Framework for Labeling Road Maps. In Geographic Information Science 9th International Conference (pp. 308–322). http://hdl.handle.net/20.500.12708/56797

2015

  • On Minimizing Crossings in Storyline Visualizations / Nöllenburg, M., Kostitsyna, I., Polishchuk, V., Schulz, A., & Strash, D. (2015). On Minimizing Crossings in Storyline Visualizations. In E. Di Giacomo & A. Lubiw (Eds.), Graph Drawing and Network Visualization 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers (pp. 192–198). Springer. https://doi.org/10.1007/978-3-319-27261-0_16
  • Drawing Large Graphs by Multilevel Maxent-Stress Optimization / Nöllenburg, M., Meyerhenke, H., & Schulz, C. (2015). Drawing Large Graphs by Multilevel Maxent-Stress Optimization. In Graph Drawing and Network Visualization 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers (pp. 30–43). Springer. https://doi.org/10.1007/978-3-319-27261-0_3
  • Recognizing Weighted Disk Contact Graphs / Klemz, B., Nöllenburg, M., & Prutkin, R. (2015). Recognizing Weighted Disk Contact Graphs. In E. Di Giacomo & A. Lubiw (Eds.), Graph Drawing and Network Visualization (pp. 433–446). Springer. https://doi.org/10.1007/978-3-319-27261-0_36
  • On the Readability of Boundary Labeling / Barth, L., Gemsa, A., Niedermann, B., & Nöllenburg, M. (2015). On the Readability of Boundary Labeling. In E. Di Giacomo & A. Lubiw (Eds.), Graph Drawing and Network Visualization (pp. 515–527). Springer. https://doi.org/10.1007/978-3-319-27261-0_42
  • Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions / Nöllenburg, M., Prutkin, R., & Rutter, I. (2015). Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. In K. Elbassioni & K. Makino (Eds.), Algorithms and Computation (pp. 637–649). LNCS. https://doi.org/10.1007/978-3-662-48971-0_54
  • Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem / Nöllenburg, M., Klawitter, J., & Ueckerdt, T. (2015). Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. In E. Di Giacomo & A. Lubiw (Eds.), Graph Drawing and Network Visualization (GD’15) (pp. 231–244). Springer. http://hdl.handle.net/20.500.12708/56342