The SCEAS System
| |||||||

## Search the dblp DataBase
Kevin Buchin:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Kevin Buchin, Joachim Giesen
**Flow Complex: General Structure and Algorithm.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:270-273 [Conf] - 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] - 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] - Kevin Buchin, André Schulz
**Inflating the cube by shrinking.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2007, pp:125-126 [Conf] - Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
**Acyclic Orientation of Drawings.**[Citation Graph (0, 0)][DBLP] SWAT, 2006, pp:268-279 [Conf] - 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] - 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] - Kevin Buchin, Maike Buchin
**Topology Control.**[Citation Graph (0, 0)][DBLP] Algorithms for Sensor and Ad Hoc Networks, 2007, pp:81-98 [Conf] - 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] **Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance.**[Citation Graph (, )][DBLP]**Polychromatic colorings of plane graphs.**[Citation Graph (, )][DBLP]**Constructing Delaunay Triangulations along Space-Filling Curves.**[Citation Graph (, )][DBLP]**On the Number of Spanning Trees a Planar Graph Can Have.**[Citation Graph (, )][DBLP]**Median Trajectories.**[Citation Graph (, )][DBLP]**Fréchet Distance of Surfaces: Some Simple Hard Cases.**[Citation Graph (, )][DBLP]**Incremental construction along space-filling curves.**[Citation Graph (, )][DBLP]**Delaunay Triangulations in O(sort(n)) Time and More.**[Citation Graph (, )][DBLP]**On Planar Supports for Hypergraphs.**[Citation Graph (, )][DBLP]**Drawing (Complete) Binary Tanglegrams.**[Citation Graph (, )][DBLP]**Detecting single file movement.**[Citation Graph (, )][DBLP]**Finding long and similar parts of trajectories.**[Citation Graph (, )][DBLP]**Feed-links for network extensions.**[Citation Graph (, )][DBLP]**Detecting Commuting Patterns by Clustering Subtrajectories.**[Citation Graph (, )][DBLP]**Exact algorithms for partial curve matching via the Fréchet distance.**[Citation Graph (, )][DBLP]**Connect the Dot: Computing Feed-Links with Minimum Dilation.**[Citation Graph (, )][DBLP]**Delaunay Triangulation of Imprecise Points Simplified and Extended.**[Citation Graph (, )][DBLP]**Detecting Hotspots in Geographic Networks.**[Citation Graph (, )][DBLP]**Clusters in Aggregated Health Data.**[Citation Graph (, )][DBLP]**Recursive geometry of the flow complex and topology of the flow complex filtration.**[Citation Graph (, )][DBLP]**Computing the Fréchet distance between simple polygons.**[Citation Graph (, )][DBLP]**Transforming spanning trees: A lower bound.**[Citation Graph (, )][DBLP]**Minimizing the Maximum Interference is Hard**[Citation Graph (, )][DBLP]**Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability**[Citation Graph (, )][DBLP]**Delaunay Triangulations in Linear Time? (Part I)**[Citation Graph (, )][DBLP]**There Are Not Too Many Magic Configurations.**[Citation Graph (, )][DBLP]**Polychromatic Colorings of Plane Graphs.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |