Research Output 1968 2020

Filter
Report
2017

The sound of space-filling curves

Haverkort, H. J., 1 Aug 2017, Eindhoven: Eindhoven University of Technology. 11 p.

Research output: Book/ReportReportAcademic

Open Access
File
2016

Covering many points with a small-area box

de Berg, M. T., Cabello, S., Cheong, O., Eppstein, D. & Knauer, C., 8 Dec 2016, Cornell: Cornell University Library. 14 p.

Research output: Book/ReportReportAcademic

Covering
Rectangle
Cover
Linear Time
Integer

Shortcuts for the circle

Bae, S. W., de Berg, M. T., Cheong, O. & Gudmundsson, J., 8 Dec 2016, Cornell: Cornell University Library. 21 p.

Research output: Book/ReportReportAcademic

Circle
Plane Graph
Augmentation
Graph in graph theory
Unit circle
2015
12 Citations (Scopus)

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
Inductive logic programming (ILP)
Computational complexity
Testing
1 Citation (Scopus)

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
Curve
Computing
Similarity Measure
Polynomial time
Min-cut

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
Outerplanar Graph
Definability
Monadic Second-order Logic
Graph in graph theory
Counting
2 Citations (Scopus)

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
Data structures
Oils and fats

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

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
Halin Graph
Outerplanar Graph
Definability
Monadic Second-order Logic
Counting

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
Reptile
Triangular pyramid
Acute
Spherical triangle
Dissection
2 Citations (Scopus)

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

Visualization

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
Hitting Set
Parameterization
Path
Graph in graph theory
Vertex of a graph
3 Citations (Scopus)

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

Hamiltonians
Coloring
Polynomials
Graph theory
7 Citations (Scopus)

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

Forbidden Minor
Kernelization
Deletion
kernel
Polynomial
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

Sensor networks
Sensor nodes
Structural properties
Wireless sensor networks
Polynomials

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
Probability distribution
Visibility
Approximation
Probability density function
Density function
2013
7 Citations (Scopus)

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

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
Motion planning
Robots

eXamine : a Cytoscape app for exploring annotated modules in networks

Dinkla, K., El-Kebir, M., Bucur, C-I., Siderius, M., Smit, M. J., Westenberg, M. A. & Klau, G. W., 2013, s.n.15 p. (arXiv.org)

Research output: Book/ReportReportAcademic

Open Access
File
G-Protein-Coupled Receptors

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
Map Matching
Simplicity
Simple Closed Curve
Embedded Graph
Path
5 Citations (Scopus)

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
Path
Arc of a curve
NP-complete problem
Drawing
Polynomial
14 Citations (Scopus)

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
Trajectories
Birds
Merging
Animals
Experiments
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
Walk
Curve
Computing
Decision problem
Decision tree

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

Space-filling Curves
Hilbert
Curve
Coil
Arbitrary

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

Sorting
Processing
6 Citations (Scopus)

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

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

Water
Processing
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
Space-filling Curves
Hilbert space
Hilbert
Three-dimensional
Curve

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

Data storage equipment
XML
Equivalence classes
Taxonomies
World Wide Web
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

Space-filling Curves
Tiling
Fragmentation
Tile
Set of points
2 Citations (Scopus)

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

Travelling salesman problems
Euclidean Distance
Denote
Travelling salesman
Polynomial Time Approximation Scheme

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

Aspect ratio
Flavors
2009
15 Citations (Scopus)

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

Drawing (graphics)
1 Citation (Scopus)

Behavioural analysis of an I2C Linux driver

Bosnacki, D., Mathijssen, A. H. J. & Usenko, Y. S., 2009, Eindhoven: Technische Universiteit Eindhoven. 16 p. (Computer science reports; vol. 0909)

Research output: Book/ReportReportAcademic

Open Access
File
Model checking
Static analysis
Data storage equipment
Defects
Linux

Enacting declarative languages using LTL : avoiding errors and improving performance

Pesic, M., Bosnacki, D. & Aalst, van der, W. M. P., 2009, Eindhoven: Technische Universiteit Eindhoven. 16 p. (Computer science reports; vol. 0914)

Research output: Book/ReportReportAcademic

Open Access
File
Temporal logic
Model checking
Web services

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

Spanning tree
Planar graph
Graph in graph theory
Degree Sequence
Polytope
4 Citations (Scopus)

Orientation-constrained rectangular layouts

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

Research output: Book/ReportReportAcademic

Layout
Rectangle
Polynomial time
Dual Graph
Planar graph

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

A proof system for invariants in layered OO designs

Middelkoop, R., Huizing, C., Kuiper, R. & Luit, E. J., 2008, Eindhoven: Technische Universiteit Eindhoven. 43 p. (Computer science reports; vol. 0801)

Research output: Book/ReportReportAcademic

Open Access
File
Acoustic waves
Specifications

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

Visualizing state spaces with Petri nets

Verbeek, H. M. W., Pretorius, A. J., Aalst, van der, W. M. P. & Wijk, van, J. J., 2007, Eindhoven: Technische Universiteit Eindhoven. 20 p. (Computer science reports; vol. 0701)

Research output: Book/ReportReportAcademic

Open Access
File
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

Skeleton-based hierarchical shape segmentation

Reniers, D. & Telea, A. C., 2006, Eindhoven: Technische Universiteit Eindhoven. 10 p. (Computer science reports; vol. 0638)

Research output: Book/ReportReportAcademic

Open Access
File
2005

Specification, analysis and verification of an automated parking garage

Mathijssen, A. H. J. & Pretorius, A. J., 2005, Eindhoven: Technische Universiteit Eindhoven. 40 p. (Computer science reports; vol. 0525)

Research output: Book/ReportReportAcademic

Open Access
File