Publications (chronologically)
2021 [ to top ]

1.Frank, F., Kaufmann, M., Kobourov, S., Mchedlidze, T., Pupyrev, S., Ueckerdt, T., Wolff, A.: Using the MetroMap Metaphor for Drawing Hypergraphs. In: Bureš, T., Dondi, R., Gamper, J., Guerrini, G., Jurdziński, T., Pahl, C., Sikora, F., and Wong, P. (eds.) Proc. 47th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’21). p. 361–372. SpringerVerlag (2021).

2.Chaplick, S., Kindermann, P., Klawitter, J., Rutter, I., Wolff, A.: Extending Partial Representations of Rectangular Duals with Given Contact Orientations. In: Calamoneri, T. (ed.) Proc. 12th International Conference on Algorithms and Complexity (CIAC’21). SpringerVerlag (2021).To appear.

3.Arseneva, E., Kleist, L., Klemz, B., Löffler, M., Schulz, A., Vogtenhuber, B., Wolff, A.: On Dual Graphs of Polyhedral Surfaces. In: Buchin, K. and Colin de Verdière, Éric (eds.) Proc. 37th Annu. Sympos. Comput. Geom. (SoCG’21). Schloss Dagstuhl~ LeibnizZentrum für Informatik (2021).To appear.[ BibTeX ]

4.Walter, J., Zink, J., Baumeister, J., Wolff, A.: Layered Drawing of Undirected Graphs with Generalized Port Constraints. In: Auber, D. and Valtr, P. (eds.) Proc. 28th Int. Symp. Graph Drawing & Network Vis. (GD’20). p. 220–234. SpringerVerlag (2021).
2020 [ to top ]

1.Evans, W., Gethner, E., SpaldingJamieson, J., Wolff, A.: Angle Covers: Algorithms and Complexity. In: Rahman, S., Sadakane, K., and Sung, W.K. (eds.) Proc. 14th Int. Workshop Algorithms Comput. (WALCOM’20). p. 94–106. SpringerVerlag (2020).

2.Chaplick, S., Förster, H., Kryven, M., Wolff, A.: Drawing Graphs with Circular Arcs and RightAngle Crossings. In: Albers, S. (ed.) Proc. 17th Scand. Symp. and Workshops on Algorithm Theory (SWAT’20). p. 21:1–. Schloss Dagstuhl~ LeibnizZentrum für Informatik (2020).

3.Chaplick, S., van Dijk, T.C., Kryven, M., Park, J.W., Ravsky, A., Wolff, A.: Bundled Crossings Revisited. Journal of Graph Algorithms & Applications. 24, 621–655 (2020).

4.Chaplick, S., Kindermann, P., Löffler, A., Thiele, F., Wolff, A., Zaft, A., Zink, J.: Stick Graphs with and without Length Constraints. Journal of Graph Algorithms & Applications. 24, 657–681 (2020).

5.Peng, D., Wolff, A., Haunert, J.H.: Finding Optimal Sequences for Area AggregationA* vs. Integer Linear Programming. ACM Transactions on Spatial Algorithms and Systems. 7, (2020).article 4 (40 pages)

6.Arseneva, E., Kleist, L., Klemz, B., Löffler, M., Schulz, A., Vogtenhuber, B., Wolff, A.: Representing Graphs by Polygons with Edge Contacts in 3D. In: Chaplick, S., Kindermann, P., and Wolff, A. (eds.) Proc. 36th European Workshop on Computational Geometry (EuroCG’20). p. 53:1– (2020).

7.Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing Graphs on Few Lines and Few Planes. Journal of Computational Geometry. 11, 433–475 (2020).

8.Firman, O., Felsner, S., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: The Complexity of Finding Tangles. In: Chaplick, S., Kindermann, P., and Wolff, A. (eds.) Proc. 36th European Workshop on Computational Geometry (EuroCG’20). p. 67:1– (2020).
2019 [ to top ]

1.Kryven, M., Ravsky, A., Wolff, A.: Drawing Graphs on Few Circles and Few Spheres. Journal of Graph Algorithms & Applications. 23, 371–391 (2019).

2.Fabrikant, S.I., Miksch, S., Wolff, A. eds.: Visual Analytics for Sets over Time and Space. Schloss Dagstuhl~ LeibnizZentrum für Informatik (2019).Dagstuhl Seminar 19192

3.Biedl, T., Felsner, S., Meijer, H., Wolff, A.: Line and Plane Cover Numbers Revisited. In: Archambault, D. and Tóth, C.D. (eds.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). p. 409–415. SpringerVerlag (2019).

4.Okamoto, Y., Ravsky, A., Wolff, A.: Variants of the Segment Number of a Graph. In: Archambault, D. and Tóth, C.D. (eds.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). p. 430–443. SpringerVerlag (2019).

5.Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing Optimal Tangles Faster. In: Löffler, M. (ed.) Proc. 35th European Workshop on Computational Geometry (EuroCG’19). p. 61:1– (2019).

6.Wolff, A., Arseneva, E., de Mesmay, A., Kleist, L., Klemz, B., Löffler, M., Schulz, A., Vogtenhuber, B.: Representing Graphs by Polygons with Edge Contacts in 3D, (2019).

7.Chaplick, S., Förster, H., Kryven, M., Wolff, A.: On Arrangements of Orthogonal Circles. In: Archambault, D. and Tóth, C.D. (eds.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). p. 216–229. SpringerVerlag (2019).

8.Evans, W., Rzka.zewski, P., Saeedi, N., Shin, C.S., Wolff, A.: Representing Graphs and Hypergraphs by Touching Polygons in 3D. In: Archambault, D. and Tóth, C.D. (eds.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). p. 18–32. SpringerVerlag (2019).

9.Chaplick, S., van Dijk, T.C., Kryven, M., Park, J.W., Ravsky, A., Wolff, A.: Bundled Crossings Revisited. In: Löffler, M. (ed.) Proc. 35th European Workshop on Computational Geometry (EuroCG’19). p. 57:1– (2019).

10.Chaplick, S., Kindermann, P., Löffler, A., Thiele, F., Wolff, A., Zaft, A., Zink, J.: Stick Graphs with Length Constraints. In: Archambault, D. and Tóth, C.D. (eds.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). p. 3–17. SpringerVerlag (2019).

11.Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing OptimalHeight Tangles Faster. In: Archambault, D. and Tóth, C.D. (eds.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). p. 203–215. SpringerVerlag (2019).

12.Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact Drawings of 1Planar Graphs with RightAngle Crossings and Few Bends. Computational Geometry: Theory and Applications. 84, 50–68 (2019).Special Issue on the 34th European Workshop on Computational Geometry

13.Chaplick, S., van Dijk, T.C., Kryven, M., Park, J.W., Ravsky, A., Wolff, A.: Bundled Crossings Revisited. In: Archambault, D. and Tóth, C.D. (eds.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). p. 63–77. SpringerVerlag (2019).

14.Schulz, A., Wolff, A.: Survey on Graph and Hypergraph Drawing, (2019).

15.Haunert, J.H., Akitaya, H., Cornelsen, S., Kindermann, P., Mchedlidze, T., Nöllenburg, M., Okamoto, Y., Wolff, A.: Clustering Colored Points in the Plane, http://drops.dagstuhl.de/opus/volltexte/2019/11380/, (2019).
2018 [ to top ]

1.Kryven, M., Ravsky, A., Wolff, A.: Drawing Graphs on Few Circles and Few Spheres. In: Panda, B.S. and Goswami, P.P. (eds.) Proc. 4th Conf. Algorithms & Discrete Appl. Math. (CALDAM’18). p. 164–178. SpringerVerlag (2018).Best presentation award for Myroslav Kryven.

2.Chan, T.M., van Dijk, T.C., Fleszar, K., Spoerhase, J., Wolff, A.: Stabbing Rectangles by Line Segments~ How Decomposition Reduces the ShallowCell Complexity. In: Hsu, W.L., Lee, D.T., and Liao, C.S. (eds.) Proc. 29th Annu. Int. Symp. Algorithms Comput. (ISAAC’18). p. 61:1–. Schloss Dagstuhl~ LeibnizZentrum für Informatik (2018).

3.Chaplick, S., Chimani, M., Cornelsen, S., Da Lozzo, G., Nöllenburg, M., Patrignani, M., Tollis, I.G., Wolff, A.: Planar LDrawings of Directed Graphs. In: Frati, F. and Ma, K.L. (eds.) Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17). p. 465–478. SpringerVerlag (2018).

4.Baker, R., Cao, N., Hu, Y., Kaufmann, M., Kobourov, S., Mchedlidze, T., Pupyrev, S., Wolff, A.: Set Visualization Using the Metro Map Metaphor, http://drops.dagstuhl.de/opus/volltexte/2018/8427, (2018).

5.Chimani, M., Felsner, S., Kobourov, S., Ueckerdt, T., Valtr, P., Wolff, A.: On the Maximum Crossing Number. Journal of Graph Algorithms & Applications. 22, 67–87 (2018).Special issue on ``Graph Drawing Beyond Planarity''.

6.Chaplick, S., Kryven, M., Liotta, G., Löffler, A., Wolff, A.: Beyond Outerplanarity. In: Frati, F. and Ma, K.L. (eds.) Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17). p. 546–559. SpringerVerlag (2018).

7.Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact Drawings of 1Planar Graphs with RightAngle Crossings and Few Bends. In: Biedl, T. and Kerren, A. (eds.) Proc. 26th Int. Symp. Graph Drawing & Network Vis. (GD’18). p. 137–151. SpringerVerlag (2018).

8.Firman, O., Ravsky, A., Wolff, A.: On the Weak Line Cover Numbers. In: Korman, M. and Mulzer, W. (eds.) Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18). p. 63:1– (2018).[ BibTeX ]

9.Chimani, M., Felsner, S., Kobourov, S., Ueckerdt, T., Valtr, P., Wolff, A.: On the Maximum Crossing Number. In: Brankovic, L., Ryan, J., and Smith, B. (eds.) Proc. 28th Int. Workshop Combin. Algorithms (IWOCA’17). p. 14 pages. SpringerVerlag (2018).

10.Argyriou, E., Cornelsen, S., Förster, H., Kaufmann, M., Nöllenburg, M., Okamoto, Y., Raftopoulou, C., Wolff, A.: Orthogonal and Smooth Orthogonal Layouts of 1Planar Graphs with Low Edge Complexity. In: Biedl, T. and Kerren, A. (eds.) Proc. 26th Int. Symp. Graph Drawing & Network Vis. (GD’18). p. 509–523. SpringerVerlag (2018).

11.Kryven, M., Ravsky, A., Wolff, A.: Drawing Graphs on Few Circles and Few Spheres. In: Frati, F. and Ma, K.L. (eds.) Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17). p. 591–593. SpringerVerlag (2018).Poster

12.Ahmed, A.R., Angelini, P., Darabi Sahneh, F., Efrat, A., Glickenstein, D., Gronemann, M., Heinsohn, N., Kobourov, S.G., Spence, R., Watkins, J., Wolff, A.: MultiLevel Steiner Trees. In: D’Angelo, G. (ed.) Proc. 17th Int. Symp. Exper. Algorithms (SEA’18). p. 15:1–. Schloss Dagstuhl~ LeibnizZentrum für Informatik (2018).

13.Firman, O., Lipp, F., Straube, L., Wolff, A.: Examining Weak Line Covers with Two Lines in the Plane. In: Biedl, T. and Kerren, A. (eds.) Proc. Int. Symp. Graph Drawing Network Vis. (GD’18). p. 643–645 (2018).poster

14.van Dijk, T.C., Lipp, F., Markfelder, P., Wolff, A.: Computing Storylines with Few Block Crossings. In: Frati, F. and Ma, K.L. (eds.) Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17). p. 365–378. SpringerVerlag (2018).

15.Chaplick, S., Lipp, F., Wolff, A., Zink, J.: 1Bend RAC Drawings of NICPlanar Graphs in Quadratic Area. In: Korman, M. and Mulzer, W. (eds.) Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18). p. 28:1– (2018).[ BibTeX ]

16.Das, A., Fleszar, K., Kobourov, S.G., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica. 80, 1170–1190 (2018).
2017 [ to top ]

1.Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The Complexity of Drawing Graphs on Few Lines and Few Planes. In: Ellen, F., Kolokolova, A., and Sack, J.R. (eds.) Proc. Algorithms Data Struct. Symp. (WADS’17). p. 265–276. SpringerVerlag (2017).

2.Bruckdorfer, T., Cornelsen, S., Gutwenger, C., Kaufmann, M., Montecchiani, F., Nöllenburg, M., Wolff, A.: Progress on Partial Edge Drawings. Journal of Graph Algorithms & Applications. 21, 757–786 (2017).

3.Haunert, J.H., Wolff, A.: Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling. International Journal of GeoInformation. 6, article 342, 20 pages (2017).

4.van Dijk, T.C., Wolff, A.: AlgorithmicallyGuided User Interaction. In: Hoel, E., Newsam, S.D., Ravada, S., Tamassia, R., and Trajcevski, G. (eds.) Proc. 25th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACMGIS’17). p. 11:1– (2017).

5.Bekos, M.A., van Dijk, T.C., Fink, M., Kindermann, P., Kobourov, S., Pupyrev, S., Spoerhase, J., Wolff, A.: Improved Approximation Algorithms for Box Contact Representations. Algorithmica. 77, 902–920 (2017).

6.Peng, D., Wolff, A., Haunert, J.H.: Using the A* Algorithm to Find Optimal Sequences for Area Aggregation. In: Peterson, M.P. (ed.) Proc. 28th Int. Cartogr. Conf. (ICC’17)  Advances in Cartogr. & GIScience. p. 389–404. SpringerVerlag (2017).

7.van Dijk, T.C., Fink, M., Fischer, N., Lipp, F., Markfelder, P., Ravsky, A., Suri, S., Wolff, A.: Block Crossings in Storyline Visualizations. Journal of Graph Algorithms & Applications. 21, 873–913 (2017).Conference version received textbfbest paper award (track A) at GD'16.
2016 [ to top ]

1.Lipp, F., Wolff, A., Zink, J.: Faster ForceDirected Graph Drawing with the WellSeparated Pair Decomposition. Algorithms. 9, article 53, 17 pages (2016).

2.Evans, W.S., Fleszar, K., Kindermann, P., Saeedi, N., Shin, C.S., Wolff, A.: Minimum Rectilinear Polygons for Given Angle Sequences. In: Akiyama, J., Ito, H., and Sakai, T. (eds.) Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCGG’16). p. 105–119. SpringerVerlag (2016).

3.Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous Drawing of Planar Graphs with RightAngle Crossings and Few Bends. Journal of Graph Algorithms & Applications. 20, 133–158 (2016).

4.Chaplick, S., Lipp, F., Park, J. won, Wolff, A.: Obstructing Visibilities with One Obstacle. In: Hu, Y. and Nöllenburg, M. (eds.) Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16). p. 295–308. SpringerVerlag (2016).

5.Budig, B., Dijk, T.C. van, Wolff, A.: Matching Labels and Markers in Historical Maps: An Algorithm with Interactive Postprocessing. ACM Transactions on Spatial Algorithms and Systems. 2, 13:1– (2016).

6.Löffler, A., van Dijk, T.C., Wolff, A.: Snapping Graph Drawings to the Grid Optimally. In: Hu, Y. and Nöllenburg, M. (eds.) Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16). p. 144–151. SpringerVerlag (2016).

7.Haunert, J.H., Wolff, A.: Beyond Maximum Independent Set: An Extended Model for PointFeature Label Placement. Proc. ISPRS (Commission II, WG II/2). p. 109–114 (2016).

8.van Dijk, T.C., Fink, M., Fischer, N., Lipp, F., Markfelder, P., Ravsky, A., Suri, S., Wolff, A.: Block Crossings in Storyline Visualizations. In: Hu, Y. and Nöllenburg, M. (eds.) Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16). p. 382–398. SpringerVerlag (2016).Received bestpaper award at GD 2016

9.Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: MultiSided Boundary Labeling. Algorithmica. 76, 225–258 (2016).

10.Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing Graphs on Few Lines and Few Planes. In: Hu, Y. and Nöllenburg, M. (eds.) Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16). p. 166–180. SpringerVerlag (2016).

11.Peng, D., Wolff, A., Haunert, J.H.: Continuous Generalization of Administrative Boundaries Based on Compatible Triangulations. In: Sarjakoski, T., Santos, M.Y., and Sarjakoski, L.T. (eds.) Proc. 19th AGILE Conference on Geographic Information Science~ Geospatial Data in a Changing World. p. 399–415. SpringerVerlag (2016).

12.Haunert, J.H., Wolff, A.: Räumliche Analyse durch kombinatorische Optimierung. In: Freeden, W. and Rummel, R. (eds.) Handbuch der Geodäsie (6 Bände). p. 1–39. Springer Berlin Heidelberg (2016).
2015 [ to top ]

1.Bereg, S., Fleszar, K., Kindermann, P., Pupyrev, S., Spoerhase, J., Wolff, A.: Colored NonCrossing Euclidean Steiner Forest. In: Elbassioni, K. and Makino, K. (eds.) Proc. 26th Annu. Int. Symp. Algorithms Comput. (ISAAC’15). p. 1–13. SpringerVerlag (2015).

2.Das, A., Gansner, E.R., Kaufmann, M., Kobourov, S., Spoerhase, J., Wolff, A.: Approximating Minimum Manhattan Networks in Higher Dimensions. Algorithmica. 71, 36–52 (2015).

3.Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous Drawing of Planar Graphs with RightAngle Crossings and Few Bends. In: Rahman, M.S. and Tomita, E. (eds.) Proc. 9th Int. Workshop Algorithms Comput. (WALCOM’15). p. 222–233. SpringerVerlag (2015).

4.Alam, M.J., Bläsius, T., Rutter, I., Ueckerdt, T., Wolff, A.: Pixel and Voxel Representations of Graphs. In: Di Giacomo, E. and Lubiw, A. (eds.) Proc. 23rd Int. Symp. Graph Drawing & Network Vis. (GD’15). p. 472–486. SpringerVerlag (2015).

5.Chaplick, S., Kindermann, P., Lipp, F., Wolff, A.: Solving Optimization Problems on Orthogonal Ray Graphs. Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCGG’15). p. 2 pp (2015).Abstract

6.Schwartges, N., Morgan, B., Haunert, J.H., Wolff, A.: Labeling Streets Along a Route in Interactive 3D Maps Using Billboards. In: Bacao, F., Santos, M.Y., and Painho, M. (eds.) Proc. 18th AGILE Conf. Geogr. Inform. Sci. (AGILE’15). p. 269–287. SpringerVerlag (2015).

7.Lipp, F., Wolff, A., Zink, J.: Faster ForceDirected Graph Drawing with the WellSeparated Pair Decomposition. In: Di Giacomo, E. and Lubiw, A. (eds.) Proc. 23rd Int. Symp. Graph Drawing & Network Vis. (GD’15). p. 52–59. SpringerVerlag (2015).

8.Fink, M., Pupyrev, S., Wolff, A.: Ordering Metro Lines by Block Crossings. Journal of Graph Algorithms & Applications. 19, 111–153 (2015).
2014 [ to top ]

1.Barth, L., Fabrikant, S.I., Kobourov, S., Lubiw, A., Nöllenburg, M., Okamoto, Y., Pupyrev, S., Squarcella, C., Ueckerdt, T., Wolff, A.: Semantic Word Cloud Representations: Hardness and Approximation Algorithms. In: Pardo, A. and Viola, A. (eds.) Proc. 11th Latin American Sympos. Theor. Inform. (LATIN’14). p. 514–525. SpringerVerlag (2014).

2.Kindermann, P., Lipp, F., Wolff, A.: Luatodonotes: Boundary Labeling for Annotations in Texts. In: Duncan, C. and Symvonis, A. (eds.) Proc. 22nd Int. Sympos. Graph Drawing (GD’14). p. 76–88. SpringerVerlag (2014).

3.Aulbach, M., Fink, M., Schuhmann, J., Wolff, A.: Drawing Graphs within Restricted Area. In: Duncan, C. and Symvonis, A. (eds.) Proc. 22nd Int. Sympos. Graph Drawing (GD’14). p. 367–379. SpringerVerlag (2014).

4.Alam, M.J., Bekos, M.A., Kaufmann, M., Kindermann, P., Kobourov, S.G., Wolff, A.: Smooth Orthogonal Drawings of Planar Graphs. In: Pardo, A. and Viola, A. (eds.) Proc. 11th Latin American Sympos. Theor. Inform. (LATIN’14). p. 144–155. SpringerVerlag (2014).

5.Peng, D., Wolff, A.: Watch Your Data Structures. Proc. 22th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK’14). p. 10 pages. , Glasgow (2014).

6.Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous Drawing of Planar Graphs with RightAngle Crossings and Few Bends. In: Duncan, C. and Symvonis, A. (eds.) Proc. 22nd Int. Sympos. Graph Drawing (GD’14). p. 515–516. SpringerVerlag (2014).Poster

7.Schwartges, N., Haunert, J.H., Wolff, A., Zwiebler, D.: Point Labeling with Sliding Labels in Interactive Maps. In: Huerta, J., Schade, S., and Granell, C. (eds.) Proc. 17th AGILE Conf. Geogr. Inform. Sci. (AGILE’14). p. 295–310. SpringerVerlag (2014).

8.Fink, M., Lechner, M., Wolff, A.: Concentric Metro Maps. Proc. Schematic Mapping Workshop (SMW’14). , Wivenhoe Park (2014).Poster

9.Bekos, M.A., van Dijk, T.C., Fink, M., Kindermann, P., Kobourov, S., Pupyrev, S., Spoerhase, J., Wolff, A.: Improved Approximation Algorithms for Box Contact Representations. In: Schulz, A. and Wagner, D. (eds.) Proc. 22nd Annu. Europ. Symp. Algorithms (ESA’14). p. 87–99. SpringerVerlag, Wroc{\l}aw (2014).

10.Angelini, P., Eppstein, D., Frati, F., Kaufmann, M., Lazard, S., Mchedlidze, T., Teillaud, M., Wolff, A.: Universal Point Sets for Drawing Planar Graphs with Circular Arcs. Journal of Graph Algorithms & Applications. 18, 313–324 (2014).

11.Schwartges, N., Wolff, A., Haunert, J.H.: Labeling Streets in Interactive Maps using Embedded Labels. In: Huang, Y., Schneider, M., Gertz, M., Krumm, J., and Sankaranarayanan, J. (eds.) Proc. 22nd ACM SIGSPATIAL Int. Conf. Advances Geogr. Inform. Syst. (ACMGIS’14). p. 517–520 (2014).

12.Kindermann, P., Schulz, A., Spoerhase, J., Wolff, A.: On Monotone Drawings of Trees. In: Duncan, C. and Symvonis, A. (eds.) Proc. 22nd Int. Sympos. Graph Drawing (GD’14). p. 488–500. SpringerVerlag (2014).

13.Wismath, S., Wolff, A.: Guest Editors’ Foreword (Special Issue of Selected Papers from the 21st Int. Symp. Graph Drawing). Journal of Graph Algorithms & Applications. 18, 174–175 (2014).
2013 [ to top ]

1.Fink, M., Haunert, J.H., Spoerhase, J., Wolff, A.: Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. In: Fekete, S. (ed.) Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13). p. 119–122. , Braunschweig (2013).

2.Wolff, A.: Graph Drawing and Cartography. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. p. 697–736. CRC Press, Boca Raton, FL (2013).[ BibTeX ]

3.Wismath, S., Wolff, A. eds.: Proceedings of the 21st International Symposium on Graph Drawing (GD’13). SpringerVerlag (2013).[ BibTeX ]

4.Schwartges, N., Allerkamp, D., Haunert, J.H., Wolff, A.: Optimizing Active Ranges for Point Selection in Dynamic Maps. Proc. 16th ICA Generalisation Workshop (ICAGW’13). , Dresden (2013).10 pages.

5.Angelini, P., Eppstein, D., Fabrizio Frati, M.K., Lazard, S., Tamara Mchedlidze, M.T., Wolff, A.: Universal Point Sets for Planar Graph Drawings with Circular Arcs. Proc. 25th Canadian Conf. Comput. Geom. (CCCG’13). p. 117–122. , Waterloo, ON, Canada (2013).

6.Das, A., Fleszar, K., Kobourov, S.G., Spoerhase, J., Veeramoni, S., Wolff, A.: Polylogarithmic Approximation for Generalized Minimum Manhattan Networks. In: Fekete, S. (ed.) Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13). p. 81–84. , Braunschweig (2013).

7.Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: TwoSided Boundary Labeling with Adjacent Sides. In: Fekete, S. (ed.) Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13). p. 233–236. , Braunschweig (2013).

8.Fink, M., Haverkort, H., Nöllenburg, M., Roberts, M., Schuhmann, J., Wolff, A.: Drawing Metro Maps using Bézier Curves. In: Didimo, W. and Patrignani, M. (eds.) Proc. 20th Int. Sympos. Graph Drawing (GD’12). p. 463–474. SpringerVerlag (2013).

9.Das, A., Fleszar, K., Kobourov, S.G., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the Generalized Minimum Manhattan Network Problem. In: Cai, L., Cheng, S.W., and Lam, T.W. (eds.) Proc. 24th Annu. Int. Symp. Algorithms Comput. (ISAAC’13). p. 722–732. SpringerVerlag (2013).

10.Peng, D., Haunert, J.H., Wolff, A.: Morphing Polylines Based on Least Squares Adjustment. Proc. 16th ICA Generalisation Workshop (ICAGW’13). , Dresden (2013).10 pages.

11.Fink, M., Haunert, J.H., Spoerhase, J., Wolff, A.: Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. IEEE Transactions on Visualization and Computer Graphics. 19, 2326–2335 (2013).

12.Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: TwoSided Boundary Labeling with Adjacent Sides. In: Dehne, F., SolisOba, R., and Sack, J.R. (eds.) Proc. 13th Int. Algorithms Data Struct. Symp. (WADS’13). p. 463–474. SpringerVerlag (2013).

13.Bruckdorfer, T., Cornelsen, S., Gutwenger, C., Kaufmann, M., Montecchiani, F., Nöllenburg, M., Wolff, A.: Progress on Partial Edge Drawings. In: Didimo, W. and Patrignani, M. (eds.) Proc. 20th Int. Sympos. Graph Drawing (GD’12). p. 67–78. SpringerVerlag (2013).
2012 [ to top ]

1.Fink, M., Haunert, J.H., Schulz, A., Spoerhase, J., Wolff, A.: Algorithms for Labeling Focus Regions. IEEE Transactions on Visualization and Computer Graphics. 18, 2583–2592 (2012).

2.Atienza, N., de Castro, N., Cortés, C., Garrido, M. Ángeles, Grima, C.I., Hernández, G., Márquez, A., MorenoGonzález, A., Nöllenburg, M., Portillo, J.R., Reyes, P., Valenzuela, J., Villar, M.T., Wolff, A.: Cover Contact Graphs. Journal of Computational Geometry. 3, (2012).

3.Buchin, K., Buchin, M., Byrka, J., Nöllenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A.: Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, FixedParameter Tractability. Algorithmica. 62, 309–332 (2012).

4.Fink, M., Haunert, J.H., Mchedlidze, T., Spoerhase, J., Wolff, A.: Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. In: Rahman, M.S. and Nakano, S. ichi (eds.) Proc. Workshop Algorithms Comput. (WALCOM’12). p. 186–197. SpringerVerlag (2012).

5.Schwartges, N., Spoerhase, J., Wolff, A.: Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. In: SolisOba, R. and Persiano, G. (eds.) Proc. 9th Workshop Approx. Online Algorithms (WAOA’11). p. 77–88. SpringerVerlag, Saarbr{ü}cken (2012).

6.Fink, M., Haunert, J.H., Mchedlidze, T., Spoerhase, J., Wolff, A.: Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. In: van Kreveld, M. and Speckmann, B. (eds.) Proc. 19th Int. Sympos. Graph Drawing (GD’11). p. 441–442. SpringerVerlag (2012).Poster

7.Kobourov, S., Wolff, A., van Ham, F. eds.: Putting Data on the Map. Schloss Dagstuhl~ LeibnizZentrum für Informatik (2012).Dagstuhl Seminar 12261

8.Rutter, I., Wolff, A.: Augmenting the Connectivity of Planar and Geometric Graphs. Journal of Graph Algorithms & Applications. 16, 599–628 (2012).
2011 [ to top ]

1.Dykes, J., MüllerHannemann, M., Wolff, A. eds.: Schematization in Cartography, Visualization, and Computational Geometry. , Schloss Dagstuhl (2011).

2.Das, A., Gansner, E.R., Kaufmann, M., Kobourov, S., Spoerhase, J., Wolff, A.: Approximating Minimum Manhattan Networks in Higher Dimensions. In: Demetrescu, C. and Halldórsson, M.M. (eds.) Proc. 19th Annu. Europ. Symp. on Algorithms (ESA’11). p. 49–60. SpringerVerlag, Saarbr{ü}cken (2011).

3.Nöllenburg, M., Wolff, A.: Drawing and Labeling HighQuality Metro Maps by MixedInteger Programming. IEEE Transactions on Visualization and Computer Graphics. 17, 626–641 (2011).
2010 [ to top ]

1.de Berg, M., Gerrits, D., Khosravi, A., Rutter, I., Tsirogiannis, C., Wolff, A.: How Alexander the Great Brought the Greeks Together While Inflicting Minimal Damage to the Barbarians. Proc. 26th European Workshop Comput. Geom. (EuroCG’10). p. 73–76. , Dortmund (2010).

2.Haunert, J.H., Wolff, A.: Optimal and Topologically Safe Simplification of Building Footprints. Proc. 18th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACMGIS’10). p. 192–201. , San Jose, CA (2010).

3.Haunert, J.H., Wolff, A.: Area aggregation in map generalisation by mixedinteger programming. International Journal of Geographical Information Science. 24, 1871–1897 (2010).

4.Rutter, I., Wolff, A.: Computing Large Matchings Fast. ACM Transactions on Algorithms. 7, article 1, 21 pages (2010).

5.Katz, B., Krug, M., Rutter, I., Wolff, A.: ManhattanGeodesic Embedding of Planar Graphs. In: Eppstein, D. and Gansner, E.R. (eds.) Proc. 17th Int. Sympos. Graph Drawing (GD’09). p. 207–218. SpringerVerlag (2010).

6.Been, K., Nöllenburg, M., Poon, S.H., Wolff, A.: Optimizing Active Ranges for Consistent Dynamic Map Labeling. Computational Geometry: Theory and Applications. 43, 312–328 (2010).

7.Erlebach, T., Hagerup, T., Jansen, K., Minzlaff, M., Wolff, A.: Trimming of Graphs, with Application to Point Labeling. Theory of Computing Systems. 47, 613–636 (2010).

8.de Berg, M., van Nijnatten, F., Sitters, R., Woeginger, G.J., Wolff, A.: The Traveling Salesman Problem Under Squared Euclidean Distances. In: Marion, J.Y. and Schwentick, T. (eds.) Proc. 27th Int. Sympos. Theoretical Aspects Comput. Sci. (STACS’10). p. 239–250. , Nancy (2010).
2009 [ to top ]

1.Ahn, H.K., Alt, H., Asano, T., Bae, S.W., Brass, P., Cheong, O., Knauer, C., Na, H.S., Shin, C.S., Wolff, A.: Constructing Optimal Highways. International Journal of Foundations of Computer Science. 20, 3–23 (2009).

2.Goaoc, X., Kratochvíl, J., Okamoto, Y., Shin, C.S., Spillner, A., Wolff, A.: Untangling a Planar Graph. Discrete & Computational Geometry. 42, 542–569 (2009).

3.Bereg, S., Mutsanas, N., Wolff, A.: Matching Points with Rectangles and Squares. Computational Geometry: Theory and Applications. 42, 93–108 (2009).

4.Keiren, J., van Walderveen, F., Wolff, A.: Constructability of Triplets. In: Langerman, S. (ed.) Proc. 25th European Workshop on Computational Geometry (EuroCG’09). , Brussels (2009).

5.Buchin, K., Buchin, M., Byrka, J., Nöllenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A.: Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, FixedParameter Tractability. In: Tollis, I.G. and Patrignani, M. (eds.) Proc. 16th Int. Sympos. Graph Drawing (GD’08). p. 324–335. SpringerVerlag, Hersonissos, Crete (2009).

6.Benkert, M., Gudmundsson, J., Knauer, C., van Oostrum, R., Wolff, A.: A PolynomialTime Approximation Algorithm for a Geometric Dispersion Problem. International Journal of Computational Geometry and Applications. 19, 267–288 (2009).

7.Nöllenburg, M., Völker, M., Wolff, A., Holten, D.: Drawing Binary Tanglegrams: An Experimental Evaluation. Proc. 11th Workshop Algorithm Engineering and Experiments (ALENEX’09). p. 106–119 (2009).
2008 [ to top ]

1.Görke, R., Shin, C.S., Wolff, A.: Constructing the City Voronoi Diagram Faster. International Journal of Computational Geometry and Applications. 18, 275–294 (2008).

2.Been, K., Nöllenburg, M., Poon, S.H., Wolff, A.: Optimizing Active Ranges for Consistent Dynamic Map Labeling. Proc. 24th Annu. ACM Sympos. Comput. Geom. (SoCG’08). p. 10–19. , College Park, MD (2008).

3.Haunert, J.H., Wolff, A.: Optimal Simplification of Building Ground Plans. Proc. 21st Congress Int. Society Photogrammetry Remote Sensing (ISPRS’08), Technical Commision II/3. p. 373–378. , Beijing (2008).

4.Spillner, A., Wolff, A.: Untangling a Planar Graph. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., and Bieliková, M. (eds.) Proc. 34th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’08). p. 473–484. SpringerVerlag, Nov{{\’y}} Smokovec, Slovakia (2008).

5.Rutter, I., Wolff, A.: Augmenting the Connectivity of Planar and Geometric Graphs. Fakultät für Informatik, Universität Karlsruhe (2008).

6.Rutter, I., Wolff, A.: Augmenting the Connectivity of Planar and Geometric Graphs. In: Petitjean, S. (ed.) Proc. 24th European Workshop on Computational Geometry (EuroCG’08). p. 71–74. , Nancy (2008).

7.Been, K., Nöllenburg, M., Poon, S.H., Wolff, A.: Optimizing Active Ranges for Consistent Dynamic Map Labeling. In: Petitjean, S. (ed.) Proc. 24th European Workshop on Computational Geometry (EuroCG’08). p. 55–58. , Nancy (2008).

8.Gerdjikov, S., Wolff, A.: Decomposing a Simple Polygon into PseudoTriangles and Convex Polygons. Computational Geometry: Theory and Applications. 41, 21–30 (2008).

9.Rutter, I., Wolff, A.: Computing Large Matchings Fast. Proc. 19th ACMSIAM Sympos. Discrete Algorithms (SODA’08). p. 183–192. , San Francisco (2008).

10.Atienza, N., de Castro, N., Cortés, C., Garrido, M. Ángeles, Grima, C.I., Hernández, G., Márquez, A., Moreno, A., Nöllenburg, M., Portillo, J.R., Reyes, P., Valenzuela, J., Villar, M.T., Wolff, A.: Cover Contact Graphs. In: Hong, S.H., Nishizeki, T., and Quan, W. (eds.) Proc. 15th Int. Sympos. Graph Drawing (GD’07). p. 171–182. SpringerVerlag, Sydney (2008).

11.Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Constructing InterferenceMinimal Networks. Computational Geometry: Theory and Applications. 40, 179–194 (2008).

12.Erlebach, T., Hagerup, T., Jansen, K., Minzlaff, M., Wolff, A.: Trimming of Graphs, with Application to Point Labeling. In: Albers, S. and Weil, P. (eds.) Proc. 25th Int. Sympos. Theoretical Aspects Comput. Sci. (STACS’08). p. 265–276. , Bordeaux (2008).

13.Rutter, I., Wolff, A.: Augmenting the Connectivity of Planar and Geometric Graphs. Proc. Int. Conf. Topological Geom. Graph Theory (TGGT’08). p. 53–56. , Paris (2008).

14.Goaoc, X., Kratochvíl, J., Okamoto, Y., Shin, C.S., Wolff, A.: Moving Vertices to Make Drawings Plane. In: Hong, S.H., Nishizeki, T., and Quan, W. (eds.) Proc. 15th Int. Sympos. Graph Drawing (GD’07). p. 101–112. SpringerVerlag, Sydney (2008).

15.Reinbacher, I., Benkert, M., van Kreveld, M., Mitchell, J.S., Snoeyink, J., Wolff, A.: Delineating Boundaries for Imprecise Regions. Algorithmica. 50, 386–414 (2008).

16.Nöllenburg, M., Merrick, D., Wolff, A., Benkert, M.: Morphing Polylines: A Step Towards Continuous Generalization. Computers, Environment and Urban Systems. 32, 248–260 (2008).
2007 [ to top ]

1.Atienza, N., de Castro, N., Cortés, C., Garrido, M. Ángeles, Grima, C.I., Hernández, G., Márquez, A., Moreno, A., Nöllenburg, M., Portillo, J.R., Reyes, P., Valenzuela, J., Villar, M.T., Wolff, A.: Cover Contact Graphs. Fakultät für Informatik, Universität Karlsruhe (2007).Available at pathhttp://www.ubka.unikarlsruhe.de/indexervvv/ira/2007/18

2.Merrick, D., Nöllenburg, M., Wolff, A., Benkert, M.: Morphing Polygonal Lines: A Step Towards Continuous Generalization. Proc. 15th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK’07). p. 390–399. , Maynooth, Ireland (2007).

3.Benkert, M., Nöllenburg, M., Uno, T., Wolff, A.: Minimizing IntraEdge Crossings in Wiring Diagrams and Public Transport Maps. In: Kaufmann, M. and Wagner, D. (eds.) Proc. 14th Int. Sympos. Graph Drawing (GD’06). p. 270–281. SpringerVerlag, Karlsruhe, Germany (2007).

4.Bereg, S., Völker, M., Wolff, A., Zhang, Y.: Straightening Drawings of Clustered Hierarchical Graphs. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., and Plasil, F. (eds.) Proc. 33rd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’07). p. 177–186. SpringerVerlag, Harrachov, Czech Republic (2007).

5.Rutter, I., Wolff, A.: Computing Large Matchings Fast. Fakultät für Informatik, Universität Karlsruhe (2007).Available at pathhttp://digbib.ubka.unikarlsruhe.de/volltexte/1000007350

6.Merrick, D., Nöllenburg, M., Wolff, A., Benkert, M.: Morphing Polygonal Lines: A Step Towards Continuous Generalization. In: Aichholzer, O. and Hackl, T. (eds.) Proc. 23rd European Workshop on Computational Geometry (EWCG’07). p. 6–9. , Graz (2007).

7.Knauer, C., Schramm, Étienne, Spillner, A., Wolff, A.: Configurations with Few Crossings in Topological Graphs. Computational Geometry: Theory and Applications. 37, 104–114 (2007).

8.Gudmundsson, J., Klein, R., Narasimhan, G., Smid, M., Wolff, A. eds.: Geometric Networks and Metric Space Embeddings. Schloss Dagstuhl~ LeibnizZentrum für Informatik (2007).

9.Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. Computational Geometry: Theory and Applications. 36, 215–236 (2007).

10.Ahn, H.K., Alt, H., Asano, T., Bae, S.W., Brass, P., Cheong, O., Knauer, C., Na, H.S., Shin, C.S., Wolff, A.: Constructing Optimal Highways. In: Jay, B. and Gudmundsson, J. (eds.) Proc. 13th Conf. Computing: The Australasian Theory Sympos. (CATS’07). p. 7–14. Australian Computer Society, Ballarat, Australia (2007).

11.Wolff, A.: Drawing Subway Maps: A Survey. Informatik~ Forschung & Entwicklung. 22, 23–44 (2007).
2006 [ to top ]

1.Bereg, S., Mutsanas, N., Wolff, A.: Matching Points with Rectangles and Squares. In: Wiedermann, J. r’i, Stuller, J., Tel, G., Pokorn’y, J., and Bieliková, M. (eds.) Proc. 32nd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’06). p. 177–186. SpringerVerlag, Merin, Czech Republic (2006).

2.Benkert, M., Gudmundsson, J., Knauer, C., Moet, E., van Oostrum, R., Wolff, A.: A PolynomialTime Approximation Algorithm for a Geometric Dispersion Problem. Fakultät für Informatik, Universität Karlsruhe (2006).Available at pathhttp://digbib.ubka.unikarlsruhe.de/volltexte/1000005162[ BibTeX ]

3.Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Constructing InterferenceMinimal Networks. In: Wiedermann, J. r’i, Stuller, J., Tel, G., Pokorn’y, J., and Bieliková, M. (eds.) Proc. 32nd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’06). p. 166–175. SpringerVerlag, Merin, Czech Republic (2006).

4.Rüetschi, U.J., Caduff, D., Timpf, S., Schulz, F., Wolff, A.: Routing by Landmarks. Proc. 6th Swiss Transport Research Conf. (STRC’06). , Ascona (2006).CDROM

5.Benkert, M., Wolff, A., Widmann, F., Shirabe, T.: The Minimum Manhattan Network Problem: Approximations and Exact Solutions. Computational Geometry: Theory and Applications. 35, 188–208 (2006).

6.Nöllenburg, M., Wolff, A.: A MixedInteger Program for Drawing HighQuality Metro Maps. In: Healy, P. and Nikolov, N.S. (eds.) Proc. 13th Int. Sympos. Graph Drawing (GD’05). p. 321–333. SpringerVerlag, Limerick, Ireland (2006).

7.Benkert, M., Gudmundsson, J., Knauer, C., Moet, E., van Oostrum, R., Wolff, A.: A PolynomialTime Approximation Algorithm for a Geometric Dispersion Problem. In: Chen, D.Z. and Lee, D.T. (eds.) Proc. 12th Annu. Int. Comput. Combinatorics Conf. (COCOON’06). p. 166–175. SpringerVerlag, Taipei (2006).

8.Benkert, M., Gudmundsson, J., Knauer, C., Moet, E., van Oostrum, R., Wolff, A.: A PolynomialTime Approximation Algorithm for a Geometric Dispersion Problem. Proc. 22nd European Workshop on Computational Geometry (EWCG’06). p. 141–144. , Delphi (2006).

9.Haunert, J.H., Wolff, A.: Generalization of Land Cover Maps by Mixed Integer Programming. Proc. 14th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACMGIS’06). p. 75–82. , Arlington, VA (2006).

10.Halldórsson, M.M., Wolff, A., Tokuyama, T.: Improved FixedParameter Algorithms for NonCrossing Subgraphs. Proc. ICALP Affiliated Workshop on Improving ExponentialTime Algorithms (iETA’06). p. 31–38. , Venezia (2006).

11.Daescu, O., Mi, N., Shin, C.S., Wolff, A.: FarthestPoint Queries with Geometric and Combinatorial Constraints. Computational Geometry: Theory and Applications. 33, 174–185 (2006).

12.Gerdjikov, S., Wolff, A.: PseudoConvex Decomposition of Simple Polygons. Proc. 22nd European Workshop on Computational Geometry (EWCG’06). p. 13–16. , Delphi (2006).

13.Erlebach, T., Hagerup, T., Jansen, K., Minzlaff, M., Wolff, A.: A New Approximation Algorithm for Labeling Weighted Points with Sliding Labels. Proc. 22nd European Workshop on Computational Geometry (EWCG’06). p. 137–140. , Delphi (2006).

14.Bereg, S., Völker, M., Wolff, A.: Compact Drawing of Clustered Layered Graphs, (2006).
2005 [ to top ]

1.Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. In: Pach, J. (ed.) Proc. 12th Int. Sympos. Graph Drawing (GD’04). p. 49–59. SpringerVerlag, New York (2005).

2.Görke, R., Wolff, A.: Constructing the City Voronoi Diagram Faster. Proc. 2nd Int. Symp. on Voronoi Diagrams in Science and Engineering (VD’05). p. 162–172. , Seoul (2005).

3.Knauer, C., Schramm, Étienne, Spillner, A., Wolff, A.: Configurations with Few Crossings in Topological Graphs. In: Deng, X. and Du, D.Z. (eds.) Proc. 16th Annu. Int. Symp. Algorithms Comput. (ISAAC’05). p. 604–613. SpringerVerlag, Sanya, Hainan, China (2005).

4.Wolff, A.: Geometrische Netzwerke und ihre Visualisierung, (2005).

5.Reinbacher, I., Benkert, M., van Kreveld, M., Mitchell, J.S., Wolff, A.: Delineating Boundaries for Imprecise Regions. In: Brodal, G.S. and Leonardi, S. (eds.) Proc. 13th Annu. Europ. Symp. on Algorithms (ESA’05). p. 143–154. SpringerVerlag, Eivissa, Spain (2005).

6.Görke, R., Wolff, A.: Constructing the City Voronoi Diagram Faster. Proc. 21st European Workshop on Computational Geometry (EWCG’05). p. 155–158. , Eindhoven (2005).

7.Knauer, C., Schramm, Étienne, Spillner, A., Wolff, A.: Configurations with Few Crossings in Topological Graphs. Fakultät für Informatik, Universität Karlsruhe (2005).Available at pathhttp://digbib.ubka.unikarlsruhe.de/volltexte/1000004122

8.Benkert, M., Widmann, F., Wolff, A.: The Minimum Manhattan Network Problem: A Fast Factor3 Approximation. In: Akiyama, J., Kano, M., and Tan, X. (eds.) Proc. 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04). p. 16–28. SpringerVerlag, Tokyo (2005).

9.Knauer, C., Schramm, Étienne, Spillner, A., Wolff, A.: Spanning Trees with Few Crossings in Geometric and Topological Graphs. Proc. 21st European Workshop on Computational Geometry (EWCG’05). p. 195–198. , Eindhoven (2005).

10.Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Constructing InterferenceMinimal Networks. Proc. 21st European Workshop on Computational Geometry (EWCG’05). p. 203–206. , Eindhoven (2005).

11.Daescu, O., Mi, N., Shin, C.S., Wolff, A.: FarthestPoint Queries with Geometric and Combinatorial Constraints. In: Akiyama, J., Kano, M., and Tan, X. (eds.) Proc. 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04). p. 62–75. SpringerVerlag, Tokyo (2005).

12.Reinbacher, I., Benkert, M., van Kreveld, M., Wolff, A.: Delineating Boundaries for Imprecise Regions. Proc. 21st European Workshop on Computational Geometry (EWCG’05). p. 127–130. , Eindhoven (2005).

13.Asano, T., de Berg, M., Cheong, O., Everett, H., Haverkort, H., Katoh, N., Wolff, A.: Optimal Spanners for AxisAligned Rectangles. Computational Geometry: Theory and Applications. 30, 59–77 (2005).
2004 [ to top ]

1.Daescu, O., Mi, N., Shin, C.S., Wolff, A.: FarthestPoint Queries with Geometric and Combinatorial Constraints. Proc. 20th European Workshop on Computational Geometry (EWCG’04). p. 45–48. , Sevilla (2004).

2.Asano, T., de Berg, M., Cheong, O., Everett, H., Haverkort, H., Katoh, N., Wolff, A.: Optimal Spanners for AxisAligned Rectangles. Proc. 20th European Workshop on Computational Geometry (EWCG’04). p. 97–100. , Sevilla (2004).

3.Gudmundsson, J., Haverkort, H., Park, S.M., Shin, C.S., Wolff, A.: Facility Location and the Geometric MinimumDiameter Spanning Tree. Computational Geometry: Theory and Applications. 27, 87–106 (2004).