piwik-script

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

    Veröffentlichungen (chronologisch)

    2022[ to top ]
    • Layered Drawing of Undirected Graphs with Generalized Port Constraints. Zink, Johannes; Walter, Julian; Baumeister, Joachim; Wolff, Alexander in Computational Geometry: Theory and Applications (2022). 105--106(101886) 1–29.
    • Simple Algorithms for Partial and Simultaneous Rectangular Duals with Given Contact Orientations. Chaplick, Steven; Felsner, Stefan; Kindermann, Philipp; Klawitter, Jonathan; Rutter, Ignaz; Wolff, Alexander in Theoretical Computer Science (2022). 919 66–74.
    • Algorithms for Floor Planning with Proximity Requirements. Klawitter, Jonathan; Klesen, Felix; Wolff, Alexander in Proc. CAAD Future 2021, CCIS, D. J. Gerber, A. Nahmad, B. Bogosian, E. Pantazis, C. Miltiadis (Hrsg.) (2022). (Bd. 1465) 151–171.
    • Universal Lower Bounds on the Segment Number of Some Classes of Planar Graphs. Klawitter, Jonathan; Klemz, Boris; Klesen, Felix; Kobourov, Stephen; Kryven, Myroslav; Wolff, Alexander; Zink, Johannes in Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22), E. Di Giacomo, F. Montecchiani (Hrsg.) (2022). 53:1–7.
    • The Computational Complexity of the ChordLink Model. Kindermann, Philipp; Sauer, Jan; Wolff, Alexander in Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22), E. Di Giacomo, F. Montecchiani (Hrsg.) (2022). 10:1–7.
    • Bounding and Computing Obstacle Numbers of Graphs. Balko, Martin; Chaplick, Steven; Gupta, Siddharth; Hoffmann, Michael; Valtr, Pavel; Wolff, Alexander in Proc. 30th Europ. Symp. Algorithms (ESA’22), LIPIcs, S. Chechik, G. Navarro, E. Rotenberg, G. Herman (Hrsg.) (2022). (Bd. 244) 11:1–11:13.
    • Morphing Rectangular Duals. Chaplick, Steven; Kindermann, Philipp; Klawitter, Jonathan; Rutter, Ignaz; Wolff, Alexander in Proc. 30th Int. Symp. Graph Drawing & Network Vis. (GD’22), Lecture Notes in Computer Science, P. Angelini, R. von Hanxleden (Hrsg.) (2022).
    • Coloring Mixed and Directional Interval Graphs. Gutowski, Grzegorz; Mittelstädt, Florian; Rutter, Ignaz; Spoerhase, Joachim; Wolff, Alexander; Zink, Johannes in Proc. 30th Int. Symp. Graph Drawing & Network Vis. (GD’22), Lecture Notes in Computer Science, P. Angelini, R. von Hanxleden (Hrsg.) (2022).
    • Outside-Obstacle Representations with All Vertices on the Outer Face. Firman, Oksana; Kindermann, Philipp; Klawitter, Jonathan; Klemz, Boris; Klesen, Felix; Wolff, Alexander in Proc. 30th Int. Symp. Graph Drawing & Network Vis. (GD’22), Lecture Notes in Computer Science, P. Angelini, R. von Hanxleden (Hrsg.) (2022).
    • Outside-Obstacle Representations with All Vertices on the Outer Face. Firman, Oksana; Kindermann, Philipp; Klawitter, Jonathan; Klemz, Boris; Klesen, Felix; Wolff, Alexander in Proc. 38th Europ. Workshop Comput. Geom. (EuroCG’22), E. Di Giacomo, F. Montecchiani (Hrsg.) (2022). 54:1–8.
    • Minimum Rectilinear Polygons for Given Angle Sequences. Evans, William S.; Fleszar, Krzysztof; Kindermann, Philipp; Saeedi, Noushin; Shin, Chan-Su; Wolff, Alexander in Computational Geometry: Theory and Applications (2022). 100(101820) 1–39.
    • The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. Goeßmann, Ina; Klawitter, Jonathan; Klemz, Boris; Klesen, Felix; Kobourov, Stephen G.; Kryven, Myroslav; Wolff, Alexander; Zink, Johannes in Proc. 48th Int. Workshop Graph-Theoretic Concepts Comput. Sci. (WG’22), Lecture Notes in Computer Science, M. Bekos, M. Kaufmann (Hrsg.) (2022). (Bd. 13453) 16 pages.
    2021[ to top ]
    • Adjacency Graphs of Polyhedral Surfaces. Arseneva, Elena; Kleist, Linda; Klemz, Boris; Löffler, Maarten; Schulz, André; Vogtenhuber, Birgit; Wolff, Alexander in Proc. 37th Annu. Sympos. Comput. Geom. (SoCG’21), LIPIcs, K. Buchin, Éric Colin de Verdière (Hrsg.) (2021). (Bd. 189) 11:1–11:17.
    • Extending Partial Representations of Rectangular Duals with Given Contact Orientations. Chaplick, Steven; Kindermann, Philipp; Klawitter, Jonathan; Rutter, Ignaz; Wolff, Alexander in Proc. 12th International Conference on Algorithms and Complexity (CIAC’21), Lecture Notes in Computer Science, T. Calamoneri, F. Coró (Hrsg.) (2021). (Bd. 12701) 340–353.
    • ClusterSets: Optimizing Planar Clusters in Categorical Point Data. Geiger, Jakob; Cornelsen, Sabine; Haunert, Jan-Henrik; Kindermann, Philipp; Mchedlidze, Tamara; Nöllenburg, Martin; Okamoto, Yoshio; Wolff, Alexander in Comput. Graphics Forum (2021). 40(3) 471–481.
    • Layered Drawing of Undirected Graphs with Generalized Port Constraints. Walter, Julian; Zink, Johannes; Baumeister, Joachim; Wolff, Alexander in Proc. 28th Int. Symp. Graph Drawing & Network Vis. (GD’20), Lecture Notes in Computer Science, D. Auber, P. Valtr (Hrsg.) (2021). (Bd. 12590) 220–234.
    • Angle Covers: Algorithms and Complexity. Evans, William; Gethner, Ellen; Spalding-Jamieson, Jack; Wolff, Alexander in Journal of Graph Algorithms & Applications (2021). 25(2) 643–661.
    • Using the Metro-Map Metaphor for Drawing Hypergraphs. Frank, Fabian; Kaufmann, Michael; Kobourov, Stephen; Mchedlidze, Tamara; Pupyrev, Sergey; Ueckerdt, Torsten; Wolff, Alexander in Proc. 47th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’21), Lecture Notes in Computer Science, T. Burevs}, R. Dondi, J. Gamper, G. Guerrini, T. Jurdziński, C. Pahl, F. Sikora, P. Wong (Hrsg.) (2021). (Bd. 12607) 361–372.
    2020[ to top ]
    • Drawing Graphs with Circular Arcs and Right-Angle Crossings. Chaplick, Steven; Förster, Henry; Kryven, Myroslav; Wolff, Alexander in Proc. 17th Scand. Symp. and Workshops on Algorithm Theory (SWAT’20), LIPIcs, S. Albers (Hrsg.) (2020). (Bd. 162) 21:1–21:14.
    • Stick Graphs with and without Length Constraints. Chaplick, Steven; Kindermann, Philipp; Löffler, Andre; Thiele, Florian; Wolff, Alexander; Zaft, Alexander; Zink, Johannes in Journal of Graph Algorithms & Applications (2020). 24(4) 657–681.
    • Representing Graphs by Polygons with Edge Contacts in 3D. Arseneva, Elena; Kleist, Linda; Klemz, Boris; Löffler, Maarten; Schulz, André; Vogtenhuber, Birgit; Wolff, Alexander in Proc. 36th European Workshop on Computational Geometry (EuroCG’20), S. Chaplick, P. Kindermann, A. Wolff (Hrsg.) (2020). 53:1–8.
    • The Complexity of Finding Tangles. Firman, Oksana; Felsner, Stefan; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proc. 36th European Workshop on Computational Geometry (EuroCG’20), S. Chaplick, P. Kindermann, A. Wolff (Hrsg.) (2020). 67:1–8.
    • Bundled Crossings Revisited. Chaplick, Steven; van Dijk, Thomas C.; Kryven, Myroslav; Park, Ji-Won; Ravsky, Alexander; Wolff, Alexander in Journal of Graph Algorithms & Applications (2020). 24(4) 621–655.
    • Angle Covers: Algorithms and Complexity. Evans, William; Gethner, Ellen; Spalding-Jamieson, Jack; Wolff, Alexander in Proc. 14th Int. Workshop Algorithms Comput. (WALCOM’20), Lecture Notes in Computer Science, S. Rahman, K. Sadakane, W.-K. Sung (Hrsg.) (2020). (Bd. 12049) 94–106.
    • Drawing Graphs on Few Lines and Few Planes. Chaplick, Steven; Fleszar, Krzysztof; Lipp, Fabian; Ravsky, Alexander; Verbitsky, Oleg; Wolff, Alexander in Journal of Computational Geometry (2020). 11(1) 433–475.
    • Finding Optimal Sequences for Area Aggregation---A* vs. Integer Linear Programming. Peng, Dongliang; Wolff, Alexander; Haunert, Jan-Henrik in ACM Transactions on Spatial Algorithms and Systems (2020). 7(1)
      article 4 (40 pages)
    2019[ to top ]
    • Stick Graphs with Length Constraints. Chaplick, Steven; Kindermann, Philipp; Löffler, Andre; Thiele, Florian; Wolff, Alexander; Zaft, Alexander; Zink, Johannes in Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (Hrsg.) (2019). (Bd. 11904) 3–17.
    • Survey on Graph and Hypergraph Drawing. Schulz, André; Wolff, Alexander (M. Löffler; A. Lubiw; S. Schleimer; E. M. W. Chambers, Hrsg.) (2019). 87–89.
    • Bundled Crossings Revisited. Chaplick, Steven; van Dijk, Thomas C.; Kryven, Myroslav; Park, Ji-Won; Ravsky, Alexander; Wolff, Alexander in Proc. 35th European Workshop on Computational Geometry (EuroCG’19), M. Löffler (Hrsg.) (2019). 57:1–7.
    • Visual Analytics for Sets over Time and Space Fabrikant, Sara Irina; Miksch, Silvia; Wolff, Alexander (2019). (Bd. 9) 31–57. Schloss Dagstuhl~-- Leibniz-Zentrum für Informatik.
      Dagstuhl Seminar 19192
    • Variants of the Segment Number of a Graph. Okamoto, Yoshio; Ravsky, Alexander; Wolff, Alexander in Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (Hrsg.) (2019). (Bd. 11904) 430–443.
    • Drawing Graphs on Few Circles and Few Spheres. Kryven, Myroslav; Ravsky, Alexander; Wolff, Alexander in Journal of Graph Algorithms & Applications (2019). 23(2) 371–391.
    • Computing Optimal Tangles Faster. Firman, Oksana; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proc. 35th European Workshop on Computational Geometry (EuroCG’19), M. Löffler (Hrsg.) (2019). 61:1–7.
    • Bundled Crossings Revisited. Chaplick, Steven; van Dijk, Thomas C.; Kryven, Myroslav; Park, Ji-Won; Ravsky, Alexander; Wolff, Alexander in Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (Hrsg.) (2019). (Bd. 11904) 63–77.
    • Computing Optimal-Height Tangles Faster. Firman, Oksana; Kindermann, Philipp; Ravsky, Alexander; Wolff, Alexander; Zink, Johannes in Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (Hrsg.) (2019). (Bd. 11904) 203–215.
    • Representing Graphs and Hypergraphs by Touching Polygons in 3D. Evans, William; Rzka}.zewski, Pawel}; Saeedi, Noushin; Shin, Chan-Su; Wolff, Alexander in Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (Hrsg.) (2019). (Bd. 11904) 18–32.
      http://arxiv.org/abs/1908.08273
    • Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. Chaplick, Steven; Lipp, Fabian; Wolff, Alexander; Zink, Johannes in Computational Geometry: Theory and Applications (2019). 84 50–68.
      Special Issue on the 34th European Workshop on Computational Geometry
    • Line and Plane Cover Numbers Revisited. Biedl, Therese; Felsner, Stefan; Meijer, Henk; Wolff, Alexander in Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (Hrsg.) (2019). (Bd. 11904) 409–415.
    • On Arrangements of Orthogonal Circles. Chaplick, Steven; Förster, Henry; Kryven, Myroslav; Wolff, Alexander in Proc. 27th Int. Symp. Graph Drawing & Network Vis. (GD’19), Lecture Notes in Computer Science, D. Archambault, C. D. Tóth (Hrsg.) (2019). (Bd. 11904) 216–229.
    2018[ to top ]
    • Drawing Graphs on Few Circles and Few Spheres. Kryven, Myroslav; Ravsky, Alexander; Wolff, Alexander in Proc. 4th Conf. Algorithms & Discrete Appl. Math. (CALDAM’18), Lecture Notes in Computer Science, B. S. Panda, P. P. Goswami (Hrsg.) (2018). (Bd. 10743) 164–178.
      Best presentation award for Myroslav Kryven.
    • On the Maximum Crossing Number. Chimani, Markus; Felsner, Stefan; Kobourov, Stephen; Ueckerdt, Torsten; Valtr, Pavel; Wolff, Alexander in Journal of Graph Algorithms & Applications (2018). 22(1) 67–87.
      Special issue on ``Graph Drawing Beyond Planarity''.
    • Planar L-Drawings of Directed Graphs. Chaplick, Steven; Chimani, Markus; Cornelsen, Sabine; Da Lozzo, Giordano; Nöllenburg, Martin; Patrignani, Maurizio; Tollis, Ioannis G.; Wolff, Alexander in Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17), Lecture Notes in Computer Science, F. Frati, K.-L. Ma (Hrsg.) (2018). (Bd. 10692) 465–478.
    • On the Weak Line Cover Numbers. Firman, Oksana; Ravsky, Alexander; Wolff, Alexander in Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18), M. Korman, W. Mulzer (Hrsg.) (2018). 63:1–5.
    • 1-Bend RAC Drawings of NIC-Planar Graphs in Quadratic Area. Chaplick, Steven; Lipp, Fabian; Wolff, Alexander; Zink, Johannes in Proc. 34th Europ. Workshop Comput. Geom. (EuroCG’18), M. Korman, W. Mulzer (Hrsg.) (2018). 28:1–6.
    • Stabbing Rectangles by Line Segments~-- How Decomposition Reduces the Shallow-Cell Complexity. Chan, Timothy M.; van Dijk, Thomas C.; Fleszar, Krzysztof; Spoerhase, Joachim; Wolff, Alexander in Proc. 29th Annu. Int. Symp. Algorithms Comput. (ISAAC’18), LIPIcs, W.-L. Hsu, D.-T. Lee, C.-S. Liao (Hrsg.) (2018). (Bd. 123) 61:1–61:13.
    • Multi-Level Steiner Trees. Ahmed, Abu Reyan; Angelini, Patrizio; Darabi Sahneh, Faryad; Efrat, Alon; Glickenstein, David; Gronemann, Martin; Heinsohn, Niklas; Kobourov, Stephen G.; Spence, Richard; Watkins, Joseph; Wolff, Alexander in Proc. 17th Int. Symp. Exper. Algorithms (SEA’18), LIPIcs, G. D’Angelo (Hrsg.) (2018). (Bd. 103) 15:1–15:14.
    • On the Maximum Crossing Number. Chimani, Markus; Felsner, Stefan; Kobourov, Stephen; Ueckerdt, Torsten; Valtr, Pavel; Wolff, Alexander in Proc. 28th Int. Workshop Combin. Algorithms (IWOCA’17), Lecture Notes in Computer Science, L. Brankovic, J. Ryan, B. Smith (Hrsg.) (2018). (Bd. 10765) 14 pages.
    • Approximating the Generalized Minimum Manhattan Network Problem. Das, Aparna; Fleszar, Krzysztof; Kobourov, Stephen G.; Spoerhase, Joachim; Veeramoni, Sankar; Wolff, Alexander in Algorithmica (2018). 80(4) 1170–1190.
    • Computing Storylines with Few Block Crossings. van Dijk, Thomas C.; Lipp, Fabian; Markfelder, Peter; Wolff, Alexander in Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17), Lecture Notes in Computer Science, F. Frati, K.-L. Ma (Hrsg.) (2018). (Bd. 10692) 365–378.
    • Beyond Outerplanarity. Chaplick, Steven; Kryven, Myroslav; Liotta, Giuseppe; Löffler, Andre; Wolff, Alexander in Proc. 25th Int. Symp. Graph Drawing & Network Vis. (GD’17), Lecture Notes in Computer Science, F. Frati, K.-L. Ma (Hrsg.) (2018). (Bd. 10692) 546–559.
    • Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. Argyriou, Evmorfia; Cornelsen, Sabine; Förster, Henry; Kaufmann, Michael; Nöllenburg, Martin; Okamoto, Yoshio; Raftopoulou, Chrysanthi; Wolff, Alexander in Proc. 26th Int. Symp. Graph Drawing & Network Vis. (GD’18), Lecture Notes in Computer Science, T. Biedl, A. Kerren (Hrsg.) (2018). (Bd. 11282) 509–523.
    • Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. Chaplick, Steven; Lipp, Fabian; Wolff, Alexander; Zink, Johannes in Proc. 26th Int. Symp. Graph Drawing & Network Vis. (GD’18), Lecture Notes in Computer Science, T. Biedl, A. Kerren (Hrsg.) (2018). (Bd. 11282) 137–151.
    2017[ to top ]
    • The Complexity of Drawing Graphs on Few Lines and Few Planes. Chaplick, Steven; Fleszar, Krzysztof; Lipp, Fabian; Ravsky, Alexander; Verbitsky, Oleg; Wolff, Alexander in Proc. Algorithms Data Struct. Symp. (WADS’17), Lecture Notes in Computer Science, F. Ellen, A. Kolokolova, J.-R. Sack (Hrsg.) (2017). (Bd. 10389) 265–276.
    • Improved Approximation Algorithms for Box Contact Representations. Bekos, Michael A.; van Dijk, Thomas C.; Fink, Martin; Kindermann, Philipp; Kobourov, Stephen; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander in Algorithmica (2017). 77(3) 902–920.
    • Using the A* Algorithm to Find Optimal Sequences for Area Aggregation. Peng, Dongliang; Wolff, Alexander; Haunert, Jan-Henrik in Proc. 28th Int. Cartogr. Conf. (ICC’17) -- Advances in Cartogr. & GIScience, Lect. Notes Geoinform. Cartogr., M. P. Peterson (Hrsg.) (2017). 389–404.
    • Progress on Partial Edge Drawings. Bruckdorfer, Till; Cornelsen, Sabine; Gutwenger, Carsten; Kaufmann, Michael; Montecchiani, Fabrizio; Nöllenburg, Martin; Wolff, Alexander in Journal of Graph Algorithms & Applications (2017). 21(4) 757–786.
    • Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling. Haunert, Jan-Henrik; Wolff, Alexander in International Journal of Geo-Information (2017). 6(11) article 342, 20 pages.
    • Block Crossings in Storyline Visualizations. van Dijk, Thomas C.; Fink, Martin; Fischer, Norbert; Lipp, Fabian; Markfelder, Peter; Ravsky, Alexander; Suri, Subhash; Wolff, Alexander in Journal of Graph Algorithms & Applications (2017). 21(5) 873–913.
      Conference version received \textbf{best paper award (track A) at GD'16.
    • Algorithmically-Guided User Interaction. van Dijk, Thomas C.; Wolff, Alexander in Proc. 25th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’17), E. Hoel, S. D. Newsam, S. Ravada, R. Tamassia, G. Trajcevski (Hrsg.) (2017). 11:1–11:4.
    2016[ to top ]
    • Räumliche Analyse durch kombinatorische Optimierung. Haunert, Jan-Henrik; Wolff, Alexander in Handbuch der Geodäsie (6 B{ä}nde), W. Freeden, R. Rummel (Hrsg.) (2016). 1–39.
    • Snapping Graph Drawings to the Grid Optimally. Löffler, Andre; van Dijk, Thomas C.; Wolff, Alexander in Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Lecture Notes in Computer Science, Y. Hu, M. Nöllenburg (Hrsg.) (2016). (Bd. 9801) 144–151.
    • Continuous Generalization of Administrative Boundaries Based on Compatible Triangulations. Peng, Dongliang; Wolff, Alexander; Haunert, Jan-Henrik in Proc. 19th AGILE Conference on Geographic Information Science~-- Geospatial Data in a Changing World, Lect. Notes Geoinf. Cartogr., T. Sarjakoski, M. Y. Santos, L. T. Sarjakoski (Hrsg.) (2016). 399–415.
    • Minimum Rectilinear Polygons for Given Angle Sequences. Evans, William S.; Fleszar, Krzysztof; Kindermann, Philipp; Saeedi, Noushin; Shin, Chan-Su; Wolff, Alexander in Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCGG’16), Lecture Notes in Computer Science, J. Akiyama, H. Ito, T. Sakai (Hrsg.) (2016). (Bd. 9943) 105–119.
    • Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. Bekos, Michael A.; van Dijk, Thomas C.; Kindermann, Philipp; Wolff, Alexander in Journal of Graph Algorithms & Applications (2016). 20(1) 133–158.
    • Obstructing Visibilities with One Obstacle. Chaplick, Steven; Lipp, Fabian; Park, Ji-won; Wolff, Alexander in Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Lecture Notes in Computer Science, Y. Hu, M. Nöllenburg (Hrsg.) (2016). (Bd. 9801) 295–308.
    • Multi-Sided Boundary Labeling. Kindermann, Philipp; Niedermann, Benjamin; Rutter, Ignaz; Schaefer, Marcus; Schulz, André; Wolff, Alexander in Algorithmica (2016). 76(1) 225–258.
    • Beyond Maximum Independent Set: An Extended Model for Point-Feature Label Placement. Haunert, Jan-Henrik; Wolff, Alexander in Proc. ISPRS (Commission II, WG II/2) (2016). (Bd. XLI-B2) 109–114.
    • Block Crossings in Storyline Visualizations. van Dijk, Thomas C.; Fink, Martin; Fischer, Norbert; Lipp, Fabian; Markfelder, Peter; Ravsky, Alexander; Suri, Subhash; Wolff, Alexander in Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Lecture Notes in Computer Science, Y. Hu, M. Nöllenburg (Hrsg.) (2016). (Bd. 9801) 382–398.
      Received best-paper award at GD 2016
    • Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. Lipp, Fabian; Wolff, Alexander; Zink, Johannes in Algorithms (2016). 9(3) article 53, 17 pages.
    • Drawing Graphs on Few Lines and Few Planes. Chaplick, Steven; Fleszar, Krzysztof; Lipp, Fabian; Ravsky, Alexander; Verbitsky, Oleg; Wolff, Alexander in Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD’16), Lecture Notes in Computer Science, Y. Hu, M. Nöllenburg (Hrsg.) (2016). (Bd. 9801) 166–180.
    • Matching Labels and Markers in Historical Maps: An Algorithm with Interactive Postprocessing. Budig, Benedikt; Dijk, Thomas C. van; Wolff, Alexander in ACM Transactions on Spatial Algorithms and Systems (2016). 2(4) 13:1–13:24.
    2015[ to top ]
    • Solving Optimization Problems on Orthogonal Ray Graphs. Chaplick, Steven; Kindermann, Philipp; Lipp, Fabian; Wolff, Alexander in Proc. Japan. Conf. Discrete Comput. Geom. Graphs (JCDCGG’15) (2015). 2 pp.
      Abstract
    • Pixel and Voxel Representations of Graphs. Alam, Md. Jawaherul; Bläsius, Thomas; Rutter, Ignaz; Ueckerdt, Torsten; Wolff, Alexander in Proc. 23rd Int. Symp. Graph Drawing & Network Vis. (GD’15), Lecture Notes in Computer Science, E. Di Giacomo, A. Lubiw (Hrsg.) (2015). (Bd. 9411) 472–486.
    • Approximating Minimum Manhattan Networks in Higher Dimensions. Das, Aparna; Gansner, Emden R.; Kaufmann, Michael; Kobourov, Stephen; Spoerhase, Joachim; Wolff, Alexander in Algorithmica (2015). 71(1) 36–52.
    • Colored Non-Crossing Euclidean Steiner Forest. Bereg, Sergey; Fleszar, Krzysztof; Kindermann, Philipp; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander in Proc. 26th Annu. Int. Symp. Algorithms Comput. (ISAAC’15), Lecture Notes in Computer Science, K. Elbassioni, K. Makino (Hrsg.) (2015). (Bd. 9472) 1–13.
    • Ordering Metro Lines by Block Crossings. Fink, Martin; Pupyrev, Sergey; Wolff, Alexander in Journal of Graph Algorithms & Applications (2015). 19(1) 111–153.
    • Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends. Bekos, Michael A.; van Dijk, Thomas C.; Kindermann, Philipp; Wolff, Alexander in Proc. 9th Int. Workshop Algorithms Comput. (WALCOM’15), Lecture Notes in Computer Science, M. S. Rahman, E. Tomita (Hrsg.) (2015). (Bd. 8973) 222–233.
    • Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition. Lipp, Fabian; Wolff, ALexander; Zink, Johannes in Proc. 23rd Int. Symp. Graph Drawing & Network Vis. (GD’15), Lecture Notes in Computer Science, E. Di Giacomo, A. Lubiw (Hrsg.) (2015). (Bd. 9411) 52–59.
    • Labeling Streets Along a Route in Interactive 3D Maps Using Billboards. Schwartges, Nadine; Morgan, Benjamin; Haunert, Jan-Henrik; Wolff, Alexander in Proc. 18th AGILE Conf. Geogr. Inform. Sci. (AGILE’15), Lecture Notes in Geoinformation and Cartography, F. Bacao, M. Y. Santos, M. Painho (Hrsg.) (2015). 269–287.
    2014[ to top ]
    • Semantic Word Cloud Representations: Hardness and Approximation Algorithms. Barth, Lukas; Fabrikant, Sara Irina; Kobourov, Stephen; Lubiw, Anna; Nöllenburg, Martin; Okamoto, Yoshio; Pupyrev, Sergey; Squarcella, Claudio; Ueckerdt, Torsten; Wolff, Alexander in Proc. 11th Latin American Sympos. Theor. Inform. (LATIN’14), Lecture Notes in Computer Science, A. Pardo, A. Viola (Hrsg.) (2014). (Bd. 8392) 514–525.
    • Drawing Graphs within Restricted Area. Aulbach, Maximilian; Fink, Martin; Schuhmann, Julian; Wolff, Alexander in Proc. 22nd Int. Sympos. Graph Drawing (GD’14), Lecture Notes in Computer Science, C. Duncan, A. Symvonis (Hrsg.) (2014). (Bd. 8871) 367–379.
    • Luatodonotes: Boundary Labeling for Annotations in Texts. Kindermann, Philipp; Lipp, Fabian; Wolff, Alexander in Proc. 22nd Int. Sympos. Graph Drawing (GD’14), Lecture Notes in Computer Science, C. Duncan, A. Symvonis (Hrsg.) (2014). (Bd. 8871) 76–88.
    • Smooth Orthogonal Drawings of Planar Graphs. Alam, Md. Jawaherul; Bekos, Michael A.; Kaufmann, Michael; Kindermann, Philipp; Kobourov, Stephen G.; Wolff, Alexander in Proc. 11th Latin American Sympos. Theor. Inform. (LATIN’14), Lecture Notes in Computer Science, A. Pardo, A. Viola (Hrsg.) (2014). (Bd. 8392) 144–155.
    • Labeling Streets in Interactive Maps using Embedded Labels. Schwartges, Nadine; Wolff, Alexander; Haunert, Jan-Henrik in Proc. 22nd ACM SIGSPATIAL Int. Conf. Advances Geogr. Inform. Syst. (ACM-GIS’14), Y. Huang, M. Schneider, M. Gertz, J. Krumm, J. Sankaranarayanan (Hrsg.) (2014). 517–520.
    • Point Labeling with Sliding Labels in Interactive Maps. Schwartges, Nadine; Haunert, Jan-Henrik; Wolff, Alexander; Zwiebler, Dennis in Proc. 17th AGILE Conf. Geogr. Inform. Sci. (AGILE’14), Lecture Notes in Geoinformation and Cartography, J. Huerta, S. Schade, C. Granell (Hrsg.) (2014). 295–310.
    • On Monotone Drawings of Trees. Kindermann, Philipp; Schulz, André; Spoerhase, Joachim; Wolff, Alexander in Proc. 22nd Int. Sympos. Graph Drawing (GD’14), Lecture Notes in Computer Science, C. Duncan, A. Symvonis (Hrsg.) (2014). (Bd. 8871) 488–500.
    • Universal Point Sets for Drawing Planar Graphs with Circular Arcs. Angelini, Patrizio; Eppstein, David; Frati, Fabrizio; Kaufmann, Michael; Lazard, Silvain; Mchedlidze, Tamara; Teillaud, Monique; Wolff, Alexander in Journal of Graph Algorithms & Applications (2014). 18(3) 313–324.
    • Improved Approximation Algorithms for Box Contact Representations. Bekos, Michael A.; van Dijk, Thomas C.; Fink, Martin; Kindermann, Philipp; Kobourov, Stephen; Pupyrev, Sergey; Spoerhase, Joachim; Wolff, Alexander in Proc. 22nd Annu. Europ. Symp. Algorithms (ESA’14), Lecture Notes in Computer Science, A. Schulz, D. Wagner (Hrsg.) (2014). (Bd. 8737) 87–99.
    • Watch Your Data Structures. Peng, Dongliang; Wolff, Alexander in Proc. 22th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK’14) (2014). 10 pages.
    • Guest Editors’ Foreword (Special Issue of Selected Papers from the 21st Int. Symp. Graph Drawing). Wismath, Stephen; Wolff, Alexander in Journal of Graph Algorithms & Applications (2014). 18(2) 174–175.
    • Concentric Metro Maps. Fink, Martin; Lechner, Magnus; Wolff, Alexander in Proc. Schematic Mapping Workshop (SMW’14) (2014).
      Poster
    2013[ to top ]
    • Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. Fink, Martin; Haunert, Jan-Henrik; Spoerhase, Joachim; Wolff, Alexander in Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13), S. Fekete (Hrsg.) (2013). 119–122.
    • Optimizing Active Ranges for Point Selection in Dynamic Maps. Schwartges, Nadine; Allerkamp, Dennis; Haunert, Jan-Henrik; Wolff, Alexander in Proc. 16th ICA Generalisation Workshop (ICAGW’13) (2013).
      10 pages.
    • Graph Drawing and Cartography. Wolff, Alexander in Handbook of Graph Drawing and Visualization, R. Tamassia (Hrsg.) (2013). 697–736.
    • Polylogarithmic Approximation for Generalized Minimum Manhattan Networks. Das, Aparna; Fleszar, Krzysztof; Kobourov, Stephen G.; Spoerhase, Joachim; Veeramoni, Sankar; Wolff, Alexander in Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13), S. Fekete (Hrsg.) (2013). 81–84.
    • Drawing Metro Maps using Bézier Curves. Fink, Martin; Haverkort, Herman; Nöllenburg, Martin; Roberts, Maxwell; Schuhmann, Julian; Wolff, Alexander in Proc. 20th Int. Sympos. Graph Drawing (GD’12), Lecture Notes in Computer Science, W. Didimo, M. Patrignani (Hrsg.) (2013). (Bd. 7704) 463–474.
    • Morphing Polylines Based on Least Squares Adjustment. Peng, Dongliang; Haunert, Jan-Henrik; Wolff, Alexander in Proc. 16th ICA Generalisation Workshop (ICAGW’13) (2013).
      10 pages.
    • Progress on Partial Edge Drawings. Bruckdorfer, Till; Cornelsen, Sabine; Gutwenger, Carsten; Kaufmann, Michael; Montecchiani, Fabrizio; Nöllenburg, Martin; Wolff, Alexander in Proc. 20th Int. Sympos. Graph Drawing (GD’12), Lecture Notes in Computer Science, W. Didimo, M. Patrignani (Hrsg.) (2013). (Bd. 7704) 67–78.
    • Selecting the Aspect Ratio of a Scatter Plot Based on Its Delaunay Triangulation. Fink, Martin; Haunert, Jan-Henrik; Spoerhase, Joachim; Wolff, Alexander in IEEE Transactions on Visualization and Computer Graphics (2013). 19(12) 2326–2335.
    • Approximating the Generalized Minimum Manhattan Network Problem. Das, Aparna; Fleszar, Krzysztof; Kobourov, Stephen G.; Spoerhase, Joachim; Veeramoni, Sankar; Wolff, Alexander in Proc. 24th Annu. Int. Symp. Algorithms Comput. (ISAAC’13), Lecture Notes in Computer Science, L. Cai, S.-W. Cheng, T.-W. Lam (Hrsg.) (2013). (Bd. 8283) 722–732.
    • Universal Point Sets for Planar Graph Drawings with Circular Arcs. Angelini, Patrizio; Eppstein, David; Fabrizio Frati, Michael Kaufmann; Lazard, Silvain; Tamara Mchedlidze, Monique Teillaud; Wolff, Alexander in Proc. 25th Canadian Conf. Comput. Geom. (CCCG’13) (2013). 117–122.
    • Two-Sided Boundary Labeling with Adjacent Sides. Kindermann, Philipp; Niedermann, Benjamin; Rutter, Ignaz; Schaefer, Marcus; Schulz, André; Wolff, Alexander in Proc. 29th Europ. Workshop Comput. Geom. (EuroCG’13), S. Fekete (Hrsg.) (2013). 233–236.
    • Two-Sided Boundary Labeling with Adjacent Sides. Kindermann, Philipp; Niedermann, Benjamin; Rutter, Ignaz; Schaefer, Marcus; Schulz, André; Wolff, Alexander in Proc. 13th Int. Algorithms Data Struct. Symp. (WADS’13), Lecture Notes in Computer Science, F. Dehne, R. Solis-Oba, J.-R. Sack (Hrsg.) (2013). (Bd. 8037) 463–474.
    • Proceedings of the 21st International Symposium on Graph Drawing (GD’13) Wismath, Stephen; Wolff, Alexander in Lecture Notes in Computer Science (2013). (Bd. 8242) Springer-Verlag.
    2012[ to top ]
    • Putting Data on the Map Kobourov, Stephen; Wolff, Alexander; van Ham, Frank in Dagstuhl Reports (2012). (Bd. 2) 51–76. Schloss Dagstuhl~-- Leibniz-Zentrum für Informatik.
      Dagstuhl Seminar 12261
    • Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. Buchin, Kevin; Buchin, Maike; Byrka, Jaroslaw; Nöllenburg, Martin; Okamoto, Yoshio; Silveira, Rodrigo I.; Wolff, Alexander in Algorithmica (2012). 62(1--2) 309–332.
    • Augmenting the Connectivity of Planar and Geometric Graphs. Rutter, Ignaz; Wolff, Alexander in Journal of Graph Algorithms & Applications (2012). 16(2) 599–628.
    • Algorithms for Labeling Focus Regions. Fink, Martin; Haunert, Jan-Henrik; Schulz, André; Spoerhase, Joachim; Wolff, Alexander in IEEE Transactions on Visualization and Computer Graphics (2012). 18(12) 2583–2592.
    • Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. Fink, Martin; Haunert, Jan-Henrik; Mchedlidze, Tamara; Spoerhase, Joachim; Wolff, Alexander in Proc. Workshop Algorithms Comput. (WALCOM’12), Lecture Notes in Computer Science, M. S. Rahman, S.- ichi Nakano (Hrsg.) (2012). (Bd. 7157) 186–197.
    • Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. Schwartges, Nadine; Spoerhase, Joachim; Wolff, Alexander in Proc. 9th Workshop Approx. Online Algorithms (WAOA’11), Lecture Notes in Computer Science, R. Solis-Oba, G. Persiano (Hrsg.) (2012). (Bd. 7164) 77–88.
    • Cover Contact Graphs. Atienza, Nieves; de Castro, Natalia; Cortés, Carmen; Garrido, M. Ángeles; Grima, Clara I.; Hernández, Gregorio; Márquez, Alberto; Moreno-González, Auxiliadora; Nöllenburg, Martin; Portillo, José Ramon; Reyes, Pedro; Valenzuela, Jesús; Villar, Maria Trinidad; Wolff, Alexander in Journal of Computational Geometry (2012). 3(1)
    2011[ to top ]
    • Approximating Minimum Manhattan Networks in Higher Dimensions. Das, Aparna; Gansner, Emden R.; Kaufmann, Michael; Kobourov, Stephen; Spoerhase, Joachim; Wolff, Alexander in Proc. 19th Annu. Europ. Symp. on Algorithms (ESA’11), Lecture Notes in Computer Science, C. Demetrescu, M. M. Halldórsson (Hrsg.) (2011). (Bd. 6942) 49–60.
    • Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming. Nöllenburg, Martin; Wolff, Alexander in IEEE Transactions on Visualization and Computer Graphics (2011). 17(5) 626–641.
    • Schematization in Cartography, Visualization, and Computational Geometry Dykes, Jason; Müller-Hannemann, Matthias; Wolff, Alexander in Dagstuhl Seminar Proceedings (2011). (Bd. 10461) Schloss Dagstuhl~-- Leibniz-Zentrum für Informatik.
    2010[ to top ]
    • Computing Large Matchings Fast. Rutter, Ignaz; Wolff, Alexander in ACM Transactions on Algorithms (2010). 7(1) article 1, 21 pages.
    • Optimal and Topologically Safe Simplification of Building Footprints. Haunert, Jan-Henrik; Wolff, Alexander in Proc. 18th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’10) (2010). 192–201.
    • How Alexander the Great Brought the Greeks Together While Inflicting Minimal Damage to the Barbarians. de Berg, Mark; Gerrits, Dirk; Khosravi, Amirali; Rutter, Ignaz; Tsirogiannis, Constantinos; Wolff, Alexander in Proc. 26th European Workshop Comput. Geom. (EuroCG’10) (2010). 73–76.
    • The Traveling Salesman Problem Under Squared Euclidean Distances. de Berg, Marc; van Nijnatten, Fred; Sitters, René; Woeginger, Gerhard J.; Wolff, Alexander in Proc. 27th Int. Sympos. Theoretical Aspects Comput. Sci. (STACS’10), J.-Y. Marion, T. Schwentick (Hrsg.) (2010). 239–250.
    • Trimming of Graphs, with Application to Point Labeling. Erlebach, Thomas; Hagerup, Torben; Jansen, Klaus; Minzlaff, Moritz; Wolff, Alexander in Theory of Computing Systems (2010). 47(3) 613–636.
    • Area aggregation in map generalisation by mixed-integer programming. Haunert, Jan-Henrik; Wolff, Alexander in International Journal of Geographical Information Science (2010). 24(12) 1871–1897.
    • Optimizing Active Ranges for Consistent Dynamic Map Labeling. Been, Ken; Nöllenburg, Martin; Poon, Sheung-Hung; Wolff, Alexander in Computational Geometry: Theory and Applications (2010). 43(3) 312–328.
    • Manhattan-Geodesic Embedding of Planar Graphs. Katz, Bastian; Krug, Marcus; Rutter, Ignaz; Wolff, Alexander in Proc. 17th Int. Sympos. Graph Drawing (GD’09), Lecture Notes in Computer Science, D. Eppstein, E. R. Gansner (Hrsg.) (2010). (Bd. 5849) 207–218.
    2009[ to top ]
    • Drawing Binary Tanglegrams: An Experimental Evaluation. Nöllenburg, Martin; Völker, Markus; Wolff, Alexander; Holten, Danny in Proc. 11th Workshop Algorithm Engineering and Experiments (ALENEX’09) (2009). 106–119.
    • Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. Buchin, Kevin; Buchin, Maike; Byrka, Jaroslaw; Nöllenburg, Martin; Okamoto, Yoshio; Silveira, Rodrigo I.; Wolff, Alexander in Proc. 16th Int. Sympos. Graph Drawing (GD’08), Lecture Notes in Computer Science, I. G. Tollis, M. Patrignani (Hrsg.) (2009). (Bd. 5417) 324–335.
    • Constructability of Trip-lets. Keiren, Jeroen; van Walderveen, Freek; Wolff, Alexander in Proc. 25th European Workshop on Computational Geometry (EuroCG’09), S. Langerman (Hrsg.) (2009).
    • Constructing Optimal Highways. Ahn, Hee-Kap; Alt, Helmut; Asano, Tetsuo; Bae, Sang Won; Brass, Peter; Cheong, Otfried; Knauer, Christian; Na, Hyeon-Suk; Shin, Chan-Su; Wolff, Alexander in International Journal of Foundations of Computer Science (2009). 20(1) 3–23.
    • A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. Benkert, Marc; Gudmundsson, Joachim; Knauer, Christian; van Oostrum, René; Wolff, Alexander in International Journal of Computational Geometry and Applications (2009). 19(3) 267–288.
    • Untangling a Planar Graph. Goaoc, Xavier; Kratochvíl, Jan; Okamoto, Yoshio; Shin, Chan-Su; Spillner, Andreas; Wolff, Alexander in Discrete & Computational Geometry (2009). 42(4) 542–569.
    • Matching Points with Rectangles and Squares. Bereg, Sergey; Mutsanas, Nikolaus; Wolff, Alexander in Computational Geometry: Theory and Applications (2009). 42(2) 93–108.
    2008[ to top ]
    • Morphing Polylines: A Step Towards Continuous Generalization. Nöllenburg, Martin; Merrick, Damian; Wolff, Alexander; Benkert, Marc in Computers, Environment and Urban Systems (2008). 32(4) 248–260.
    • Cover Contact Graphs. Atienza, Nieves; de Castro, Natalia; Cortés, Carmen; Garrido, M. Ángeles; Grima, Clara I.; Hernández, Gregorio; Márquez, Alberto; Moreno, Auxiliadora; Nöllenburg, Martin; Portillo, José Ramon; Reyes, Pedro; Valenzuela, Jesús; Villar, Maria Trinidad; Wolff, Alexander in Proc. 15th Int. Sympos. Graph Drawing (GD’07), Lecture Notes in Computer Science, S.-H. Hong, T. Nishizeki, W. Quan (Hrsg.) (2008). (Bd. 4875) 171–182.
    • Untangling a Planar Graph. Spillner, Andreas; Wolff, Alexander in Proc. 34th Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’08), Lecture Notes in Computer Science, V. Geffert, J. Karhumäki, A. Bertoni, B. Preneel, P. Návrat, M. Bieliková (Hrsg.) (2008). (Bd. 4910) 473–484.
    • Optimizing Active Ranges for Consistent Dynamic Map Labeling. Been, Ken; Nöllenburg, Martin; Poon, Sheung-Hung; Wolff, Alexander in Proc. 24th European Workshop on Computational Geometry (EuroCG’08), S. Petitjean (Hrsg.) (2008). 55–58.
    • Moving Vertices to Make Drawings Plane. Goaoc, Xavier; Kratochvíl, Jan; Okamoto, Yoshio; Shin, Chan-Su; Wolff, Alexander in Proc. 15th Int. Sympos. Graph Drawing (GD’07), Lecture Notes in Computer Science, S.-H. Hong, T. Nishizeki, W. Quan (Hrsg.) (2008). (Bd. 4875) 101–112.
    • Computing Large Matchings Fast. Rutter, Ignaz; Wolff, Alexander in Proc. 19th ACM-SIAM Sympos. Discrete Algorithms (SODA’08) (2008). 183–192.
    • Constructing Interference-Minimal Networks. Benkert, Marc; Gudmundsson, Joachim; Haverkort, Herman; Wolff, Alexander in Computational Geometry: Theory and Applications (2008). 40(3) 179–194.
    • Optimal Simplification of Building Ground Plans. Haunert, Jan-Henrik; Wolff, Alexander in Proc. 21st Congress Int. Society Photogrammetry Remote Sensing (ISPRS’08), Technical Commision II/3, Int. Archives of Photogrammetry, Remote Sensing and Spatial Informat. Sci. (2008). (Bd. XXXVII, Part B2) 373–378.
    • Trimming of Graphs, with Application to Point Labeling. Erlebach, Thomas; Hagerup, Torben; Jansen, Klaus; Minzlaff, Moritz; Wolff, Alexander in Proc. 25th Int. Sympos. Theoretical Aspects Comput. Sci. (STACS’08), LIPIcs, S. Albers, P. Weil (Hrsg.) (2008). (Bd. 1) 265–276.
    • Constructing the City Voronoi Diagram Faster. Görke, Robert; Shin, Chan-Su; Wolff, Alexander in International Journal of Computational Geometry and Applications (2008). 18(4) 275–294.
    • Optimizing Active Ranges for Consistent Dynamic Map Labeling. Been, Ken; Nöllenburg, Martin; Poon, Sheung-Hung; Wolff, Alexander in Proc. 24th Annu. ACM Sympos. Comput. Geom. (SoCG’08) (2008). 10–19.
    • Augmenting the Connectivity of Planar and Geometric Graphs. Rutter, Ignaz; Wolff, Alexander in Proc. Int. Conf. Topological Geom. Graph Theory (TGGT’08), Electronic Notes in Discrete Mathematics (2008). (Bd. 31) 53–56.
    • Decomposing a Simple Polygon into Pseudo-Triangles and Convex Polygons. Gerdjikov, Stefan; Wolff, Alexander in Computational Geometry: Theory and Applications (2008). 41(1--2) 21–30.
    • Delineating Boundaries for Imprecise Regions. Reinbacher, Iris; Benkert, Marc; van Kreveld, Marc; Mitchell, Joseph S.B.; Snoeyink, Jack; Wolff, Alexander in Algorithmica (2008). 50(3) 386–414.
    • Augmenting the Connectivity of Planar and Geometric Graphs. Rutter, Ignaz; Wolff, Alexander in Proc. 24th European Workshop on Computational Geometry (EuroCG’08), S. Petitjean (Hrsg.) (2008). 71–74.
    2007[ to top ]
    • Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transport Maps. Benkert, Marc; Nöllenburg, Martin; Uno, Takeaki; Wolff, Alexander in Proc. 14th Int. Sympos. Graph Drawing (GD’06), Lecture Notes in Computer Science, M. Kaufmann, D. Wagner (Hrsg.) (2007). (Bd. 4372) 270–281.
    • Drawing Subway Maps: A Survey. Wolff, Alexander in Informatik~-- Forschung & Entwicklung (2007). 22(1) 23–44.
    • Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. Bekos, Michael A.; Kaufmann, Michael; Symvonis, Antonios; Wolff, Alexander in Computational Geometry: Theory and Applications (2007). 36(3) 215–236.
    • Constructing Optimal Highways. Ahn, Hee-Kap; Alt, Helmut; Asano, Tetsuo; Bae, Sang Won; Brass, Peter; Cheong, Otfried; Knauer, Christian; Na, Hyeon-Suk; Shin, Chan-Su; Wolff, Alexander in Proc. 13th Conf. Computing: The Australasian Theory Sympos. (CATS’07), Conferences in Research and Practice in Information Technology, B. Jay, J. Gudmundsson (Hrsg.) (2007). (Bd. 65) 7–14.
    • Straightening Drawings of Clustered Hierarchical Graphs. Bereg, Sergey; Völker, Markus; Wolff, Alexander; Zhang, Yuanyi in Proc. 33rd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’07), Lecture Notes in Computer Science, J. van Leeuwen, G. F. Italiano, W. van der Hoek, C. Meinel, H. Sack, F. Plasil (Hrsg.) (2007). (Bd. 4362) 177–186.
    • Geometric Networks and Metric Space Embeddings Gudmundsson, Joachim; Klein, Rolf; Narasimhan, Giri; Smid, Michiel; Wolff, Alexander in Dagstuhl Seminar Proceedings (2007). (Bd. 06481) Schloss Dagstuhl~-- Leibniz-Zentrum für Informatik.
    • Morphing Polygonal Lines: A Step Towards Continuous Generalization. Merrick, Damian; Nöllenburg, Martin; Wolff, Alexander; Benkert, Marc in Proc. 15th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK’07) (2007). 390–399.
    • Morphing Polygonal Lines: A Step Towards Continuous Generalization. Merrick, Damian; Nöllenburg, Martin; Wolff, Alexander; Benkert, Marc in Proc. 23rd European Workshop on Computational Geometry (EWCG’07), O. Aichholzer, T. Hackl (Hrsg.) (2007). 6–9.
    • Configurations with Few Crossings in Topological Graphs. Knauer, Christian; Schramm, Étienne; Spillner, Andreas; Wolff, Alexander in Computational Geometry: Theory and Applications (2007). 37(2) 104–114.
    2006[ to top ]
    • Farthest-Point Queries with Geometric and Combinatorial Constraints. Daescu, Ovidiu; Mi, Ningfang; Shin, Chan-Su; Wolff, Alexander in Computational Geometry: Theory and Applications (2006). 33(3) 174–185.
    • Constructing Interference-Minimal Networks. Benkert, Marc; Gudmundsson, Joachim; Haverkort, Herman; Wolff, Alexander in Proc. 32nd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’06), Lecture Notes in Computer Science, J. Wiedermann, J. Stuller, G. Tel, J. Pokorn’y}}, M. Bieliková (Hrsg.) (2006). (Bd. 3831) 166–175.
    • A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. Benkert, Marc; Gudmundsson, Joachim; Knauer, Christian; Moet, Esther; van Oostrum, René; Wolff, Alexander in Proc. 12th Annu. Int. Comput. Combinatorics Conf. (COCOON’06), Lecture Notes in Computer Science, D. Z. Chen, D.-T. Lee (Hrsg.) (2006). (Bd. 4112) 166–175.
    • Improved Fixed-Parameter Algorithms for Non-Crossing Subgraphs. Halldórsson, Magnús M.; Wolff, Alexander; Tokuyama, Takeshi in Proc. ICALP Affiliated Workshop on Improving Exponential-Time Algorithms (iETA’06) (2006). 31–38.
    • Routing by Landmarks. Rüetschi, Urs-Jakob; Caduff, David; Timpf, Sabine; Schulz, Frank; Wolff, Alexander in Proc. 6th Swiss Transport Research Conf. (STRC’06) (2006).
      CD-ROM
    • Pseudo-Convex Decomposition of Simple Polygons. Gerdjikov, Stefan; Wolff, Alexander in Proc. 22nd European Workshop on Computational Geometry (EWCG’06) (2006). 13–16.
    • A New Approximation Algorithm for Labeling Weighted Points with Sliding Labels. Erlebach, Thomas; Hagerup, Torben; Jansen, Klaus; Minzlaff, Moritz; Wolff, Alexander in Proc. 22nd European Workshop on Computational Geometry (EWCG’06) (2006). 137–140.
    • Matching Points with Rectangles and Squares. Bereg, Sergey; Mutsanas, Nikolaus; Wolff, Alexander in Proc. 32nd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM’06), Lecture Notes in Computer Science, J. r’i} Wiedermann, J. Stuller, G. Tel, J. Pokorn’y}}, M. Bieliková (Hrsg.) (2006). (Bd. 3831) 177–186.
    • Generalization of Land Cover Maps by Mixed Integer Programming. Haunert, Jan-Henrik; Wolff, Alexander in Proc. 14th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’06) (2006). 75–82.
    • The Minimum Manhattan Network Problem: Approximations and Exact Solutions. Benkert, Marc; Wolff, Alexander; Widmann, Florian; Shirabe, Takeshi in Computational Geometry: Theory and Applications (2006). 35(3) 188–208.
    • A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. Benkert, Marc; Gudmundsson, Joachim; Knauer, Christian; Moet, Esther; van Oostrum, René; Wolff, Alexander in Proc. 22nd European Workshop on Computational Geometry (EWCG’06) (2006). 141–144.
    • A Mixed-Integer Program for Drawing High-Quality Metro Maps. Nöllenburg, Martin; Wolff, Alexander in Proc. 13th Int. Sympos. Graph Drawing (GD’05), Lecture Notes in Computer Science, P. Healy, N. S. Nikolov (Hrsg.) (2006). (Bd. 3843) 321–333.
    2005[ to top ]
    • Delineating Boundaries for Imprecise Regions. Reinbacher, Iris; Benkert, Marc; van Kreveld, Marc; Mitchell, Joseph S.B.; Wolff, Alexander in Proc. 13th Annu. Europ. Symp. on Algorithms (ESA’05), Lecture Notes in Computer Science, G. S. Brodal, S. Leonardi (Hrsg.) (2005). (Bd. 3669) 143–154.
    • Farthest-Point Queries with Geometric and Combinatorial Constraints. Daescu, Ovidiu; Mi, Ningfang; Shin, Chan-Su; Wolff, Alexander in Proc. 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04), Lecture Notes in Computer Science, J. Akiyama, M. Kano, X. Tan (Hrsg.) (2005). (Bd. 3742) 62–75.
    • Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. Bekos, Michael A.; Kaufmann, Michael; Symvonis, Antonios; Wolff, Alexander in Proc. 12th Int. Sympos. Graph Drawing (GD’04), Lecture Notes in Computer Science, J. Pach (Hrsg.) (2005). (Bd. 3383) 49–59.
    • Constructing the City Voronoi Diagram Faster. Görke, Robert; Wolff, Alexander in Proc. 2nd Int. Symp. on Voronoi Diagrams in Science and Engineering (VD’05) (2005). 162–172.
    • Constructing the City Voronoi Diagram Faster. Görke, Robert; Wolff, Alexander in Proc. 21st European Workshop on Computational Geometry (EWCG’05) (2005). 155–158.
    • Optimal Spanners for Axis-Aligned Rectangles. Asano, Tetsuo; de Berg, Mark; Cheong, Otfried; Everett, Hazel; Haverkort, Herman; Katoh, Naoki; Wolff, Alexander in Computational Geometry: Theory and Applications (2005). 30(1) 59–77.
    • Constructing Interference-Minimal Networks. Benkert, Marc; Gudmundsson, Joachim; Haverkort, Herman; Wolff, Alexander in Proc. 21st European Workshop on Computational Geometry (EWCG’05) (2005). 203–206.
    • Delineating Boundaries for Imprecise Regions. Reinbacher, Iris; Benkert, Marc; van Kreveld, Marc; Wolff, Alexander in Proc. 21st European Workshop on Computational Geometry (EWCG’05) (2005). 127–130.
    • Configurations with Few Crossings in Topological Graphs. Knauer, Christian; Schramm, Étienne; Spillner, Andreas; Wolff, Alexander in Proc. 16th Annu. Int. Symp. Algorithms Comput. (ISAAC’05), Lecture Notes in Computer Science, X. Deng, D.-Z. Du (Hrsg.) (2005). (Bd. 3827) 604–613.
    • Geometrische Netzwerke und ihre Visualisierung. Wolff, Alexander (2005, Juni).
    • The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. Benkert, Marc; Widmann, Florian; Wolff, Alexander in Proc. 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04), Lecture Notes in Computer Science, J. Akiyama, M. Kano, X. Tan (Hrsg.) (2005). (Bd. 3742) 16–28.
    • Spanning Trees with Few Crossings in Geometric and Topological Graphs. Knauer, Christian; Schramm, Étienne; Spillner, Andreas; Wolff, Alexander in Proc. 21st European Workshop on Computational Geometry (EWCG’05) (2005). 195–198.
    2004[ to top ]
    • The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. Benkert, Marc; Widmann, Florian; Wolff, Alexander in Abstracts 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04) (2004). 85–86.
    • Optimal Spanners for Axis-Aligned Rectangles. Asano, Tetsuo; de Berg, Mark; Cheong, Otfried; Everett, Hazel; Haverkort, Herman; Katoh, Naoki; Wolff, Alexander in Proc. 20th European Workshop on Computational Geometry (EWCG’04) (2004). 97–100.
    • Farthest-Point Queries with Geometric and Combinatorial Constraints. Daescu, Ovidiu; Mi, Ningfang; Shin, Chan-Su; Wolff, Alexander in Proc. 20th European Workshop on Computational Geometry (EWCG’04) (2004). 45–48.
    • The Minimum Manhattan Network Problem: Approximations and Exact Solutions. Wolff, Alexander; Benkert, Marc; Shirabe, Takeshi in Proc. 20th European Workshop on Computational Geometry (EWCG’04) (2004). 209–212.
    • Web-Based Delineation of Imprecise Regions. Arampatzis, Avi; van Kreveld, Marc; Reinbacher, Iris; Jones, Christopher B.; Vaid, Subodh; Clough, Paul; Joho, Hideo; Sanderson, Mark; Benkert, Marc; Wolff, Alexander in Proc. Workshop on Geographic Information Retrieval at SIGIR’04 (2004).
    • Algorithms for the Placement of Diagrams on Maps. van Kreveld, Marc; Schramm, Étienne; Wolff, Alexander in Proc. 12th Int. ACM Symp. Advances Geogr. Inform. Syst. (ACM-GIS’04), D. Pfoder, I. F. Cruz, M. Ronthaler (Hrsg.) (2004). 222–231.
    • Farthest-Point Queries with Geometric and Combinatorial Constraints. Daescu, Ovidiu; Mi, Ningfang; Shin, Chan-Su; Wolff, Alexander in Abstracts 8th Japanese Conf. on Discrete and Computational Geometry (JCDCG’04) (2004). 110–111.
    • Facility Location and the Geometric Minimum-Diameter Spanning Tree. Gudmundsson, Joachim; Haverkort, Herman; Park, Sang-Min; Shin, Chan-Su; Wolff, Alexander in Computational Geometry: Theory and Applications (2004). 27(1) 87–106.
    2003[ to top ]
    • Labeling Points with Weights. Poon, Sheung-Hung; Shin, Chan-Su; Strijk, Tycho; Uno, Takeaki; Wolff, Alexander in Algorithmica (2003). 38(2) 341–362.
    2002[ to top ]
    • A Tutorial for Designing Flexible Geometric Algorithms. Kapoor, Vikas; Kühl, Dietmar; Wolff, Alexander in Algorithmica (2002). 33(1) 52–70.
    • Approximating the Geometric Minimum-Diameter Spanning Tree. Gudmundsson, Joachim; Haverkort, Herman; Park, Sang-Min; Shin, Chan-Su; Wolff, Alexander in Proc. 18th European Workshop on Computational Geometry (EWCG’02) (2002). 41–45.
    • Towards an Evaluation of Quality for Names Placement Methods. van Dijk, Steven; van Kreveld, Marc; Strijk, Tycho; Wolff, Alexander in International Journal of Geographical Information Science (2002). 16(7) 641–661.
    • A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling. Wolff, Alexander; Thon, Michael; Xu, Yinfeng in International Journal of Computational Geometry and Applications (2002). 12(4) 269–281.
    • Facility Location and the Geometric Minimum-Diameter Spanning Tree. Gudmundsson, Joachim; Haverkort, Herman; Park, Sang-Min; Shin, Chan-Su; Wolff, Alexander in Proc. 5th Int. Workshop Approx. Algorithms Combin. Optim. (APPROX’02), Lecture Notes in Computer Science, K. Jansen, S. Leonardi, V. Vazirani (Hrsg.) (2002). (Bd. 2462) 146–160.
    2001[ to top ]
    • Labeling Points with Weights. Poon, Sheung-Hung; Shin, Chan-Su; Strijk, Tycho; Wolff, Alexander in Proc. 17th European Workshop on Computational Geometry (EWCG’01) (2001). 97–100.
    • Three Rules Suffice for Good Label Placement. Wagner, Frank; Wolff, Alexander; Kapoor, Vikas; Strijk, Tycho in Algorithmica (2001). 30(2) 334–349.
    • Etiquetado de puntos alineados. Garrido, Mari Ángeles; Márquez, Alberto; Iturriaga, Claudia; Portillo, José Ramon; Reyes, Pedro; Wolff, Alexander in Proc. IX Encuentros de Geometría Computacional (EGC’01) (2001). 285–294.
    • Labeling Points with Weights. Poon, Sheung-Hung; Shin, Chan-Su; Strijk, Tycho; Wolff, Alexander in Proc. 12th Annu. Int. Symp. Algorithms Comput. (ISAAC’01), Lecture Notes in Computer Science, P. Eades, T. Takaoka (Hrsg.) (2001). (Bd. 2223) 610–622.
    • Labeling Subway Lines. Garrido, Mari Ángeles; Iturriaga, Claudia; Márquez, Alberto; Portillo, José Ramon; Reyes, Pedro; Wolff, Alexander in Proc. 12th Annu. Int. Symp. Algorithms Comput. (ISAAC’01), Lecture Notes in Computer Science, P. Eades, T. Takaoka (Hrsg.) (2001). (Bd. 2223) 649–659.
    • Labeling Points with Circles. Strijk, Tycho; Wolff, Alexander in International Journal of Computational Geometry and Applications (2001). 11(2) 181–195.
    2000[ to top ]
    • New Algorithms for Two-Label Point Labeling. Qin, Zhongping; Wolff, Alexander; Xu, Yinfeng; Zhu, Binhai in Proc. 8th Annu. Europ. Symp. on Algorithms (ESA’00), Lecture Notes in Computer Science, M. Paterson (Hrsg.) (2000). (Bd. 1879) 368–379.
    • A Simple and Efficient Algorithm for High-Quality Line Labeling. Wolff, Alexander; Knipping, Lars; van Kreveld, Marc; Strijk, Tycho; Agarwal, Pankaj K. in Innovations in GIS VII: GeoComputation, P. M. Atkinson, D. J. Martin (Hrsg.) (2000). 147–159.
    • Ein neuer Algorithmus zur Beschriftung von Punkten mit je zwei Kreisen. Thon, Michael; Wolff, Alexander; Xu, Yinfeng in Tagungsband der Informatiktage, Gesellschaft für Informatik e.V. (Hrsg.) (2000).
    • A Better Lower Bound for Two-Circle Point Labeling. Wolff, Alexander; Thon, Michael; Xu, Yinfeng in Proc. 11th Annu. Int. Symp. Algorithms Comput. (ISAAC’00), Lecture Notes in Computer Science, D. Lee, S.-H. Teng (Hrsg.) (2000). (Bd. 1969) 422–431.
    1999[ to top ]
    • Towards an Evaluation of Quality for Label Placement Methods. van Dijk, Steven; van Kreveld, Marc; Strijk, Tycho; Wolff, Alexander in Proc. 19th Int. Cartographic Conf. (ICA’99) (1999). 905–913.
    • Point Labeling with Sliding Labels. van Kreveld, Marc; Strijk, Tycho; Wolff, Alexander in Computational Geometry: Theory and Applications (1999). 13(1) 21–47.
    • A Combinatorial Framework for Map Labeling. Wagner, Frank; Wolff, Alexander in Proc. 6th Int. Sympos. Graph Drawing (GD’98), Lecture Notes in Computer Science, S. H. Whitesides (Hrsg.) (1999). (Bd. 1547) 316–331.
    • Automated Label Placement in Theory and Practice. Technical Report (PhD dissertation), Wolff, Alexander PhD thesis, Fachbereich Mathematik und Informatik, Freie Universität Berlin. (1999, Mai).
    • A Simple and Efficient Algorithm for High-Quality Line Labeling. Wolff, Alexander; Knipping, Lars; van Kreveld, Marc; Strijk, Tycho; Agarwal, Pankaj K. in Proc. 7th Annu. Geograph. Inform. Sci. Research Conf. UK (GISRUK’99), D. Martin, F. Wu (Hrsg.) (1999). 146–150.
    • A Simple and Efficient Algorithm for High-Quality Line Labeling. Agarwal, Pankaj K.; Knipping, Lars; van Kreveld, Marc; Strijk, Tycho; Wolff, Alexander in Proc. 15th European Workshop on Computational Geometry (EWCG’99) (1999). 93–96.
    1998[ to top ]
    • Point Set Labeling with Sliding Labels. van Kreveld, Marc; Strijk, Tycho; Wolff, Alexander in Proc. 14th Annu. ACM Sympos. Comput. Geom. (SoCG’98) (1998). 337–346.
    • MakeIt! -- Generating and Maintaining Makefiles Automatically. Schönherr, Sven; Wolff, Alexander in Proc. Workshop on Algorithms and Experiments (ALEX’98), R. Battini, A. A. Bertossi (Hrsg.) (1998). 165–174.
    • The Hardness of Approximating Set Cover. Wolff, Alexander in Lectures on Proof Verification and Approximation Algorithms, E. W. Mayr, H. J. Prömel, A. Steger (Hrsg.) (1998). (Bd. 1367) 249–262.
    1997[ to top ]
    • A Practical Map Labeling Algorithm. Wagner, Frank; Wolff, Alexander in Computational Geometry: Theory and Applications (1997). 7(5--6) 387–404.
    1996[ to top ]
    • The Map-Labeling Bibliography. Wolff, Alexander; Strijk, Tycho (1996).
    1995[ to top ]
    • Map Labeling. Technical Report (Master thesis), Wolff, Alexander PhD thesis, Fachbereich Mathematik und Informatik, Freie Universität Berlin. (1995, Mai).
    • Map Labeling Heuristics: Provably Good and Practically Useful. Wagner, Frank; Wolff, Alexander in Proc. 11th Annu. ACM Sympos. Comput. Geom. (SoCG’95) (1995). 109–118.
    • An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. Wagner, Frank; Wolff, Alexander in Proc. 3rd Annu. Europ. Symp. on Algorithms (ESA’95), Lecture Notes in Computer Science, P. Spirakis (Hrsg.) (1995). (Bd. 979) 420–433.
    • Fast and Reliable Map Labeling. Wagner, Frank; Wolff, Alexander in Proc. 9th Int. Symp. Computer Science for Environment Protection (CSEP’95), H. K. und Werner Pillmann (Hrsg.) (1995). 667–675.

    Nach oben