2009 | ||
---|---|---|
22 | EE | Kevin Buchin, Maike Buchin, Yusu Wang: Exact algorithms for partial curve matching via the Fréchet distance. SODA 2009: 645-654 |
2008 | ||
21 | EE | Sergey Bereg, Kevin Buchin, Maike Buchin, Marina L. Gavrilova, Binhai Zhu: Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. COCOON 2008: 352-362 |
20 | EE | Kevin Buchin, Maike Buchin, Joachim Gudmundsson: Detecting single file movement. GIS 2008: 33 |
19 | EE | Boris Aronov, Kevin Buchin, Maike Buchin, B. Jansen, T. de Jong, Marc J. van Kreveld, Maarten Löffler, Jin Luo, Rodrigo I. Silveira, Bettina Speckmann: Feed-links for network extensions. GIS 2008: 35 |
18 | EE | 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 |
17 | EE | Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo: Detecting Commuting Patterns by Clustering Subtrajectories. ISAAC 2008: 644-655 |
16 | EE | Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein: Polychromatic colorings of plane graphs. Symposium on Computational Geometry 2008: 338-345 |
15 | EE | Kevin Buchin: Minimizing the Maximum Interference is Hard CoRR abs/0802.2134: (2008) |
14 | EE | 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) |
13 | EE | Kevin Buchin: Delaunay Triangulations in Linear Time? (Part I) CoRR abs/0812.0387: (2008) |
12 | EE | Kevin Buchin, Tamal K. Dey, Joachim Giesen, Matthias John: Recursive geometry of the flow complex and topology of the flow complex filtration. Comput. Geom. 40(2): 115-137 (2008) |
11 | EE | Kevin Buchin, Maike Buchin, Carola Wenk: Computing the Fréchet distance between simple polygons. Comput. Geom. 41(1-2): 2-20 (2008) |
10 | EE | Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote: There Are Not Too Many Magic Configurations. Discrete & Computational Geometry 39(1-3): 3-16 (2008) |
2007 | ||
9 | EE | Kevin Buchin, Maike Buchin: Topology Control. Algorithms for Sensor and Ad Hoc Networks 2007: 81-98 |
8 | 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. CCCG 2007: 141-144 | |
7 | EE | Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel: On the Number of Cycles in Planar Graphs. COCOON 2007: 97-107 |
6 | EE | Kevin Buchin, André Schulz: Inflating the cube by shrinking. Symposium on Computational Geometry 2007: 125-126 |
5 | EE | Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote: There are not too many magic configurations. Symposium on Computational Geometry 2007: 142-149 |
4 | EE | Kevin Buchin, Maike Buchin: Lower Bounds for the Complexity of the Voronoi Diagram of Polygonal Curves under the Discrete Frechet Distance CoRR abs/0708.1909: (2007) |
2006 | ||
3 | EE | Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote: Acyclic Orientation of Drawings. SWAT 2006: 268-279 |
2 | EE | Kevin Buchin, Maike Buchin, Carola Wenk: Computing the Fréchet distance between simple polygons in polynomial time. Symposium on Computational Geometry 2006: 80-87 |
2005 | ||
1 | EE | Kevin Buchin, Joachim Giesen: Flow Complex: General Structure and Algorithm. CCCG 2005: 270-273 |