Publications by Type

Chapter (part of a book) [ to top ]

  • 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).
     
  • 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).
     
  • Wolff, A., Knipping, L., van Kreveld, M., Strijk, T., Agarwal, P.K.: A Simple and Efficient Algorithm for High-Quality Line Labeling. In: Atkinson, P.M. and Martin, D.J. (eds.) Innovations in GIS VII: GeoComputation. p. 147--159. Taylor & Francis (2000).
     
  • Wolff, A.: The Hardness of Approximating Set Cover. In: Mayr, E.W., Prömel, H.J., and Steger, A. (eds.) Lectures on Proof Verification and Approximation Algorithms. p. 249--262. Springer-Verlag (1998).
     

Article in journal, newspaper, or magazine [ to top ]

  • Das, A., Fleszar, K., Kobourov, S.G., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica. (2017).
     
  • 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).
     
  • Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. Journal of Graph Algorithms & Applications. 20, 133--158 (2016).
     
  • Lipp, F., Wolff, A., Zink, J.: Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. Algorithms. 9, article 53, 17 pages (2016).
     
  • Budig, B., Dijk, T.C.V., Wolff, A.: Matching Labels and Markers in Historical Maps: An Algorithm with Interactive Postprocessing. ACM Trans. Spatial Algorithms Syst. 2, 13:1--13:24 (2016).
     
  • Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Multi-Sided Boundary Labeling. Algorithmica. 76, 225--258 (2016).
     
  • Fink, M., Pupyrev, S., Wolff, A.: Ordering Metro Lines by Block Crossings. Journal of Graph Algorithms & Applications. 19, 111--153 (2015).
     
  • 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).
     
  • 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).
     
  • 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).
     
  • 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).
     
  • Atienza, N., de Castro, N., Cortés, C., Garrido, M.Á., Grima, C.I., Hernández, G., Márquez, A., Moreno-Gonzá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, 599--628 (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, 2583--2592 (2012).
     
  • Buchin, K., Buchin, M., Byrka, J., Nöllenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A.: Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. Algorithmica. 62, 309--332 (2012).
     
  • Nöllenburg, M., Wolff, A.: Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming. IEEE Transactions on Visualization and Computer Graphics. 17, 626--641 (2011).
     
  • Haunert, J.-H., Wolff, A.: Area aggregation in map generalisation by mixed-integer programming. International Journal of Geographical Information Science. 24, 1871--1897 (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, 312--328 (2010).
     
  • 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).
     
  • Rutter, I., Wolff, A.: Computing Large Matchings Fast. ACM Transactions on Algorithms. 7, article 1, 21 pages (2010).
     
  • Benkert, M., Gudmundsson, J., Knauer, C., van Oostrum, R., Wolff, A.: A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. International Journal of Computational Geometry and Applications. 19, 267--288 (2009).
     
  • Bereg, S., Mutsanas, N., Wolff, A.: Matching Points with Rectangles and Squares. Computational Geometry: Theory and Applications. 42, 93--108 (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, 3--23 (2009).
     
  • 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).
     
  • 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).
     
  • Reinbacher, I., Benkert, M., van Kreveld, M., Mitchell, J.S.B., Snoeyink, J., Wolff, A.: Delineating Boundaries for Imprecise Regions. Algorithmica. 50, 386--414 (2008).
     
  • Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Constructing Interference-Minimal Networks. Computational Geometry: Theory and Applications. 40, 179--194 (2008).
     
  • 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).
     
  • Gerdjikov, S., Wolff, A.: Decomposing a Simple Polygon into Pseudo-Triangles and Convex Polygons. Computational Geometry: Theory and Applications. 41, 21--30 (2008).
     
  • 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).
     
  • Knauer, C., Schramm, É., Spillner, A., Wolff, A.: Configurations with Few Crossings in Topological Graphs. Computational Geometry: Theory and Applications. 37, 104--114 (2007).
     
  • Wolff, A.: Drawing Subway Maps: A Survey. Informatik~-- Forschung & Entwicklung. 22, 23--44 (2007).
     
  • 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).
     
  • Daescu, O., Mi, N., Shin, C.-S., Wolff, A.: Farthest-Point Queries with Geometric and Combinatorial Constraints. Computational Geometry: Theory and Applications. 33, 174--185 (2006).
     
  • Asano, T., de Berg, M., Cheong, O., Everett, H., Haverkort, H., Katoh, N., Wolff, A.: Optimal Spanners for Axis-Aligned Rectangles. Computational Geometry: Theory and Applications. 30, 59--77 (2005).
     
  • Gudmundsson, J., Haverkort, H., Park, S.-M., Shin, C.-S., Wolff, A.: Facility Location and the Geometric Minimum-Diameter Spanning Tree. Computational Geometry: Theory and Applications. 27, 87--106 (2004).
     
  • Poon, S.-H., Shin, C.-S., Strijk, T., Uno, T., Wolff, A.: Labeling Points with Weights. Algorithmica. 38, 341--362 (2003).
     
  • Kapoor, V., Kühl, D., Wolff, A.: A Tutorial for Designing Flexible Geometric Algorithms. Algorithmica. 33, 52--70 (2002).
     
  • 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, 641--661 (2002).
     
  • Wolff, A., Thon, M., Xu, Y.: A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling. International Journal of Computational Geometry and Applications. 12, 269--281 (2002).
     
  • Wagner, F., Wolff, A., Kapoor, V., Strijk, T.: Three Rules Suffice for Good Label Placement. Algorithmica. 30, 334--349 (2001).
     
  • Strijk, T., Wolff, A.: Labeling Points with Circles. International Journal of Computational Geometry and Applications. 11, 181--195 (2001).
     
  • van Kreveld, M., Strijk, T., Wolff, A.: Point Labeling with Sliding Labels. Computational Geometry: Theory and Applications. 13, 21--47 (1999).
     
  • Wagner, F., Wolff, A.: A Practical Map Labeling Algorithm. Computational Geometry: Theory and Applications. 7, 387--404 (1997).
     

Book or Conference Proceedings [ to top ]

  • Wismath, S., Wolff, A. eds: Proceedings of the 21st International Symposium on Graph Drawing (GD'13). Springer-Verlag (2013).
     
  • Kobourov, S., Wolff, A., van Ham, F. eds: Putting Data on the Map. Schloss Dagstuhl~-- Leibniz-Zentrum für Informatik (2012).
     
  • Dykes, J., Müller-Hannemann, M., Wolff, A. eds: Schematization in Cartography, Visualization, and Computational Geometry. , Schloss Dagstuhl (2011).
     
  • Gudmundsson, J., Klein, R., Narasimhan, G., Smid, M., Wolff, A. eds: Geometric Networks and Metric Space Embeddings. , Schloss Dagstuhl (2007).
     

Article in Conference Proceedings [ to top ]

  • 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). Springer-Verlag (2017).
     
  • 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). Springer-Verlag (2017).
     
  • Haunert, J.-H., Wolff, A.: Beyond Maximum Independent Set: An Extended Model for Point-Feature Label Placement. Proc. ISPRS (Commission II, WG II/2). p. 109--114 (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. 105--119. Springer-Verlag (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. 166--180. Springer-Verlag (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. 295--308. Springer-Verlag (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. 382--398. Springer-Verlag (2016).
     
  • 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. Springer-Verlag (2016).
     
  • 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. Springer-Verlag (2015).
     
  • 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).
     
  • 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. Springer-Verlag (2015).
     
  • Bereg, S., Fleszar, K., Kindermann, P., Pupyrev, S., Spoerhase, J., Wolff, A.: Colored Non-Crossing Euclidean Steiner Forest. In: Elbassioni, K. and Makino, K. (eds.) Proc. 26th Annu. Int. Symp. Algorithms Comput. (ISAAC'15). p. 1--13. Springer-Verlag (2015).
     
  • Lipp, F., Wolff, A.L., Zink, J.: Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. In: Di Giacomo, E. and Lubiw, A. (eds.) Proc. 23rd Int. Symp. Graph Drawing & Network Vis. (GD'15). p. 52--59. Springer-Verlag (2015).
     
  • Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. In: Rahman, M.S. and Tomita, E. (eds.) Proc. 9th Int. Workshop Algorithms Comput. (WALCOM'15). p. 222--233. Springer-Verlag (2015).
     
  • Peng, D., Wolff, A.: Watch Your Data Structures. Proc. 22th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK'14). , Glasgow (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. 367--379. Springer-Verlag (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. 76--88. Springer-Verlag (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.) Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM-GIS'14). p. 517--520 (2014).
     
  • Fink, M., Lechner, M., Wolff, A.: Concentric Metro Maps. Proc. Schematic Mapping Workshop (SMW'14). , Wivenhoe Park (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. 87--99. Springer-Verlag, Wroc{\l}aw (2014).
     
  • 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. Springer-Verlag (2014).
     
  • Bekos, M.A., van Dijk, T.C., Kindermann, P., Wolff, A.: Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. In: Duncan, C. and Symvonis, A. (eds.) Proc. 22nd Int. Sympos. Graph Drawing (GD'14). p. 515--516. Springer-Verlag (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. 514--525. Springer-Verlag (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. 144--155. Springer-Verlag (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. 488--500. Springer-Verlag (2014).
     
  • Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Two-Sided Boundary Labeling with Adjacent Sides. In: Fekete, S. (ed.) Proc. 29th Europ. Workshop Comput. Geom. (EuroCG'13). p. 233--236. , 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).
     
  • 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).
     
  • 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. Springer-Verlag (2013).
     
  • Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Two-Sided Boundary Labeling with Adjacent Sides. In: Dehne, F., Solis-Oba, R., and Sack, J.-R. (eds.) Proc. 13th Int. Algorithms Data Struct. Symp. (WADS'13). p. 463--474. Springer-Verlag (2013).
     
  • 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. Springer-Verlag (2013).
     
  • Peng, D., Haunert, J.-H., Wolff, A.: Morphing Polylines Based on Least Squares Adjustment. Proc. 16th ICA Generalisation Workshop (ICAGW'13). , Dresden (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. 119--122. , Braunschweig (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. 463--474. Springer-Verlag (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. 81--84. , Braunschweig (2013).
     
  • Schwartges, N., Spoerhase, J., Wolff, A.: Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. In: Solis-Oba, R. and Persiano, G. (eds.) Proc. 9th Workshop Approx. Online Algorithms (WAOA'11). p. 77--88. Springer-Verlag, Saarbr{ü}cken (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. 441--442. Springer-Verlag (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. 186--197. Springer-Verlag (2012).
     
  • 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. Springer-Verlag, Saarbr{ü}cken (2011).
     
  • 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).
     
  • Haunert, J.-H., Wolff, A.: Optimal and Topologically Safe Simplification of Building Footprints. Proc. 18th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS'10). p. 192--201. , San Jose, CA (2010).
     
  • Katz, B., Krug, M., Rutter, I., Wolff, A.: Manhattan-Geodesic Embedding of Planar Graphs. In: Eppstein, D. and Gansner, E.R. (eds.) Proc. 17th Int. Sympos. Graph Drawing (GD'09). p. 207--218. Springer-Verlag (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. 73--76. , Dortmund (2010).
     
  • 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).
     
  • Keiren, J., van Walderveen, F., Wolff, A.: Constructability of Trip-lets. In: Langerman, S. (ed.) Proc. 25th European Workshop on Computational Geometry (EuroCG'09). , Brussels (2009).
     
  • Buchin, K., Buchin, M., Byrka, J., Nöllenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A.: Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. In: Tollis, I.G. and Patrignani, M. (eds.) Proc. 16th Int. Sympos. Graph Drawing (GD'08). p. 324--335. Springer-Verlag, Hersonissos, Crete (2009).
     
  • 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).
     
  • Rutter, I., Wolff, A.: Computing Large Matchings Fast. Proc. 19th ACM-SIAM Sympos. Discrete Algorithms (SODA'08). p. 183--192. , San Francisco (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. 265--276. , Bordeaux (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. 373--378. , Beijing (2008).
     
  • 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. Springer-Verlag, Sydney (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. 71--74. , Nancy (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. 473--484. Springer-Verlag, Nov{{\'y}} Smokovec, Slovakia (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. 55--58. , Nancy (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. 171--182. Springer-Verlag, Sydney (2008).
     
  • 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).
     
  • 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).
     
  • 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).
     
  • 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. Springer-Verlag, Harrachov, Czech Republic (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. 7--14. Australian Computer Society, Ballarat, Australia (2007).
     
  • Benkert, M., Nöllenburg, M., Uno, T., Wolff, A.: Minimizing Intra-Edge 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. Springer-Verlag, Karlsruhe, Germany (2007).
     
  • Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Constructing Interference-Minimal 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. Springer-Verlag, Merin, Czech Republic (2006).
     
  • Benkert, M., Gudmundsson, J., Knauer, C., Moet, E., van Oostrum, R., Wolff, A.: A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. Proc. 22nd European Workshop on Computational Geometry (EWCG'06). p. 141--144. , Delphi (2006).
     
  • Halldórsson, M.M., Wolff, A., Tokuyama, T.: Improved Fixed-Parameter Algorithms for Non-Crossing Subgraphs. Proc. ICALP Affiliated Workshop on Improving Exponential-Time Algorithms (iETA'06). p. 31--38. , Venezia (2006).
     
  • Gerdjikov, S., Wolff, A.: Pseudo-Convex Decomposition of Simple Polygons. Proc. 22nd European Workshop on Computational Geometry (EWCG'06). p. 13--16. , Delphi (2006).
     
  • 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).
     
  • Benkert, M., Gudmundsson, J., Knauer, C., Moet, E., van Oostrum, R., Wolff, A.: A Polynomial-Time 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. Springer-Verlag, Taipei (2006).
     
  • Nöllenburg, M., Wolff, A.: A Mixed-Integer Program for Drawing High-Quality Metro Maps. In: Healy, P. and Nikolov, N.S. (eds.) Proc. 13th Int. Sympos. Graph Drawing (GD'05). p. 321--333. Springer-Verlag, Limerick, Ireland (2006).
     
  • Haunert, J.-H., Wolff, A.: Generalization of Land Cover Maps by Mixed Integer Programming. Proc. 14th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS'06). p. 75--82. , Arlington, VA (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. 137--140. , Delphi (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. 177--186. Springer-Verlag, Merin, Czech Republic (2006).
     
  • 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).
     
  • 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. 604--613. Springer-Verlag, Sanya, Hainan, China (2005).
     
  • Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Constructing Interference-Minimal Networks. Proc. 21st European Workshop on Computational Geometry (EWCG'05). p. 203--206. , 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. 49--59. Springer-Verlag, New York (2005).
     
  • 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).
     
  • 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. 143--154. Springer-Verlag, Eivissa, Spain (2005).
     
  • Benkert, M., Widmann, F., Wolff, A.: The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. In: Akiyama, J., Kano, M., and Tan, X. (eds.) Proc. 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG'04). p. 16--28. Springer-Verlag, Tokyo (2005).
     
  • Daescu, O., Mi, N., Shin, C.-S., Wolff, A.: Farthest-Point 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. Springer-Verlag, 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. 127--130. , Eindhoven (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. 195--198. , Eindhoven (2005).
     
  • Arampatzis, A., van Kreveld, M., Reinbacher, I., Jones, C.B., Vaid, S., Clough, P., Joho, H., Sanderson, M., Benkert, M., Wolff, A.: Web-Based Delineation of Imprecise Regions. Proc. Workshop on Geographic Information Retrieval at SIGIR'04. , Sheffield (2004).
     
  • Daescu, O., Mi, N., Shin, C.-S., Wolff, A.: Farthest-Point Queries with Geometric and Combinatorial Constraints. Proc. 20th European Workshop on Computational Geometry (EWCG'04). p. 45--48. , Sevilla (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. (ACM-GIS'04). p. 222--231. , Washington D.C. (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. 209--212. , Sevilla (2004).
     
  • Asano, T., de Berg, M., Cheong, O., Everett, H., Haverkort, H., Katoh, N., Wolff, A.: Optimal Spanners for Axis-Aligned Rectangles. Proc. 20th European Workshop on Computational Geometry (EWCG'04). p. 97--100. , Sevilla (2004).
     
  • Daescu, O., Mi, N., Shin, C.-S., Wolff, A.: Farthest-Point Queries with Geometric and Combinatorial Constraints. Abstracts 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG'04). p. 110--111. , Tokyo (2004).
     
  • Benkert, M., Widmann, F., Wolff, A.: The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. Abstracts 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG'04). p. 85--86. , Tokyo (2004).
     
  • Gudmundsson, J., Haverkort, H., Park, S.-M., Shin, C.-S., Wolff, A.: Facility Location and the Geometric Minimum-Diameter Spanning Tree. In: Jansen, K., Leonardi, S., and Vazirani, V. (eds.) Proc. 5th Int. Workshop Approx. Algorithms Combin. Optim. (APPROX'02). p. 146--160. Springer-Verlag, Roma (2002).
     
  • Gudmundsson, J., Haverkort, H., Park, S.-M., Shin, C.-S., Wolff, A.: Approximating the Geometric Minimum-Diameter Spanning Tree. Proc. 18th European Workshop on Computational Geometry (EWCG'02). p. 41--45. , War-szawa (2002).
     
  • 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. 610--622. Springer-Verlag, 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. 97--100. , Berlin (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. 649--659. Springer-Verlag, Christchurch (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. 285--294. , Girona (2001).
     
  • Qin, Z., Wolff, A., Xu, Y., Zhu, B.: New Algorithms for Two-Label Point Labeling. In: Paterson, M. (ed.) Proc. 8th Annu. Europ. Symp. on Algorithms (ESA'00). p. 368--379. Springer-Verlag, Saarbr{ü}cken (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).
     
  • Wolff, A., Thon, M., Xu, Y.: A Better Lower Bound for Two-Circle Point Labeling. In: Lee, D.T. and Teng, S.-H. (eds.) Proc. 11th Annu. Int. Symp. Algorithms Comput. (ISAAC'00). p. 422--431. Springer-Verlag, Taipei (2000).
     
  • van Dijk, S., van Kreveld, M., Strijk, T., Wolff, A.: Towards an Evaluation of Quality for Label Placement Methods. Proc. 19th Int. Cartographic Conf. (ICA'99). p. 905--913. Int. Cartographic Association, Ottawa (1999).
     
  • Wolff, A., Knipping, L., van Kreveld, M., Strijk, T., Agarwal, P.K.: A Simple and Efficient Algorithm for High-Quality Line Labeling. In: Martin, D. and Wu, F. (eds.) Proc. 7th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK'99). p. 146--150. , Southampton (1999).
     
  • Agarwal, P.K., Knipping, L., van Kreveld, M., Strijk, T., Wolff, A.: A Simple and Efficient Algorithm for High-Quality Line Labeling. Proc. 15th European Workshop on Computational Geometry (EWCG'99). p. 93--96. , Sophia-Antipolis (1999).
     
  • Wagner, F., Wolff, A.: A Combinatorial Framework for Map Labeling. In: Whitesides, S.H. (ed.) Proc. 6th Int. Sympos. Graph Drawing (GD'98). p. 316--331. Springer-Verlag, Montr{é}al (1999).
     
  • van Kreveld, M., Strijk, T., Wolff, A.: Point Set Labeling with Sliding Labels. Proc. 14th Annu. ACM Sympos. Comput. Geom. (SoCG'98). p. 337--346. , Minneapolis (1998).
     
  • Schönherr, S., Wolff, A.: MakeIt! -- Generating and Maintaining Makefiles Automatically. In: Battini, R. and Bertossi, A.A. (eds.) Proc. Workshop on Algorithms and Experiments (ALEX'98). p. 165--174. , Trento (1998).
     
  • Wagner, F., Wolff, A.: Fast and Reliable Map Labeling. In: und Werner Pillmann, H.K. (ed.) Proc. 9th Int. Symp. Computer Science for Environment Protection (CSEP'95). p. 667--675. Metropolis, Berlin (1995).
     
  • Wagner, F., Wolff, A.: Map Labeling Heuristics: Provably Good and Practically Useful. Proc. 11th Annu. ACM Sympos. Comput. Geom. (SoCG'95). p. 109--118. , Vancouver (1995).
     
  • Wagner, F., Wolff, A.: An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. In: Spirakis, P. (ed.) Proc. 3rd Annu. Europ. Symp. on Algorithms (ESA'95). p. 420--433. Springer-Verlag, Corfu (1995).
     

PhD or Master Thesis [ to top ]

  • Wolff, A.: Automated Label Placement in Theory and Practice, (1999).
     
  • Wolff, A.: Map Labeling, (1995).
     

Miscellaneous [ to top ]

  • Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The Complexity of Drawing Graphs on Few Lines and Few Planes, http://arxiv.org/abs/1607.06444, (2016).
     
  • 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, http://arxiv.org/abs/1311.4778, (2014).
     
  • Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Multi-Sided Boundary Labeling, http://arxiv.org/abs/1305.0750, (2013).
     
  • Das, A., Fleszar, K., Kobourov, S.G., Spoerhase, J., Veeramoni, S., Wolff, A.: Polylogarithmic Approximation for Generalized Minimum Manhattan Networks, http://arxiv.org/abs/1203.6481, (2012).
     
  • Buchin, K., Buchin, M., Byrka, J., Nöllenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A.: Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability, http://arxiv.org/abs/0806.0920, (2008).
     
  • Bereg, S., Völker, M., Wolff, A.: Compact Drawing of Clustered Layered Graphs, (2006).
     
  • Wolff, A.: Geometrische Netzwerke und ihre Visualisierung, (2005).
     
  • van Kreveld, M., Neyer, G., Schirra, S., Rickenbach, R., Wagner, F., Widmayer, P., Wolff, A.: Geographic Information Systems, (1997).
     
  • Wolff, A., Strijk, T.: The Map-Labeling Bibliography, http://i11www.ira.uka.de/map-labeling/bibliography/, (1996).