The SCEAS System
Navigation Menu

Search the dblp DataBase


Kevin Buchin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kevin Buchin, Joachim Giesen
    Flow Complex: General Structure and Algorithm. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:270-273 [Conf]
  2. Kevin Buchin, Maike Buchin, Carola Wenk
    Computing the Fréchet distance between simple polygons in polynomial time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:80-87 [Conf]
  3. 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]
  4. Kevin Buchin, André Schulz
    Inflating the cube by shrinking. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:125-126 [Conf]
  5. Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
    Acyclic Orientation of Drawings. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:268-279 [Conf]
  6. Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor P. Fekete, Christian Knauer, André Schulz, Perouz Taslakian
    On Rolling Cube Puzzles. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:141-144 [Conf]
  7. Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel
    On the Number of Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:97-107 [Conf]
  8. Kevin Buchin, Maike Buchin
    Topology Control. [Citation Graph (0, 0)][DBLP]
    Algorithms for Sensor and Ad Hoc Networks, 2007, pp:81-98 [Conf]
  9. Kevin Buchin, Maike Buchin
    Lower Bounds for the Complexity of the Voronoi Diagram of Polygonal Curves under the Discrete Frechet Distance [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  10. Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. [Citation Graph (, )][DBLP]

  11. Polychromatic colorings of plane graphs. [Citation Graph (, )][DBLP]

  12. Constructing Delaunay Triangulations along Space-Filling Curves. [Citation Graph (, )][DBLP]

  13. On the Number of Spanning Trees a Planar Graph Can Have. [Citation Graph (, )][DBLP]

  14. Median Trajectories. [Citation Graph (, )][DBLP]

  15. Fréchet Distance of Surfaces: Some Simple Hard Cases. [Citation Graph (, )][DBLP]

  16. Incremental construction along space-filling curves. [Citation Graph (, )][DBLP]

  17. Delaunay Triangulations in O(sort(n)) Time and More. [Citation Graph (, )][DBLP]

  18. On Planar Supports for Hypergraphs. [Citation Graph (, )][DBLP]

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

  20. Detecting single file movement. [Citation Graph (, )][DBLP]

  21. Finding long and similar parts of trajectories. [Citation Graph (, )][DBLP]

  22. Feed-links for network extensions. [Citation Graph (, )][DBLP]

  23. Detecting Commuting Patterns by Clustering Subtrajectories. [Citation Graph (, )][DBLP]

  24. Exact algorithms for partial curve matching via the Fréchet distance. [Citation Graph (, )][DBLP]

  25. Connect the Dot: Computing Feed-Links with Minimum Dilation. [Citation Graph (, )][DBLP]

  26. Delaunay Triangulation of Imprecise Points Simplified and Extended. [Citation Graph (, )][DBLP]

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

  28. Clusters in Aggregated Health Data. [Citation Graph (, )][DBLP]

  29. Recursive geometry of the flow complex and topology of the flow complex filtration. [Citation Graph (, )][DBLP]

  30. Computing the Fréchet distance between simple polygons. [Citation Graph (, )][DBLP]

  31. Transforming spanning trees: A lower bound. [Citation Graph (, )][DBLP]

  32. Minimizing the Maximum Interference is Hard [Citation Graph (, )][DBLP]

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

  34. Delaunay Triangulations in Linear Time? (Part I) [Citation Graph (, )][DBLP]

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

  36. Polychromatic Colorings of Plane Graphs. [Citation Graph (, )][DBLP]

Search in 0.005secs, Finished in 0.006secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002