Publications (chronologically)
- $d$-planar
- (weak)_line_cover_number
- (weak)_plane_cover_number
- 2D
- 3-connected_planar_graphs
- 3-regular_graphs
- 3D
- APX-hard
- Approximation_Algorithms
- C++
- ChordLink
- Computational_Geometry
- FPT
- Focus+context_techniques
- GIS
- Geometric_topology
- Graph_Drawing
- Hybrid_representation
- Information_visualization
- L-drawings
- Manhattan_distance
- Minimum_Manhattan_Network
- Monte-Carlo_algorithm
- NP-hard
- NP-hardness
- Ordered_graphs
- Standard_Template_Library
- Steiner_trees
- Sugiyama_framework
- VLSI_layout
- [ 2025 ]
- [ 2024 ]
- [ 2023 ]
- [ 2022 ]
- [ 2021 ]
- [ 2020 ]
- [ 2019 ]
- [ 2018 ]
- [ 2017 ]
- [ 2016 ]
- [ 2015 ]
- [ 2014 ]
- [ 2013 ]
- [ 2012 ]
- [ 2011 ]
- [ 2010 ]
- [ 2009 ]
- [ 2008 ]
- [ 2007 ]
- [ 2006 ]
- [ 2005 ]
- [ 2004 ]
- [ 2003 ]
- [ 2002 ]
- [ 2001 ]
- [ 2000 ]
- [ 1999 ]
- [ 1998 ]
- [ 1997 ]
- [ 1996 ]
- [ 1995 ]
2025[ to top ]
-
Outside-Obstacle Representations with All Vertices on the Outer Face. . Computing in Geometry and Topology, 4(1), pp. 2:1–2:21. 2025.
-
Recognizing 2-Layer and Outer k-Planar Graphs. . In Proc. 41st Annu. Sympos. Comput. Geom. (SoCG’25), of LIPIcs, O. Aichholzer, H. Wang (eds.). Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025.
-
Minimum Monotone Spanning Trees. . In Proc. 51st Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’25), Vol. 15538 of Lecture Notes in Computer Science, R. Královič, V. Kůrková (eds.), pp. 1–16. Springer-Verlag, 2025.
2024[ to top ]
-
Graph Harvester. . In Proc. 32nd Int. Symp. Graph Drawing & Network Vis. (GD’24), Vol. 320 of LIPIcs, S. Felsner, K. Klein (eds.), pp. 58:1–3. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024.
-
Adjacency Graphs of Polyhedral Surfaces. . Discrete & Computational Geometry, 71, pp. 1429–1455. 2024.
-
Storylines with a Protagonist. . In Proc. 32nd Int. Symp. Graph Drawing & Network Vis. (GD’24), Vol. 320 of LIPIcs, S. Felsner, K. Klein (eds.), pp. 26:1–22. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024.
-
The Price of Upwardness. . In Proc. 32nd Int. Symp. Graph Drawing & Network Vis. (GD’24), Vol. 320 of LIPIcs, S. Felsner, K. Klein (eds.), pp. 13:1–20. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024.
-
Constrained and Ordered Level Planarity Parameterized by the Number of Levels. . In Proc. 40th Annu. Sympos. Comput. Geom. (SoCG’24), Vol. 293 of LIPIcs, W. Mulzer, J. M. Phillips (eds.), pp. 21:1–16. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024.
-
Morphing Graph Drawings in the Presence of Point Obstacles. . In Proc. 50th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’24), Vol. 14519 of Lecture Notes in Computer Science, H. Fernau, S. Gaspers, R. Klasing (eds.), pp. 240–254. Springer-Verlag, 2024.
-
Outerplanar and Forest Storyplans. . In Proc. 50th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’24), Vol. 14519 of Lecture Notes in Computer Science, H. Fernau, S. Gaspers, R. Klasing (eds.), pp. 211–225. Springer-Verlag, 2024.
-
Bounding the Treewidth of Outer k-Planar Graphs via Triangulations. . In Proc. 32nd Int. Symp. Graph Drawing & Network Vis. (GD’24), Vol. 320 of LIPIcs, S. Felsner, K. Klein (eds.), pp. 14:1–17. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024.
-
Bounding and Computing Obstacle Numbers of Graphs. . SIAM Journal of Discrete Mathematics, 38(2), pp. 1537–1565. 2024.
-
Eliminating Crossings in Ordered Graphs. . In Proc. 19th Scand. Symp. Algorithm Theory (SWAT’24), Vol. 294 of LIPIcs, H. Bodlaender (ed.), pp. 1:1–19. Schloss Dagstuhl – Leibniz-Institut für Informatik, 2024.
2023[ to top ]
-
Coloring and Recognizing Mixed Interval Graphs. . In Proc. 34th Annu. Int. Symp. Algorithms Comput. (ISAAC’23), Vol. 283 of LIPIcs, S. Iwata, N. Kakimura (eds.), pp. 36:1–14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023.
-
Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. . In Proc. 49th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’23), Vol. 13878 of Lecture Notes in Computer Science, L. Gąsieniec (ed.), pp. 96–110. Springer-Verlag, 2023.
-
Planar L-Drawings of Directed Graphs. . Computing in Geometry and Topology, 2(1), pp. 7:1–7:15. 2023.
-
Morphing Rectangular Duals. . In Proc. 30th Int. Symp. Graph Drawing & Network Vis. (GD’22), Vol. 13764 of Lecture Notes in Computer Science, P. Angelini, R. von Hanxleden (eds.), pp. 389–403. Springer-Verlag, 2023.
-
Coloring Mixed and Directional Interval Graphs. . In Proc. 30th Int. Symp. Graph Drawing & Network Vis. (GD’22), Vol. 13764 of Lecture Notes in Computer Science, P. Angelini, R. von Hanxleden (eds.), pp. 418–431. Springer-Verlag, 2023.
-
Morphing Planar Graph Drawings Through 3D. . In Proc. 49th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’23), Vol. 13878 of Lecture Notes in Computer Science, L. Gąsieniec (ed.), pp. 80–95. Springer-Verlag, 2023.
-
Outside-Obstacle Representations with All Vertices on the Outer Face. . In Proc. 30th Int. Symp. Graph Drawing & Network Vis. (GD’22), Vol. 13764 of Lecture Notes in Computer Science, P. Angelini, R. von Hanxleden (eds.), pp. 432–440. Springer-Verlag, 2023.
-
The Parametrized Complexity of the Segment Number. . In Proc. 31st Int. Symp. Graph Drawing & Network Vis. (GD’23), Vol. 14466 of Lecture Notes in Computer Science, M. Bekos, M. Chimani (eds.), pp. 97–113. Springer-Verlag, 2023.
-
Morphing Planar Graph Drawings Through 3D. . Computing in Geometry and Topology, 2(1), pp. 5:1–5:18. 2023.
-
The Computational Complexity of the ChordLink Model. . Journal of Graph Algorithms & Applications, 27(9), pp. 759–767. 2023.
-
Parameterized Approaches to Orthogonal Compaction. . In Proc. 49th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’23), Vol. 13878 of Lecture Notes in Computer Science, L. Gąsieniec (ed.), pp. 111–128. Springer-Verlag, 2023.
-
The Complexity of Finding Tangles. . In Proc. 49th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’23), Vol. 13878 of Lecture Notes in Computer Science, L. Gąsieniec (ed.), pp. 3–17. Springer-Verlag, 2023.
-
A Simple Pipeline for Orthogonal Graph Drawing. . In Proc. 31st Int. Symp. Graph Drawing & Network Vis. (GD’23), Vol. 14466 of Lecture Notes in Computer Science, M. Bekos, M. Chimani (eds.), pp. 170–186. Springer-Verlag, 2023.
-
The Complexity of Drawing Graphs on Few Lines and Few Planes. . Journal of Graph Algorithms & Applications, 27(6), pp. 459–488. 2023.
2022[ to top ]
-
Bounding and Computing Obstacle Numbers of Graphs. . In Proc. 30th Europ. Symp. Algorithms (ESA’22), Vol. 244 of LIPIcs, S. Chechik, G. Navarro, E. Rotenberg, G. Herman (eds.), pp. 11:1–13. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022.
-
Algorithms for Floor Planning with Proximity Requirements. . In Proc. CAAD Future 2021, Vol. 1465 of CCIS, D. J. Gerber, A. Nahmad, B. Bogosian, E. Pantazis, C. Miltiadis (eds.), pp. 151–171. Springer-Verlag, 2022.
-
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. . In Proc. 48th Int. Workshop Graph-Theoretic Concepts Comput. Sci. (WG’22), Vol. 13453 of Lecture Notes in Computer Science, M. Bekos, M. Kaufmann (eds.), p. 16 pages. Springer-Verlag, 2022.
-
Simple Algorithms for Partial and Simultaneous Rectangular Duals with Given Contact Orientations. . Theoretical Computer Science, 919, pp. 66–74. 2022.
-
Minimum Rectilinear Polygons for Given Angle Sequences. . Computational Geometry: Theory and Applications, 100(101820), pp. 1–39. 2022.
-
The Computational Complexity of the ChordLink Model. . In Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22), E. Di Giacomo, F. Montecchiani (eds.), pp. 10:1–7. 2022.
-
Layered Drawing of Undirected Graphs with Generalized Port Constraints. . Computational Geometry: Theory and Applications, 105--106(101886), pp. 1–29. 2022.
2021[ to top ]
-
ClusterSets: Optimizing Planar Clusters in Categorical Point Data. . Comput. Graphics Forum, 40(3), pp. 471–481. 2021.
-
Adjacency Graphs of Polyhedral Surfaces. . In Proc. 37th Annu. Sympos. Comput. Geom. (SoCG’21), Vol. 189 of LIPIcs, K. Buchin, Éric Colin de Verdière (eds.), pp. 11:1–17. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021.
-
Extending Partial Representations of Rectangular Duals with Given Contact Orientations. . In Proc. 12th International Conference on Algorithms and Complexity (CIAC’21), Vol. 12701 of Lecture Notes in Computer Science, T. Calamoneri, F. Coró (eds.), pp. 340–353. Springer-Verlag, 2021.
-
Using the Metro-Map Metaphor for Drawing Hypergraphs. . In Proc. 47th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’21), Vol. 12607 of Lecture Notes in Computer Science, T. Bureš, R. Dondi, J. Gamper, G. Guerrini, T. Jurdziński, C. Pahl, F. Sikora, P. Wong (eds.), pp. 361–372. Springer-Verlag, 2021.
-
Layered Drawing of Undirected Graphs with Generalized Port Constraints. . In Proc. 28th Int. Symp. Graph Drawing & Network Vis. (GD’20), Vol. 12590 of Lecture Notes in Computer Science, D. Auber, P. Valtr (eds.), pp. 220–234. Springer-Verlag, 2021.
-
Angle Covers: Algorithms and Complexity. . Journal of Graph Algorithms & Applications, 25(2), pp. 643–661. 2021.
2020[ to top ]
-
Angle Covers: Algorithms and Complexity. . In Proc. 14th Int. Workshop Algorithms Comput. (WALCOM’20), Vol. 12049 of Lecture Notes in Computer Science, S. Rahman, K. Sadakane, W.-K. Sung (eds.), pp. 94–106. Springer-Verlag, 2020.
-
Stick Graphs with and without Length Constraints. . Journal of Graph Algorithms & Applications, 24(4), pp. 657–681. 2020.
-
Bundled Crossings Revisited. . Journal of Graph Algorithms & Applications, 24(4), pp. 621–655. 2020.
-
Drawing Graphs with Circular Arcs and Right-Angle Crossings. . In Proc. 17th Scand. Symp. and Workshops on Algorithm Theory (SWAT’20), Vol. 162 of LIPIcs, S. Albers (ed.), pp. 21:1–14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020.
-
Drawing Graphs on Few Lines and Few Planes. . Journal of Computational Geometry, 11(1), pp. 433–475. 2020.
-
Finding Optimal Sequences for Area Aggregation---A* vs. Integer Linear Programming. . ACM Transactions on Spatial Algorithms and Systems, 7(1). 2020.
2019[ to top ]
-
Drawing Graphs on Few Circles and Few Spheres. . Journal of Graph Algorithms & Applications, 23(2), pp. 371–391. 2019.
-
Survey on Graph and Hypergraph Drawing. . M. Löffler; A. Lubiw; S. Schleimer; E. M. W. Chambers (eds.), pp. 87–89. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019.
-
Variants of the Segment Number of a Graph. . In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 430–443. Springer-Verlag, 2019.
-
Bundled Crossings Revisited. . In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 63–77. Springer-Verlag, 2019.
-
Multi-Level Steiner Trees. . ACM J. Exp. Algorithmics, 24(1), pp. 2.5:1–2.5:22. 2019.
-
Stick Graphs with Length Constraints. . In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 3–17. Springer-Verlag, 2019.
-
On Arrangements of Orthogonal Circles. . In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 216–229. Springer-Verlag, 2019.
-
Line and Plane Cover Numbers Revisited. . In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 409–415. Springer-Verlag, 2019.
-
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. . Computational Geometry: Theory and Applications, 84, pp. 50–68. 2019.
-
Representing Graphs and Hypergraphs by Touching Polygons in 3D. . In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 18–32. Springer-Verlag, 2019.
-
Visual Analytics for Sets over Time and Space. . In Vol. 9, pp. 31–57. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019.
-
Computing Optimal-Height Tangles Faster. . In Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Vol. 11904 of Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (eds.), pp. 203–215. Springer-Verlag, 2019.
2018[ to top ]
-
On the Maximum Crossing Number. . Journal of Graph Algorithms & Applications, 22(1), pp. 67–87. 2018.
-
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. . In Proc. 26th Int. Symp. Graph Drawing & Network Vis. (GD’18), Vol. 11282 of Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.), pp. 509–523. Springer-Verlag, 2018.
-
Stabbing Rectangles by Line Segments – How Decomposition Reduces the Shallow-Cell Complexity. . In Proc. 29th Annu. Int. Symp. Algorithms Comput. (ISAAC’18), Vol. 123 of LIPIcs, W.-L. Hsu, D.-T. Lee, C.-S. Liao (eds.), pp. 61:1–13. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018.
-
Drawing Graphs on Few Circles and Few Spheres. . In Proc. 4th Conf. Algorithms & Discrete Appl. Math. (CALDAM’18), Vol. 10743 of Lecture Notes in Computer Science, B. S. Panda, P. P. Goswami (eds.), pp. 164–178. Springer-Verlag, 2018.
-
Beyond Outerplanarity. . In Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17), Vol. 10692 of Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.), pp. 546–559. Springer-Verlag, 2018.
-
On the Maximum Crossing Number. . In Proc. 28th Int. Workshop Combin. Algorithms (IWOCA’17), Vol. 10765 of Lecture Notes in Computer Science, L. Brankovic, J. Ryan, B. Smith (eds.), pp. 61–74. Springer-Verlag, 2018.
-
Computing Storylines with Few Block Crossings. . In Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17), Vol. 10692 of Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.), pp. 365–378. Springer-Verlag, 2018.
-
Approximating the Generalized Minimum Manhattan Network Problem. . Algorithmica, 80(4), pp. 1170–1190. 2018.
-
On the Weak Line Cover Numbers. . In Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18), M. Korman, W. Mulzer (eds.), pp. 63:1–5. 2018.
-
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. . In Proc. 26th Int. Symp. Graph Drawing & Network Vis. (GD’18), Vol. 11282 of Lecture Notes in Computer Science, T. Biedl, A. Kerren (eds.), pp. 137–151. Springer-Verlag, 2018.
-
Planar L-Drawings of Directed Graphs. . In Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17), Vol. 10692 of Lecture Notes in Computer Science, F. Frati, K.-L. Ma (eds.), pp. 465–478. Springer-Verlag, 2018.
-
Multi-Level Steiner Trees. . In Proc. 17th Int. Symp. Exper. Algorithms (SEA’18), Vol. 103 of LIPIcs, G. D’Angelo (ed.), pp. 15:1–14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018.
2017[ to top ]
-
Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling. . International Journal of Geo-Information, 6(11), p. article 342, 20 pages. 2017.
-
The Complexity of Drawing Graphs on Few Lines and Few Planes. . In Proc. Algorithms Data Struct. Symp. (WADS’17), Vol. 10389 of Lecture Notes in Computer Science, F. Ellen, A. Kolokolova, J.-R. Sack (eds.), pp. 265–276. Springer-Verlag, 2017.
-
Block Crossings in Storyline Visualizations. . Journal of Graph Algorithms & Applications, 21(5), pp. 873–913. 2017.
-
Improved Approximation Algorithms for Box Contact Representations. . Algorithmica, 77(3), pp. 902–920. 2017.
-
Algorithmically-Guided User Interaction. . In Proc. 25th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’17), E. Hoel, S. D. Newsam, S. Ravada, R. Tamassia, G. Trajcevski (eds.), pp. 11:1–4. 2017.
-
Using the A* Algorithm to Find Optimal Sequences for Area Aggregation. . In Proc. 28th Int. Cartogr. Conf. (ICC’17) -- Advances in Cartogr. & GIScience, of Lect. Notes Geoinform. Cartogr., M. P. Peterson (ed.), pp. 389–404. Springer-Verlag, 2017.
-
Progress on Partial Edge Drawings. . Journal of Graph Algorithms & Applications, 21(4), pp. 757–786. 2017.
2016[ to top ]
-
Multi-Sided Boundary Labeling. . Algorithmica, 76(1), pp. 225–258. 2016.
-
Drawing Graphs on Few Lines and Few Planes. . In Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Vol. 9801 of Lecture Notes in Computer Science, Y. Hu, M. Nöllenburg (eds.), pp. 166–180. Springer-Verlag, 2016.
-
Matching Labels and Markers in Historical Maps: An Algorithm with Interactive Postprocessing. . ACM Transactions on Spatial Algorithms and Systems, 2(4), pp. 13:1–24. 2016.
-
Snapping Graph Drawings to the Grid Optimally. . In Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Vol. 9801 of Lecture Notes in Computer Science, Y. Hu, M. Nöllenburg (eds.), pp. 144–151. Springer-Verlag, 2016.
-
Beyond Maximum Independent Set: An Extended Model for Point-Feature Label Placement. . In Proc. ISPRS (Commission II, WG II/2), Vol. XLI-B2, pp. 109–114. 2016.
-
Continuous Generalization of Administrative Boundaries Based on Compatible Triangulations. . In Proc. 19th AGILE Conference on Geographic Information Science – Geospatial Data in a Changing World, of Lect. Notes Geoinf. Cartogr., T. Sarjakoski, M. Y. Santos, L. T. Sarjakoski (eds.), pp. 399–415. Springer-Verlag, 2016.
-
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. . Algorithms, 9(3), p. article 53, 17 pages. 2016.
-
Räumliche Analyse durch kombinatorische Optimierung. . In Handbuch der Geodäsie (6 Bände), W. Freeden, R. Rummel (eds.), pp. 1–39. Springer Berlin Heidelberg, 2016.
-
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. . Journal of Graph Algorithms & Applications, 20(1), pp. 133–158. 2016.
-
Minimum Rectilinear Polygons for Given Angle Sequences. . In Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCGG’16), Vol. 9943 of Lecture Notes in Computer Science, J. Akiyama, H. Ito, T. Sakai (eds.), pp. 105–119. Springer-Verlag, 2016.
-
Block Crossings in Storyline Visualizations. . In Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Vol. 9801 of Lecture Notes in Computer Science, Y. Hu, M. Nöllenburg (eds.), pp. 382–398. Springer-Verlag, 2016.
-
Obstructing Visibilities with One Obstacle. . In Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Vol. 9801 of Lecture Notes in Computer Science, Y. Hu, M. Nöllenburg (eds.), pp. 295–308. Springer-Verlag, 2016.
2015[ to top ]
-
Labeling Streets Along a Route in Interactive 3D Maps Using Billboards. . In Proc. 18th AGILE Conf. Geogr. Inform. Sci. (AGILE’15), of Lecture Notes in Geoinformation and Cartography, F. Bacao, M. Y. Santos, M. Painho (eds.), pp. 269–287. Springer-Verlag, 2015.
-
Colored Non-Crossing Euclidean Steiner Forest. . In Proc. 26th Annu. Int. Symp. Algorithms Comput. (ISAAC’15), Vol. 9472 of Lecture Notes in Computer Science, K. Elbassioni, K. Makino (eds.), pp. 429–441. Springer-Verlag, 2015.
-
Solving Optimization Problems on Orthogonal Ray Graphs. . In Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCGG’15), p. 2 pp. 2015.
-
Pixel and Voxel Representations of Graphs. . In Proc. 23rd Int. Symp. Graph Drawing & Network Vis. (GD’15), Vol. 9411 of Lecture Notes in Computer Science, E. Di Giacomo, A. Lubiw (eds.), pp. 472–486. Springer-Verlag, 2015.
-
Approximating Minimum Manhattan Networks in Higher Dimensions. . Algorithmica, 71(1), pp. 36–52. 2015.
-
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. . In Proc. 9th Int. Workshop Algorithms Comput. (WALCOM’15), Vol. 8973 of Lecture Notes in Computer Science, M. S. Rahman, E. Tomita (eds.), pp. 222–233. Springer-Verlag, 2015.
-
Ordering Metro Lines by Block Crossings. . Journal of Graph Algorithms & Applications, 19(1), pp. 111–153. 2015.
-
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. . In Proc. 23rd Int. Symp. Graph Drawing & Network Vis. (GD’15), Vol. 9411 of Lecture Notes in Computer Science, E. Di Giacomo, A. Lubiw (eds.), pp. 52–59. Springer-Verlag, 2015.
2014[ to top ]
-
Drawing Graphs within Restricted Area. . In Proc. 22nd Int. Sympos. Graph Drawing (GD’14), Vol. 8871 of Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.), pp. 367–379. Springer-Verlag, 2014.
-
Universal Point Sets for Drawing Planar Graphs with Circular Arcs. . Journal of Graph Algorithms & Applications, 18(3), pp. 313–324. 2014.
-
Luatodonotes: Boundary Labeling for Annotations in Texts. . In Proc. 22nd Int. Sympos. Graph Drawing (GD’14), Vol. 8871 of Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.), pp. 76–88. Springer-Verlag, 2014.
-
Semantic Word Cloud Representations: Hardness and Approximation Algorithms. . In Proc. 11th Latin American Sympos. Theor. Inform. (LATIN’14), Vol. 8392 of Lecture Notes in Computer Science, A. Pardo, A. Viola (eds.), pp. 514–525. Springer-Verlag, 2014.
-
Improved Approximation Algorithms for Box Contact Representations. . In Proc. 22nd Annu. Europ. Symp. Algorithms (ESA’14), Vol. 8737 of Lecture Notes in Computer Science, A. Schulz, D. Wagner (eds.), pp. 87–99. Springer-Verlag, 2014.
-
Labeling Streets in Interactive Maps using Embedded Labels. . In Proc. 22nd ACM SIGSPATIAL Int. Conf. Advances Geogr. Inform. Syst. (ACM-GIS’14), Y. Huang, M. Schneider, M. Gertz, J. Krumm, J. Sankaranarayanan (eds.), pp. 517–520. 2014.
-
On Monotone Drawings of Trees. . In Proc. 22nd Int. Sympos. Graph Drawing (GD’14), Vol. 8871 of Lecture Notes in Computer Science, C. Duncan, A. Symvonis (eds.), pp. 488–500. Springer-Verlag, 2014.
-
Smooth Orthogonal Drawings of Planar Graphs. . In Proc. 11th Latin American Sympos. Theor. Inform. (LATIN’14), Vol. 8392 of Lecture Notes in Computer Science, A. Pardo, A. Viola (eds.), pp. 144–155. Springer-Verlag, 2014.
-
Point Labeling with Sliding Labels in Interactive Maps. . In Proc. 17th AGILE Conf. Geogr. Inform. Sci. (AGILE’14), of Lecture Notes in Geoinformation and Cartography, J. Huerta, S. Schade, C. Granell (eds.), pp. 295–310. Springer-Verlag, 2014.
-
Concentric Metro Maps. . In Proc. Schematic Mapping Workshop (SMW’14). Wivenhoe Park, 2014.
-
Watch Your Data Structures. . In Proc. 22th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK’14), p. 10 pages. Glasgow, 2014.
-
Guest Editors’ Foreword (Special Issue of Selected Papers from the 21st Int. Symp. Graph Drawing). . Journal of Graph Algorithms & Applications, 18(2), pp. 174–175. 2014.
2013[ to top ]
-
Universal Point Sets for Planar Graph Drawings with Circular Arcs. . In Proc. 25th Canadian Conf. Comput. Geom. (CCCG’13), pp. 117–122. Waterloo, ON, Canada, 2013.
-
Proceedings of the 21st International Symposium on Graph Drawing (GD’13). . In Vol. 8242 of Lecture Notes in Computer Science. Springer-Verlag, 2013.
-
Morphing Polylines Based on Least Squares Adjustment. . In Proc. 16th ICA Generalisation Workshop (ICAGW’13). 2013.
-
Progress on Partial Edge Drawings. . In Proc. 20th Int. Sympos. Graph Drawing (GD’12), Vol. 7704 of Lecture Notes in Computer Science, W. Didimo, M. Patrignani (eds.), pp. 67–78. Springer-Verlag, 2013.
-
Optimizing Active Ranges for Point Selection in Dynamic Maps. . In Proc. 16th ICA Generalisation Workshop (ICAGW’13). 2013.
-
Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. . IEEE Transactions on Visualization and Computer Graphics, 19(12), pp. 2326–2335. 2013.
-
Drawing Metro Maps using Bézier Curves. . In Proc. 20th Int. Sympos. Graph Drawing (GD’12), Vol. 7704 of Lecture Notes in Computer Science, W. Didimo, M. Patrignani (eds.), pp. 463–474. Springer-Verlag, 2013.
-
Approximating the Generalized Minimum Manhattan Network Problem. . In Proc. 24th Annu. Int. Symp. Algorithms Comput. (ISAAC’13), Vol. 8283 of Lecture Notes in Computer Science, L. Cai, S.-W. Cheng, T.-W. Lam (eds.), pp. 722–732. Springer-Verlag, 2013.
-
Graph Drawing and Cartography. . In Handbook of Graph Drawing and Visualization, R. Tamassia (ed.), pp. 697–736. CRC Press, Boca Raton, FL, 2013.
-
Two-Sided Boundary Labeling with Adjacent Sides. . In Proc. 13th Int. Algorithms Data Struct. Symp. (WADS’13), Vol. 8037 of Lecture Notes in Computer Science, F. Dehne, R. Solis-Oba, J.-R. Sack (eds.), pp. 463–474. Springer-Verlag, 2013.
2012[ to top ]
-
Algorithms for Labeling Focus Regions. . IEEE Transactions on Visualization and Computer Graphics, 18(12), pp. 2583–2592. 2012.
-
Cover Contact Graphs. . Journal of Computational Geometry, 3(1). 2012.
-
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. . Algorithmica, 62(1--2), pp. 309–332. 2012.
-
Augmenting the Connectivity of Planar and Geometric Graphs. . Journal of Graph Algorithms & Applications, 16(2), pp. 599–628. 2012.
-
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. . In Proc. Workshop Algorithms Comput. (WALCOM’12), Vol. 7157 of Lecture Notes in Computer Science, M. S. Rahman, S.- ichi Nakano (eds.), pp. 186–197. Springer-Verlag, 2012.
-
Putting Data on the Map. . In Vol. 2 of Dagstuhl Reports, pp. 51–76. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2012.
-
Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. . In Proc. 9th Workshop Approx. Online Algorithms (WAOA’11), Vol. 7164 of Lecture Notes in Computer Science, R. Solis-Oba, G. Persiano (eds.), pp. 77–88. Springer-Verlag, 2012.
2011[ to top ]
-
Approximating Minimum Manhattan Networks in Higher Dimensions. . In Proc. 19th Annu. Europ. Symp. on Algorithms (ESA’11), Vol. 6942 of Lecture Notes in Computer Science, C. Demetrescu, M. M. Halldórsson (eds.), pp. 49–60. Springer-Verlag, 2011.
-
Schematization in Cartography, Visualization, and Computational Geometry. . In Vol. 10461 of Dagstuhl Seminar Proceedings. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2011.
-
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming. . IEEE Transactions on Visualization and Computer Graphics, 17(5), pp. 626–641. 2011.
2010[ to top ]
-
Trimming of Graphs, with Application to Point Labeling. . Theory of Computing Systems, 47(3), pp. 613–636. 2010.
-
Manhattan-Geodesic Embedding of Planar Graphs. . In Proc. 17th Int. Sympos. Graph Drawing (GD’09), Vol. 5849 of Lecture Notes in Computer Science, D. Eppstein, E. R. Gansner (eds.), pp. 207–218. Springer-Verlag, 2010.
-
How Alexander the Great Brought the Greeks Together While Inflicting Minimal Damage to the Barbarians. . In Proc. 26th European Workshop Comput. Geom. (EuroCG’10), pp. 73–76. Dortmund, 2010.
-
The Traveling Salesman Problem Under Squared Euclidean Distances. . In Proc. 27th Int. Sympos. Theoretical Aspects Comput. Sci. (STACS’10), J.-Y. Marion, T. Schwentick (eds.), pp. 239–250. Nancy, 2010.
-
Optimal and Topologically Safe Simplification of Building Footprints. . In Proc. 18th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’10), pp. 192–201. 2010.
-
Area aggregation in map generalisation by mixed-integer programming. . International Journal of Geographical Information Science, 24(12), pp. 1871–1897. 2010.
-
Optimizing Active Ranges for Consistent Dynamic Map Labeling. . Computational Geometry: Theory and Applications, 43(3), pp. 312–328. 2010.
-
Computing Large Matchings Fast. . ACM Transactions on Algorithms, 7(1), p. article 1, 21 pages. 2010.
2009[ to top ]
-
Constructability of Trip-lets. . In Proc. 25th European Workshop on Computational Geometry (EuroCG’09), S. Langerman (ed.). 2009.
-
Matching Points with Rectangles and Squares. . Computational Geometry: Theory and Applications, 42(2), pp. 93–108. 2009.
-
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. . In Proc. 16th Int. Sympos. Graph Drawing (GD’08), Vol. 5417 of Lecture Notes in Computer Science, I. G. Tollis, M. Patrignani (eds.), pp. 324–335. Springer-Verlag, 2009.
-
Untangling a Planar Graph. . Discrete & Computational Geometry, 42(4), pp. 542–569. 2009.
-
Constructing Optimal Highways. . International Journal of Foundations of Computer Science, 20(1), pp. 3–23. 2009.
-
Drawing Binary Tanglegrams: An Experimental Evaluation. . In Proc. 11th Workshop Algorithm Engineering and Experiments (ALENEX’09), pp. 106–119. 2009.
-
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. . International Journal of Computational Geometry and Applications, 19(3), pp. 267–288. 2009.
2008[ to top ]
-
Moving Vertices to Make Drawings Plane. . In Proc. 15th Int. Sympos. Graph Drawing (GD’07), Vol. 4875 of Lecture Notes in Computer Science, S.-H. Hong, T. Nishizeki, W. Quan (eds.), pp. 101–112. Springer-Verlag, 2008.
-
Cover Contact Graphs. . In Proc. 15th Int. Sympos. Graph Drawing (GD’07), Vol. 4875 of Lecture Notes in Computer Science, S.-H. Hong, T. Nishizeki, W. Quan (eds.), pp. 171–182. Springer-Verlag, 2008.
-
Optimizing Active Ranges for Consistent Dynamic Map Labeling. . In Proc. 24th Annu. ACM Sympos. Comput. Geom. (SoCG’08), pp. 10–19. 2008.
-
Augmenting the Connectivity of Planar and Geometric Graphs. . In Proc. Int. Conf. Topological Geom. Graph Theory (TGGT’08), Vol. 31 of Electronic Notes in Discrete Mathematics, pp. 53–56. Paris, 2008.
-
Decomposing a Simple Polygon into Pseudo-Triangles and Convex Polygons. . Computational Geometry: Theory and Applications, 41(1--2), pp. 21–30. 2008.
-
Trimming of Graphs, with Application to Point Labeling. . In Proc. 25th Int. Sympos. Theoretical Aspects Comput. Sci. (STACS’08), Vol. 1 of LIPIcs, S. Albers, P. Weil (eds.), pp. 265–276. Bordeaux, 2008.
-
Optimal Simplification of Building Ground Plans. . In Proc. 21st Congress Int. Society Photogrammetry Remote Sensing (ISPRS’08), Technical Commision II/3, Vol. XXXVII, Part B2 of Int. Archives of Photogrammetry, Remote Sensing and Spatial Informat. Sci., pp. 373–378. Beijing, 2008.
-
Untangling a Planar Graph. . In Proc. 34th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’08), Vol. 4910 of Lecture Notes in Computer Science, V. Geffert, J. Karhumäki, A. Bertoni, B. Preneel, P. Návrat, M. Bieliková (eds.), pp. 473–484. Springer-Verlag, 2008.
-
Delineating Boundaries for Imprecise Regions. . Algorithmica, 50(3), pp. 386–414. 2008.
-
Morphing Polylines: A Step Towards Continuous Generalization. . Computers, Environment and Urban Systems, 32(4), pp. 248–260. 2008.
-
Computing Large Matchings Fast. . In Proc. 19th ACM-SIAM Sympos. Discrete Algorithms (SODA’08), pp. 183–192. 2008.
-
Constructing Interference-Minimal Networks. . Computational Geometry: Theory and Applications, 40(3), pp. 179–194. 2008.
-
Constructing the City Voronoi Diagram Faster. . International Journal of Computational Geometry and Applications, 18(4), pp. 275–294. 2008.
2007[ to top ]
-
Straightening Drawings of Clustered Hierarchical Graphs. . In Proc. 33rd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’07), Vol. 4362 of Lecture Notes in Computer Science, J. van Leeuwen, G. F. Italiano, W. van der Hoek, C. Meinel, H. Sack, F. Plášil (eds.), pp. 177–186. Springer-Verlag, 2007.
-
Morphing Polygonal Lines: A Step Towards Continuous Generalization. . In Proc. 15th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK’07), pp. 390–399. Maynooth, Ireland, 2007.
-
Geometric Networks and Metric Space Embeddings. . In Vol. 06481 of Dagstuhl Seminar Proceedings. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2007.
-
Drawing Subway Maps: A Survey. . Informatik – Forschung & Entwicklung, 22(1), pp. 23–44. 2007.
-
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. . Computational Geometry: Theory and Applications, 36(3), pp. 215–236. 2007.
-
Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transport Maps. . In Proc. 14th Int. Sympos. Graph Drawing (GD’06), Vol. 4372 of Lecture Notes in Computer Science, M. Kaufmann, D. Wagner (eds.), pp. 270–281. Springer-Verlag, 2007.
-
Constructing Optimal Highways. . In Proc. 13th Conf. Computing: The Australasian Theory Sympos. (CATS’07), Vol. 65 of Conferences in Research and Practice in Information Technology, B. Jay, J. Gudmundsson (eds.), pp. 7–14. Australian Computer Society, 2007.
-
Configurations with Few Crossings in Topological Graphs. . Computational Geometry: Theory and Applications, 37(2), pp. 104–114. 2007.
-
Morphing Polygonal Lines: A Step Towards Continuous Generalization. . In Proc. 23rd European Workshop on Computational Geometry (EWCG’07), O. Aichholzer, T. Hackl (eds.), pp. 6–9. Graz, 2007.
2006[ to top ]
-
Matching Points with Rectangles and Squares. . In Proc. 32nd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’06), Vol. 3831 of Lecture Notes in Computer Science, J. Wiedermann, J. Stuller, G. Tel, J. Pokorný, M. Bieliková (eds.), pp. 177–186. Springer-Verlag, 2006.
-
Farthest-Point Queries with Geometric and Combinatorial Constraints. . Computational Geometry: Theory and Applications, 33(3), pp. 174–185. 2006.
-
Generalization of Land Cover Maps by Mixed Integer Programming. . In Proc. 14th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’06), pp. 75–82. 2006.
-
A Mixed-Integer Program for Drawing High-Quality Metro Maps. . In Proc. 13th Int. Sympos. Graph Drawing (GD’05), Vol. 3843 of Lecture Notes in Computer Science, P. Healy, N. S. Nikolov (eds.), pp. 321–333. Springer-Verlag, 2006.
-
Routing by Landmarks. . In Proc. 6th Swiss Transport Research Conf. (STRC’06). Ascona, 2006.
-
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. . In Proc. 22nd European Workshop on Computational Geometry (EWCG’06), pp. 141–144. Delphi, 2006.
-
Constructing Interference-Minimal Networks. . In Proc. 32nd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’06), Vol. 3831 of Lecture Notes in Computer Science, J. Wiedermann, J. Stuller, G. Tel, J. Pokorný, M. Bieliková (eds.), pp. 166–175. Springer-Verlag, 2006.
-
The Minimum Manhattan Network Problem: Approximations and Exact Solutions. . Computational Geometry: Theory and Applications, 35(3), pp. 188–208. 2006.
-
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. . In Proc. 12th Annu. Int. Comput. Combinatorics Conf. (COCOON’06), Vol. 4112 of Lecture Notes in Computer Science, D. Z. Chen, D.-T. Lee (eds.), pp. 166–175. Springer-Verlag, 2006.
-
Improved Fixed-Parameter Algorithms for Non-Crossing Subgraphs. . In Proc. ICALP Affiliated Workshop on Improving Exponential-Time Algorithms (iETA’06), pp. 31–38. Venezia, 2006.
-
Pseudo-Convex Decomposition of Simple Polygons. . In Proc. 22nd European Workshop on Computational Geometry (EWCG’06), pp. 13–16. Delphi, 2006.
-
A New Approximation Algorithm for Labeling Weighted Points with Sliding Labels. . In Proc. 22nd European Workshop on Computational Geometry (EWCG’06), pp. 137–140. Delphi, 2006.
2005[ to top ]
-
Delineating Boundaries for Imprecise Regions. . In Proc. 13th Annu. Europ. Symp. on Algorithms (ESA’05), Vol. 3669 of Lecture Notes in Computer Science, G. S. Brodal, S. Leonardi (eds.), pp. 143–154. Springer-Verlag, 2005.
-
Constructing Interference-Minimal Networks. . In Proc. 21st European Workshop on Computational Geometry (EWCG’05), pp. 203–206. Eindhoven, 2005.
-
Constructing the City Voronoi Diagram Faster. . In Proc. 2nd Int. Symp. on Voronoi Diagrams in Science and Engineering (VD’05), pp. 162–172. Seoul, 2005.
-
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. . In Proc. 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04), Vol. 3742 of Lecture Notes in Computer Science, J. Akiyama, M. Kano, X. Tan (eds.), pp. 16–28. Springer-Verlag, 2005.
-
Optimal Spanners for Axis-Aligned Rectangles. . Computational Geometry: Theory and Applications, 30(1), pp. 59–77. 2005.
-
Farthest-Point Queries with Geometric and Combinatorial Constraints. . In Proc. 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04), Vol. 3742 of Lecture Notes in Computer Science, J. Akiyama, M. Kano, X. Tan (eds.), pp. 62–75. Springer-Verlag, 2005.
-
Configurations with Few Crossings in Topological Graphs. . In Proc. 16th Annu. Int. Symp. Algorithms Comput. (ISAAC’05), Vol. 3827 of Lecture Notes in Computer Science, X. Deng, D.-Z. Du (eds.), pp. 604–613. Springer-Verlag, 2005.
-
Constructing the City Voronoi Diagram Faster. . In Proc. 21st European Workshop on Computational Geometry (EWCG’05), pp. 155–158. Eindhoven, 2005.
-
Geometrische Netzwerke und ihre Visualisierung. . 2005, June.
-
Delineating Boundaries for Imprecise Regions. . In Proc. 21st European Workshop on Computational Geometry (EWCG’05), pp. 127–130. Eindhoven, 2005.
-
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. . In Proc. 12th Int. Sympos. Graph Drawing (GD’04), Vol. 3383 of Lecture Notes in Computer Science, J. Pach (ed.), pp. 49–59. Springer-Verlag, 2005.
-
Spanning Trees with Few Crossings in Geometric and Topological Graphs. . In Proc. 21st European Workshop on Computational Geometry (EWCG’05), pp. 195–198. Eindhoven, 2005.
2004[ to top ]
-
Farthest-Point Queries with Geometric and Combinatorial Constraints. . In Proc. 20th European Workshop on Computational Geometry (EWCG’04), pp. 45–48. Sevilla, 2004.
-
The Minimum Manhattan Network Problem: Approximations and Exact Solutions. . In Proc. 20th European Workshop on Computational Geometry (EWCG’04), pp. 209–212. Sevilla, 2004.
-
Facility Location and the Geometric Minimum-Diameter Spanning Tree. . Computational Geometry: Theory and Applications, 27(1), pp. 87–106. 2004.
-
Farthest-Point Queries with Geometric and Combinatorial Constraints. . In Abstracts 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04), pp. 110–111. Tokyo, 2004.
-
Algorithms for the Placement of Diagrams on Maps. . In Proc. 12th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’04), D. Pfoder, I. F. Cruz, M. Ronthaler (eds.), pp. 222–231. 2004.
-
Web-Based Delineation of Imprecise Regions. . In Proc. Workshop on Geographic Information Retrieval at SIGIR’04. Sheffield, 2004.
-
Optimal Spanners for Axis-Aligned Rectangles. . In Proc. 20th European Workshop on Computational Geometry (EWCG’04), pp. 97–100. Sevilla, 2004.
-
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. . In Abstracts 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04), pp. 85–86. Tokyo, 2004.
2003[ to top ]
-
Labeling Points with Weights. . Algorithmica, 38(2), pp. 341–362. 2003.
2002[ to top ]
-
A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling. . International Journal of Computational Geometry and Applications, 12(4), pp. 269–281. 2002.
-
A Tutorial for Designing Flexible Geometric Algorithms. . Algorithmica, 33(1), pp. 52–70. 2002.
-
Towards an Evaluation of Quality for Names Placement Methods. . International Journal of Geographical Information Science, 16(7), pp. 641–661. 2002.
-
Approximating the Geometric Minimum-Diameter Spanning Tree. . In Proc. 18th European Workshop on Computational Geometry (EWCG’02), pp. 41–45. War-szawa, 2002.
-
Facility Location and the Geometric Minimum-Diameter Spanning Tree. . In Proc. 5th Int. Workshop Approx. Algorithms Combin. Optim. (APPROX’02), Vol. 2462 of Lecture Notes in Computer Science, K. Jansen, S. Leonardi, V. Vazirani (eds.), pp. 146–160. Springer-Verlag, 2002.
2001[ to top ]
-
Three Rules Suffice for Good Label Placement. . Algorithmica, 30(2), pp. 334–349. 2001.
-
Labeling Points with Weights. . In Proc. 12th Annu. Int. Symp. Algorithms Comput. (ISAAC’01), Vol. 2223 of Lecture Notes in Computer Science, P. Eades, T. Takaoka (eds.), pp. 610–622. Springer-Verlag, 2001.
-
Labeling Subway Lines. . In Proc. 12th Annu. Int. Symp. Algorithms Comput. (ISAAC’01), Vol. 2223 of Lecture Notes in Computer Science, P. Eades, T. Takaoka (eds.), pp. 649–659. Springer-Verlag, 2001.
-
Labeling Points with Circles. . International Journal of Computational Geometry and Applications, 11(2), pp. 181–195. 2001.
-
Etiquetado de puntos alineados. . In Proc. IX Encuentros de Geometría Computacional (EGC’01), pp. 285–294. Girona, 2001.
- [ BibTeX ]
-
Labeling Points with Weights. . In Proc. 17th European Workshop on Computational Geometry (EWCG’01), pp. 97–100. Berlin, 2001.
2000[ to top ]
-
A Better Lower Bound for Two-Circle Point Labeling. . In Proc. 11th Annu. Int. Symp. Algorithms Comput. (ISAAC’00), Vol. 1969 of Lecture Notes in Computer Science, D. Lee, S.-H. Teng (eds.), pp. 422–431. Springer-Verlag, 2000.
-
A Simple and Efficient Algorithm for High-Quality Line Labeling. . In Innovations in GIS VII: GeoComputation, P. M. Atkinson, D. J. Martin (eds.), pp. 147–159. Taylor & Francis, 2000.
-
New Algorithms for Two-Label Point Labeling. . In Proc. 8th Annu. Europ. Symp. on Algorithms (ESA’00), Vol. 1879 of Lecture Notes in Computer Science, M. Paterson (ed.), pp. 368–379. Springer-Verlag, 2000.
1999[ to top ]
-
A Combinatorial Framework for Map Labeling. . In Proc. 6th Int. Sympos. Graph Drawing (GD’98), Vol. 1547 of Lecture Notes in Computer Science, S. H. Whitesides (ed.), pp. 316–331. Springer-Verlag, 1999.
-
Point Labeling with Sliding Labels. . Computational Geometry: Theory and Applications, 13(1), pp. 21–47. 1999.
-
A Simple and Efficient Algorithm for High-Quality Line Labeling. . In Proc. 15th European Workshop on Computational Geometry (EWCG’99), pp. 93–96. Sophia-Antipolis, 1999.
- [ BibTeX ]
-
A Simple and Efficient Algorithm for High-Quality Line Labeling. . In Proc. 7th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK’99), D. Martin, F. Wu (eds.), pp. 146–150. Southampton, 1999.
- [ BibTeX ]
-
Towards an Evaluation of Quality for Label Placement Methods. . In Proc. 19th Int. Cartographic Conf. (ICA’99), pp. 905–913. Int. Cartographic Association, Ottawa, 1999.
-
Automated Label Placement in Theory and Practice. Technical Report (PhD dissertation), . . PhD dissertation. Fachbereich Mathematik und Informatik, Freie Universität Berlin, 1999, May.
1998[ to top ]
-
MakeIt! -- Generating and Maintaining Makefiles Automatically. . In Proc. Workshop on Algorithms and Experiments (ALEX’98), R. Battini, A. A. Bertossi (eds.), pp. 165–174. Trento, 1998.
-
Point Set Labeling with Sliding Labels. . In Proc. 14th Annu. ACM Sympos. Comput. Geom. (SoCG’98), pp. 337–346. 1998.
-
The Hardness of Approximating Set Cover. . In Lectures on Proof Verification and Approximation Algorithms, Vol. 1367, E. W. Mayr, H. J. Prömel, A. Steger (eds.), pp. 249–262. Springer-Verlag, 1998.
1997[ to top ]
-
A Practical Map Labeling Algorithm. . Computational Geometry: Theory and Applications, 7(5--6), pp. 387–404. 1997.
1996[ to top ]
-
The Map-Labeling Bibliography. . 1996.
1995[ to top ]
-
Map Labeling. Technical Report (Master thesis), . . Master thesis. Fachbereich Mathematik und Informatik, Freie Universität Berlin, 1995, May.
- [ BibTeX ]
-
Fast and Reliable Map Labeling. . In Proc. 9th Int. Symp. Computer Science for Environment Protection (CSEP’95), H. K. und Werner Pillmann (ed.), pp. 667–675. Metropolis, 1995.
- [ BibTeX ]
-
An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. . In Proc. 3rd Annu. Europ. Symp. on Algorithms (ESA’95), Vol. 979 of Lecture Notes in Computer Science, P. Spirakis (ed.), pp. 420–433. Springer-Verlag, 1995.
-
Map Labeling Heuristics: Provably Good and Practically Useful. . In Proc. 11th Annu. ACM Sympos. Comput. Geom. (SoCG’95), pp. 109–118. 1995.