piwik-script

English Intern
    Lehrstuhl für Informatik I - Algorithmen und Komplexität

    Veröffentlichungen (nach Typ)

    Kapitel (Teil eines Buches) [ nach oben ]

    • 1.
      Haunert, J.-H., Wolff, A.: Räumliche Analyse durch kombinatorische Optimierung. In: Freeden, W. und Rummel, R. (hrsg.) Handbuch der Geodäsie (6 Bände). S. 1–39. Springer Berlin Heidelberg (2016).
       
    • 2.
      Wolff, A.: Graph Drawing and Cartography. In: Tamassia, R. (hrsg.) Handbook of Graph Drawing and Visualization. S. 697–736. CRC Press, Boca Raton, FL (2013).
       
    • 3.
      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. und Martin, D.J. (hrsg.) Innovations in GIS VII: GeoComputation. S. 147–159. Taylor & Francis (2000).
       
    • 4.
      Wolff, A.: The Hardness of Approximating Set Cover. In: Mayr, E.W., Prömel, H.J., und Steger, A. (hrsg.) Lectures on Proof Verification and Approximation Algorithms. S. 249–262. Springer-Verlag (1998).
       

    Artikel in einem Journal, einer Zeitung oder einem Magazin [ nach oben ]

    • 1.
      Evans, W.S., Fleszar, K., Kindermann, P., Saeedi, N., Shin, C.-S., Wolff, A.: Minimum Rectilinear Polygons for Given Angle Sequences. Computational Geometry: Theory and Applications. 100, 1–39 (2022).
       
    • 2.
      Geiger, J., Cornelsen, S., Haunert, J.-H., Kindermann, P., Mchedlidze, T., Nöllenburg, M., Okamoto, Y., Wolff, A.: ClusterSets: Optimizing Planar Clusters in Categorical Point Data. Comput. Graphics Forum. 40, 471–481 (2021).
       
    • 3.
      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).
       
    • 4.
      Peng, D., Wolff, A., Haunert, J.-H.: Finding Optimal Sequences for Area Aggregation – A* vs. Integer Linear Programming. ACM Transactions on Spatial Algorithms and Systems. 7, (2020).
       
    • 5.
      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).
       
    • 6.
      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).
       
    • 7.
      Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. Computational Geometry: Theory and Applications. 84, 50–68 (2019).
       
    • 8.
      Kryven, M., Ravsky, A., Wolff, A.: Drawing Graphs on Few Circles and Few Spheres. Journal of Graph Algorithms & Applications. 23, 371–391 (2019).
       
    • 9.
      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).
       
    • 10.
      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).
       
    • 11.
      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).
       
    • 12.
      Haunert, J.-H., Wolff, A.: Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling. International Journal of Geo-Information. 6, article 342, 20 pages (2017).
       
    • 13.
      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).
       
    • 14.
      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).
       
    • 15.
      Lipp, F., Wolff, A., Zink, J.: Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. Algorithms. 9, article 53, 17 pages (2016).
       
    • 16.
      Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Multi-Sided Boundary Labeling. Algorithmica. 76, 225–258 (2016).
       
    • 17.
      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–13:24 (2016).
       
    • 18.
      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).
       
    • 19.
      Fink, M., Pupyrev, S., Wolff, A.: Ordering Metro Lines by Block Crossings. Journal of Graph Algorithms & Applications. 19, 111–153 (2015).
       
    • 20.
      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).
       
    • 21.
      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).
       
    • 22.
      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).
       
    • 23.
      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).
       
    • 24.
      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).
       
    • 25.
      Rutter, I., Wolff, A.: Augmenting the Connectivity of Planar and Geometric Graphs. Journal of Graph Algorithms & Applications. 16, 599–628 (2012).
       
    • 26.
      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).
       
    • 27.
      Atienza, N., de Castro, N., Cortés, C., Garrido, M. Ángeles, 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).
       
    • 28.
      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).
       
    • 29.
      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).
       
    • 30.
      Haunert, J.-H., Wolff, A.: Area aggregation in map generalisation by mixed-integer programming. International Journal of Geographical Information Science. 24, 1871–1897 (2010).
       
    • 31.
      Rutter, I., Wolff, A.: Computing Large Matchings Fast. ACM Transactions on Algorithms. 7, article 1, 21 pages (2010).
       
    • 32.
      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).
       
    • 33.
      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).
       
    • 34.
      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).
       
    • 35.
      Bereg, S., Mutsanas, N., Wolff, A.: Matching Points with Rectangles and Squares. Computational Geometry: Theory and Applications. 42, 93–108 (2009).
       
    • 36.
      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).
       
    • 37.
      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).
       
    • 38.
      Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Constructing Interference-Minimal Networks. Computational Geometry: Theory and Applications. 40, 179–194 (2008).
       
    • 39.
      Gerdjikov, S., Wolff, A.: Decomposing a Simple Polygon into Pseudo-Triangles and Convex Polygons. Computational Geometry: Theory and Applications. 41, 21–30 (2008).
       
    • 40.
      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).
       
    • 41.
      Reinbacher, I., Benkert, M., van Kreveld, M., Mitchell, J.S., Snoeyink, J., Wolff, A.: Delineating Boundaries for Imprecise Regions. Algorithmica. 50, 386–414 (2008).
       
    • 42.
      Wolff, A.: Drawing Subway Maps: A Survey. Informatik – Forschung & Entwicklung. 22, 23–44 (2007).
       
    • 43.
      Knauer, C., Schramm, Étienne, Spillner, A., Wolff, A.: Configurations with Few Crossings in Topological Graphs. Computational Geometry: Theory and Applications. 37, 104–114 (2007).
       
    • 44.
      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).
       
    • 45.
      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).
       
    • 46.
      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).
       
    • 47.
      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).
       
    • 48.
      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).
       
    • 49.
      Poon, S.-H., Shin, C.-S., Strijk, T., Uno, T., Wolff, A.: Labeling Points with Weights. Algorithmica. 38, 341–362 (2003).
       
    • 50.
      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).
       
    • 51.
      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).
       
    • 52.
      Kapoor, V., Kühl, D., Wolff, A.: A Tutorial for Designing Flexible Geometric Algorithms. Algorithmica. 33, 52–70 (2002).
       
    • 53.
      Wagner, F., Wolff, A., Kapoor, V., Strijk, T.: Three Rules Suffice for Good Label Placement. Algorithmica. 30, 334–349 (2001).
       
    • 54.
      Strijk, T., Wolff, A.: Labeling Points with Circles. International Journal of Computational Geometry and Applications. 11, 181–195 (2001).
       
    • 55.
      van Kreveld, M., Strijk, T., Wolff, A.: Point Labeling with Sliding Labels. Computational Geometry: Theory and Applications. 13, 21–47 (1999).
       
    • 56.
      Wagner, F., Wolff, A.: A Practical Map Labeling Algorithm. Computational Geometry: Theory and Applications. 7, 387–404 (1997).
       

    Buch oder Konferenzband [ nach oben ]

    • 1.
      Fabrikant, S.I., Miksch, S., Wolff, A. hrsg.: Visual Analytics for Sets over Time and Space. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019).
       
    • 2.
      Wismath, S., Wolff, A. hrsg.: Proceedings of the 21st International Symposium on Graph Drawing (GD’13). Springer-Verlag (2013).
       
    • 3.
      Kobourov, S., Wolff, A., van Ham, F. hrsg.: Putting Data on the Map. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012).
       
    • 4.
      Dykes, J., Müller-Hannemann, M., Wolff, A. hrsg.: Schematization in Cartography, Visualization, and Computational Geometry. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011).
       
    • 5.
      Gudmundsson, J., Klein, R., Narasimhan, G., Smid, M., Wolff, A. hrsg.: Geometric Networks and Metric Space Embeddings. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007).
       

    Dissertation oder Abschlussarbeit [ nach oben ]

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

    Artikel in Konferenzband [ nach oben ]

    • 1.
      Walter, J., Zink, J., Baumeister, J., Wolff, A.: Layered Drawing of Undirected Graphs with Generalized Port Constraints. In: Auber, D. und Valtr, P. (hrsg.) Proc. 28th Int. Symp. Graph Drawing & Network Vis. (GD’20). S. 220–234. Springer-Verlag (2021).
       
    • 2.
      Frank, F., Kaufmann, M., Kobourov, S., Mchedlidze, T., Pupyrev, S., Ueckerdt, T., Wolff, A.: Using the Metro-Map Metaphor for Drawing Hypergraphs. In: Bureš, T., Dondi, R., Gamper, J., Guerrini, G., Jurdziński, T., Pahl, C., Sikora, F., und Wong, P. (hrsg.) Proc. 47th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’21). S. 361–372. Springer-Verlag (2021).
       
    • 3.
      Arseneva, E., Kleist, L., Klemz, B., Löffler, M., Schulz, A., Vogtenhuber, B., Wolff, A.: Adjacency Graphs of Polyhedral Surfaces. In: Buchin, K. und Colin de Verdière, Éric (hrsg.) Proc. 37th Annu. Sympos. Comput. Geom. (SoCG’21). S. 11:1–11:17. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021).
       
    • 4.
      Chaplick, S., Kindermann, P., Klawitter, J., Rutter, I., Wolff, A.: Extending Partial Representations of Rectangular Duals with Given Contact Orientations. In: Calamoneri, T. und Coró, F. (hrsg.) Proc. 12th International Conference on Algorithms and Complexity (CIAC’21). S. 340–353. Springer-Verlag (2021).
       
    • 5.
      Chaplick, S., Förster, H., Kryven, M., Wolff, A.: Drawing Graphs with Circular Arcs and Right-Angle Crossings. In: Albers, S. (hrsg.) Proc. 17th Scand. Symp. and Workshops on Algorithm Theory (SWAT’20). S. 21:1–21:14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020).
       
    • 6.
      Firman, O., Felsner, S., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: The Complexity of Finding Tangles. In: Chaplick, S., Kindermann, P., und Wolff, A. (hrsg.) Proc. 36th European Workshop on Computational Geometry (EuroCG’20). S. 67:1–8 (2020).
       
    • 7.
      Evans, W., Gethner, E., Spalding-Jamieson, J., Wolff, A.: Angle Covers: Algorithms and Complexity. In: Rahman, S., Sadakane, K., und Sung, W.-K. (hrsg.) Proc. 14th Int. Workshop Algorithms Comput. (WALCOM’20). S. 94–106. Springer-Verlag (2020).
       
    • 8.
      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., und Wolff, A. (hrsg.) Proc. 36th European Workshop on Computational Geometry (EuroCG’20). S. 53:1–8 (2020).
       
    • 9.
      Chaplick, S., Kindermann, P., Löffler, A., Thiele, F., Wolff, A., Zaft, A., Zink, J.: Stick Graphs with Length Constraints. In: Archambault, D. und Tóth, C.D. (hrsg.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). S. 3–17. Springer-Verlag (2019).
       
    • 10.
      Evans, W., Rzążewski, P., Saeedi, N., Shin, C.-S., Wolff, A.: Representing Graphs and Hypergraphs by Touching Polygons in 3D. In: Archambault, D. und Tóth, C.D. (hrsg.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). S. 18–32. Springer-Verlag (2019).
       
    • 11.
      Okamoto, Y., Ravsky, A., Wolff, A.: Variants of the Segment Number of a Graph. In: Archambault, D. und Tóth, C.D. (hrsg.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). S. 430–443. Springer-Verlag (2019).
       
    • 12.
      Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing Optimal-Height Tangles Faster. In: Archambault, D. und Tóth, C.D. (hrsg.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). S. 203–215. Springer-Verlag (2019).
       
    • 13.
      Chaplick, S., van Dijk, T.C., Kryven, M., Park, J.-W., Ravsky, A., Wolff, A.: Bundled Crossings Revisited. In: Archambault, D. und Tóth, C.D. (hrsg.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). S. 63–77. Springer-Verlag (2019).
       
    • 14.
      Biedl, T., Felsner, S., Meijer, H., Wolff, A.: Line and Plane Cover Numbers Revisited. In: Archambault, D. und Tóth, C.D. (hrsg.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). S. 409–415. Springer-Verlag (2019).
       
    • 15.
      Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing Optimal Tangles Faster. In: Löffler, M. (hrsg.) Proc. 35th European Workshop on Computational Geometry (EuroCG’19). S. 61:1–7 (2019).
       
    • 16.
      Chaplick, S., van Dijk, T.C., Kryven, M., Park, J.-W., Ravsky, A., Wolff, A.: Bundled Crossings Revisited. In: Löffler, M. (hrsg.) Proc. 35th European Workshop on Computational Geometry (EuroCG’19). S. 57:1–7 (2019).
       
    • 17.
      Chaplick, S., Förster, H., Kryven, M., Wolff, A.: On Arrangements of Orthogonal Circles. In: Archambault, D. und Tóth, C.D. (hrsg.) Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19). S. 216–229. Springer-Verlag (2019).
       
    • 18.
      Chimani, M., Felsner, S., Kobourov, S., Ueckerdt, T., Valtr, P., Wolff, A.: On the Maximum Crossing Number. In: Brankovic, L., Ryan, J., und Smith, B. (hrsg.) Proc. 28th Int. Workshop Combin. Algorithms (IWOCA’17). S. 14 pages. Springer-Verlag (2018).
       
    • 19.
      Argyriou, E., Cornelsen, S., Förster, H., Kaufmann, M., Nöllenburg, M., Okamoto, Y., Raftopoulou, C., Wolff, A.: Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. In: Biedl, T. und Kerren, A. (hrsg.) Proc. 26th Int. Symp. Graph Drawing & Network Vis. (GD’18). S. 509–523. Springer-Verlag (2018).
       
    • 20.
      Chaplick, S., Lipp, F., Wolff, A., Zink, J.: Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. In: Biedl, T. und Kerren, A. (hrsg.) Proc. 26th Int. Symp. Graph Drawing & Network Vis. (GD’18). S. 137–151. Springer-Verlag (2018).
       
    • 21.
      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.: Multi-Level Steiner Trees. In: D’Angelo, G. (hrsg.) Proc. 17th Int. Symp. Exper. Algorithms (SEA’18). S. 15:1–14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018).
       
    • 22.
      Chaplick, S., Lipp, F., Wolff, A., Zink, J.: 1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area. In: Korman, M. und Mulzer, W. (hrsg.) Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18). S. 28:1–6 (2018).
       
    • 23.
      Chaplick, S., Chimani, M., Cornelsen, S., Da Lozzo, G., Nöllenburg, M., Patrignani, M., Tollis, I.G., Wolff, A.: Planar L-Drawings of Directed Graphs. In: Frati, F. und Ma, K.-L. (hrsg.) Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17). S. 465–478. Springer-Verlag (2018).
       
    • 24.
      van Dijk, T.C., Lipp, F., Markfelder, P., Wolff, A.: Computing Storylines with Few Block Crossings. In: Frati, F. und Ma, K.-L. (hrsg.) Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17). S. 365–378. Springer-Verlag (2018).
       
    • 25.
      Kryven, M., Ravsky, A., Wolff, A.: Drawing Graphs on Few Circles and Few Spheres. In: Panda, B.S. und Goswami, P.P. (hrsg.) Proc. 4th Conf. Algorithms & Discrete Appl. Math. (CALDAM’18). S. 164–178. Springer-Verlag (2018).
       
    • 26.
      Firman, O., Ravsky, A., Wolff, A.: On the Weak Line Cover Numbers. In: Korman, M. und Mulzer, W. (hrsg.) Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18). S. 63:1–5 (2018).
       
    • 27.
      Chan, T.M., van Dijk, T.C., Fleszar, K., Spoerhase, J., Wolff, A.: Stabbing Rectangles by Line Segments – How Decomposition Reduces the Shallow-Cell Complexity. In: Hsu, W.-L., Lee, D.-T., und Liao, C.-S. (hrsg.) Proc. 29th Annu. Int. Symp. Algorithms Comput. (ISAAC’18). S. 61:1–61:13. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018).
       
    • 28.
      Chaplick, S., Kryven, M., Liotta, G., Löffler, A., Wolff, A.: Beyond Outerplanarity. In: Frati, F. und Ma, K.-L. (hrsg.) Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17). S. 546–559. Springer-Verlag (2018).
       
    • 29.
      Peng, D., Wolff, A., Haunert, J.-H.: Using the A* Algorithm to Find Optimal Sequences for Area Aggregation. In: Peterson, M.P. (hrsg.) Proc. 28th Int. Cartogr. Conf. (ICC’17) -- Advances in Cartogr. & GIScience. S. 389–404. Springer-Verlag (2017).
       
    • 30.
      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., und Sack, J.-R. (hrsg.) Proc. Algorithms Data Struct. Symp. (WADS’17). S. 265–276. Springer-Verlag (2017).
       
    • 31.
      van Dijk, T.C., Wolff, A.: Algorithmically-Guided User Interaction. In: Hoel, E., Newsam, S.D., Ravada, S., Tamassia, R., und Trajcevski, G. (hrsg.) Proc. 25th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’17). S. 11:1–11:4 (2017).
       
    • 32.
      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., und Sakai, T. (hrsg.) Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCGG’16). S. 105–119. Springer-Verlag (2016).
       
    • 33.
      Peng, D., Wolff, A., Haunert, J.-H.: Continuous Generalization of Administrative Boundaries Based on Compatible Triangulations. In: Sarjakoski, T., Santos, M.Y., und Sarjakoski, L.T. (hrsg.) Proc. 19th AGILE Conference on Geographic Information Science – Geospatial Data in a Changing World. S. 399–415. Springer-Verlag (2016).
       
    • 34.
      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. und Nöllenburg, M. (hrsg.) Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16). S. 382–398. Springer-Verlag (2016).
       
    • 35.
      Löffler, A., van Dijk, T.C., Wolff, A.: Snapping Graph Drawings to the Grid Optimally. In: Hu, Y. und Nöllenburg, M. (hrsg.) Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16). S. 144–151. Springer-Verlag (2016).
       
    • 36.
      Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing Graphs on Few Lines and Few Planes. In: Hu, Y. und Nöllenburg, M. (hrsg.) Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16). S. 166–180. Springer-Verlag (2016).
       
    • 37.
      Chaplick, S., Lipp, F., Park, J.- won, Wolff, A.: Obstructing Visibilities with One Obstacle. In: Hu, Y. und Nöllenburg, M. (hrsg.) Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16). S. 295–308. Springer-Verlag (2016).
       
    • 38.
      Haunert, J.-H., Wolff, A.: Beyond Maximum Independent Set: An Extended Model for Point-Feature Label Placement. Proc. ISPRS (Commission II, WG II/2). S. 109–114 (2016).
       
    • 39.
      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. und Tomita, E. (hrsg.) Proc. 9th Int. Workshop Algorithms Comput. (WALCOM’15). S. 222–233. Springer-Verlag (2015).
       
    • 40.
      Chaplick, S., Kindermann, P., Lipp, F., Wolff, A.: Solving Optimization Problems on Orthogonal Ray Graphs. Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCGG’15). S. 2 pp (2015).
       
    • 41.
      Alam, M.J., Bläsius, T., Rutter, I., Ueckerdt, T., Wolff, A.: Pixel and Voxel Representations of Graphs. In: Di Giacomo, E. und Lubiw, A. (hrsg.) Proc. 23rd Int. Symp. Graph Drawing & Network Vis. (GD’15). S. 472–486. Springer-Verlag (2015).
       
    • 42.
      Bereg, S., Fleszar, K., Kindermann, P., Pupyrev, S., Spoerhase, J., Wolff, A.: Colored Non-Crossing Euclidean Steiner Forest. In: Elbassioni, K. und Makino, K. (hrsg.) Proc. 26th Annu. Int. Symp. Algorithms Comput. (ISAAC’15). S. 1–13. Springer-Verlag (2015).
       
    • 43.
      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., und Painho, M. (hrsg.) Proc. 18th AGILE Conf. Geogr. Inform. Sci. (AGILE’15). S. 269–287. Springer-Verlag (2015).
       
    • 44.
      Lipp, F., Wolff, A., Zink, J.: Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. In: Di Giacomo, E. und Lubiw, A. (hrsg.) Proc. 23rd Int. Symp. Graph Drawing & Network Vis. (GD’15). S. 52–59. Springer-Verlag (2015).
       
    • 45.
      Fink, M., Lechner, M., Wolff, A.: Concentric Metro Maps. Proc. Schematic Mapping Workshop (SMW’14). , Wivenhoe Park (2014).
       
    • 46.
      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. und Wagner, D. (hrsg.) Proc. 22nd Annu. Europ. Symp. Algorithms (ESA’14). S. 87–99. Springer-Verlag (2014).
       
    • 47.
      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. und Viola, A. (hrsg.) Proc. 11th Latin American Sympos. Theor. Inform. (LATIN’14). S. 514–525. Springer-Verlag (2014).
       
    • 48.
      Schwartges, N., Wolff, A., Haunert, J.-H.: Labeling Streets in Interactive Maps using Embedded Labels. In: Huang, Y., Schneider, M., Gertz, M., Krumm, J., und Sankaranarayanan, J. (hrsg.) Proc. 22nd ACM SIGSPATIAL Int. Conf. Advances Geogr. Inform. Syst. (ACM-GIS’14). S. 517–520 (2014).
       
    • 49.
      Kindermann, P., Lipp, F., Wolff, A.: Luatodonotes: Boundary Labeling for Annotations in Texts. In: Duncan, C. und Symvonis, A. (hrsg.) Proc. 22nd Int. Sympos. Graph Drawing (GD’14). S. 76–88. Springer-Verlag (2014).
       
    • 50.
      Kindermann, P., Schulz, A., Spoerhase, J., Wolff, A.: On Monotone Drawings of Trees. In: Duncan, C. und Symvonis, A. (hrsg.) Proc. 22nd Int. Sympos. Graph Drawing (GD’14). S. 488–500. Springer-Verlag (2014).
       
    • 51.
      Aulbach, M., Fink, M., Schuhmann, J., Wolff, A.: Drawing Graphs within Restricted Area. In: Duncan, C. und Symvonis, A. (hrsg.) Proc. 22nd Int. Sympos. Graph Drawing (GD’14). S. 367–379. Springer-Verlag (2014).
       
    • 52.
      Schwartges, N., Haunert, J.-H., Wolff, A., Zwiebler, D.: Point Labeling with Sliding Labels in Interactive Maps. In: Huerta, J., Schade, S., und Granell, C. (hrsg.) Proc. 17th AGILE Conf. Geogr. Inform. Sci. (AGILE’14). S. 295–310. Springer-Verlag (2014).
       
    • 53.
      Alam, M.J., Bekos, M.A., Kaufmann, M., Kindermann, P., Kobourov, S.G., Wolff, A.: Smooth Orthogonal Drawings of Planar Graphs. In: Pardo, A. und Viola, A. (hrsg.) Proc. 11th Latin American Sympos. Theor. Inform. (LATIN’14). S. 144–155. Springer-Verlag (2014).
       
    • 54.
      Peng, D., Wolff, A.: Watch Your Data Structures. Proc. 22th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK’14). S. 10 pages. , Glasgow (2014).
       
    • 55.
      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., und Lam, T.-W. (hrsg.) Proc. 24th Annu. Int. Symp. Algorithms Comput. (ISAAC’13). S. 722–732. Springer-Verlag (2013).
       
    • 56.
      Das, A., Fleszar, K., Kobourov, S.G., Spoerhase, J., Veeramoni, S., Wolff, A.: Polylogarithmic Approximation for Generalized Minimum Manhattan Networks. In: Fekete, S. (hrsg.) Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13). S. 81–84. , Braunschweig (2013).
       
    • 57.
      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). S. 117–122. , Waterloo, ON, Canada (2013).
       
    • 58.
      Bruckdorfer, T., Cornelsen, S., Gutwenger, C., Kaufmann, M., Montecchiani, F., Nöllenburg, M., Wolff, A.: Progress on Partial Edge Drawings. In: Didimo, W. und Patrignani, M. (hrsg.) Proc. 20th Int. Sympos. Graph Drawing (GD’12). S. 67–78. Springer-Verlag (2013).
       
    • 59.
      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. (hrsg.) Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13). S. 119–122. , Braunschweig (2013).
       
    • 60.
      Peng, D., Haunert, J.-H., Wolff, A.: Morphing Polylines Based on Least Squares Adjustment. Proc. 16th ICA Generalisation Workshop (ICAGW’13) (2013).
       
    • 61.
      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., und Sack, J.-R. (hrsg.) Proc. 13th Int. Algorithms Data Struct. Symp. (WADS’13). S. 463–474. Springer-Verlag (2013).
       
    • 62.
      Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Two-Sided Boundary Labeling with Adjacent Sides. In: Fekete, S. (hrsg.) Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13). S. 233–236. , Braunschweig (2013).
       
    • 63.
      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) (2013).
       
    • 64.
      Fink, M., Haverkort, H., Nöllenburg, M., Roberts, M., Schuhmann, J., Wolff, A.: Drawing Metro Maps using Bézier Curves. In: Didimo, W. und Patrignani, M. (hrsg.) Proc. 20th Int. Sympos. Graph Drawing (GD’12). S. 463–474. Springer-Verlag (2013).
       
    • 65.
      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. und Nakano, S.- ichi (hrsg.) Proc. Workshop Algorithms Comput. (WALCOM’12). S. 186–197. Springer-Verlag (2012).
       
    • 66.
      Schwartges, N., Spoerhase, J., Wolff, A.: Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. In: Solis-Oba, R. und Persiano, G. (hrsg.) Proc. 9th Workshop Approx. Online Algorithms (WAOA’11). S. 77–88. Springer-Verlag (2012).
       
    • 67.
      Das, A., Gansner, E.R., Kaufmann, M., Kobourov, S., Spoerhase, J., Wolff, A.: Approximating Minimum Manhattan Networks in Higher Dimensions. In: Demetrescu, C. und Halldórsson, M.M. (hrsg.) Proc. 19th Annu. Europ. Symp. on Algorithms (ESA’11). S. 49–60. Springer-Verlag (2011).
       
    • 68.
      Katz, B., Krug, M., Rutter, I., Wolff, A.: Manhattan-Geodesic Embedding of Planar Graphs. In: Eppstein, D. und Gansner, E.R. (hrsg.) Proc. 17th Int. Sympos. Graph Drawing (GD’09). S. 207–218. Springer-Verlag (2010).
       
    • 69.
      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. und Schwentick, T. (hrsg.) Proc. 27th Int. Sympos. Theoretical Aspects Comput. Sci. (STACS’10). S. 239–250. , Nancy (2010).
       
    • 70.
      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). S. 192–201 (2010).
       
    • 71.
      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). S. 73–76. , Dortmund (2010).
       
    • 72.
      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. und Patrignani, M. (hrsg.) Proc. 16th Int. Sympos. Graph Drawing (GD’08). S. 324–335. Springer-Verlag (2009).
       
    • 73.
      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). S. 106–119 (2009).
       
    • 74.
      Keiren, J., van Walderveen, F., Wolff, A.: Constructability of Trip-lets. In: Langerman, S. (hrsg.) Proc. 25th European Workshop on Computational Geometry (EuroCG’09). , Brussels (2009).
       
    • 75.
      Goaoc, X., Kratochvíl, J., Okamoto, Y., Shin, C.-S., Wolff, A.: Moving Vertices to Make Drawings Plane. In: Hong, S.-H., Nishizeki, T., und Quan, W. (hrsg.) Proc. 15th Int. Sympos. Graph Drawing (GD’07). S. 101–112. Springer-Verlag (2008).
       
    • 76.
      Erlebach, T., Hagerup, T., Jansen, K., Minzlaff, M., Wolff, A.: Trimming of Graphs, with Application to Point Labeling. In: Albers, S. und Weil, P. (hrsg.) Proc. 25th Int. Sympos. Theoretical Aspects Comput. Sci. (STACS’08). S. 265–276. , Bordeaux (2008).
       
    • 77.
      Rutter, I., Wolff, A.: Augmenting the Connectivity of Planar and Geometric Graphs. Proc. Int. Conf. Topological Geom. Graph Theory (TGGT’08). S. 53–56. , Paris (2008).
       
    • 78.
      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., und Quan, W. (hrsg.) Proc. 15th Int. Sympos. Graph Drawing (GD’07). S. 171–182. Springer-Verlag (2008).
       
    • 79.
      Rutter, I., Wolff, A.: Computing Large Matchings Fast. Proc. 19th ACM-SIAM Sympos. Discrete Algorithms (SODA’08). S. 183–192 (2008).
       
    • 80.
      Rutter, I., Wolff, A.: Augmenting the Connectivity of Planar and Geometric Graphs. In: Petitjean, S. (hrsg.) Proc. 24th European Workshop on Computational Geometry (EuroCG’08). S. 71–74. , Nancy (2008).
       
    • 81.
      Been, K., Nöllenburg, M., Poon, S.-H., Wolff, A.: Optimizing Active Ranges for Consistent Dynamic Map Labeling. In: Petitjean, S. (hrsg.) Proc. 24th European Workshop on Computational Geometry (EuroCG’08). S. 55–58. , Nancy (2008).
       
    • 82.
      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). S. 10–19 (2008).
       
    • 83.
      Spillner, A., Wolff, A.: Untangling a Planar Graph. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., und Bieliková, M. (hrsg.) Proc. 34th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’08). S. 473–484. Springer-Verlag (2008).
       
    • 84.
      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. S. 373–378. , Beijing (2008).
       
    • 85.
      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., und Plasil, F. (hrsg.) Proc. 33rd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’07). S. 177–186. Springer-Verlag (2007).
       
    • 86.
      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. und Gudmundsson, J. (hrsg.) Proc. 13th Conf. Computing: The Australasian Theory Sympos. (CATS’07). S. 7–14. Australian Computer Society (2007).
       
    • 87.
      Benkert, M., Nöllenburg, M., Uno, T., Wolff, A.: Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transport Maps. In: Kaufmann, M. und Wagner, D. (hrsg.) Proc. 14th Int. Sympos. Graph Drawing (GD’06). S. 270–281. Springer-Verlag (2007).
       
    • 88.
      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). S. 390–399. , Maynooth, Ireland (2007).
       
    • 89.
      Merrick, D., Nöllenburg, M., Wolff, A., Benkert, M.: Morphing Polygonal Lines: A Step Towards Continuous Generalization. In: Aichholzer, O. und Hackl, T. (hrsg.) Proc. 23rd European Workshop on Computational Geometry (EWCG’07). S. 6–9. , Graz (2007).
       
    • 90.
      Nöllenburg, M., Wolff, A.: A Mixed-Integer Program for Drawing High-Quality Metro Maps. In: Healy, P. und Nikolov, N.S. (hrsg.) Proc. 13th Int. Sympos. Graph Drawing (GD’05). S. 321–333. Springer-Verlag (2006).
       
    • 91.
      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). S. 137–140. , Delphi (2006).
       
    • 92.
      Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Constructing Interference-Minimal Networks. In: Wiedermann, J., Stuller, J., Tel, G., Pokorný, J., und Bieliková, M. (hrsg.) Proc. 32nd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’06). S. 166–175. Springer-Verlag (2006).
       
    • 93.
      Bereg, S., Mutsanas, N., Wolff, A.: Matching Points with Rectangles and Squares. In: Wiedermann, J., Stuller, J., Tel, G., Pokorný, J., und Bieliková, M. (hrsg.) Proc. 32nd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’06). S. 177–186. Springer-Verlag (2006).
       
    • 94.
      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).
       
    • 95.
      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). S. 75–82 (2006).
       
    • 96.
      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). S. 31–38. , Venezia (2006).
       
    • 97.
      Gerdjikov, S., Wolff, A.: Pseudo-Convex Decomposition of Simple Polygons. Proc. 22nd European Workshop on Computational Geometry (EWCG’06). S. 13–16. , Delphi (2006).
       
    • 98.
      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. und Lee, D.-T. (hrsg.) Proc. 12th Annu. Int. Comput. Combinatorics Conf. (COCOON’06). S. 166–175. Springer-Verlag (2006).
       
    • 99.
      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). S. 141–144. , Delphi (2006).
       
    • 100.
      Benkert, M., Widmann, F., Wolff, A.: The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. In: Akiyama, J., Kano, M., und Tan, X. (hrsg.) Proc. 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04). S. 16–28. Springer-Verlag (2005).
       
    • 101.
      Knauer, C., Schramm, Étienne, Spillner, A., Wolff, A.: Configurations with Few Crossings in Topological Graphs. In: Deng, X. und Du, D.-Z. (hrsg.) Proc. 16th Annu. Int. Symp. Algorithms Comput. (ISAAC’05). S. 604–613. Springer-Verlag (2005).
       
    • 102.
      Reinbacher, I., Benkert, M., van Kreveld, M., Wolff, A.: Delineating Boundaries for Imprecise Regions. Proc. 21st European Workshop on Computational Geometry (EWCG’05). S. 127–130. , Eindhoven (2005).
       
    • 103.
      Görke, R., Wolff, A.: Constructing the City Voronoi Diagram Faster. Proc. 2nd Int. Symp. on Voronoi Diagrams in Science and Engineering (VD’05). S. 162–172. , Seoul (2005).
       
    • 104.
      Reinbacher, I., Benkert, M., van Kreveld, M., Mitchell, J.S., Wolff, A.: Delineating Boundaries for Imprecise Regions. In: Brodal, G.S. und Leonardi, S. (hrsg.) Proc. 13th Annu. Europ. Symp. on Algorithms (ESA’05). S. 143–154. Springer-Verlag (2005).
       
    • 105.
      Görke, R., Wolff, A.: Constructing the City Voronoi Diagram Faster. Proc. 21st European Workshop on Computational Geometry (EWCG’05). S. 155–158. , Eindhoven (2005).
       
    • 106.
      Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Constructing Interference-Minimal Networks. Proc. 21st European Workshop on Computational Geometry (EWCG’05). S. 203–206. , Eindhoven (2005).
       
    • 107.
      Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. In: Pach, J. (hrsg.) Proc. 12th Int. Sympos. Graph Drawing (GD’04). S. 49–59. Springer-Verlag (2005).
       
    • 108.
      Daescu, O., Mi, N., Shin, C.-S., Wolff, A.: Farthest-Point Queries with Geometric and Combinatorial Constraints. In: Akiyama, J., Kano, M., und Tan, X. (hrsg.) Proc. 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04). S. 62–75. Springer-Verlag (2005).
       
    • 109.
      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). S. 195–198. , Eindhoven (2005).
       
    • 110.
      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). S. 97–100. , Sevilla (2004).
       
    • 111.
      van Kreveld, M., Schramm, Étienne, Wolff, A.: Algorithms for the Placement of Diagrams on Maps. In: Pfoder, D., Cruz, I.F., und Ronthaler, M. (hrsg.) Proc. 12th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’04). S. 222–231 (2004).
       
    • 112.
      Wolff, A., Benkert, M., Shirabe, T.: The Minimum Manhattan Network Problem: Approximations and Exact Solutions. Proc. 20th European Workshop on Computational Geometry (EWCG’04). S. 209–212. , Sevilla (2004).
       
    • 113.
      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). S. 45–48. , Sevilla (2004).
       
    • 114.
      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). S. 110–111. , Tokyo (2004).
       
    • 115.
      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). S. 85–86. , Tokyo (2004).
       
    • 116.
      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).
       
    • 117.
      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). S. 41–45. , War-szawa (2002).
       
    • 118.
      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., und Vazirani, V. (hrsg.) Proc. 5th Int. Workshop Approx. Algorithms Combin. Optim. (APPROX’02). S. 146–160. Springer-Verlag (2002).
       
    • 119.
      Garrido, M. Ángeles, 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). S. 285–294. , Girona (2001).