The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Alexander Wolff: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
    Facility Location and the Geometric Minimum-Diameter Spanning Tree. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:146-160 [Conf]
  2. Marc Benkert, Joachim Gudmundsson, Christian Knauer, Esther Moet, René van Oostrum, Alexander Wolff
    A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:166-175 [Conf]
  3. Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
    Point Set Labeling with Sliding Labels. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:337-346 [Conf]
  4. Frank Wagner, Alexander Wolff
    Map Labeling Heuristics: Provably Good and Practically Useful. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:109-118 [Conf]
  5. Alexander Wolff
    The Hardness of Approximating Set Cover. [Citation Graph (0, 0)][DBLP]
    Lectures on Proof Verification and Approximation Algorithms, 1997, pp:249-262 [Conf]
  6. Zhongping Qin, Alexander Wolff, Yin-Feng Xu, Binhai Zhu
    New Algorithms for Two-Label Point Labeling. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:368-379 [Conf]
  7. Iris Reinbacher, Marc Benkert, Marc J. van Kreveld, Joseph S. B. Mitchell, Alexander Wolff
    Delineating Boundaries for Imprecise Regions. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:143-154 [Conf]
  8. Frank Wagner, Alexander Wolff
    An Efficient and Effective Approximation Algorithm for the Map Labeling Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:420-433 [Conf]
  9. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff
    Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:49-59 [Conf]
  10. Martin Nöllenburg, Alexander Wolff
    A Mixed-Integer Program for Drawing High-Quality Metro Maps. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:321-333 [Conf]
  11. Frank Wagner, Alexander Wolff
    A Combinatorial Framework for Map Labeling. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:316-331 [Conf]
  12. Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff
    Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:270-281 [Conf]
  13. Marc J. van Kreveld, Étienne Schramm, Alexander Wolff
    Algorithms for the placement of diagrams on maps. [Citation Graph (0, 0)][DBLP]
    GIS, 2004, pp:222-231 [Conf]
  14. Jan-Henrik Haunert, Alexander Wolff
    Generalization of land cover maps by mixed integer programming. [Citation Graph (0, 0)][DBLP]
    GIS, 2006, pp:75-82 [Conf]
  15. Maria Angeles Garrido, Claudia Iturriaga, Alberto Márquez, José Ramón Portillo, Pedro Reyes, Alexander Wolff
    Labeling Subway Lines. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:649-659 [Conf]
  16. Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
    Configurations with Few Crossings in Topological Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:604-613 [Conf]
  17. Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Alexander Wolff
    Labeling Points with Weights. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:610-622 [Conf]
  18. Alexander Wolff, Michael Thon, Yin-Feng Xu
    A Better Lower Bound for Two-Circle Point Labeling. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:422-431 [Conf]
  19. Marc Benkert, Alexander Wolff, Florian Widmann
    The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:16-28 [Conf]
  20. Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
    Farthest-Point Queries with Geometric and Combinatorial Constraints. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:62-75 [Conf]
  21. Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff
    Constructing Interference-Minimal Networks. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:166-176 [Conf]
  22. Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff
    Matching Points with Rectangles and Squares. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:177-186 [Conf]
  23. Vikas Kapoor, Dietmar Kühl, Alexander Wolff
    A Tutorial for Designing Flexible Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:1, pp:52-70 [Journal]
  24. Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff
    Labeling Points with Weights. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:2, pp:341-362 [Journal]
  25. Frank Wagner, Alexander Wolff, Vikas Kapoor, Tycho Strijk
    Three Rules Suffice for Good Label Placement. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:2, pp:334-349 [Journal]
  26. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff
    Optimal spanners for axis-aligned rectangles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:1, pp:59-77 [Journal]
  27. Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
    Farthest-point queries with geometric and combinatorial constraints. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:33, n:3, pp:174-185 [Journal]
  28. Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
    Facility location and the geometric minimum-diameter spanning tree. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:87-106 [Journal]
  29. Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
    Point labeling with sliding labels. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:13, n:1, pp:21-47 [Journal]
  30. Frank Wagner, Alexander Wolff
    A Practical Map Labeling Algorithm. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:387-404 [Journal]
  31. Marc Benkert, Alexander Wolff, Florian Widmann, Takeshi Shirabe
    The minimum Manhattan network problem: Approximations and exact solutions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:35, n:3, pp:188-208 [Journal]
  32. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff
    Boundary labeling: Models and efficient algorithms for rectangular maps. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:3, pp:215-236 [Journal]
  33. Steven van Dijk, Marc J. van Kreveld, Tycho Strijk, Alexander Wolff
    Towards an evaluation of quality for names placement methods. [Citation Graph (0, 0)][DBLP]
    International Journal of Geographical Information Science, 2002, v:16, n:7, pp:641-661 [Journal]
  34. Tycho Strijk, Alexander Wolff
    Labeling Points with Circles. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:2, pp:181-195 [Journal]
  35. Alexander Wolff, Michael Thon, Yin-Feng Xu
    A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:4, pp:269-282 [Journal]
  36. Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang
    Straightening Drawings of Clustered Hierarchical Graphs. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:176-187 [Conf]
  37. Christian Knauer, Étienne Schramm, Andreas Spillner, Alexander Wolff
    Configurations with few crossings in topological graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:2, pp:104-114 [Journal]
  38. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  39. Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff
    Moving Vertices to Make Drawings Plane [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  40. Andreas Spillner, Alexander Wolff
    Untangling a Planar Graph [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  41. Drawing Binary Tanglegrams: An Experimental Evaluation. [Citation Graph (, )][DBLP]


  42. Constructing Optimal Highways. [Citation Graph (, )][DBLP]


  43. Optimizing active ranges for consistent dynamic map labeling. [Citation Graph (, )][DBLP]


  44. 06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. [Citation Graph (, )][DBLP]


  45. Spanning trees with few crossings in geometric and topological graphs. [Citation Graph (, )][DBLP]


  46. Delineating boundaries for imprecise regions. [Citation Graph (, )][DBLP]


  47. Constructing interference-minimal networks. [Citation Graph (, )][DBLP]


  48. Constructing the city Voronoi diagram faster. [Citation Graph (, )][DBLP]


  49. Cover Contact Graphs. [Citation Graph (, )][DBLP]


  50. Manhattan-Geodesic Embedding of Planar Graphs. [Citation Graph (, )][DBLP]


  51. Moving Vertices to Make Drawings Plane. [Citation Graph (, )][DBLP]


  52. Drawing (Complete) Binary Tanglegrams. [Citation Graph (, )][DBLP]


  53. Computing large matchings fast. [Citation Graph (, )][DBLP]


  54. Untangling a Planar Graph. [Citation Graph (, )][DBLP]


  55. Trimming of Graphs, with Application to Point Labeling. [Citation Graph (, )][DBLP]


  56. The Traveling Salesman Problem under Squared Euclidean Distances. [Citation Graph (, )][DBLP]


  57. Delineating Boundaries for Imprecise Regions. [Citation Graph (, )][DBLP]


  58. Constructing minimum-interference networks. [Citation Graph (, )][DBLP]


  59. Decomposing a simple polygon into pseudo-triangles and convex polygons. [Citation Graph (, )][DBLP]


  60. Matching points with rectangles and squares. [Citation Graph (, )][DBLP]


  61. Optimizing active ranges for consistent dynamic map labeling. [Citation Graph (, )][DBLP]


  62. Trimming of Graphs, with Application to Point Labeling [Citation Graph (, )][DBLP]


  63. Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability [Citation Graph (, )][DBLP]


  64. Drawing Binary Tanglegrams: An Experimental Evaluation [Citation Graph (, )][DBLP]


  65. The Traveling Salesman Problem Under Squared Euclidean Distances [Citation Graph (, )][DBLP]


  66. Untangling a Planar Graph. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.456secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002