| 2012 | ||
|---|---|---|
| j34 | Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff: Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability. Algorithmica 62(1-2): 309-332 (2012) | |
| j33 | Ignaz Rutter, Alexander Wolff: Augmenting the Connectivity of Planar and Geometric Graphs. J. Graph Algorithms Appl. 16(2): 599-628 (2012) | |
| j32 | Nieves Atienza, Natalia de Castro, Carmen Cortés, Maria Angeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno-González, Martin Nöllenburg, José Ramón Portillo, Pedro Reyes, Jesus Valenzuela, Maria Trinidad Villar, Alexander Wolff: Cover Contact Graphs. JoCG 3(1): 102-131 (2012) | |
| j31 | Martin Fink, Jan-Henrik Haunert, André Schulz, Joachim Spoerhase, Alexander Wolff: Algorithms for Labeling Focus Regions. IEEE Trans. Vis. Comput. Graph. 18(12): 2583-2592 (2012) | |
| c42 | Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff: Progress on Partial Edge Drawings. Graph Drawing 2012: 67-78 | |
| c41 | Martin Fink, Herman J. Haverkort, Martin Nöllenburg, Maxwell Roberts, Julian Schuhmann, Alexander Wolff: Drawing Metro Maps Using Bézier Curves. Graph Drawing 2012: 463-474 | |
| c40 | Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff: Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. WALCOM 2012: 186-197 | |
| i16 | Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff: Polylogarithmic Approximation for Generalized Minimum Manhattan Networks. CoRR abs/1203.6481 (2012) | |
| i15 | Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff: Progress on Partial Edge Drawings. CoRR abs/1209.0830 (2012) | |
| i14 | Stephen Koubourov, Alexander Wolff, Frank van Ham: Putting Data on the Map (Dagstuhl Seminar 12261). Dagstuhl Reports 2(6): 51-76 (2012) | |
| 2011 | ||
| j30 | Martin Nöllenburg, Alexander Wolff: Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming. IEEE Trans. Vis. Comput. Graph. 17(5): 626-641 (2011) | |
| c39 | Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff: Approximating Minimum Manhattan Networks in Higher Dimensions. ESA 2011: 49-60 | |
| c38 | Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff: Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. Graph Drawing 2011: 441-442 | |
| c37 | Nadine Schwartges, Joachim Spoerhase, Alexander Wolff: Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs. WAOA 2011: 77-88 | |
| i13 | Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff: Approximating Minimum Manhattan Networks in Higher Dimensions. CoRR abs/1107.0901 (2011) | |
| i12 | Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff: Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. CoRR abs/1107.4970 (2011) | |
| 2010 | ||
| j29 | Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff: Optimizing active ranges for consistent dynamic map labeling. Comput. Geom. 43(3): 312-328 (2010) | |
| j28 | Jan-Henrik Haunert, Alexander Wolff: Area aggregation in map generalisation by mixed-integer programming. International Journal of Geographical Information Science 24(12): 1871-1897 (2010) | |
| j27 | Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff: Trimming of Graphs, with Application to Point Labeling. Theory Comput. Syst. 47(3): 613-636 (2010) | |
| j26 | Ignaz Rutter, Alexander Wolff: Computing large matchings fast. ACM Transactions on Algorithms 7(1): 1 (2010) | |
| c36 | Jan-Henrik Haunert, Alexander Wolff: Optimal and topologically safe simplification of building footprints. GIS 2010: 192-201 | |
| c35 | Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg: The Traveling Salesman Problem under Squared Euclidean Distances. STACS 2010: 239-250 | |
| i11 | Mark de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff: The Traveling Salesman Problem Under Squared Euclidean Distances. CoRR abs/1001.0236 (2010) | |
| 2009 | ||
| j25 | Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff: Matching points with rectangles and squares. Comput. Geom. 42(2): 93-108 (2009) | |
| j24 | Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, Alexander Wolff: Untangling a Planar Graph. Discrete & Computational Geometry 42(4): 542-569 (2009) | |
| j23 | Marc Benkert, Joachim Gudmundsson, Christian Knauer, René van Oostrum, Alexander Wolff: A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. Int. J. Comput. Geometry Appl. 19(3): 267-288 (2009) | |
| j22 | Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. Int. J. Found. Comput. Sci. 20(1): 3-23 (2009) | |
| c34 | Martin Nöllenburg, Markus Völker, Alexander Wolff, Danny Holten: Drawing Binary Tanglegrams: An Experimental Evaluation. ALENEX 2009: 106-119 | |
| c33 | Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff: Manhattan-Geodesic Embedding of Planar Graphs. Graph Drawing 2009: 207-218 | |
| 2008 | ||
| j21 | Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Jack Snoeyink, Alexander Wolff: Delineating Boundaries for Imprecise Regions. Algorithmica 50(3): 386-414 (2008) | |
| j20 | Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing minimum-interference networks. Comput. Geom. 40(3): 179-194 (2008) | |
| j19 | Stefan Gerdjikov, Alexander Wolff: Decomposing a simple polygon into pseudo-triangles and convex polygons. Comput. Geom. 41(1-2): 21-30 (2008) | |
| j18 | Ignaz Rutter, Alexander Wolff: Augmenting the Connectivity of Planar and Geometric Graphs. Electronic Notes in Discrete Mathematics 31: 53-56 (2008) | |
| j17 | Robert Görke, Chan-Su Shin, Alexander Wolff: Constructing the City Voronoi Diagram Faster. Int. J. Comput. Geometry Appl. 18(4): 275-294 (2008) | |
| j16 | Martin Nöllenburg, Damian Merrick, Alexander Wolff, Marc Benkert: Morphing polylines: A step towards continuous generalization. Computers, Environment and Urban Systems 32(4): 248-260 (2008) | |
| c32 | Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff: Optimizing active ranges for consistent dynamic map labeling. Symposium on Computational Geometry 2008: 10-19 | |
| c31 | Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff: Drawing (Complete) Binary Tanglegrams. Graph Drawing 2008: 324-335 | |
| c30 | ||
| c29 | ||
| c28 | Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff: Trimming of Graphs, with Application to Point Labeling. STACS 2008: 265-276 | |
| i10 | Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff: Trimming of Graphs, with Application to Point Labeling. CoRR abs/0802.2854 (2008) | |
| i9 | Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff: Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. CoRR abs/0806.0920 (2008) | |
| i8 | Martin Nöllenburg, Danny Holten, Markus Völker, Alexander Wolff: Drawing Binary Tanglegrams: An Experimental Evaluation. CoRR abs/0806.0928 (2008) | |
| 2007 | ||
| j15 | Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff: Boundary labeling: Models and efficient algorithms for rectangular maps. Comput. Geom. 36(3): 215-236 (2007) | |
| j14 | Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff: Configurations with few crossings in topological graphs. Comput. Geom. 37(2): 104-114 (2007) | |
| j13 | ||
| c27 | Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. CATS 2007: 7-14 | |
| c26 | Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff: Moving Vertices to Make Drawings Plane. Graph Drawing 2007: 101-112 | |
| c25 | Nieves Atienza, Natalia de Castro, Carmen Cortés, Maria Angeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno-González, Martin Nöllenburg, José Ramón Portillo, Pedro Reyes, Jesus Valenzuela, Maria Trinidad Villar, Alexander Wolff: Cover Contact Graphs. Graph Drawing 2007: 171-182 | |
| c24 | Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang: Straightening Drawings of Clustered Hierarchical Graphs. SOFSEM (1) 2007: 176-187 | |
| e1 | Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff (Eds.): Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006. Dagstuhl Seminar Proceedings 06481, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 | |
| i7 | Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff: Moving Vertices to Make Drawings Plane. CoRR abs/0706.1002 (2007) | |
| i6 | ||
| i5 | Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff: Constructing Optimal Highways. CoRR abs/cs/0703037 (2007) | |
| 2006 | ||
| j12 | Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff: Farthest-point queries with geometric and combinatorial constraints. Comput. Geom. 33(3): 174-185 (2006) | |
| j11 | Marc Benkert, Alexander Wolff, Florian Widmann, Takeshi Shirabe: The minimum Manhattan network problem: Approximations and exact solutions. Comput. Geom. 35(3): 188-208 (2006) | |
| c23 | Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff: A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. COCOON 2006: 166-175 | |
| c22 | Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff: 06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. Geometric Networks and Metric Space Embeddings 2006 | |
| c21 | Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff: Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. Graph Drawing 2006: 270-281 | |
| c20 | Jan-Henrik Haunert, Alexander Wolff: Generalization of land cover maps by mixed integer programming. GIS 2006: 75-82 | |
| c19 | Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing Interference-Minimal Networks. SOFSEM 2006: 166-176 | |
| c18 | Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff: Matching Points with Rectangles and Squares. SOFSEM 2006: 177-186 | |
| 2005 | ||
| j10 | Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff: Optimal spanners for axis-aligned rectangles. Comput. Geom. 30(1): 59-77 (2005) | |
| c17 | Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Alexander Wolff: Delineating Boundaries for Imprecise Regions. ESA 2005: 143-154 | |
| c16 | Martin Nöllenburg, Alexander Wolff: A Mixed-Integer Program for Drawing High-Quality Metro Maps. Graph Drawing 2005: 321-333 | |
| c15 | Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff: Configurations with Few Crossings in Topological Graphs. ISAAC 2005: 604-613 | |
| i4 | Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Alexander Wolff: Delineating boundaries for imprecise regions. EuroCG 2005: 127-130 | |
| i3 | ||
| i2 | Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff: Spanning trees with few crossings in geometric and topological graphs. EuroCG 2005: 195-198 | |
| i1 | Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing interference-minimal networks. EuroCG 2005: 203-206 | |
| 2004 | ||
| j9 | Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff: Facility location and the geometric minimum-diameter spanning tree. Comput. Geom. 27(1): 87-106 (2004) | |
| c14 | Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff: Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. Graph Drawing 2004: 49-59 | |
| c13 | Marc J. van Kreveld, Étienne Schramm, Alexander Wolff: Algorithms for the placement of diagrams on maps. GIS 2004: 222-231 | |
| c12 | Marc Benkert, Alexander Wolff, Florian Widmann: The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. JCDCG 2004: 16-28 | |
| c11 | Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff: Farthest-Point Queries with Geometric and Combinatorial Constraints. JCDCG 2004: 62-75 | |
| 2003 | ||
| j8 | Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff: Labeling Points with Weights. Algorithmica 38(2): 341-362 (2003) | |
| 2002 | ||
| j7 | Vikas Kapoor, Dietmar Kühl, Alexander Wolff: A Tutorial for Designing Flexible Geometric Algorithms. Algorithmica 33(1): 52-70 (2002) | |
| j6 | Steven van Dijk, Marc J. van Kreveld, Tycho Strijk, Alexander Wolff: Towards an evaluation of quality for names placement methods. International Journal of Geographical Information Science 16(7): 641-661 (2002) | |
| j5 | Alexander Wolff, Michael Thon, Yin-Feng Xu: A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling. Int. J. Comput. Geometry Appl. 12(4): 269-282 (2002) | |
| c10 | Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff: Facility Location and the Geometric Minimum-Diameter Spanning Tree. APPROX 2002: 146-160 | |
| 2001 | ||
| j4 | Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk: Three Rules Suffice for Good Label Placement. Algorithmica 30(2): 334-349 (2001) | |
| j3 | Tycho Strijk, Alexander Wolff: Labeling Points with Circles. Int. J. Comput. Geometry Appl. 11(2): 181-195 (2001) | |
| c9 | Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Alexander Wolff: Labeling Points with Weights. ISAAC 2001: 610-622 | |
| c8 | Maria Angeles Garrido, Claudia Iturriaga, Alberto Márquez, José Ramón Portillo, Pedro Reyes, Alexander Wolff: Labeling Subway Lines. ISAAC 2001: 649-659 | |
| 2000 | ||
| c7 | Zhongping Qin, Alexander Wolff, Yin-Feng Xu, Binhai Zhu: New Algorithms for Two-Label Point Labeling. ESA 2000: 368-379 | |
| c6 | Alexander Wolff, Michael Thon, Yin-Feng Xu: A Better Lower Bound for Two-Circle Point Labeling. ISAAC 2000: 422-431 | |
| 1999 | ||
| j2 | Marc J. van Kreveld, Tycho Strijk, Alexander Wolff: Point labeling with sliding labels. Comput. Geom. 13(1): 21-47 (1999) | |
| 1998 | ||
| c5 | Marc J. van Kreveld, Tycho Strijk, Alexander Wolff: Point Set Labeling with Sliding Labels. Symposium on Computational Geometry 1998: 337-346 | |
| c4 | Frank Wagner, Alexander Wolff: A Combinatorial Framework for Map Labeling. Graph Drawing 1998: 316-331 | |
| 1997 | ||
| j1 | ||
| c3 | Alexander Wolff: The Hardness of Approximating Set Cover. Lectures on Proof Verification and Approximation Algorithms 1997: 249-262 | |
| 1995 | ||
| c2 | Frank Wagner, Alexander Wolff: Map Labeling Heuristics: Provably Good and Practically Useful. Symposium on Computational Geometry 1995: 109-118 | |
| c1 | Frank Wagner, Alexander Wolff: An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. ESA 1995: 420-433 | |
Colors in the list of coauthors
Last update Tue May 21 00:14:16 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page