Publications (chronologically)
Key Words
Publications
2019 [ to top ]

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, 5068 (2019).

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). SpringerVerlag (2019).

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). SpringerVerlag (2019).

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). SpringerVerlag (2019).

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). SpringerVerlag (2019).

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

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:17 (2019).

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:17 (2019).

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). SpringerVerlag (2019).

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). SpringerVerlag (2019).

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). SpringerVerlag (2019).
2018 [ to top ]

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. 643645 (2018).

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. 546559. SpringerVerlag (2018).

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. 509523. SpringerVerlag (2018).

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:161:13. Schloss Dagstuhl~ LeibnizZentrum für Informatik (2018).

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. 164178. SpringerVerlag (2018).

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).

Das, A., Fleszar, K., Kobourov, S.G., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica. 80, 11701190 (2018).

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. 465478. SpringerVerlag (2018).

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:114. Schloss Dagstuhl~ LeibnizZentrum für Informatik (2018).

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:16 (2018).[ BibTeX ]

Chimani, M., Felsner, S., Kobourov, S., Ueckerdt, T., Valtr, P., Wolff, A.: On the Maximum Crossing Number. Journal of Graph Algorithms & Applications. 22, 6787 (2018).

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. 365378. SpringerVerlag (2018).

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. 591593. SpringerVerlag (2018).

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:15 (2018).[ BibTeX ]

Baker, R., Cao, N., Hu, Y., Kaufmann, M., Kobourov, S., Mchedlidze, T., Pupyrev, S., Wolff, A.: Set Visualization Using the Metro Map Metaphor. In: Hu, Y., Micallef, L., Nöllenburg, M., and Rodgers, P. (eds.) Scalable Set Visualizations (Dagstuhl Seminar 17332). p. 122. Schloss Dagstuhl~ LeibnizZentrum für Informatik (2018).

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. 137151. SpringerVerlag (2018).
2017 [ to top ]

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, 902920 (2017).

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:111:4 (2017).

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).

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, 757786 (2017).

Peng, D., Wolff, A., Haunert, J.H.: Using the A\($^\star$\) 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. 389404. SpringerVerlag (2017).

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. 265276. SpringerVerlag (2017).

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, 873913 (2017).
2016 [ to top ]

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. 144151. SpringerVerlag (2016).

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

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. 399415. SpringerVerlag (2016).

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

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, 133158 (2016).

Budig, B., Dijk, T.C. van, Wolff, A.: Matching Labels and Markers in Historical Maps: An Algorithm with Interactive Postprocessing. ACM Trans. Spatial Algorithms Syst. 2, 13:113:24 (2016).

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. 139. Springer Berlin Heidelberg (2016).

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. 295308. SpringerVerlag (2016).

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. 105119. SpringerVerlag (2016).

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. 166180. SpringerVerlag (2016).

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

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. 382398. SpringerVerlag (2016).
2015 [ to top ]

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).

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. 113. SpringerVerlag (2015).

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. 269287. SpringerVerlag (2015).[ BibTeX ]

Lipp, F., Wolff, A.L., 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. 5259. SpringerVerlag (2015).

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

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. 472486. SpringerVerlag (2015).

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. 222233. SpringerVerlag (2015).

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

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. 295310. SpringerVerlag (2014).[ BibTeX ]

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

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. 8799. SpringerVerlag, Wroc{\l}aw (2014).

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. 488500. SpringerVerlag (2014).

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, 174175 (2014).

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

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. 517520 (2014).

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. 144155. SpringerVerlag (2014).

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. 7688. SpringerVerlag (2014).[ BibTeX ]

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, 313324 (2014).

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. 514525. SpringerVerlag (2014).

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. 515516. SpringerVerlag (2014).

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. 367379. SpringerVerlag (2014).
2013 [ to top ]

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. 463474. SpringerVerlag (2013).

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

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. 117122. , Waterloo, ON, Canada (2013).

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. 463474. SpringerVerlag (2013).

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. 119122. , Braunschweig (2013).

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).

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. 6778. SpringerVerlag (2013).

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

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

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. 722732. SpringerVerlag (2013).

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. 8184. , Braunschweig (2013).

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. 233236. , Braunschweig (2013).

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, 23262335 (2013).
2012 [ to top ]

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. 7788. SpringerVerlag, Saarbr{ü}cken (2012).

Atienza, N., de Castro, N., Cortés, C., Garrido, M.Á., 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).

Rutter, I., Wolff, A.: Augmenting the Connectivity of Planar and Geometric Graphs. Journal of Graph Algorithms & Applications. 16, 599628 (2012).

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. 186197. SpringerVerlag (2012).

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, 309332 (2012).

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. 441442. SpringerVerlag (2012).

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

Fink, M., Haunert, J.H., Schulz, A., Spoerhase, J., Wolff, A.: Algorithms for Labeling Focus Regions. IEEE Transactions on Visualization and Computer Graphics. 18, 25832592 (2012).
2011 [ to top ]

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

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. 4960. SpringerVerlag, Saarbr{ü}cken (2011).

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

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

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. 207218. SpringerVerlag (2010).

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

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

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. 7376. , Dortmund (2010).

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

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. 192201. , San Jose, CA (2010).

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. 239250. , Nancy (2010).
2009 [ to top ]

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).

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

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, 267288 (2009).

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. 106119 (2009).

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

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. 324335. SpringerVerlag, Hersonissos, Crete (2009).

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, 323 (2009).
2008 [ to top ]

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. 101112. SpringerVerlag, Sydney (2008).

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. 473484. SpringerVerlag, Nov{{\'y}} Smokovec, Slovakia (2008).

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

Nöllenburg, M., Merrick, D., Wolff, A., Benkert, M.: Morphing Polylines: A Step Towards Continuous Generalization. Computers, Environment and Urban Systems. 32, 248260 (2008).

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. 265276. , Bordeaux (2008).

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

Rutter, I., Wolff, A.: Computing Large Matchings Fast. Proc. 19th ACMSIAM Sympos. Discrete Algorithms (SODA'08). p. 183192. , San Francisco (2008).

Atienza, N., de Castro, N., Cortés, C., Garrido, M.Á., 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. 171182. SpringerVerlag, Sydney (2008).

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

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. 7174. , Nancy (2008).

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

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

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

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. 373378. , Beijing (2008).

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. 5558. , Nancy (2008).

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. 1019. , College Park, MD (2008).
2007 [ to top ]

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. 69. , Graz (2007).

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

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. 177186. SpringerVerlag, Harrachov, Czech Republic (2007).

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

Wolff, A.: Drawing Subway Maps: A Survey. Informatik~ Forschung & Entwicklung. 22, 2344 (2007).

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. 270281. SpringerVerlag, Karlsruhe, Germany (2007).

Atienza, N., de Castro, N., Cortés, C., Garrido, M.Á., 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).

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

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. 714. Australian Computer Society, Ballarat, Australia (2007).

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. 390399. , Maynooth, Ireland (2007).

Rutter, I., Wolff, A.: Computing Large Matchings Fast. Fakultät für Informatik, Universität Karlsruhe (2007).
2006 [ to top ]

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).[ BibTeX ]

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).

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. 7582. , Arlington, VA (2006).

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. 166175. SpringerVerlag, Taipei (2006).

Bereg, S., Völker, M., Wolff, A.: Compact Drawing of Clustered Layered Graphs, (2006).

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. 141144. , Delphi (2006).

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. 166175. SpringerVerlag, Merin, Czech Republic (2006).

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. 177186. SpringerVerlag, Merin, Czech Republic (2006).

Gerdjikov, S., Wolff, A.: PseudoConvex Decomposition of Simple Polygons. Proc. 22nd European Workshop on Computational Geometry (EWCG'06). p. 1316. , Delphi (2006).

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. 137140. , Delphi (2006).

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

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. 321333. SpringerVerlag, Limerick, Ireland (2006).

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

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. 3138. , Venezia (2006).
2005 [ to top ]

Knauer, C., Schramm, É., Spillner, A., Wolff, A.: Configurations with Few Crossings in Topological Graphs. Fakultät für Informatik, Universität Karlsruhe (2005).

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

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, 5977 (2005).

Reinbacher, I., Benkert, M., van Kreveld, M., Mitchell, J.S.B., 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. 143154. SpringerVerlag, Eivissa, Spain (2005).

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

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. 4959. SpringerVerlag, New York (2005).

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. 6275. SpringerVerlag, Tokyo (2005).

Knauer, C., Schramm, É., 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. 604613. SpringerVerlag, Sanya, Hainan, China (2005).

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. 162172. , Seoul (2005).

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

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

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. 1628. SpringerVerlag, Tokyo (2005).

Reinbacher, I., Benkert, M., van Kreveld, M., Wolff, A.: Delineating Boundaries for Imprecise Regions. Proc. 21st European Workshop on Computational Geometry (EWCG'05). p. 127130. , Eindhoven (2005).
2004 [ to top ]

Benkert, M., Widmann, F., Wolff, A.: The Minimum Manhattan Network Problem: A Fast Factor3 Approximation. Abstracts 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG'04). p. 8586. , Tokyo (2004).

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. 97100. , Sevilla (2004).

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. 4548. , Sevilla (2004).

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, 87106 (2004).

Asano, T., de Berg, M., Cheong, O., Everett, H., Haverkort, H., Katoh, N., Wolff, A.: Optimal Spanners for AxisAligned Rectangles. Department of Computer Science, Utrecht University (2004).

Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. Fakultät für Informatik, Universität Karlsruhe (2004).

Daescu, O., Mi, N., Shin, C.S., Wolff, A.: FarthestPoint Queries with Geometric and Combinatorial Constraints. Abstracts 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG'04). p. 110111. , Tokyo (2004).

Arampatzis, A., van Kreveld, M., Reinbacher, I., Jones, C.B., Vaid, S., Clough, P., Joho, H., Sanderson, M., Benkert, M., Wolff, A.: WebBased Delineation of Imprecise Regions. Proc. Workshop on Geographic Information Retrieval at SIGIR'04. , Sheffield (2004).

Wolff, A., Benkert, M., Shirabe, T.: The Minimum Manhattan Network Problem: Approximations and Exact Solutions. Proc. 20th European Workshop on Computational Geometry (EWCG'04). p. 209212. , Sevilla (2004).

Benkert, M., Widmann, F., Wolff, A.: The Minimum Manhattan Network Problem: A Fast Factor3 Approximation. Fakultät für Informatik, Universität Karlsruhe (2004).

van Kreveld, M., Schramm, É., Wolff, A.: Algorithms for the Placement of Diagrams on Maps. In: Pfoder, D., Cruz, I.F., and Ronthaler, M. (eds.) Proc. 12th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACMGIS'04). p. 222231. , Washington D.C. (2004).
2003 [ to top ]

Poon, S.H., Shin, C.S., Strijk, T., Uno, T., Wolff, A.: Labeling Points with Weights. Algorithmica. 38, 341362 (2003).
2002 [ to top ]

van Dijk, S., van Kreveld, M., Strijk, T., Wolff, A.: Towards an Evaluation of Quality for Names Placement Methods. International Journal of Geographical Information Science. 16, 641661 (2002).

Wolff, A., Thon, M., Xu, Y.: A Simple Factor2/3 Approximation Algorithm for TwoCircle Point Labeling. International Journal of Computational Geometry and Applications. 12, 269281 (2002).

Gudmundsson, J., Haverkort, H., Park, S.M., Shin, C.S., Wolff, A.: Facility Location and the Geometric MinimumDiameter Spanning Tree. In: Jansen, K., Leonardi, S., and Vazirani, V. (eds.) Proc. 5th Int. Workshop Approx. Algorithms Combin. Optim. (APPROX'02). p. 146160. SpringerVerlag, Roma (2002).

Kapoor, V., Kühl, D., Wolff, A.: A Tutorial for Designing Flexible Geometric Algorithms. Algorithmica. 33, 5270 (2002).

Gudmundsson, J., Haverkort, H., Park, S.M., Shin, C.S., Wolff, A.: Approximating the Geometric MinimumDiameter Spanning Tree. Proc. 18th European Workshop on Computational Geometry (EWCG'02). p. 4145. , Warszawa (2002).

Gudmundsson, J., Haverkort, H., Park, S.M., Shin, C.S., Wolff, A.: Approximating the Geometric MinimumDiameter Spanning Tree. Institut für Mathematik und Informatik, Universität Greifswald (2002).

Bach, K., Hanig, K., Hoffmann, T., Kresse, W., Löcherbach, J., Rosenthal, P., Rudnick, S., Schreiber, P., Thon, M., Wolff, A.: Beschriftungsalgorithmen in Theorie & Praxis. Institut für Mathematik und Informatik, Universität Greifswald (2002).
2001 [ to top ]

Poon, S.H., Shin, C.S., Strijk, T., Wolff, A.: Labeling Points with Weights. In: Eades, P. and Takaoka, T. (eds.) Proc. 12th Annu. Int. Symp. Algorithms Comput. (ISAAC'01). p. 610622. SpringerVerlag, Christchurch (2001).

Wolff, A., Knipping, L., van Kreveld, M., Strijk, T., Agarwal, P.K.: A Simple and Efficient Algorithm for HighQuality Line Labeling. Department of Computer Science, Utrecht University (2001).

Strijk, T., Wolff, A.: Labeling Points with Circles. International Journal of Computational Geometry and Applications. 11, 181195 (2001).

van Dijk, S., van Kreveld, M., Strijk, T., Wolff, A.: Towards an Evaluation of Quality for Names Placement Methods. Department of Computer Science, Utrecht University (2001).

Poon, S.H., Shin, C.S., Strijk, T., Wolff, A.: Labeling Points with Weights. Institut für Mathematik und Informatik, Universität Greifswald (2001).

Wagner, F., Wolff, A., Kapoor, V., Strijk, T.: Three Rules Suffice for Good Label Placement. Algorithmica. 30, 334349 (2001).

Garrido, M.Á., Iturriaga, C., Márquez, A., Portillo, J.R., Reyes, P., Wolff, A.: Labeling Subway Lines. In: Eades, P. and Takaoka, T. (eds.) Proc. 12th Annu. Int. Symp. Algorithms Comput. (ISAAC'01). p. 649659. SpringerVerlag, Christchurch (2001).

Poon, S.H., Shin, C.S., Strijk, T., Wolff, A.: Labeling Points with Weights. Proc. 17th European Workshop on Computational Geometry (EWCG'01). p. 97100. , Berlin (2001).

Garrido, M.Á., Márquez, A., Iturriaga, C., Portillo, J.R., Reyes, P., Wolff, A.: Etiquetado de puntos alineados. Proc. IX Encuentros de Geometría Computacional (EGC'01). p. 285294. , Girona (2001).[ BibTeX ]
2000 [ to top ]

Qin, Z., Wolff, A., Xu, Y., Zhu, B.: New Algorithms for TwoLabel Point Labeling. In: Paterson, M. (ed.) Proc. 8th Annu. Europ. Symp. on Algorithms (ESA'00). p. 368379. SpringerVerlag, Saarbr{ü}cken (2000).

Wolff, A., Thon, M., Xu, Y.: A Better Lower Bound for TwoCircle Point Labeling. In: Lee, D.T. and Teng, S.H. (eds.) Proc. 11th Annu. Int. Symp. Algorithms Comput. (ISAAC'00). p. 422431. SpringerVerlag, Taipei (2000).

Wolff, A.: A Simple Proof for the NPHardness of Edge Labeling. Institut für Mathematik und Informatik, Universität Greifswald (2000).

Qin, Z., Wolff, A., Xu, Y., Zhu, B.: New Algorithms for TwoLabel Point Labeling. Hongkong University of Science and Technology (2000).[ BibTeX ]

Wolff, A., Knipping, L., van Kreveld, M., Strijk, T., Agarwal, P.K.: A Simple and Efficient Algorithm for HighQuality Line Labeling. In: Atkinson, P.M. and Martin, D.J. (eds.) Innovations in GIS VII: GeoComputation. p. 147159. Taylor & Francis (2000).

Thon, M., Wolff, A., Xu, Y.: Ein neuer Algorithmus zur Beschriftung von Punkten mit je zwei Kreisen. In: Gesellschaft für Informatik e.V., (ed.) Tagungsband der Informatiktage. , Bad Schussenried (2000).[ BibTeX ]

Kapoor, V., Kühl, D., Wolff, A.: A Generic Design Concept for Geometric Algorithms. Institut für Informatik, Fachbereich Mathematik und Informatik, Freie Universität Berlin (2000).[ BibTeX ]
1999 [ to top ]

Wagner, F., Wolff, A.: A Combinatorial Framework for Map Labeling. In: Whitesides, S.H. (ed.) Proc. 6th Int. Sympos. Graph Drawing (GD'98). p. 316331. SpringerVerlag, Montr{é}al (1999).

Agarwal, P.K., Knipping, L., van Kreveld, M., Strijk, T., Wolff, A.: A Simple and Efficient Algorithm for HighQuality Line Labeling. Proc. 15th European Workshop on Computational Geometry (EWCG'99). p. 9396. , SophiaAntipolis (1999).[ BibTeX ]