The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Günter Rote: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Günter Rote
    Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:119-135 [Conf]
  2. Günter Rote
    On the Connection Between Hexagonal and Unidirectional Rectangular Systolic Arrays. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:70-83 [Conf]
  3. Friedrich Eisenbrand, Günter Rote
    Fast Reduction of Ternary Quadratic Forms. [Citation Graph (0, 0)][DBLP]
    CaLC, 2001, pp:32-44 [Conf]
  4. Adrian Dumitrescu, Günter Rote
    On the Fréchet distance of a set of curves. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:162-165 [Conf]
  5. Alon Efrat, Günter Rote, Micha Sharir
    On the Union of Fat Wedges and Separating a Collection of Segments By a Line. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:115-120 [Conf]
  6. Dana Randall, Günter Rote, Francisco Santos, Jack Snoeyink
    Counting triangulations and pseudo-triangulations of wheels. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:149-152 [Conf]
  7. Günter Rote, Christian Schwarz, Jack Snoeyink
    Maintaining the Approximate Width of a Set of Points in the Plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:258-263 [Conf]
  8. Günter Rote, Cao An Wang, Lusheng Wang, Yin-Feng Xu
    On Constrained Minimum Pseudotriangulations. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:445-454 [Conf]
  9. Nina Amenta, Sunghee Choi, Günter Rote
    Incremental constructions con BRIO. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:211-219 [Conf]
  10. Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides
    The complexity of (un)folding. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:164-170 [Conf]
  11. Oswin Aichholzer, Franz Aurenhammer, Michael Taschwer, Günter Rote
    Triangulations Intersect Nicely. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:220-229 [Conf]
  12. Helmut Alt, Oswin Aichholzer, Günter Rote
    Matching Shapes with a Reference Point. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:85-92 [Conf]
  13. Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote
    Locked and unlocked chains of planar shapes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:61-70 [Conf]
  14. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
    On Simultaneous Inner and Outer Approximation of Shapes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:216-224 [Conf]
  15. Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley
    Planar minimally rigid graphs and pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:154-163 [Conf]
  16. Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger
    Minimum-Link Paths Among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:63-72 [Conf]
  17. Wolfgang Mulzer, Günter Rote
    Minimum weight triangulation is NP-hard. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:1-10 [Conf]
  18. Günter Rote
    Pseudotriangulations, polytopes, and how to expand linkages. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:133-134 [Conf]
  19. Günter Rote
    Degenerate Convex Hulls in High Dimensions without Extra Storage. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:26-32 [Conf]
  20. Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
    New upper bounds on the quality of the PCA bounding boxes in r2 and r3. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:275-283 [Conf]
  21. Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
    There are not too many magic configurations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:142-149 [Conf]
  22. Ares Ribó Mor, Günter Rote, André Schulz
    Embedding 3-polytopes on a small grid. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:112-118 [Conf]
  23. Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran Palaniappan, Günter Rote
    Finding a curve in a map. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:384-385 [Conf]
  24. Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
    Matching Convex Shapes with Respect to the Symmetric Difference. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:320-333 [Conf]
  25. Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
    Matching Point Sets with Respect to the Earth Mover's Distance. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:520-531 [Conf]
  26. Johann Hagauer, Günter Rote
    Three-Clustering of Points in the Plane. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:192-199 [Conf]
  27. Robert Connelly, Erik D. Demaine, Günter Rote
    Every Polygon Can Be Untangled. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:62-65 [Conf]
  28. Robert Connelly, Erik D. Demaine, Günter Rote
    Straighting Polygonal Arcs and Convexifying Polygonal Cycles. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:432-442 [Conf]
  29. Sergio Cabello, Erik D. Demaine, Günter Rote
    Planar Embeddings of Graphs with Specified Edge Lengths. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:283-294 [Conf]
  30. Herbert Edelsbrunner, Günter Rote, Emo Welzl
    Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:364-375 [Conf]
  31. Mordecai J. Golin, Günter Rote
    A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:256-267 [Conf]
  32. Günter Rote
    A New Metric Between Polygons and How to Compute it. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:404-415 [Conf]
  33. Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger
    The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:204-218 [Conf]
  34. Friedrich Eisenbrand, Günter Rote
    Fast 2-Variable Integer Programming. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:78-89 [Conf]
  35. Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger
    Toward Optimal Diffusion Matrices. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  36. Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
    Generalized Self-Approaching Curves. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:317-326 [Conf]
  37. Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
    Matching planar maps. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:589-598 [Conf]
  38. Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
    Covering shapes by ellipses. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:453-454 [Conf]
  39. Günter Rote
    Pursuit-evasion with imprecise target location. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:747-753 [Conf]
  40. Günter Rote
    Strictly convex drawings of planar graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:728-734 [Conf]
  41. Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl
    Approximation of Convex Figures by Pairs of Rectangles. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:240-249 [Conf]
  42. Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
    Acyclic Orientation of Drawings. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:268-279 [Conf]
  43. Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu
    The Zigzag Path of a Pseudo-Triangulation. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:377-388 [Conf]
  44. Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote
    On Geometric Dilation and Halving Chords. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:244-255 [Conf]
  45. Günter Rote, Gerhard J. Woeginger
    Minimizing the Number of Tardy Jobs. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1998, v:13, n:4, pp:423-430 [Journal]
  46. Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
    Matching Convex Shapes with Respect to the Symmetric Difference. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:1, pp:89-103 [Journal]
  47. Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk
    Covering with Ellipses. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:1, pp:145-160 [Journal]
  48. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
    Simultaneous Inner and Outer Approximation of Shapes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:365-389 [Journal]
  49. Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap
    Shortest Paths for Line Segments. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:2-4, pp:182-200 [Journal]
  50. Joseph S. B. Mitchell, Günter Rote, Gerhard J. Woeginger
    Minimum-Link Paths Among Obstacles in the Plan. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:431-459 [Journal]
  51. Günter Rote, André Schulz
    Threshold arrangements and the knapsack problem. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2006, v:19, n:1, pp:108-112 [Journal]
  52. Yi-Jen Chiang, Tobias Lenz, Xiang Lu, Günter Rote
    Simple and optimal output-sensitive construction of contour trees using monotone paths. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:2, pp:165-195 [Journal]
  53. Alon Efrat, Günter Rote, Micha Sharir
    On the Union of Fat Wedges and Separating a Collection of Segments By a Line. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:277-288 [Journal]
  54. Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley
    Planar minimally rigid graphs and pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:1-2, pp:31-61 [Journal]
  55. Johann Hagauer, Günter Rote
    Three-clustering of Points in the Plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:87-95 [Journal]
  56. Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote
    On the geometric dilation of closed curves, graphs, and point sets. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:1, pp:16-38 [Journal]
  57. Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl
    Approximation of convex figures by pairs of rectangles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:2, pp:77-87 [Journal]
  58. Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
    Generalized self-approaching curves. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:3-24 [Journal]
  59. Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu
    Triangulations Intersect Nicely. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:16, n:4, pp:339-359 [Journal]
  60. Imre Bárány, Günter Rote, William L. Steiger, C.-H. Zhang
    A Central Limit Theorem for Convex Chains in the Square. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:1, pp:35-50 [Journal]
  61. Peter Braß, Günter Rote, Konrad J. Swanepoel
    Triangles of Extremal Area or Perimeter in a Finite Planar Point Set. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:1, pp:51-58 [Journal]
  62. Robert Connelly, Erik D. Demaine, Günter Rote
    Blowing Up Polygonal Linkages. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:2, pp:205-239 [Journal]
  63. David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger
    Finding Minimum Area k-gons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:45-58 [Journal]
  64. David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Walter Whiteley
    Non-Crossing Frameworks with Non-Crossing Reciprocals. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:4, pp:567-600 [Journal]
  65. Richard Pollack, Micha Sharir, Günter Rote
    Computing the Geodesic Center of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:611-626 [Journal]
  66. Günter Rote
    Crossing the Bridge at Night. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:78, n:, pp:241-0 [Journal]
  67. Tamás Fleiner, Volker Kaibel, Günter Rote
    Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:1, pp:121-130 [Journal]
  68. Oswin Aichholzer, Helmut Alt, Günter Rote
    Matching Shapes with a Reference Point. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:4, pp:349-363 [Journal]
  69. Vladimir G. Deineko, René van Dal, Günter Rote
    The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:3, pp:141-148 [Journal]
  70. Joseph S. B. Mitchell, Günter Rote, Gopalakrishnan Sundaram, Gerhard J. Woeginger
    Counting Convex Polygons in Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:45-49 [Journal]
  71. Günter Rote
    Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:3, pp:123-127 [Journal]
  72. Günter Rote, Gerhard J. Woeginger
    Counting Convex k-Gons in Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:4, pp:191-194 [Journal]
  73. Günter Rote, Gerhard J. Woeginger, Binhai Zhu, Zhengyan Wang
    Counting k-Subsets and Convex k-gons in the Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:3, pp:149-151 [Journal]
  74. Helmut Alt, Alon Efrat, Günter Rote, Carola Wenk
    Matching planar maps. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:49, n:2, pp:262-283 [Journal]
  75. Vasilis Capoyleas, Günter Rote, Gerhard J. Woeginger
    Geometric Clusterings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:2, pp:341-356 [Journal]
  76. Oswin Aichholzer, Franz Aurenhammer, Günter Rote, Yin-Feng Xu
    Constant-Level Greedy Triangulations Approximate the MWT Well. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:4, pp:361-369 [Journal]
  77. Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle
    A Visibility Representation for Graphs in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal]
  78. Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger
    The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:125-158 [Journal]
  79. Rainer E. Burkard, Helidon Dollani, Yixun Lin, Günter Rote
    The Obnoxious Center Problem on a Tree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:4, pp:498-509 [Journal]
  80. Herbert Edelsbrunner, Günter Rote, Emo Welzl
    Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:66, n:2, pp:157-180 [Journal]
  81. Günter Rote
    Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:303-308 [Journal]
  82. Mordecai J. Golin, Günter Rote
    A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:5, pp:1770-1781 [Journal]
  83. Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber
    Pointed Drawings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:237-240 [Conf]
  84. Günter Rote, Martin Zachariasen
    Matrix scaling by network flow. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:848-854 [Conf]
  85. Sergio Cabello, Günter Rote
    Obnoxious centers in graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:98-107 [Conf]
  86. Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
    Wooden Geometric Puzzles: Design and Hardness Proofs. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:16-29 [Conf]
  87. Günter Rote
    Computing the Fréchet distance between piecewise smooth curves. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:3, pp:162-174 [Journal]
  88. Wolfgang Mulzer, Günter Rote
    Minimum-weight triangulation is NP-hard [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  89. Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote
    Locked and Unlocked Chains of Planar Shapes [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  90. Partitioning a Polygon into Two Mirror Congruent Pieces. [Citation Graph (, )][DBLP]


  91. Integer Point Sets Minimizing Average Pairwise l1 Distance: What is the Optimal Shape of a Town? [Citation Graph (, )][DBLP]


  92. Constant-Working-Space Algorithms for Geometric Problems. [Citation Graph (, )][DBLP]


  93. Matching point sets with respect to the Earth mover's distance. [Citation Graph (, )][DBLP]


  94. Improved lower bound on the geometric dilation of point sets. [Citation Graph (, )][DBLP]


  95. A pointed Delaunay pseudo-triangulation of a simple polygon. [Citation Graph (, )][DBLP]


  96. The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. [Citation Graph (, )][DBLP]


  97. Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. [Citation Graph (, )][DBLP]


  98. Resolving Loads with Positive Interior Stresses. [Citation Graph (, )][DBLP]


  99. Plane Graphs with Parity Constraints. [Citation Graph (, )][DBLP]


  100. Detecting Hotspots in Geographic Networks. [Citation Graph (, )][DBLP]


  101. Recovering Structure from r-Sampled Objects. [Citation Graph (, )][DBLP]


  102. Matching point sets with respect to the Earth Mover's Distance. [Citation Graph (, )][DBLP]


  103. Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs. [Citation Graph (, )][DBLP]


  104. Bounds on the quality of the PCA bounding boxes. [Citation Graph (, )][DBLP]


  105. Strictly convex drawings of planar graphs [Citation Graph (, )][DBLP]


  106. The parameterized complexity of some geometric problems in unbounded dimension [Citation Graph (, )][DBLP]


  107. Fixed-parameter tractability and lower bounds for stabbing problems [Citation Graph (, )][DBLP]


  108. Small grid embeddings of 3-polytopes [Citation Graph (, )][DBLP]


  109. There Are Not Too Many Magic Configurations. [Citation Graph (, )][DBLP]


  110. Locked and Unlocked Chains of Planar Shapes. [Citation Graph (, )][DBLP]


Search in 0.418secs, Finished in 0.424secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002