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