Martin Nöllenburg

» Univ.Prof. Dipl.-Inform. Dr.rer.nat.
contact | research | cv | activities | teaching | publications

Address:
Martin Nöllenburg
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Room: HC0405
Phone: +43(1)58801–192120
Email: noellenburg@ac.tuwien.ac.at
Web: http://www.ac.tuwien.ac.at/people/noellenburg/
ORCID iD iconorcid.org/0000-0003-0454-3937

Research Interests

  • graph algorithms, in particular for graph drawing and network visualization
  • computational geometry, in particular algorithms for cartography and geovisualization
  • algorithm engineering and combinatorial optimization

Research Team Graph and Geometric Algorithms

Group Members

Alumni

Open positions

For individual postdoc opportunities in our group funding through external fellowships may be possible, e.g., from FWF, MSCA European Fellowships, or the Humboldt Foundation. You are welcome to contact me and discuss your ideas.

Currently, we do not have open PhD positions.

We do not offer paid undergrad summer internships.

Short CV

  • 2020 Full Professor at TU Wien, Vienna, Austria
  • 2017-2020 Associate Professor at TU Wien, Vienna, Austria
  • 2015-2017 Tenure-Track Assistant Professor at TU Wien, Vienna, Austria
  • 02/2015 Habilitation in Computer Science at Karlsruhe Institute of Technology, Germany
  • 2010-2015 Head of Young Investigator Group at Karlsruhe Institute of Technology, Germany
  • 2010 Postdoctoral researcher (DFG fellowship) at UC Irvine, California, USA
  • 2005-2009 PhD student (Dr. rer. nat.) at Universität Karlsruhe, Germany
  • 2002-2003 Visiting student and DAAD scholar at McGill University, Montreal, Canada
  • 1999-2005 Studies of Computer Science at Universität Karlsruhe, Germany

Activities

Teaching

Theses and Projects

Please contact me if you are interested in writing your Bachelor/Master thesis or doing a project course in an area related to my research interests. Some general thesis topics are listed here and in TISS.

Winter Term 2024/25

Summer Term 2024

Publications

Most of the publications are also listed at DBLP and Google Scholar.

201 results
2025
[201]Introducing Fairness in Network Visualization
, , , , , ,
Information Sciences, volume 691, pages 121642, 2025.
[bibtex] [doi]
2024
[200]Computing Data-driven Multilinear Metro Maps
,
The Cartographic Journal, pages 1–16, 2024.
[bibtex] [doi]
[199]Visualizing Extensions of Argumentation Frameworks as Layered Graphs
, , , ,
CoRR, volume abs/2409.05457, 2024.
[bibtex] [doi]
[198]Splitting Plane Graphs to Outerplanarity
, ,
J. Graph Algorithms Appl., volume 28, number 3, pages 31–48, 2024.
[bibtex] [doi]
[197]An Introduction to and Survey of Biological Network Visualization
, , , , , , ,
Computers & Graphics, pages 104115, 2024.
[bibtex] [doi]
[196]Improving Temporal Treemaps by Minimizing Crossings
,
Comput. Graph. Forum, volume 43, number 3, pages e15087, 2024.
[bibtex] [doi]
[195]Uncertainty in Humanities Network Visualization
, , , , , , , , , , , , , , , , , , ,
Frontiers in Communication, volume 8, pages 1305137, 2024.
[bibtex] [doi]
[194]On the Complexity of the Storyplan Problem
, , , , , ,
J. Computer and Systems Sciences, volume 139, pages 103466, 2024.
[bibtex] [doi]
[193]Hoop Diagrams: A Set Visualization Method
, , , , ,
Diagrammatic Representation and Inference (DIAGRAMS'24), volume 14981 of LNCS, pages 377-392, 2024, Springer.
[bibtex] [doi]
[192]GdMetriX - A NetworkX Extension For Graph Drawing Metrics
, ,
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 45:1–45:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: Poster abstract
[bibtex] [doi]
[191]Introducing Fairness in Graph Visualization via Gradient Descent
, , , ,
Machine Learning Methods in Visualisation for Big Data (MLVis'24) (Daniel Archambault, Ian Nabney, Jaakko Peltonen, eds.), pages 1–5, 2024, Eurographics Association.
[bibtex] [doi]
[190]Introducing Fairness in Graph Visualization
, , , ,
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 49:1–49:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: Poster abstract
[bibtex] [doi]
[189]Minimizing Switches in Cased Graph Drawings
, ,
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 43:1–43:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: Poster abstract
[bibtex] [doi]
[188]Constrained Boundary Labeling
, , ,
Algorithms and Computation (ISAAC'24) (Julian Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 26:1–26:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[187]Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
, , , , ,
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 31:1–31:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[186]The Parameterized Complexity of Extending Stack Layouts
, , ,
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[185]Boundary Labeling in a Circular Orbit
, , , ,
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 22:1–22:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[184]Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
, , ,
Computational Geometry (SoCG'24) (Wolfgang Mulzer, Jeff M. Phillips, eds.), volume 293 of LIPIcs, pages 19:1–19:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[183]Bundling-Aware Graph Drawing
, , , , ,
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 15:1–15:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
2023
[182]LinSets.zip: Compressing Linear Set Diagrams
, ,
IEEE Trans. Visualization and Computer Graphics, volume 29, number 6, pages 2875–2887, 2023.
[bibtex] [doi]
[181]Faster Edge-Path Bundling Through Graph Spanners
, , , ,
Computer Graphics Forum, volume 42, number 6, pages e14789, 2023.
[bibtex] [doi]
[180]MosaicSets: Embedding Set Systems into Grid Graphs
, , , , ,
IEEE Trans. Visualization and Computer Graphics, 2023.
[bibtex] [pdf]
[179]Untangling Circular Drawings: Algorithms and Complexity
, , , ,
Comput. Geom. Theory Appl., volume 111, 2023.
[bibtex] [doi]
[178]Worbel: Aggregating Point Labels into Word Clouds
, , , ,
ACM Trans. Spatial Algorithms and Systems, volume 9, number 3, pages 19:1–19:32, 2023.
[bibtex] [doi]
[177]On the Upward Book Thickness Problem: Combinatorial and Complexity Results
, , ,
European J. Combinatorics, volume 110, pages 103662, 2023.
[bibtex] [doi]
[176]Splitting Vertices in 2-Layer Graph Drawings
, , , , , , , , , ,
IEEE Computer Graphics and Applications, volume 43, number 3, pages 24–35, 2023.
[bibtex] [doi]
[175]Computing Hive Plots: A Combinatorial Framework
,
Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), volume 14466 of LNCS, pages 153–169, 2023, Springer.
[bibtex] [pdf] [doi]
[174]Planarizing Graphs and their Drawings by Vertex Splitting
, , , , ,
Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 232–246, 2023, Springer.
[bibtex] [pdf] [doi]
[173]On Families of Planar DAGs with Constant Stack Number
,
Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), volume 14465 of LNCS, pages 135–151, 2023, Springer.
[bibtex] [pdf] [doi]
[172]MySemCloud: Semantic-aware Word Cloud Editing
, ,
Pacific Visualization Symposium (PacificVis'23), pages 147–156, 2023.
[bibtex] [pdf] [doi]
[171]Splitting Plane Graphs to Outerplanarity
, ,
Algorithms and Computation (WALCOM'23) (Bertrand M. T. Lin, Chun-Cheng Lin, Giuseppe Liotta, eds.), volume 13973 of LNCS, 2023, Springer.
[bibtex] [pdf] [doi]
[170]Crossing Minimization in Time Interval Storylines
, , , ,
European Workshop on Computational Geometry (EuroCG'23) (Clemens Huemer, Carlos Seara, eds.), pages 36:1–36:7, 2023.
[bibtex] [pdf]
[169]Block Crossings in One-Sided Tanglegrams
,
Algorithms and Data Structures (WADS'23) (Pat Morin, Subhash Suri, eds.), volume 14079 of LNCS, pages 386–400, 2023, Springer.
[bibtex] [pdf] [doi]
[168]Transitions in Dynamic Point Labeling
, , ,
Geographic Information Science (GIScience'23) (Roger Beecham, Jed A. Long, Dianna Smith, Qunshan Zhao, Sarah Wise, eds.), volume 277 of LIPIcs, pages 2:1–2:19, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[167]Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
, , , ,
Computational Geometry (SoCG'23) (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[166]On the Complexity of the Storyplan Problem
, , , , , ,
Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 304–318, 2023, Springer.
[bibtex] [doi]
2022
[165]Multi-level Area Balancing of Clustered Graphs
, ,
IEEE Trans. Visualization and Computer Graphics, volume 28, number 7, pages 2682–2696, 2022.
[bibtex] [doi]
[164]Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach
, , , ,
IEEE Trans. Visualization and Computer Graphics, volume 28, number 1, pages 313–323, 2022.
[bibtex] [doi]
[163]Multicriteria Optimization for Dynamic Demers Cartograms
, , , , ,
IEEE Trans. Visualization and Computer Graphics, volume 28, number 6, pages 2376–2387, 2022.
Note: TVCG Replicability Stamp
[bibtex] [doi]
[162]Recognizing Weighted and Seeded Disk Graphs
, ,
J. Computational Geometry, volume 13, number 1, pages 327–376, 2022.
[bibtex] [doi]
[161]Mixed Labeling: Integrating Internal and External Labels
, , ,
IEEE Trans. Visualization and Computer Graphics, volume 28, number 4, pages 1848–1861, 2022.
[bibtex] [pdf] [doi]
[160]Shape-Guided Mixed Metro Map Layout
, , , ,
Computer Graphics Forum, volume 41, number 7, pages 495–506, 2022.
[bibtex] [doi]
[159]An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
, ,
ACM J. Experimental Algorithmics, volume 27, pages 1.8:1–1.8:36, 2022.
[bibtex] [doi]
[158]Parameterized Algorithms for Queue Layouts
, , ,
J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022.
[bibtex] [doi]
[157]On Computing Optimal Linear Diagrams
,
Diagrammatic Representation and Inference (DIAGRAMS'22) (Valeria Giardino, Sven Linker, Richard Burns, Francesco Bellucci, Jean-Michel Boucheix, Petrucio Viana, eds.), volume 13462 of LNAI, pages 20–36, 2022, Springer.
[bibtex] [pdf] [doi]
[156]Multidimensional Manhattan Preferences
, , , ,
Theoretical Informatics (LATIN'22) (Armando Castañeda, Francisco Rodríguez-Henríquez, eds.), volume 13568 of LNCS, pages 273–289, 2022, Springer.
[bibtex] [doi]
[155]Minimum Link Fencing
, , , , ,
Algorithms and Computation (ISAAC'22) (Sang Won Bae, Heejin Park, eds.), volume 248 of LIPIcs, pages 34:1–34:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
2021
[154]External Labeling: Fundamental Concepts and Algorithmic Techniques
, ,
2021, Morgan & Claypool.
[bibtex] [doi]
[153]On the Readability of Abstract Set Visualizations
, , ,
IEEE Trans. Visualization and Computer Graphics, volume 27, number 6, pages 2821–2832, 2021.
[bibtex] [doi]
[152]Labeling Nonograms: Boundary Labeling for Curve Arrangements
, ,
Comput. Geom. Theory Appl., volume 98, pages 101791, 2021.
[bibtex] [doi]
[151]MetroSets: Visualizing Sets as Metro Maps
, , ,
IEEE Trans. Visualization and Computer Graphics, volume 27, number 2, pages 1257–1267, 2021.
[bibtex] [pdf] [doi]
[150]ClusterSets: Optimizing Planar Clusters in Categorical Point Data
, , , , , , ,
Computer Graphics Forum, volume 40, number 3, pages 471–481, 2021.
[bibtex] [pdf] [doi]
[149]Geometric Planar Networks on Bichromatic Collinear Points
, , ,
Theoretical Computer Science, volume 895, pages 124–136, 2021.
[bibtex] [doi]
[148]Layered Area-Proportional Rectangle Contact Representation
, ,
Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 318–326, 2021, Springer.
[bibtex] [doi]
[147]Disjoint Box Covering in a Rectilinear Polygon
, , ,
European Workshop on Computational Geometry (EuroCG'21), pages 71:1–71:7, 2021.
[bibtex] [pdf]
[146]Untangling Circular Drawings: Algorithms and Complexity
, , , ,
Algorithms and Computation (ISAAC'21) (Hee-Kap Ahn, Kunihiko Sadakane, eds.), volume 212 of LIPIcs, pages 19:1–19:17, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[145]Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
, , ,
Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 304–317, 2021, Springer.
[bibtex] [pdf] [doi]
[144]Balanced Independent and Dominating Sets on Colored Interval Graphs
, , , ,
Theory and Practice of Computer Science (SOFSEM'21) (Tomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdziński, Claus Pahl, Florian Sikora, Prudence Wong, eds.), volume 12607 of LNCS, pages 89–103, 2021, Springer.
[bibtex] [doi]
[143]Worbel: Aggregating Point Labels into Word Clouds
, , , ,
Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256–267, 2021, ACM.
[bibtex] [pdf] [doi]
[142]On the Upward Book Thickness Problem: Combinatorial and Complexity Results
, , ,
Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 242–256, 2021, Springer.
[bibtex] [pdf] [doi]
2020
[141]A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives
, , , ,
Computer Graphics Forum, volume 39, number 3, pages 619–646, 2020.
[bibtex] [pdf] [doi]
[140]A Unified Model and Algorithms for Temporal Map Labeling
, ,
Algorithmica, volume 82, pages 2709–2736, 2020.
[bibtex] [doi]
[139]Placing Labels in Road Maps: Algorithms and Complexity
, ,
Algorithmica, volume 82, pages 1881–1908, 2020.
[bibtex] [doi]
[138]Route Schematization with Landmarks
, , ,
J. Spatial Information Science, volume 21, 2020.
[bibtex] [pdf] [doi]
[137]Parameterized Algorithms for Book Embedding Problems
, , ,
J. Graph Algorithms Appl., volume 24, number 4, pages 603–620, 2020.
[bibtex] [doi]
[136]Crossing Layout in Non-planar Graphs

Chapter in Beyond Planar Graphs (Seok-Hee Hong, Takeshi Tokuyama, eds.), pages 187–209, 2020, Springer Nature Singapore.
[bibtex] [doi]
[135]The Turing Test for Graph Drawing Algorithms
, , , , ,
Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 466–481, 2020, Springer.
[bibtex] [pdf] [doi]
[134]Towards Data-Driven Multilinear Metro Maps
,
Diagrammatic Representation and Inference (DIAGRAMS'20) (Ahti-Veikko Pietarinen, Peter Chapman, Leonie Bosveld de Smet, Valeria Giardino, James Corter, Sven Linker, eds.), volume 12169 of LNAI, pages 153–161, 2020, Springer.
[bibtex] [pdf] [doi]
[133]Labeling Nonograms
,
European Workshop on Computational Geometry (EuroCG'20), pages 71:1–71:8, 2020.
[bibtex] [pdf]
[132]Extending Partial 1-Planar Drawings
, , , ,
Automata, Languages, and Programming (ICALP'20) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[131]Extending Nearly Complete 1-Planar Drawings in Polynomial Time
, , , ,
Mathematical Foundations of Computer Science (MFCS'20) (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[130]An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
, ,
Algorithms (ESA'20) (Fabrizio Grandoni, Peter Sanders, Grzegorz Herman, eds.), volume 173 of LIPIcs, pages 19:1–19:24, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[129]Balanced Independent and Dominating Sets on Colored Interval Graphs
, , , ,
European Workshop on Computational Geometry (EuroCG'20), pages 66:1–66:6, 2020.
[bibtex] [pdf]
[128]Parameterized Algorithms for Queue Layouts
, , ,
Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 40–54, 2020, Springer.
[bibtex] [pdf] [doi]
[127]Layered Fan-Planar Graph Drawings
, , , , ,
Mathematical Foundations of Computer Science (MFCS'20) (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 14:1–14:13, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[126]Geometric Planar Networks on Bichromatic Points
, , ,
Algorithms and Discrete Applied Mathematics (CALDAM'20) (Manoj Changat, Sandip Das, eds.), volume 12016 of LNCS, pages 79–91, 2020, Springer.
[bibtex] [pdf] [doi]
2019
[125]Metabopolis: scalable network layout for biological pathway diagrams in urban map style
, , ,
BMC Bioinformatics, volume 20, pages 187, 2019.
[bibtex] [doi]
[124]Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses
, , , , , , , , ,
Optics Express, volume 27, number 12, pages 17402–17425, 2019.
[bibtex] [doi]
[123]Minimizing crossings in constrained two-sided circular graph layouts
,
J. Computational Geometry, volume 10, number 2, pages 45–69, 2019.
[bibtex] [doi]
[122]Lombardi Drawings of Knots and Links
, , , , ,
J. Computational Geometry, volume 10, number 1, pages 444–476, 2019.
[bibtex] [doi]
[121]Short Plane Supports for Spatial Hypergraphs
, , , ,
J. Graph Algorithms Appl., volume 23, number 3, pages 463–498, 2019.
[bibtex] [doi]
[120]On the Readability of Leaders in Boundary Labeling
, , ,
Information Visualization, volume 18, number 1, pages 110–132, 2019.
[bibtex] [doi]
[119]External Labeling Techniques: A Taxonomy and Survey
, ,
Computer Graphics Forum, volume 38, number 3, pages 833–860, 2019.
[bibtex] [pdf] [doi]
[118]Planar Drawings of Fixed-Mobile Bigraphs
, , , , , ,
Theoretical Computer Science, volume 795, pages 408–419, 2019.
[bibtex] [doi]
[117]Guidelines for Experimental Algorithmics: A Case Study in Network Analysis
, , , , , ,
Algorithms, volume 12, number 7, pages 127:1–127:37, 2019.
[bibtex] [pdf] [doi]
[116]Computing Stable Demers Cartograms
, , , , , ,
Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 46–60, 2019, Springer.
[bibtex] [pdf] [doi]
[115]Maximizing Ink in Partial Edge Drawings of k-plane Graphs
, , ,
Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 323–336, 2019, Springer.
[bibtex] [pdf] [doi]
[114]Exploring Semi-Automatic Map Labeling
, , , ,
Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13–22, 2019, ACM.
[bibtex] [pdf] [doi]
[113]On Strict (Outer-)Confluent Graphs
, , ,
Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 147–161, 2019, Springer.
[bibtex] [pdf] [doi]
[112]Mixed Linear Layouts: Complexity, Heuristics, and Experiments
, ,
Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 460–467, 2019, Springer.
[bibtex] [pdf] [doi]
[111]Parameterized Algorithms for Book Embedding Problems
, , ,
Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 365–378, 2019, Springer.
[bibtex] [pdf] [doi]
2018
[110]Drawing Large Graphs by Multilevel Maxent-Stress Optimization
, ,
IEEE Trans. Visualization and Computer Graphics, volume 24, number 5, pages 1814–1827, 2018.
[bibtex] [doi]
[109]Scalable Set Visualizations (Dagstuhl Seminar 17332)
, , ,
Dagstuhl Reports, volume 7, number 8, pages 1–22, 2018.
[bibtex] [doi]
[108]Planar and poly-arc Lombardi drawings
, , , , ,
J. Computational Geometry, volume 9, number 1, pages 328–355, 2018.
[bibtex] [doi]
[107]Graph Visualization
,
Chapter in Encyclopedia of Big Data Technologies (Sherif Sakr, Albert Zomaya, eds.), 2018, Springer International Publishing.
[bibtex] [pdf] [doi]
[106]A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways
, ,
Eurographics Conference on Visualization (EuroVis'18) – Posters (Anna Puig, Renata Raidou, eds.), pages 57–59, 2018.
[bibtex] [doi]
[105]Towards Characterizing Strict Outerconfluent Graphs
,
Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 612–614, 2018, Springer.
[bibtex] [pdf]
[104]Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts
,
Computational Geometry (SoCG'18) (Bettina Speckmann, Csaba D. Tóth, eds.), pages 53:1–53:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[103]Experimental Evaluation of Book Drawing Algorithms
, ,
Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 224–238, 2018, Springer.
[bibtex] [pdf] [doi]
[102]Lombardi Drawings of Knots and Links
, , , , ,
Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 113–126, 2018, Springer.
[bibtex] [pdf] [doi]
[101]Minimzing Wiggles in Storyline Visualizations
,
Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 585–587, 2018, Springer.
[bibtex] [pdf]
[100]Short Plane Supports for Spatial Hypergraphs
, , , ,
Graph Drawing and Network Visualization (GD'18) (Therese Biedl, Andreas Kerren, eds.), volume 11282 of LNCS, pages 53–66, 2018, Springer International Publishing.
[bibtex] [pdf] [doi]
[99]Planar L-Drawings of Directed Graphs
, , , , , , ,
Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 465–478, 2018, Springer.
[bibtex] [pdf] [doi]
[98]Planar Drawings of Fixed-Mobile Bigraphs
, , , , , ,
Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 426–439, 2018, Springer.
[bibtex] [pdf] [doi]
[97]Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
, , , , , , ,
Graph Drawing and Network Visualization (GD'18) (Therese Biedl, Andreas Kerren, eds.), volume 11282 of LNCS, pages 509–523, 2018, Springer International Publishing.
[bibtex] [pdf] [doi]
2017
[96]Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
, ,
International Journal of Computational Geometry and Applications, volume 27, number 1–2, pages 121–158, 2017.
[bibtex] [doi]
[95]Euclidean Greedy Drawings of Trees
,
Discrete and Computational Geometry, volume 58, number 3, pages 543–579, 2017.
[bibtex] [doi]
[94]Progress on Partial Edge Drawings
, , , , , ,
J. Graph Algorithms Appl., volume 21, number 4, pages 757–786, 2017.
[bibtex] [doi]
[93]Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd
, , , , , ,
Chapter in Evaluation in the Crowd. Crowdsourcing and Human-Centered Experiments (Daniel Archambault, Helen Purchase, Tobias Hoßfeld, eds.), volume 10264 of LNCS, pages 6–26, 2017, Springer International Publishing.
[bibtex] [doi]
[92]Minimizing crossings in constrained two-sided circular graph layouts
,
European Workshop on Computational Geometry (EuroCG'17), pages 265–268, April 2017.
[bibtex] [pdf]
[91]Radial Contour Labeling with Straight Leaders
, ,
IEEE Pacific Visualization Symposium (PacificVis'17), pages 295–304, 2017.
[bibtex] [pdf] [doi]
2016
[90]On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
, ,
J. Computational Geometry, volume 7, number 1, pages 47–69, 2016.
[bibtex] [pdf]
[89]Extending Convex Partial Drawings of Graphs
, ,
Algorithmica, volume 76, number 1, pages 47–67, 2016.
[bibtex] [doi]
[88]Mixed Map Labeling
, ,
J. Spatial Information Science, volume 13, pages 3–32, 2016.
[bibtex] [doi]
[87]Evaluation of Labeling Strategies for Rotating Maps
, ,
ACM J. Experimental Algorithmics, volume 21, number 1, pages 1.4:1–1.4:21, 2016.
[bibtex] [pdf] [doi]
[86]Consistent Labeling of Rotating Maps
, ,
J. Computational Geometry, volume 7, number 1, pages 308–331, 2016.
[bibtex] [pdf]
[85]Strict Confluent Drawing
, , , , ,
J. Computational Geometry, volume 7, number 1, pages 22–46, 2016.
[bibtex] [pdf]
[84]Adjacency-Preserving Spatial Treemaps
, , , ,
J. Computational Geometry, volume 7, number 1, pages 100-122, 2016.
[bibtex] [pdf]
[83]Software Visualization via Hierarchic Micro/Macro Layouts
, ,
Information Visualization Theory and Applications (IVAPP'16) (Lars Linsen, Alexandru C. Telea, eds.), pages 153–160, 2016, SciTePress.
[bibtex] [doi]
[82]An Algorithmic Framework for Labeling Road Maps
,
Geographic Information Science (GIScience '16) (Jennifer A. Miller, David O'Sullivan, Nancy Wiegand, eds.), volume 9927 of LNCS, pages 308–322, 2016, Springer International Publishing.
[bibtex] [pdf] [doi]
[81]Temporal Map Labeling: A New Unified Framework with Experiments
, , ,
Advances in Geographic Information Systems (SIGSPATIAL'16), pages 23:1–23:10, 2016.
[bibtex] [pdf] [doi]
2015
[80]Multi-Row Boundary-Labeling Algorithms for Panorama Images
, ,
ACM Trans. Spatial Algorithms and Systems, volume 1, number 1, pages 1:1–1:30, 2015.
[bibtex] [pdf] [doi]
[79]Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052)
, , ,
Dagstuhl Reports, volume 5, number 1, pages 243–258, 2015.
[bibtex] [pdf] [doi]
[78]Many-to-One Boundary Labeling with Backbones
, , , , , , ,
J. Graph Algorithms Appl., volume 19, number 3, pages 779–816, 2015.
[bibtex] [pdf] [doi]
[77]Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
, ,
Algorithms and Computation (ISAAC'15) (Khaled Elbassioni, Kazuhisa Makino, eds.), volume 9472 of LNCS, pages 637–649, 2015, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[76]Drawing Large Graphs by Multilevel Maxent-Stress Optimization
, ,
Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 30–43, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[75]Towards Realistic Flow Control in Power Grid Operation
, , , ,
Energy Informatics (EI'15) (Sebastian Gottwalt, Lukas König, Hartmut Schmeck, eds.), volume 9424 of LNCS, pages 192–199, 2015, Springer International Publishing.
[bibtex] [doi]
[74]Mixed Map Labeling
, ,
Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 339–351, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[73]Operating Power Grids with Few Flow Control Buses
, , , , , , ,
Future Energy Systems (e-Energy'15), pages 289–294, 2015, ACM.
[bibtex] [pdf] [doi]
[72]Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem
, ,
Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 231–244, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[71]On Minimizing Crossings in Storyline Visualizations
, , , ,
Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 192–198, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[70]Recognizing Weighted Disk Contact Graphs
, ,
Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 433–446, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[69]Label Placement in Road Maps
, ,
Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 221–234, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[68]On the Readability of Boundary Labeling
, , ,
Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 515–527, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[67]Towards Realistic Pedestrian Route Planning
, , , ,
Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'15) (Giuseppe F. Italiano, Marie Schmidt, eds.), volume 48 of OpenAccess Series in Informatics (OASIcs), pages 1–15, 2015, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
2014
[66]On d-regular schematization of embedded paths
, , , ,
Comput. Geom. Theory Appl., volume 47, number 3A, pages 381–406, 2014.
[bibtex] [doi]
[65]Scalability Considerations for Multivariate Graph Visualization
, , , , , ,
Chapter in Multivariate Network Visualization (Andreas Kerren, Helen C. Purchase, Matthew O. Ward, eds.), volume 8380 of LNCS, pages 207–235, 2014, Springer International Publishing.
[bibtex] [doi]
[64]A survey on automated metro map layout methods

Schematic Mapping Workshop, apr 2014.
[bibtex] [pdf]
[63]On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
, ,
Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 476–487, 2014, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[62]Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams
, ,
Algorithm Theory (SWAT'14) (R. Ravi, I. L. Gørtz, eds.), volume 8503 of LNCS, pages 253–264, 2014, Springer International Publishing.
[bibtex] [doi]
[61]Evaluation of Labeling Strategies for Rotating Maps
, ,
Experimental Algorithms (SEA'14) (Joachim Gudmundsson, J. Katajainen, eds.), volume 8504 of LNCS, pages 235–246, 2014, Springer International Publishing.
[bibtex] [pdf] [doi]
[60]PIGRA – A Tool for Pixelated Graph Representations
, , ,
Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 513–514, 2014, Springer Berlin Heidelberg.
Note: Poster abstract
[bibtex] [pdf]
[59]Semantic Word Cloud Representations: Hardness and Approximation Algorithms
, , , , , , , , ,
Theoretical Informatics (LATIN'14) (Alfredo Viola, ed.), volume 8392 of LNCS, pages 514–525, 2014, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[58]Simultaneous Embeddability of Two Partitions
, ,
Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 64–75, 2014, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
2013
[57]Edge-weighted contact representations of planar graphs
, ,
J. Graph Algorithms Appl., volume 17, number 4, pages 441–473, 2013.
[bibtex] [doi]
[56]Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151)
, ,
Dagstuhl Reports, volume 3, number 4, pages 34–68, 2013.
[bibtex] [pdf] [doi]
[55]Optimal 3D Angular Resolution for Low-Degree Graphs
, , ,
J. Graph Algorithms Appl., volume 17, number 3, pages 173–200, 2013.
[bibtex] [doi]
[54]Drawing Trees with Perfect Angular Resolution and Polynomial Area
, , , ,
Discrete and Computational Geometry, volume 49, number 2, pages 157–182, 2013.
[bibtex] [doi]
[53]On The Usability of Lombardi Graph Drawings
, , ,
Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 451–462, 2013, Springer Berlin Heidelberg.
[bibtex] [doi]
[52]Edge-weighted contact representations of planar graphs
, ,
Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 224–235, 2013, Springer Berlin Heidelberg.
[bibtex] [doi]
[51]Euclidean Greedy Drawings of Trees
,
Algorithms (ESA'13) (H. L. Bodlaender, G. F. Italiano, eds.), volume 8125 of LNCS, pages 767–778, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[50]Drawing Planar Graphs with a Prescribed Inner Face
, ,
Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 316–327, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[49]Planar Lombardi Drawings of Outerpaths
,
Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 561–562, 2013, Springer Berlin Heidelberg.
Note: Poster abstract
[bibtex] [doi]
[48]Circular-Arc Cartograms
, ,
IEEE Pacific Visualization Symposium (PacificVis'13), pages 1–8, 2013, IEEE.
[bibtex] [pdf] [doi]
[47]Trajectory-Based Dynamic Map Labeling
, ,
Algorithms and Computation (ISAAC'13) (Leizhen Cai, Siu-Wing Cheng, Tak-Wah Lam, eds.), volume 8283 of LNCS, pages 413–423, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[46]Drawing Metro Maps using Bézier Curves
, , , , ,
Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 463–474, 2013, Springer Berlin Heidelberg.
[bibtex] [doi]
[45]Strict Confluent Drawing
, , , , ,
Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 352–363, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[44]Progress on Partial Edge Drawings
, , , , , ,
Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 67–78, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[43]Many-to-One Boundary Labeling with Backbones
, , , , , , ,
Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 244–255, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[42]Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
, , , , ,
Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 460–471, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[41]Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor
, , ,
Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 553–554, 2013, Springer Berlin Heidelberg.
Note: Poster abstract
[bibtex] [doi]
2012
[40]Lombardi Drawings of Graphs
, , , ,
J. Graph Algorithms Appl., volume 16, number 1, pages 85–108, 2012.
[bibtex] [doi]
[39]Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
, , , , ,
Computer Vision and Image Understanding, volume 116, number 7, pages 803–814, 2012.
[bibtex] [doi]
[38]Drawing (Complete) Binary Tanglegrams
, , , , , ,
Algorithmica, volume 62, number 1–2, pages 309–332, 2012.
[bibtex] [doi]
[37]Cover Contact Graphs
, , , , , , , , , , , , ,
J. Computational Geometry, volume 3, number 1, pages 102–131, 2012.
[bibtex] [pdf]
2011
[36]Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
,
IEEE Trans. Visualization and Computer Graphics, volume 17, number 5, pages 626-641, 2011.
[bibtex] [doi]
[35]Connecting Two Trees with Optimal Routing Cost
, , , , , ,
Canadian Conference on Computational Geometry (CCCG '11), pages 43–47, 2011, University of Toronto.
[bibtex] [pdf]
[34]Sliding Labels for Dynamic Point Labeling
, ,
Canadian Conference on Computational Geometry (CCCG '11), pages 205–210, 2011, University of Toronto.
[bibtex] [pdf]
[33]Consistent Labeling of Rotating Maps
, ,
Algorithms and Data Structures (WADS'11) (Frank Dehne, John Iacono, Jörg-Rüdiger Sack, eds.), volume 6844 of LNCS, pages 451–462, 2011, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[32]On d-regular Schematization of Embedded Paths
, , ,
Theory and Practice of Computer Science (SOFSEM'11), volume 6543 of LNCS, pages 260–271, 2011, Springer Berlin Heidelberg.
[bibtex] [doi]
[31]Automatic Generation of Route Sketches
, , ,
Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 391–392, 2011, Springer Berlin Heidelberg.
Note: Poster abstract
[bibtex] [doi]
[30]Boundary-Labeling Algorithms for Panorama Images
, ,
Advances in Geographic Information Systems (SIGSPATIAL'11), pages 289–298, 2011, ACM.
[bibtex] [pdf] [doi]
[29]Optimal 3D Angular Resolution for Low-Degree Graphs
, , ,
Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 208-219, 2011, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[28]Lombardi Drawings of Graphs
, , , ,
Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 195–207, 2011, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[27]Drawing Trees with Perfect Angular Resolution and Polynomial Area
, , , ,
Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 183–194, 2011, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[26]Adjacency-Preserving Spatial Treemaps
, , , ,
Algorithms and Data Structures (WADS'11) (Frank Dehne, John Iacono, Jörg-Rüdiger Sack, eds.), volume 6844 of LNCS, pages 159–170, 2011, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
2010
[25]Optimizing Active Ranges for Consistent Dynamic Map Labeling
, , ,
Comput. Geom. Theory Appl., volume 43, number 3, pages 312–328, 2010.
[bibtex] [doi]
[24]Boundary Labeling with Octilinear Leaders
, , ,
Algorithmica, volume 57, pages 436–461, 2010.
[bibtex] [doi]
[23]Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexität

Chapter in Ausgezeichnete Informatikdissertationen 2009 (Steffen Hölldobler, ed.), volume D-10 of Lecture Notes in Informatics (LNI), 2010, Gesellschaft für Informatik e.V. (GI).
[bibtex]
[22]Dynamic One-Sided Boundary Labeling
, ,
Advances in Geographic Information Systems (SIGSPATIAL'10), pages 310–319, 2010, ACM.
[bibtex] [pdf] [doi]
[21]An Improved Algorithm for the Metro-Line Crossing Minimization Problem

Graph Drawing (GD'09) (David Eppstein, Emden R. Gansner, eds.), volume 5849 of LNCS, pages 381–392, 2010, Springer Berlin Heidelberg.
[bibtex] [doi]
[20]Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling
,
Canadian Conference on Computational Geometry (CCCG '10), pages 203–206, 2010, University of Manitoba.
[bibtex] [pdf]
[19]Path Schematization for Route Sketches
, , ,
Algorithm Theory (SWAT'10) (H. Kaplan, ed.), volume 6139 of LNCS, pages 285–296, 2010, Springer Berlin Heidelberg.
[bibtex] [doi]
2009
[18]Consistent Digital Rays
, , ,
Discrete and Computational Geometry, volume 42, number 3, pages 359–378, 2009.
[bibtex] [doi]
[17]Algorithms for Multi-Criteria Boundary Labeling
, , ,
J. Graph Algorithms Appl., volume 13, number 3, pages 289-317, 2009.
[bibtex] [doi]
[16]Drawing Binary Tanglegrams: An Experimental Evaluation
, , ,
Algorithm Engineering and Experiments (ALENEX'09) (Irene Finocchi, John Hershberger, eds.), pages 106–119, 2009, SIAM.
[bibtex] [pdf] [doi]
[15]Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
, , , , , ,
Graph Drawing (GD'08) (Ioannis G. Tollis, Maurizio Patrignani, eds.), volume 5417 of LNCS, pages 324–335, 2009, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[14]Network Visualization: Algorithms, Applications, and Complexity

feb 2009, PhD thesis, Fakultät für Informatik, Universität Karlsruhe (TH).
[bibtex] [pdf]
2008
[13]Morphing Polylines: A Step Towards Continuous Generalization
, , ,
Computers, Environment and Urban Systems, volume 32, number 4, pages 248–260, 2008.
[bibtex] [doi]
[12]Consistent Digital Rays
, , ,
Computational Geometry (SoCG'08), pages 355–364, 2008, ACM.
[bibtex] [pdf] [doi]
[11]Optimizing Active Ranges for Consistent Dynamic Map Labeling
, , ,
Computational Geometry (SoCG'08), pages 10–19, 2008, ACM.
[bibtex] [pdf] [doi]
[10]Boundary Labeling with Octilinear Leaders
, , ,
Algorithm Theory (SWAT'08) (Joachim Gudmundsson, ed.), volume 5124 of LNCS, pages 234–245, 2008, Springer Berlin Heidelberg.
[bibtex] [doi]
[9]Algorithms for Multi-Criteria One-Sided Boundary Labeling
, , ,
Graph Drawing (GD'07) (Seok-Hee Hong, Takao Nishizeki, eds.), volume 4875 of LNCS, pages 243–254, 2008, Springer Berlin Heidelberg.
[bibtex] [doi]
[8]Cover Contact Graphs
, , , , , , , , , , , , ,
Graph Drawing (GD'07) (Seok-Hee Hong, Takao Nishizeki, eds.), volume 4875 of LNCS, pages 171–182, 2008, Springer Berlin Heidelberg.
[bibtex] [doi]
2007
[7]Geographic Visualization

Chapter in Human-Centered Visualization Environments (Andreas Kerren, Achim Ebert, Joerg Meyer, eds.), volume 4417 of LNCS, pages 257-294, 2007, Springer Berlin Heidelberg.
[bibtex] [doi]
[6]Improved Algorithms for Length-Minimal One-Sided Boundary Labeling
,
European Workshop on Computational Geometry (EuroCG'07), pages 190–193, mar 2007.
[bibtex]
[5]Morphing Polygonal Lines: A Step Towards Continuous Generalization
, , ,
Geographic Information Science Research Conference UK (GISRUK'07) (Adam Winstanley, ed.), pages 390–399, 2007.
[bibtex] [pdf]
[4]Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps
, , ,
Graph Drawing (GD'06) (M. Kaufmann, D. Wagner, eds.), volume 4372 of LNCS, pages 270-281, 2007, Springer-Verlag.
[bibtex] [doi]
2006
[3]A Mixed-Integer Program for Drawing High-Quality Metro Maps
,
Graph Drawing (GD'05) (Patrick Healy, Nikola S. Nikolov, eds.), volume 3843 of LNCS, pages 321–333, 2006, Springer Berlin Heidelberg.
[bibtex] [doi]
2005
[2]Automated Drawing of Metro Maps

AUG 2005, Master's thesis, Fakultät für Informatik, Universität Karlsruhe (TH).
[bibtex] [pdf]
2004
[1]Validation in the Cluster Analysis of Gene Expression Data
,
Workshop Fuzzy-Systeme und Computational Intelligence (R. Mikut, M. Reischl, eds.), pages 13-32, NOV 2004, Universitätsverlag Karlsruhe.
[bibtex] [pdf]