Publications: Martin Nöllenburg

⬅️ Zurück zum Profil

2026

• Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time Bhore, Sujoy, Nöllenburg, Martin, Tóth, Csaba D., Wulms, Jules. Discrete and Computational Geometry
  📄 Details

• The Peculiarities of Extending Queue Layouts Depian, Thomas, Fink, Simon D., Ganian, Robert, Nöllenburg, Martin. Graph-Theoretic Concepts in Computer Science (WG'25)
  📄 Details

• Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchies Dobler, Alexander, Le Thanh, Son, Nöllenburg, Martin, Weinkauf, Tino. Pacific Visualization Symposium (PacificVis'26)
  📄 Details

• Block Crossings in One-Sided Tanglegrams Dobler, Alexander, Nöllenburg, Martin. Algorithmica
  📄 Details

• $F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness Piselli, Tommaso, Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Di Bartolomeo, Sara. IEEE Trans. Vis. Comput. Graph.
  📄 Details

• Clarity and Computational Efficiency of Orbital Boundary Labeling Wallinger, Markus, Bonerath, Annika, Terziadis, Soeren, Wulms, Jules, Nöllenburg, Martin. Pacific Visualization Symposium (PacificVis'26)
  📄 Details

2025

• Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms Caroppo, Susanna, Da Lozzo, Giordano, Di Battista, Giuseppe, Goodrich, Michael, Nöllenburg, Martin. Algorithms and Data Structures (WADS'25)
  📄 Details

• Visualizing Treewidth Chiu, Alvin, Depian, Thomas, Eppstein, David, Goodrich, Michael T., Nöllenburg, Martin. Graph Drawing and Network Visualization (GD'25)
  📄 Details

• Pathways to Tractability for Geometric Thickness Depian, Thomas, Fink, Simon D., Firbas, Alexander, Ganian, Robert, Nöllenburg, Martin. Theory and Practice of Computer Science (SOFSEM'25)
  📄 Details

• The Peculiarities of Extending Queue Layouts Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg. Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025
  📄 Details

• Partial Level Planarity Parameterized by the Size of the Missing Graph Depian, Thomas, Fink, Simon D., Klemz, Boris, Ganian, Robert, Nöllenburg, Martin, Sieper, Marie Diana. European Workshop on Computational Geometry (EuroCG'25)
  📄 Details

• Geometry Matters in Planar Storyplans Dobler, Alexander, Holzmüller, Maximilian, Nöllenburg, Martin. Graph Drawing and Network Visualization (GD'25)
  📄 Details

• On Planar Unit-Length Linear Linkages in Polygonal Domains Depian, Thomas, Haase, Carolina, Nöllenburg, Martin, Schulz, André. European Workshop on Computational Geometry (EuroCG'25)
  📄 Details

• Optimizing Wiggle in Storylines Dobler, Alexander, Hegemann, Tim, Nöllenburg, Martin, Wolff, Alexander. Graph Drawing and Network Visualization (GD'25)
  📄 Details

• Representing Hypergraphs by Point-Line Incidences Dobler, Alexander, Kobourov, Stephen G., Mondal, Debajyoti, Nöllenburg, Martin. Theory and Practice of Computer Science (SOFSEM'25)
  📄 Details

• Transitions in Dynamic Point Labeling Depian, Thomas, Li, Guangping, Nöllenburg, Martin, Wulms, Jules. Cartography and Geographic Information Science
  📄 Details

• On Minimizing Wiggle in Stacked Area Charts Dobler, Alexander, Nöllenburg, Martin. Algorithms and Data Structures (WADS'25)
  📄 Details

• Constrained Boundary Labeling Depian, Thomas, Nöllenburg, Martin, Terziadis, Soeren, Wallinger, Markus. Comput. Geom. Theory Appl.
  📄 Details

• Optimizing Staircase Motifs in Biofabric Network Layouts Di Bartolomeo, Sara, Wallinger, Markus, Nöllenburg, Martin. Comput. Graph. Forum
  📄 Details

• An Introduction to and Survey of Biological Network Visualization Ehlers, Henry, Brich, Nicolas, Yu, Jiacheng, Krone, Michael, Nöllenburg, Martin, Natsukawa, Hiroaki, Yuan, Xiaoru, Wu, Hsiang-Yun. Computers & Graphics
  📄 Details

• Introducing Fairness in Network Visualization Eades, Peter, Hong, Seok-Hee, Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Piselli, Tommaso, Wismath, Stephen. Information Sciences
  📄 Details

• Planarizing Graphs and their Drawings by Vertex Splitting Nöllenburg, Martin, Sorge, Manuel, Terziadis, Soeren, Villedieu, Anaïs, Wu, Hsiang-Yun, Wulms, Jules. J. Computational Geometry
  📄 Details

• Passenger Decision-Making in Mass Transit Systems: Insights From Dual-Process Theories Prabhakar, Archana, Grison, Elise, Morgagni, Simone, Nöllenburg, Martin, Gyselinck, Valérie. Applied Cognitive Psychology
  📄 Details

• F2Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness Tommaso Piselli, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Di Bartolomeo, Sara.
  📄 Details

• Bundling-Aware Graph Drawing Revisited Wallinger, Markus, Piselli, Tommaso, Tappini, Alessandra, Archambault, Daniel, Liotta, Giuseppe, Nöllenburg, Martin. IEEE Trans. Vis. Comput. Graph.
  📄 Details

2024

• Bundling-Aware Graph Drawing Archambault, Daniel, Liotta, Giuseppe, Nöllenburg, Martin, Piselli, Tommaso, Tappini, Alessandra, Wallinger, Markus. Graph Drawing and Network Visualization (GD'24)
  📄 Details

• On the Complexity of the Storyplan Problem Binucci, Carla, Di Giacomo, Emilio, Lenhart, William J., Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Symvonis, Antonios. J. Computer and Systems Sciences
  📄 Details

• Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable Bhore, Sujoy, Ganian, Robert, Khazaliya, Liana, Montecchiani, Fabrizio, Nöllenburg, Martin. J. Computational Geometry
  📄 Details

• Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time Bhore, Sujoy, Nöllenburg, Martin, Tóth, Csaba D., Wulms, Jules. Computational Geometry (SoCG'24)
  📄 Details

• Boundary Labeling in a Circular Orbit Bonerath, Annika, Nöllenburg, Martin, Terziadis, Soeren, Wallinger, Markus, Wulms, Jules. Graph Drawing and Network Visualization (GD'24)
  📄 Details

• Uncertainty in Humanities Network Visualization Melanie Conroy, Christina Gillmann, Francis Harvey, Tamara Mchedlidze, Sara Irina Fabrikant, Florian Windhager, Gerik Scheuermann, Timothy R. Tangherlini, Christopher N. Warren, Scott B. Weingart, Malte Rehbein, Katy Börner, Kimmo Elo, Stefan Jänicke, Andreas Kerren, Martin Nöllenburg, Tim Dwyer, Øyvind Eide, Stephen Kobourov, Gregor Betz. Frontiers in Communication
  📄 Details

• The Parameterized Complexity of Extending Stack Layouts Depian, Thomas, Fink, Simon D., Ganian, Robert, Nöllenburg, Martin. 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, September 18-20, 2024, Vienna, Austria
  📄 Details

• Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings Dobler, Alexander, Jünger, Michael, Jünger, Paul J., Meffert, Julian, Mutzel, Petra, Nöllenburg, Martin. Graph Drawing and Network Visualization (GD'24)
  📄 Details

• Improving Temporal Treemaps by Minimizing Crossings Dobler, Alexander, Nöllenburg, Martin. Comput. Graph. Forum
  📄 Details

• Constrained Boundary Labeling Depian, Thomas, Nöllenburg, Martin, Terziadis, Soeren, Wallinger, Markus. Algorithms and Computation (ISAAC'24)
  📄 Details

• Minimizing Switches in Cased Graph Drawings Ganian, Robert, Nöllenburg, Martin, Röder, Sebastian. Graph Drawing and Network Visualization (GD'24)
  📄 Details

• Splitting Plane Graphs to Outerplanarity Gronemann, Martin, Nöllenburg, Martin, Villedieu, Anaïs. J. Graph Algorithms Appl.
  📄 Details

• Introducing Fairness in Graph Visualization Hong, Seok-Hee, Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Piselli, Tommaso. Graph Drawing and Network Visualization (GD'24)
  📄 Details

• Introducing Fairness in Graph Visualization via Gradient Descent Montecchiani, Fabrizio, Liotta, Giuseppe, Nöllenburg, Martin, Hong, Seok-Hee, Piselli, Tommaso. Machine Learning Methods in Visualisation for Big Data (MLVis'24)
  📄 Details

• Visualizing Extensions of Argumentation Frameworks as Layered Graphs Nöllenburg, Martin, Pirker, Christian, Rapberger, Anna, Woltran, Stefan, Wulms, Jules. CoRR
  📄 Details

• GdMetriX - A NetworkX Extension For Graph Drawing Metrics Nöllenburg, Martin, Röder, Sebastian, Wallinger, Markus. Graph Drawing and Network Visualization (GD'24)
  📄 Details

• Computing Data-driven Multilinear Metro Maps Nöllenburg, Martin, Terziadis, Soeren. The Cartographic Journal
  📄 Details

• Computing Hive Plots: A Combinatorial Framework Nöllenburg, Martin, Wallinger, Markus. J. Graph Algorithms Appl.
  📄 Details

• Hoop Diagrams: A Set Visualization Method Rodgers, Peter, Chapman, Peter, Blake, Andrew, Nöllenburg, Martin, Wallinger, Markus, Dobler, Alexander. Diagrammatic Representation and Inference (DIAGRAMS'24)
  📄 Details

2023

• Splitting Vertices in 2-Layer Graph Drawings Ahmed, Reyan, Angelini, Patrizio, Bekos, Michael A., Di Battista, Giuseppe, Kaufmann, Michael, Kindermann, Philipp, Kobourov, Stephen, Nöllenburg, Martin, Symvonis, Antonios, Villedieu, Anaïs, Wallinger, Markus. IEEE Computer Graphics and Applications
  📄 Details

• On the Complexity of the Storyplan Problem Binucci, Carla, Di Giacomo, Emilio, Lenhart, William J., Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Symvonis, Antonios. Graph Drawing and Network Visualization (GD'22)
  📄 Details

• On the Upward Book Thickness Problem: Combinatorial and Complexity Results Bhore, Sujoy, Da Lozzo, Giordano, Montecchiani, Fabrizio, Nöllenburg, Martin. European J. Combinatorics
  📄 Details

• Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable Bhore, Sujoy, Ganian, Robert, Khazaliya, Liana, Montecchiani, Fabrizio, Nöllenburg, Martin. 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA
  📄 Details

• Worbel: Aggregating Point Labels into Word Clouds Bhore, Sujoy, Ganian, Robert, Li, Guangping, Nöllenburg, Martin, Wulms, Jules. ACM Trans. Spatial Algorithms and Systems
  📄 Details

• Untangling Circular Drawings: Algorithms and Complexity Bhore, Sujoy, Li, Guangping, Nöllenburg, Martin, Rutter, Ignaz, Wu, Hsiang-Yun. Comput. Geom. Theory Appl.
  📄 Details

• Transitions in Dynamic Point Labeling Depian, Thomas, Li, Guangping, Nöllenburg, Martin, Wulms, Jules. Geographic Information Science (GIScience'23)
  📄 Details

• Block Crossings in One-Sided Tanglegrams Dobler, Alexander, Nöllenburg, Martin. Algorithms and Data Structures (WADS'23)
  📄 Details

• Crossing Minimization in Time Interval Storylines Dobler, Alexander, Nöllenburg, Martin, Stojanovic, Daniel, Villedieu, Anaïs, Wulms, Jules. European Workshop on Computational Geometry (EuroCG'23)
  📄 Details

• New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162) Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin, Zehavi, Meirav, Khazaliya, Liana. Dagstuhl Reports
  📄 Details

• Splitting Plane Graphs to Outerplanarity Gronemann, Martin, Nöllenburg, Martin, Villedieu, Anaïs. Algorithms and Computation (WALCOM'23)
  📄 Details

• MySemCloud: Semantic-aware Word Cloud Editing Huber, Michael, Nöllenburg, Martin, Villedieu, Anaïs. Pacific Visualization Symposium (PacificVis'23)
  📄 Details

• On Families of Planar DAGs with Constant Stack Number Nöllenburg, Martin, Pupyrev, Sergey. Graph Drawing and Network Visualization (GD'23)
  📄 Details

• Planarizing Graphs and their Drawings by Vertex Splitting Nöllenburg, Martin, Sorge, Manuel, Terziadis, Soeren, Villedieu, Anaïs, Wu, Hsiang-Yun, Wulms, Jules. Graph Drawing and Network Visualization (GD'22)
  📄 Details

• Computing Hive Plots: A Combinatorial Framework Nöllenburg, Martin, Wallinger, Markus. Graph Drawing and Network Visualization (GD'23)
  📄 Details

• MosaicSets: Embedding Set Systems into Grid Graphs Rottmann, Peter, Wallinger, Markus, Bonerath, Annika, Gedicke, Sven, Nöllenburg, Martin, Haunert, Jan-Henrik. IEEE Trans. Visualization and Computer Graphics
  📄 Details

• Faster Edge-Path Bundling Through Graph Spanners Wallinger, Markus, Archambault, Daniel, Auber, David, Nöllenburg, Martin, Peltonen, Jaakko. Computer Graphics Forum
  📄 Details

• LinSets.zip: Compressing Linear Set Diagrams Wallinger, Markus, Dobler, Alexander, Nöllenburg, Martin. IEEE Trans. Visualization and Computer Graphics
  📄 Details

2022

• Parameterized Algorithms for Queue Layouts Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin. J. Graph Algorithms Appl.
  📄 Details

• Minimum Link Fencing Bhore, Sujoy, Klute, Fabian, Löffler, Maarten, Nöllenburg, Martin, Terziadis, Soeren, Villedieu, Anaïs. Algorithms and Computation (ISAAC'22)
  📄 Details

• An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling Bhore, Sujoy, Li, Guangping, Nöllenburg, Martin. ACM J. Experimental Algorithmics
  📄 Details

• Shape-Guided Mixed Metro Map Layout Batik, Tobias, Terziadis, Soeren, Wang, Yu-Shuen, Nöllenburg, Martin, Wu, Hsiang-Yun. Computer Graphics Forum
  📄 Details

• Multidimensional Manhattan Preferences Chen, Jiehua, Nöllenburg, Martin, Simola, Sofia, Villedieu, Anaïs, Wallinger, Markus. Theoretical Informatics (LATIN'22)
  📄 Details

• Mixed Labeling: Integrating Internal and External Labels Čmolík, Ladislav, Pavlovec, Václav, Wu, Hsiang-Yun, Nöllenburg, Martin. IEEE Trans. Visualization and Computer Graphics
  📄 Details

• On Computing Optimal Linear Diagrams Dobler, Alexander, Nöllenburg, Martin. Diagrammatic Representation and Inference (DIAGRAMS'22)
  📄 Details

• Recognizing Weighted and Seeded Disk Graphs Klemz, Boris, Nöllenburg, Martin, Prutkin, Roman. J. Computational Geometry
  📄 Details

• Multicriteria Optimization for Dynamic Demers Cartograms Nickel, Soeren, Sondag, Max, Meulemans, Wouter, Kobourov, Stephen, Peltonen, Jaakko, Nöllenburg, Martin. IEEE Trans. Visualization and Computer Graphics
  📄 Details

• Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach Wallinger, Markus, Archambault, Daniel, Auber, David, Nöllenburg, Martin, Peltonen, Jaakko. IEEE Trans. Visualization and Computer Graphics
  📄 Details

• Multi-level Area Balancing of Clustered Graphs Wu, Hsiang-Yun, Nöllenburg, Martin, Viola, Ivan. IEEE Trans. Visualization and Computer Graphics
  📄 Details

2021

• Geometric Planar Networks on Bichromatic Collinear Points Bandyapadhyay, Sayan, Banik, Aritra, Bhore, Sujoy, Nöllenburg, Martin. Theoretical Computer Science
  📄 Details

• On the Upward Book Thickness Problem: Combinatorial and Complexity Results Bhore, Sujoy, Da Lozzo, Giordano, Montecchiani, Fabrizio, Nöllenburg, Martin. Graph Drawing and Network Visualization (GD'21)
  📄 Details

• Worbel: Aggregating Point Labels into Word Clouds Bhore, Sujoy, Ganian, Robert, Li, Guangping, Nöllenburg, Martin, Wulms, Jules. Proceedings of the International Conference on Advances in Geographic Information Systems 2021 (ACM SIGSPATIAL 2021)
  📄 Details

• Balanced Independent and Dominating Sets on Colored Interval Graphs Bhore, Sujoy, Haunert, Jan-Henrik, Klute, Fabian, Li, Guangping, Nöllenburg, Martin. Theory and Practice of Computer Science (SOFSEM'21)
  📄 Details

• Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs Bhore, Sujoy, Löffler, Maarten, Nickel, Soeren, Nöllenburg, Martin. Graph Drawing and Network Visualization (GD'21)
  📄 Details

• Untangling Circular Drawings: Algorithms and Complexity Bhore, Sujoy, Li, Guangping, Nöllenburg, Martin, Rutter, Ignaz, Wu, Hsiang-Yun. Algorithms and Computation (ISAAC'21)
  📄 Details

• Disjoint Box Covering in a Rectilinear Polygon Bhore, Sujoy, Li, Guangping, Nöllenburg, Martin, Wulms, Jules. European Workshop on Computational Geometry (EuroCG'21)
  📄 Details

• External Labeling: Fundamental Concepts and Algorithmic Techniques Bekos, Michael A., Niedermann, Benjamin, Nöllenburg, Martin.
  📄 Details

• On Strict (Outer-)Confluent Graphs Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg. J. Graph Algorithms Appl.
  📄 Details

• ClusterSets: Optimizing Planar Clusters in Categorical Point Data Geiger, Jakob, Cornelsen, Sabine, Haunert, Jan-Henrik, Kindermann, Philipp, Mchedlidze, Tamara, Nöllenburg, Martin, Okamoto, Yoshio, Wolff, Alexander. Computer Graphics Forum
  📄 Details

• Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin, Zehavi, Meirav. Dagstuhl Reports
  📄 Details

• MetroSets: Visualizing Sets as Metro Maps Jacobsen, Ben, Wallinger, Markus, Kobourov, Stephen, Nöllenburg, Martin. IEEE Trans. Visualization and Computer Graphics
  📄 Details

• Labeling Nonograms: Boundary Labeling for Curve Arrangements Klute, Fabian, Löffler, Maarten, Nöllenburg, Martin. Comput. Geom. Theory Appl.
  📄 Details

• Layered Area-Proportional Rectangle Contact Representation Nöllenburg, Martin, Villedieu, Anaïs, Wulms, Jules. Graph Drawing and Network Visualization (GD'21)
  📄 Details

• On the Readability of Abstract Set Visualizations Wallinger, Markus, Jacobsen, Ben, Kobourov, Stephen, Nöllenburg, Martin. IEEE Trans. Visualization and Computer Graphics
  📄 Details

2020

• Geometric Planar Networks on Bichromatic Points Bandyapadhyay, Sayan, Banik, Aritra, Bhore, Sujoy, Nöllenburg, Martin. Algorithms and Discrete Applied Mathematics (CALDAM'20)
  📄 Details

• Layered Fan-Planar Graph Drawings Biedl, Therese, Chaplick, Steven, Kaufmann, Michael, Montecchiani, Fabrizio, Nöllenburg, Martin, Raftopoulou, Chrysanthi. Mathematical Foundations of Computer Science (MFCS'20)
  📄 Details

• Parameterized Algorithms for Book Embedding Problems Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin. J. Graph Algorithms Appl.
  📄 Details

• Parameterized Algorithms for Queue Layouts Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin. Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers
  📄 Details

• Balanced Independent and Dominating Sets on Colored Interval Graphs Bhore, Sujoy, Haunert, Jan-Henrik, Klute, Fabian, Li, Guangping, Nöllenburg, Martin. European Workshop on Computational Geometry (EuroCG'20)
  📄 Details

• An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling Bhore, Sujoy, Li, Guangping, Nöllenburg, Martin. Algorithms (ESA'20)
  📄 Details

• Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eiben, Eduard, Ganian, Robert, Hamm, Thekla, Klute, Fabian, Nöllenburg, Martin. 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic
  📄 Details

• Extending Partial 1-Planar Drawings Eiben, Eduard, Ganian, Robert, Hamm, Thekla, Klute, Fabian, Nöllenburg, Martin. 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)
  📄 Details

• Route Schematization with Landmarks Galvão, Marcelo, Krukar, Jakub, Nöllenburg, Martin, Schwering, Angela. J. Spatial Information Science
  📄 Details

• Placing Labels in Road Maps: Algorithms and Complexity Gemsa, Andreas, Niedermann, Benjamin, Nöllenburg, Martin. Algorithmica
  📄 Details

• A Unified Model and Algorithms for Temporal Map Labeling Gemsa, Andreas, Niedermann, Benjamin, Nöllenburg, Martin. Algorithmica
  📄 Details

• Labeling Nonograms Löffler, Maarten, Nöllenburg, Martin. European Workshop on Computational Geometry (EuroCG'20)
  📄 Details

• Crossing Layout in Non-planar Graphs Nöllenburg, Martin. Beyond Planar Graphs
  📄 Details

• Towards Data-Driven Multilinear Metro Maps Nickel, Soeren, Nöllenburg, Martin. Diagrammatic Representation and Inference (DIAGRAMS'20)
  📄 Details

• The Turing Test for Graph Drawing Algorithms Purchase, Helen C., Archambault, Daniel, Kobourov, Stephen, Nöllenburg, Martin, Pupyrev, Sergey, Wu, Hsiang-Yun. Graph Drawing and Network Visualization (GD'20)
  📄 Details

• A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives Wu, Hsiang-Yun, Niedermann, Benjamin, Takahashi, Shigeo, Roberts, Maxwell J., Nöllenburg, Martin. Computer Graphics Forum
  📄 Details

2019

• Guidelines for Experimental Algorithmics: A Case Study in Network Analysis Eugenio Angriman, van der Grinten, Alexander, von Looz, Moritz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas. Algorithms
  📄 Details

• Planar Drawings of Fixed-Mobile Bigraphs Bekos, Michael A., De Luca, Felice, Didimo, Walter, Mchedlidze, Tamara, Nöllenburg, Martin, Symvonis, Antonios, Tollis, Ioannis. Theoretical Computer Science
  📄 Details

• Parameterized Algorithms for Book Embedding Problems Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin. Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings
  📄 Details

• External Labeling Techniques: A Taxonomy and Survey Bekos, Michael A., Niedermann, Benjamin, Nöllenburg, Martin. Computer Graphics Forum
  📄 Details

• On the Readability of Leaders in Boundary Labeling Barth, Lukas, Gemsa, Andreas, Niedermann, Benjamin, Nöllenburg, Martin. Information Visualization
  📄 Details

• Short Plane Supports for Spatial Hypergraphs Castermans, Thom, van Garderen, Mereke, Meulemans, Wouter, Nöllenburg, Martin, Yuan, Xiaoru. J. Graph Algorithms Appl.
  📄 Details

• Mixed Linear Layouts: Complexity, Heuristics, and Experiments de Col, Philipp, Klute, Fabian, Nöllenburg, Martin. Graph Drawing and Network Visualization (GD'19)
  📄 Details

• On Strict (Outer-)Confluent Graphs Förster, Henry, Ganian, Robert, Klute, Fabian, Nöllenburg, Martin. Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings
  📄 Details

• Exploring Semi-Automatic Map Labeling Klute, Fabian, Li, Guangping, Löffler, Raphael, Nöllenburg, Martin, Schmidt, Manuela. Advances in Geographic Information Systems (SIGSPATIAL'19)
  📄 Details

• Maximizing Ink in Partial Edge Drawings of k-plane Graphs Hummel, Matthias, Klute, Fabian, Nickel, Soeren, Nöllenburg, Martin. Graph Drawing and Network Visualization (GD'19)
  📄 Details

• Lombardi Drawings of Knots and Links Kindermann, Philipp, Kobourov, Stephen, Löffler, Maarten, Nöllenburg, Martin, Schulz, André, Vogtenhuber, Birgit. J. Computational Geometry
  📄 Details

• Minimizing crossings in constrained two-sided circular graph layouts Klute, Fabian, Nöllenburg, Martin. J. Computational Geometry
  📄 Details

• Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses Nesic, Aleksandar, Blaicher, Matthias, Hoose, Tobias, Hofmann, Andreas, Lauermann, Matthias, Kutuvantavida, Yasar, Nöllenburg, Martin, Randel, Sebastian, Freude, Wolfgang, Koos, Christian. Optics Express
  📄 Details

• Computing Stable Demers Cartograms Nickel, Soeren, Sondag, Max, Meulemans, Wouter, Chimani, Markus, Kobourov, Stephen, Peltonen, Jaakko, Nöllenburg, Martin. Graph Drawing and Network Visualization (GD'19)
  📄 Details

• Metabopolis: scalable network layout for biological pathway diagrams in urban map style Wu, Hsiang-Yun, Nöllenburg, Martin, Sousa, Filipa L., Viola, Ivan. BMC Bioinformatics
  📄 Details

2018

• Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity Argyriou, Evmorfia, Cornelsen, Sabine, Förster, Henry, Kaufmann, Michael, Nöllenburg, Martin, Okamoto, Yoshio, Raftopoulou, Chrysanthi, Wolff, Alexander. Graph Drawing and Network Visualization (GD'18)
  📄 Details

• Planar Drawings of Fixed-Mobile Bigraphs Bekos, Michael, De Luca, Felice, Didimo, Walter, Mchedlidze, Tamara, Nöllenburg, Martin, Symvonis, Antonios, Tollis, Ioannis G.. Graph Drawing and Network Visualization (GD'17)
  📄 Details

• Planar L-Drawings of Directed Graphs Chaplick, Steven, Chimani, Markus, Cornelsen, Sabine, Da Lozzo, Giordano, Nöllenburg, Martin, Patrignani, Maurizio, Tollis, Ioannis G., Wolff, Alexander. Graph Drawing and Network Visualization (GD'17)
  📄 Details

• Short Plane Supports for Spatial Hypergraphs Casterman, Thom, van Garderen, Mereke, Meulemans, Wouter, Nöllenburg, Martin, Yuan, Xiaoru. Graph Drawing and Network Visualization (GD'18)
  📄 Details

• Planar and poly-arc Lombardi drawings Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Löffler, Maarten, Nöllenburg, Martin. J. Computational Geometry
  📄 Details

• Minimzing Wiggles in Storyline Visualizations Fröschl, Theresa, Nöllenburg, Martin. Graph Drawing and Network Visualization (GD'17)
  📄 Details

• Scalable Set Visualizations (Dagstuhl Seminar 17332) Yifan Hu, Luana Micallef, Martin Nöllenburg, Peter Rodgers. Dagstuhl Reports
  📄 Details

• Graph Visualization Hu, Yifan, Nöllenburg, Martin. Encyclopedia of Big Data Technologies
  📄 Details

• Lombardi Drawings of Knots and Links Kindermann, Philipp, Kobourov, Stephen G., Löffler, Maarten, Nöllenburg, Martin, Schulz, André, Vogtenhuber, Birgit. Graph Drawing and Network Visualization (GD'17)
  📄 Details

• Experimental Evaluation of Book Drawing Algorithms Klawitter, Jonathan, Mchedlidze, Tamara, Nöllenburg, Martin. Graph Drawing and Network Visualization (GD'17)
  📄 Details

• Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts Klute, Fabian, Nöllenburg, Martin. Computational Geometry (SoCG'18)
  📄 Details

• Towards Characterizing Strict Outerconfluent Graphs Klute, Fabian, Nöllenburg, Martin. Graph Drawing and Network Visualization (GD'17)
  📄 Details

• Drawing Large Graphs by Multilevel Maxent-Stress Optimization Meyerhenke, Henning, Nöllenburg, Martin, Schulz, Christian. IEEE Trans. Visualization and Computer Graphics
  📄 Details

• A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways Wu, Hsiang-Yun, Nöllenburg, Martin, Viola, Ivan. Eurographics Conference on Visualization (EuroVis'18) – Posters
  📄 Details

2017

• Progress on Partial Edge Drawings Bruckdorfer, Till, Cornelsen, Sabine, Gutwenger, Carsten, Kaufmann, Michael, Montecchiani, Fabrizio, Nöllenburg, Martin, Wolff, Alexander. J. Graph Algorithms Appl.
  📄 Details

• Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd Gadiraju, Ujwal, Möller, Sebastian, Nöllenburg, Martin, Saupe, Dietmar, Egger-Lampl, Sebastian, Archambault, Daniel, Fisher, Brian. Evaluation in the Crowd. Crowdsourcing and Human-Centered Experiments
  📄 Details

• Minimizing crossings in constrained two-sided circular graph layouts Klute, Fabian, Nöllenburg, Martin. European Workshop on Computational Geometry (EuroCG'17)
  📄 Details

• Radial Contour Labeling with Straight Leaders Niedermann, Benjamin, Nöllenburg, Martin, Rutter, Ignaz. IEEE Pacific Visualization Symposium (PacificVis'17)
  📄 Details

• Euclidean Greedy Drawings of Trees Nöllenburg, Martin, Prutkin, Roman. Discrete and Computational Geometry
  📄 Details

• Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz. International Journal of Computational Geometry and Applications
  📄 Details

2016

• Adjacency-Preserving Spatial Treemaps Buchin, Kevin, Eppstein, David, Löffler, Maarten, Nöllenburg, Martin, Silveira, Rodrigo I.. J. Computational Geometry
  📄 Details

• Temporal Map Labeling: A New Unified Framework with Experiments Barth, Lukas, Niedermann, Benjamin, Nöllenburg, Martin, Strash, Darren. Advances in Geographic Information Systems (SIGSPATIAL'16)
  📄 Details

• Strict Confluent Drawing Eppstein, David, Holten, Danny, Löffler, Maarten, Nöllenburg, Martin, Speckmann, Bettina, Verbeek, Kevin. J. Computational Geometry
  📄 Details

• Consistent Labeling of Rotating Maps Gemsa, Andreas, Nöllenburg, Martin, Rutter, Ignaz. J. Computational Geometry
  📄 Details

• Evaluation of Labeling Strategies for Rotating Maps Gemsa, Andreas, Nöllenburg, Martin, Rutter, Ignaz. ACM J. Experimental Algorithmics
  📄 Details

• Mixed Map Labeling Löffler, Maarten, Nöllenburg, Martin, Staals, Frank. J. Spatial Information Science
  📄 Details

• Extending Convex Partial Drawings of Graphs Mchedlidze, Tamara, Nöllenburg, Martin, Rutter, Ignaz. Algorithmica
  📄 Details

• An Algorithmic Framework for Labeling Road Maps Niedermann, Benjamin, Nöllenburg, Martin. Geographic Information Science (GIScience ‘16)
  📄 Details

• On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz. J. Computational Geometry
  📄 Details

• Software Visualization via Hierarchic Micro/Macro Layouts Nöllenburg, Martin, Rutter, Ignaz, Schuhmacher, Alfred. Information Visualization Theory and Applications (IVAPP'16)
  📄 Details

2015

• Towards Realistic Pedestrian Route Planning Andreev, Simeon, Dibbelt, Julian, Nöllenburg, Martin, Pajor, Thomas, Wagner, Dorothea. Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'15)
  📄 Details

• Many-to-One Boundary Labeling with Backbones Bekos, Michael, Cornelsen, Sabine, Fink, Martin, Hong, Seok-Hee, Kaufmann, Michael, Nöllenburg, Martin, Rutter, Ignaz, Symvonis, Antonios. J. Graph Algorithms Appl.
  📄 Details

• Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052) Brandes, Ulrik, Finocchi, Irene, Nöllenburg, Martin, Quigley, Aaron. Dagstuhl Reports
  📄 Details

• On the Readability of Boundary Labeling Barth, Lukas, Gemsa, Andreas, Niedermann, Benjamin, Nöllenburg, Martin. Graph Drawing (GD'15)
  📄 Details

• Multi-Row Boundary-Labeling Algorithms for Panorama Images Gemsa, Andreas, Haunert, Jan-Henrik, Nöllenburg, Martin. ACM Trans. Spatial Algorithms and Systems
  📄 Details

• Label Placement in Road Maps Gemsa, Andreas, Niedermann, Benjamin, Nöllenburg, Martin. Algorithms and Complexity (CIAC'15)
  📄 Details

• Recognizing Weighted Disk Contact Graphs Klemz, Boris, Nöllenburg, Martin, Prutkin, Roman. Graph Drawing (GD'15)
  📄 Details

• On Minimizing Crossings in Storyline Visualizations Kostitsyna, Irina, Nöllenburg, Martin, Polishchuk, Valentin, Schulz, André, Strash, Darren. Graph Drawing (GD'15)
  📄 Details

• Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem Klawitter, Jonathan, Nöllenburg, Martin, Ueckerdt, Torsten. Graph Drawing (GD'15)
  📄 Details

• Operating Power Grids with Few Flow Control Buses Leibfried, Thomas, Mchedlidze, Tamara, Meyer-Hübner, Nico, Nöllenburg, Martin, Rutter, Ignaz, Sanders, Peter, Wagner, Dorothea, Wegner, Franziska. Future Energy Systems (e-Energy'15)
  📄 Details

• Mixed Map Labeling Löffler, Maarten, Nöllenburg, Martin, Staals, Frank. Algorithms and Complexity (CIAC'15)
  📄 Details

• Towards Realistic Flow Control in Power Grid Operation Mchedlidze, Tamara, Nöllenburg, Martin, Rutter, Ignaz, Wagner, Dorothea, Wegner, Franziska. Energy Informatics (EI'15)
  📄 Details

• Drawing Large Graphs by Multilevel Maxent-Stress Optimization Meyerhenke, Henning, Nöllenburg, Martin, Schulz, Christian. Graph Drawing (GD'15)
  📄 Details

• Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz. Algorithms and Computation (ISAAC'15)
  📄 Details

2014

• Simultaneous Embeddability of Two Partitions Athenstädt, Jan Christoph, Hartmann, Tanja, Nöllenburg, Martin. Graph Drawing (GD'14)
  📄 Details

• Semantic Word Cloud Representations: Hardness and Approximation Algorithms Barth, Lukas, Fabrikant, Sara Irina, Kobourov, Stephen G., Lubiw, Anna, Nöllenburg, Martin, Okamoto, Yoshio, Pupyrev, Sergey, Squarcella, Claudio, Ueckerdt, Torsten, Wolff, Alexander. Theoretical Informatics (LATIN'14)
  📄 Details

• PIGRA – A Tool for Pixelated Graph Representations Bläsius, Thomas, Klute, Fabian, Niedermann, Benjamin, Nöllenburg, Martin. Graph Drawing (GD'14)
  📄 Details

• On d-regular schematization of embedded paths Delling, Daniel, Gemsa, Andreas, Nöllenburg, Martin, Pajor, Thomas, Rutter, Ignaz. Comput. Geom. Theory Appl.
  📄 Details

• Evaluation of Labeling Strategies for Rotating Maps Gemsa, Andreas, Nöllenburg, Martin, Rutter, Ignaz. Experimental Algorithms (SEA'14)
  📄 Details

• Scalability Considerations for Multivariate Graph Visualization Jankun-Kelly, T. J., Dwyer, Tim, Holten, Danny, Hurter, Christophe, Nöllenburg, Martin, Weaver, Chris, Xu, Kai. Multivariate Network Visualization
  📄 Details

• Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams Klemz, Boris, Mchedlidze, Tamara, Nöllenburg, Martin. Algorithm Theory (SWAT'14)
  📄 Details

• A survey on automated metro map layout methods Nöllenburg, Martin. Schematic Mapping Workshop
  📄 Details

• On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz. Graph Drawing (GD'14)
  📄 Details

2013

• Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor Athenstädt, Jan Christoph, Görke, Robert, Krug, Marcus, Nöllenburg, Martin. Graph Drawing (GD'12)
  📄 Details

• Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings Biedl, Therese, Bläsius, Thomas, Niedermann, Benjamin, Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz. Graph Drawing (GD'13)
  📄 Details

• Many-to-One Boundary Labeling with Backbones Bekos, Michael, Cornelsen, Sabine, Fink, Martin, Hong, Seok-Hee, Kaufmann, Michael, Nöllenburg, Martin, Rutter, Ignaz, Symvonis, Antonios. Graph Drawing (GD'13)
  📄 Details

• Progress on Partial Edge Drawings Bruckdorfer, Till, Cornelsen, Sabine, Gutwenger, Carsten, Kaufmann, Michael, Montecchiani, Fabrizio, Nöllenburg, Martin, Wolff, Alexander. Graph Drawing (GD'12)
  📄 Details

• Drawing Trees with Perfect Angular Resolution and Polynomial Area Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Nöllenburg, Martin. Discrete and Computational Geometry
  📄 Details

• Strict Confluent Drawing Eppstein, David, Holten, Danny, Löffler, Maarten, Nöllenburg, Martin, Speckmann, Bettina, Verbeek, Kevin. Graph Drawing (GD'13)
  📄 Details

• Optimal 3D Angular Resolution for Low-Degree Graphs Eppstein, David, Löffler, Maarten, Mumford, Elena, Nöllenburg, Martin. J. Graph Algorithms Appl.
  📄 Details

• Drawing Metro Maps using Bézier Curves Fink, Martin, Haverkort, Herman, Nöllenburg, Martin, Roberts, Maxwell J., Schuhmann, Julian, Wolff, Alexander. Graph Drawing (GD'12)
  📄 Details

• Trajectory-Based Dynamic Map Labeling Gemsa, Andreas, Niedermann, Benjamin, Nöllenburg, Martin. Algorithms and Computation (ISAAC'13)
  📄 Details

• Circular-Arc Cartograms Kämper, Jan-Hinrich, Kobourov, Stephen G., Nöllenburg, Martin. IEEE Pacific Visualization Symposium (PacificVis'13)
  📄 Details

• Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151) Kobourov, Stephen, Nöllenburg, Martin, Teillaud, Monique. Dagstuhl Reports
  📄 Details

• Planar Lombardi Drawings of Outerpaths Löffler, Maarten, Nöllenburg, Martin. Graph Drawing (GD'12)
  📄 Details

• Drawing Planar Graphs with a Prescribed Inner Face Mchedlidze, Tamara, Nöllenburg, Martin, Rutter, Ignaz. Graph Drawing (GD'13)
  📄 Details

• Euclidean Greedy Drawings of Trees Nöllenburg, Martin, Prutkin, Roman. Algorithms (ESA'13)
  📄 Details

• Edge-weighted contact representations of planar graphs Nöllenburg, Martin, Prutkin, Roman, Rutter, Ignaz. J. Graph Algorithms Appl.
  📄 Details

• On The Usability of Lombardi Graph Drawings Purchase, Helen C., Hamer, John, Nöllenburg, Martin, Kobourov, Stephen G.. Graph Drawing (GD'12)
  📄 Details

2012

• Cover Contact Graphs Atienza, Nieves, de Castro, Natalia, Cortés, Carmen, Garrido, M. Ángeles, Grima, Clara I., Hernández, Gregorio, Márquez, Alberto, Moreno, Auxiliadora, Nöllenburg, Martin, Portillo, José Ramón, Reyes, Pedro, Valenzuela, Jesús, Villar, Maria Trinidad, Wolff, Alexander. J. Computational Geometry
  📄 Details

• Drawing (Complete) Binary Tanglegrams Buchin, Kevin, Buchin, Maike, Byrka, Jaroslaw, Nöllenburg, Martin, Okamoto, Yoshio, Silveira, Rodrigo, Wolff, Alexander. Algorithmica
  📄 Details

• Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes Chun, Jinhee, Kaothanthong, Natsuda, Kasai, Ryosei, Korman, Matias, Tokuyama, Takeshi, Nöllenburg, Martin. Computer Vision and Image Understanding
  📄 Details

• Lombardi Drawings of Graphs Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Nöllenburg, Martin. J. Graph Algorithms Appl.
  📄 Details

2011

• Adjacency-Preserving Spatial Treemaps Buchin, Kevin, Eppstein, David, Löffler, Maarten, Nöllenburg, Martin, Silveira, Rodrigo I.. Algorithms and Data Structures (WADS'11)
  📄 Details

• Drawing Trees with Perfect Angular Resolution and Polynomial Area Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Nöllenburg, Martin. Graph Drawing (GD'10)
  📄 Details

• Lombardi Drawings of Graphs Duncan, Christian A., Eppstein, David, Goodrich, Michael T., Kobourov, Stephen G., Nöllenburg, Martin. Graph Drawing (GD'10)
  📄 Details

• Optimal 3D Angular Resolution for Low-Degree Graphs Eppstein, David, Löffler, Maarten, Mumford, Elena, Nöllenburg, Martin. Graph Drawing (GD'10)
  📄 Details

• Boundary-Labeling Algorithms for Panorama Images Gemsa, Andreas, Haunert, Jan-Henrik, Nöllenburg, Martin. Advances in Geographic Information Systems (SIGSPATIAL'11)
  📄 Details

• Automatic Generation of Route Sketches Gemsa, Andreas, Nöllenburg, Martin, Pajor, Thomas, Rutter, Ignaz. Graph Drawing (GD'10)
  📄 Details

• On d-regular Schematization of Embedded Paths Gemsa, Andreas, Nöllenburg, Martin, Pajor, Thomas, Rutter, Ignaz. Theory and Practice of Computer Science (SOFSEM'11)
  📄 Details

• Consistent Labeling of Rotating Maps Gemsa, Andreas, Nöllenburg, Martin, Rutter, Ignaz. Algorithms and Data Structures (WADS'11)
  📄 Details

• Sliding Labels for Dynamic Point Labeling Gemsa, Andreas, Nöllenburg, Martin, Rutter, Ignaz. Canadian Conference on Computational Geometry (CCCG ‘11)
  📄 Details

• Connecting Two Trees with Optimal Routing Cost Kao, Mong-Jen, Katz, Bastian, Krug, Marcus, Lee, D. T., Nöllenburg, Martin, Rutter, Ignaz, Wagner, Dorothea. Canadian Conference on Computational Geometry (CCCG ‘11)
  📄 Details

• Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming Nöllenburg, Martin, Wolff, Alexander. IEEE Trans. Visualization and Computer Graphics
  📄 Details

2010

• Boundary Labeling with Octilinear Leaders Bekos, Michael, Kaufmann, Michael, Nöllenburg, Martin, Symvonis, Antonios. Algorithmica
  📄 Details

• Optimizing Active Ranges for Consistent Dynamic Map Labeling Been, Ken, Nöllenburg, Martin, Poon, Sheung-Hung, Wolff, Alexander. Comput. Geom. Theory Appl.
  📄 Details

• Path Schematization for Route Sketches Delling, Daniel, Gemsa, Andreas, Nöllenburg, Martin, Pajor, Thomas. Algorithm Theory (SWAT'10)
  📄 Details

• Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling Löffler, Maarten, Nöllenburg, Martin. Canadian Conference on Computational Geometry (CCCG ‘10)
  📄 Details

• An Improved Algorithm for the Metro-Line Crossing Minimization Problem Nöllenburg, Martin. Graph Drawing (GD'09)
  📄 Details

• Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexität Nöllenburg, Martin. Ausgezeichnete Informatikdissertationen 2009
  📄 Details

• Dynamic One-Sided Boundary Labeling Nöllenburg, Martin, Polishchuk, Valentin, Sysikaski, Mikko. Advances in Geographic Information Systems (SIGSPATIAL'10)
  📄 Details

2009

• Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability Buchin, Kevin, Buchin, Maike, Byrka, Jaroslaw, Nöllenburg, Martin, Okamoto, Yoshio, Silveira, Rodrigo I., Wolff, Alexander. Graph Drawing (GD'08)
  📄 Details

• Algorithms for Multi-Criteria Boundary Labeling Benkert, Marc, Haverkort, Herman, Kroll, Moritz, Nöllenburg, Martin. J. Graph Algorithms Appl.
  📄 Details

• Consistent Digital Rays Chun, Jinhee, Korman, Matias, Nöllenburg, Martin, Tokuyama, Takeshi. Discrete and Computational Geometry
  📄 Details

• Network Visualization: Algorithms, Applications, and Complexity Nöllenburg, Martin.
  📄 Details

• Drawing Binary Tanglegrams: An Experimental Evaluation Nöllenburg, Martin, Völker, Markus, Wolff, Alexander, Holten, Danny. Algorithm Engineering and Experiments (ALENEX'09)
  📄 Details

2008

• Cover Contact Graphs Atienza, Nieves, de Castro, Natalia, Cortés, Carmen, Garrido, M. Ángeles, Grima, Clara I., Hernández, Gregorio, Márquez, Alberto, Moreno, Auxiliadora, Nöllenburg, Martin, Portillo, José Ramon, Reyes, Pedro, Valenzuela, Jesús, Villar, Maria Trinidad, Wolff, Alexander. Graph Drawing (GD'07)
  📄 Details

• Algorithms for Multi-Criteria One-Sided Boundary Labeling Benkert, Marc, Haverkort, Herman, Kroll, Moritz, Nöllenburg, Martin. Graph Drawing (GD'07)
  📄 Details

• Boundary Labeling with Octilinear Leaders Bekos, Michael A., Kaufmann, Michael, Nöllenburg, Martin, Symvonis, Antonios. Algorithm Theory (SWAT'08)
  📄 Details

• Optimizing Active Ranges for Consistent Dynamic Map Labeling Been, Ken, Nöllenburg, Martin, Poon, Sheung-Hung, Wolff, Alexander. Computational Geometry (SoCG'08)
  📄 Details

• Consistent Digital Rays Chun, Jinhee, Korman, Matias, Nöllenburg, Martin, Tokuyama, Takeshi. Computational Geometry (SoCG'08)
  📄 Details

• Morphing Polylines: A Step Towards Continuous Generalization Nöllenburg, Martin, Merrick, Damian, Wolff, Alexander, Benkert, Marc. Computers, Environment and Urban Systems
  📄 Details

2007

• Improved Algorithms for Length-Minimal One-Sided Boundary Labeling Benkert, Marc, Nöllenburg, Martin. European Workshop on Computational Geometry (EuroCG'07)
  📄 Details

• Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps Benkert, Marc, Nöllenburg, Martin, Uno, Takeaki, Wolff, Alexander. Graph Drawing (GD'06)
  📄 Details

• Morphing Polygonal Lines: A Step Towards Continuous Generalization Merrick, Damian, Nöllenburg, Martin, Wolff, Alexander, Benkert, Marc. Geographic Information Science Research Conference UK (GISRUK'07)
  📄 Details

• Geographic Visualization Nöllenburg, Martin. Human-Centered Visualization Environments
  📄 Details

2006

• A Mixed-Integer Program for Drawing High-Quality Metro Maps Nöllenburg, Martin, Wolff, Alexander. Graph Drawing (GD'05)
  📄 Details

2005

• Automated Drawing of Metro Maps Nöllenburg, Martin.
  📄 Details

2004

• Validation in the Cluster Analysis of Gene Expression Data Jäkel, Jens, Nöllenburg, Martin. Workshop Fuzzy-Systeme und Computational Intelligence
  📄 Details