Research Output

Filter
Report
2015

A structural approach to kernels for ILPs : treewidth and total unimodularity

Jansen, B. M. P. & Kratsch, S., 2015, s.n. 24 p. (arXiv; vol. 1506.07729 [cs.CC])

Research output: Book/ReportReportAcademic

Open Access
File
14 Citations (Scopus)
65 Downloads (Pure)

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
136 Downloads (Pure)

Definability equals recognizability for $k$-outerplanar graphs

Jaffke, L. & Bodlaender, H. L., 2015, s.n. 40 p. (arXiv; vol. 1509.08315 [cs.LO])

Research output: Book/ReportReportAcademic

Open Access
File
13 Downloads (Pure)

Finding pairwise intersections inside a query range

Berg, de, M. T., Gudmundsson, J. & Mehrabi, A. D., 2015, s.n. 15 p. (arXiv; vol. 1502.06079 [cs.DS])

Research output: Book/ReportReportAcademic

Open Access
File
62 Downloads (Pure)

Hyperorthogonal well-folded Hilbert curves

Bos, A. & Haverkort, H. J., 2015, s.n. 35 p. (arXiv; vol. 1508.02517 [cs.CG])

Research output: Book/ReportReportAcademic

Open Access
File
67 Downloads (Pure)

MSOL-definability equals recognizability for Halin graphs and bounded degree $k$-outerplanar graphs

Jaffke, L. & Bodlaender, H. L., 2015, s.n. 39 p. (arXiv; vol. 1503.01604 [cs.LO])

Research output: Book/ReportReportAcademic

Open Access
File
20 Downloads (Pure)

No acute tetrahedron is an 8-reptile

Haverkort, H. J., 2015, s.n. 6 p. (arXiv; vol. 1508.03773 [cs.CG])

Research output: Book/ReportReportAcademic

Open Access
File
68 Downloads (Pure)

On minimizing crossings in storyline visualizations

Kostitsyna, I., Nöllenburg, M., Polishchuk, V., Schulz, A. & Strash, D., 2015, s.n. (arXiv; vol. 1509.00442)

Research output: Book/ReportReportAcademic

On structural parameterizations of hitting set : hitting paths in graphs using 2-SAT

Jansen, B. M. P., 2015, s.n. 25 p. (arXiv; vol. 1507.05890 [cs.DS])

Research output: Book/ReportReportAcademic

Open Access
File
71 Downloads (Pure)

Sparsification upper and lower bounds for graph problems and Not-All-Equal SAT

Jansen, B. M. P. & Pieterse, A., 2015, s.n. 21 p. (arXiv; vol. 1509.07437 [cs.CC])

Research output: Book/ReportReportAcademic

3 Citations (Scopus)
1 Downloads (Pure)

Uniform kernelization complexity of hitting forbidden minors

Giannopoulou, A. C., Jansen, B. M. P., Lokshtanov, D. & Saurabh, S., 2015, s.n. 35 p. (arXiv; vol. 1502.03965 [cs.DS])

Research output: Book/ReportReportAcademic

7 Citations (Scopus)
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
61 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
56 Downloads (Pure)

Efficient multi-robot motion planning for unlabeled discs in simple polygons

Adler, A., Berg, de, M. T., Halperin, D. & Solovey, K., 2013, s.n. 12 p. (arXiv.org; vol. 1312.1038 [cs.CG])

Research output: Book/ReportReportAcademic

Open Access
File
106 Downloads (Pure)

Map matching with simplicity constraints

Meulemans, W., 2013, s.n. 12 p. (arXiv.org; vol. 1306.2827 [cs.CG])

Research output: Book/ReportReportAcademic

Open Access
File
31 Downloads (Pure)

Strict confluent drawing

Eppstein, D., Holten, D. H. R., Löffler, M., Nöllenburg, M., Speckmann, B. & Verbeek, K. A. B., 2013, s.n. 20 p. (arXiv.org; vol. 1308.6824 [cs.CG])

Research output: Book/ReportReportAcademic

Open Access
File
86 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
15 Citations (Scopus)
109 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
44 Downloads (Pure)

Harmonious Hilbert curves and other extradimensional space-filling curves

Haverkort, H. J., 2012, s.n. 40 p. (arXiv.org; vol. 1211.0175 [cs.CG])

Research output: Book/ReportReportAcademic

I/O-optimal algorithms on grid graph

Haverkort, H. J., 2012, s.n. 24 p. (arXiv.org; vol. 1211.2066 [cs.DS])

Research output: Book/ReportReportAcademic

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
51 Downloads (Pure)

Simple I/O-efficient flow accumulation on grid terrains

Haverkort, H. J. & Janssen, J., 2012, s.n. 13 p. (arXiv.org; vol. 1211.1857 [cs.DS])

Research output: Book/ReportReportAcademic

2011

An inventory of three-dimensional Hilbert space-filling curves

Haverkort, H. J., 2011, s.n. (arXiv.org [cs.CG]; vol. 1109.2323)

Research output: Book/ReportReportAcademic

Open Access
File
153 Downloads (Pure)

I/O efficient bisimulation partitioning on very large directed acyclic graphs

Hellings, J., Fletcher, G. H. L. & Haverkort, H. J., 2011, (arXiv.org (cs.DS); vol. 1112.0857)

Research output: Book/ReportReportAcademic

2010

Recursive tilings and space-filling curves with little fragmentation

Haverkort, H. J., 2010, s.n. 28 p. (arXiv.org [cs.CG]; vol. 1002.1843)

Research output: Book/ReportReportAcademic

1 Downloads (Pure)

The Traveling Salesman Problem under squared Euclidean distances

Berg, de, M. T., Nijnatten, van, F. S. B., Sitters, R. A., Woeginger, G. J. & Wolff, A., 2010, s.n. 12 p. (arXiv.org [cs.CG]; vol. 1001.0236)

Research output: Book/ReportReportAcademic

2 Citations (Scopus)

Treemaps with bounded aspect ratio

Berg, de, M. T., Speckmann, B. & Weele, van der, V., 2010, s.n. 15 p. (arXiv.org [cs.CG]; vol. 1012.1749)

Research output: Book/ReportReportAcademic

1 Downloads (Pure)
2009

Area-universal rectangular layouts

Eppstein, D., Mumford, E., Speckmann, B. & Verbeek, K. A. B., 2009, s.n. 19 p. (arXiv.org [cs.CG]; vol. 0901.3924)

Research output: Book/ReportReportAcademic

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

Orientation-constrained rectangular layouts

Eppstein, D. & Mumford, E., 2009, s.n. 12 p. (arXiv.org [cs.CG]; vol. 0904.4312)

Research output: Book/ReportReportAcademic

4 Citations (Scopus)

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

Cache-oblivious selection in sorted X+Y matrices

Berg, de, M. & Thite, S., 2008, s.n. 9 p. (arXiv.org [cs.DS]; vol. 0804.0936)

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

Drawing binary tanglegrams:an experimental evaluation

Nöllenburg, M., Holten, D. H. R., Völker, M. & Wolff, A., 2008, s.n. 13 p. (arXiv.org [cs.DS]; vol. 0806.0928)

Research output: Book/ReportReportAcademic

2007

Lattice based extended formulations for integer linear equality systems

Aardal, K. I. & Wolsey, L. A., 2007, Amsterdam: Centrum voor Wiskunde en Informatica. 19 p. (CWI Report; vol. PNA-R0702)

Research output: Book/ReportReportAcademic

2006

On covering a graph optimally with induced subgraphs

Thite, S., 2006, s.n. 9 p. (arXiv.org [cs.DM]; vol. 0604013)

Research output: Book/ReportReportAcademic

On the number of pseudo-triangulations of certain point sets

Aichholzer, O., Orden, D., Santos, F. & Speckmann, B., 2006, s.n. 23 p. (arXiv:math.CO; vol. 0601747)

Research output: Book/ReportReportAcademic

Pants decomposition of the punctured plane

Poon, S. H. & Thite, S., 2006, s.n. 5 p. (arXiv.org [cs.CG]; vol. 0602080)

Research output: Book/ReportReportAcademic

2004

Approximate distance oracles for geometric spanners

Gudmundsson, J., Levcopoulos, C., Narasimhan, G. & Smid, M. H. M., 2004, Ottawa ON, Canada: Carleton University. 28 p. (Technical Report; vol. TR-04-08)

Research output: Book/ReportReportAcademic

Approximate range searching using binary space partitions

Berg, de, M. & Streppel, M. W. A., 2004, Eindhoven: Technische Universiteit Eindhoven. 17 p. (Computer science reports; vol. 0433)

Research output: Book/ReportReportAcademic

Open Access
File
5 Citations (Scopus)
62 Downloads (Pure)
1995

Polyhedral techniques in combinatorial optimization

Aardal, K. I. & van Hoesel, C. P. M., 1995, Eindhoven: Technische Universiteit Eindhoven. 44 p. (Memorandum COSOR; vol. 9515)

Research output: Book/ReportReportAcademic

Open Access
File
128 Downloads (Pure)