• 1290 Citations
20052020

Research output per year

If you made any changes in Pure these will be visible here soon.

Research Output

Filter
Report
2015

Computing the similarity between moving curves

Buchin, K., Ophelders, T. A. E. & Speckmann, B., 2015, s.n. (arXiv; vol. 1507.03819 [cs.CG])

Research output: Book/ReportReportAcademic

Open Access
File
144 Downloads (Pure)
2014

Interference minimization in asymmetric sensor networks

Brise, Y., Buchin, K., Eversmann, D., Hoffmann, M. & Mulzer, W., 2014, s.n. 15 p. (arXiv; vol. 1406.7753 [cs.CG])

Research output: Book/ReportReportAcademic

1 Downloads (Pure)

Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)

Buchin, K., Kostitsyna, I., Löffler, M. & Silveira, R. I., 2014, s.n. 13 p. (arXiv.org; vol. 1402.5681 [cs.CG])

Research output: Book/ReportReportAcademic

Open Access
File
68 Downloads (Pure)
2013

Computing the Fréchet distance with a retractable leash

Buchin, K., Buchin, M., Leusden, van, R., Meulemans, W. & Mulzer, W., 2013, 13 p. (arXiv.org; vol. 1306.5527 [cs.CG])

Research output: Book/ReportReportAcademic

Open Access
File
62 Downloads (Pure)

Trajectory grouping structure

Buchin, K., Buchin, M., Kreveld, van, M. J., Speckmann, B. & Staals, F., 2013, s.n. 16 p. (arXiv.org; vol. 1303.6127[cs.CG])

Research output: Book/ReportReportAcademic

Open Access
File
16 Citations (Scopus)
116 Downloads (Pure)
2012

Four Soviets walk the dog, with an application to Alt's conjecture

Buchin, K., Buchin, M., Meulemans, W. & Mulzer, W., 2012, 13 p. (arXiv.org; vol. 1209.4403 [cs.CG])

Research output: Book/ReportReportAcademic

Open Access
File
46 Downloads (Pure)

Locally correct Fréchet matchings

Buchin, K., Buchin, M., Meulemans, W. & Speckmann, B., 2012, 15 p. (arXiv.org; vol. 1206.6257 [cs.CG])

Research output: Book/ReportReportAcademic

Open Access
File
54 Downloads (Pure)
2009

On planar supports for hypergraphs

Buchin, K., Kreveld, van, M. J., Meijer, H., Speckmann, B. & Verbeek, K. A. B., 2009, Utrecht: Utrecht University. 10 p. (Universiteit Utrecht. UU-CS, Department of Computer Science; vol. 0935)

Research output: Book/ReportReportAcademic

On the number of spanning trees a planar graph can have

Buchin, K. & Schulz, A., 2009, s.n. 18 p. (arXiv.org [math.CO]; vol. 0912.0712)

Research output: Book/ReportReportAcademic

Vectors in a box

Buchin, K., Matousek, J., Moser, R. A. & Pálvölgyi, D., 2009, s.n. 12 p. (arXiv.org [math.CO]; vol. 0912.0424)

Research output: Book/ReportReportAcademic

2008

Delaunay triangulations in linear time? (Part I)

Buchin, K., 2008, s.n. 5 p. (arXiv.org [cs.CG]; vol. 0812.0387)

Research output: Book/ReportReportAcademic

Drawing (complete) binary tanglegrams: hardness, approximation, fixed-parameter tractability

Buchin, K., Buchin, M., Byrka, J., Nöllenburg, M., Okamoto, Y., Silveira, R. I. & Wolff, A., 2008, s.n. 17 p. (arXiv.org [cs.CG]; vol. 0806.0920)

Research output: Book/ReportReportAcademic

Minimizing the maximum interference is hard

Buchin, K., 2008, s.n. 4 p. (arXiv.org [cs.CG]; vol. 0802.2134)

Research output: Book/ReportReportAcademic

2007

Lower bounds for the complexity of the Voronoi diagram of polygonal curves under the discrete Fréchet distance

Buchin, K. & Buchin, M., 2007, s.n. 6 p. (arXiv.org [cs.CG]; vol. 0708.1909)

Research output: Book/ReportReportAcademic