Information and Computing Sciences
Technical reports: Guests and Others
reports (53)
techrep_id file title / author UU-CS-2012-001 Exact algorithms for Kayles
Hans L.Bodlaender, Dieter Kratsch and Sjoerd T.TimmerUU-CS-2011-003 Exact Algorithms for Kayles
Hans L. Bodlaender and Dieter KratschUU-CS-2010-022 Treewidth Computations II. Lower Bounds
Hans L. Bodlaender and Arie M. C. A. KosterUU-CS-2009-035 On Planar Supports for Hypergraphs
Kevin Buchin, Marc van Kreveld, Henk Meijer, Bettina Speckmann, Kevin VerbeekUU-CS-2009-023 A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. ThilikosUU-CS-2008-032 Treewidth Computations I Upper Bounds
Hans L.Bodlaender and Arie M.C.A.KosterUU-CS-2008-008 Algorithmic Aspects of Proportional Symbol Maps
Sergio Cabello, Herman Haverkort, Marc van Kreveld, Bettina SpeckmannUU-CS-2007-054 Matched Drawings of Planar Graphs
Emilio Di Giacomo, Walter Didimo, Marc van Kreveld, Giuseppe Liotta, Bettina SpeckmannUU-CS-2007-045 On the Number of Empty Pseudo-Triangles in Point Sets
Marc van Kreveld and Bettina SpeckmannUU-CS-2007-042 Edges and Switches, Tunnels and Bridges
D. Eppstein, M. van Kreveld, E. Mumford, and B. SpeckmannUU-CS-2006-032 ps.gz On exact algorithms for treewidth
Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. ThilikosUU-CS-2006-015 ps.gz An exact algorithm for graph coloring with polynomial memory
Hans L. Bodlaender and Dieter KratschUU-CS-2005-051 ps.gz Treewidth Lower Bounds with Brambles
Hans L. Bodlaender, Alexander Grigoriev, and Arie M. C. A. KosterUU-CS-2005-049 ps.gz Visibility Maps of Segments and Triangles in 3D
Esther Moet, Christian Knauer, and Marc van KreveldUU-CS-2005-044 ps.gz Efficient Detection of Motion Patterns in Spatio-Temporal Data Sets
Joachim Gudmundsson, Marc van Kreveld, Bettina SpeckmannUU-CS-2005-037 Realizing partitions respecting full and partial order information
Erik Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark Overmars, Sue WhitesidesUU-CS-2004-053 ps.gz On the Maximum Cardinality Search Lower Bound for Treewidth
Hans L. Bodlaender and Arie M. C. A. KosterUU-CS-2004-050 ps.gz Degree-Based Treewidth Lower Bounds
Arie M. C. A. Koster, Thomas Wolle, and Hans L. BodlaenderUU-CS-2004-043 ps.gz Area-Preserving Approximations of Polygonal Paths
Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc van Kreveld, and Bettina SpeckmannUU-CS-2004-042 ps.gz A Note on Contraction Degeneracy
Thomas Wolle, Arie M. C. A. Koster, Hans L. BodlaenderUU-CS-2004-040 ps.gz On Rectangular Cartograms
Marc van Kreveld, Bettina SpeckmannUU-CS-2004-034 ps.gz Contraction and Treewidth Lower Bounds
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas WolleUU-CS-2003-044 ps.gz Guarding Art Galleries by Guarding Witnesses
Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, and Chan-Su ShinUU-CS-2003-038 ps.gz On Algorithms for (P5,Gem)-Free Graphs
Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy SpinradUU-CS-2003-027 ps.gz Safe Separators for Treewidth
Hans L. Bodlaender and Arie M. C. A. KosterUU-CS-2003-001 ps.gz Pre-processing rules for triangulation of probabilistic networks
Hans L. Bodlaender, Arie M. C. A. Koster, and Frank van den EijkhofUU-CS-2002-051 ps.gz Safe reduction rules for weighted treewidth
Frank van den Eijkhof, Hans L. Bodlaender, and Arie M.C.A. KosterUU-CS-2002-048 ps.gz External Uniqueness is Unique Enough
Dave Clarke, Tobias WrigstadUU-CS-2002-033 ps.gz Computing Signed Permutations of Polygons
Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark Overmars, Godfried T. ToussaintUU-CS-2002-013 ps.gz Computing farthest neighbors on a convex polytope
Otfried Cheong, Chan-Su Shin, Antoine VigneronUU-CS-2001-49 ps.gz Treewidth: Computational Experiments
Arie M.C.A. Koster, Hans L. Bodlaender, Stan P. M. van HoeselUU-CS-2001-21 On R-trees with low query complexity
M. T. de Berg, J. G. Gudmundsson, M. Hammar, M. H. OvermarsUU-CS-2001-10 Box-Trees and R-Trees with Near-Optimal Query Time
P. K. Agarwal, M. T. de Berg, J. G. Gudmundsson, M. Hammar, H. J. HaverkortUU-CS-2001-05 Higher Order Delaunay Triangulations
J. G. Gudmundsson, M. Hammar, M. van KreveldUU-CS-2000-42 ps.gz Kayles and nimbers
H. L. Bodlaender, D. KratschUU-CS-2000-31 ps.gz Flipturning polygons
O. Aichholzer, C. Cortes, E. D. Demaine, V. Dujmovic, J. Erickson, H. Meijer, M. H. Overmars, B. Palop, S. Ramaswami, G. T. ToussaintUU-CS-2000-12 ps.gz A probabilistic and decision-theoretic approach to the management of infectious disease at the ICU
P. J. F. Lucas, N. de Bruijn, K. Schurink, A. HoepelmanUU-CS-1999-41 ps.gz Non-standard approaches to integer programming
K. I. Aardal, R. Weismantel, L. A. WolseyUU-CS-1999-25 ps.gz Belief updates in multiple agent systems
J-W. RoordaUU-CS-1999-06 ps.gz Improving antibiotic therapy of ventilator associated pneumonia using a probabilistic approach
N. de Bruijn, P. J. F. Lucas, K. Schurink, A. HoepelmanUU-CS-1997-05 ps.gz Isomorphism for graphs of bounded distance width
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. ThilikosUU-CS-1996-29 ps.gz It is hard to know when greedy is good for finding independent sets
Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi YamazakiUU-CS-1996-25 ps.gz Computing the angularity tolerance
M. T. de Berg, H. Meijer, M. H. Overmars, G. WilfongUU-CS-1995-34 ps.gz Treewidth and minimum fill-in on d-trapezoid graphs
H. L. Bodlaender, T. Kloks, D. Kratsch, H. MuellerUU-CS-1995-03 ps.gz Rankings of graphs
H. L. Bodlaender, J. S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Mueller, Zs. TuzaRUU-CS-93-32 Honesty in Partial Logic
W. van der Hoek, J. Jaspars and E. ThijsseRUU-CS-92-30 Treewidth and pathwidth of permutation graphs
H.L. Bodlaender and A.J.J. Kloks and D. KratschRUU-CS-92-28 Treewidth of chordal bipartite graphs
A.J.J. Kloks and D. KratschRUU-CS-91-03 The complexity of coloring games on perfect graphs
H.L. Bodlaender and D. KratschRUU-CS-86-05 Reconstructing visible regions from visible segments
Wm. R. Franklin and V. AkmanRUU-CS-86-04 Adaptive grid for polyhedral visibility in object space; an implementation
Wm. R. Franklin and V. AkmanRUU-CS-86-03 Octree data structures and creation by stacking
Wm. R. Franklin and V. AkmanRUU-CS-85-28 A simple and efficient halved line algorithm for hidden line elimination
Wm.R.Franklin and V. Akman
BibTeX entries
@TECHREPORT{UUCS2012001,
author = {L.Bodlaender, Hans and Kratsch, Dieter and T.Timmer, Sjoerd},
year = 2012,
title = {Exact algorithms for Kayles},
number = {UU-CS-2012-001},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2012/2012-001.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2011003,
author = {Bodlaender, Hans~L. and Kratsch, Dieter},
year = 2011,
title = {Exact Algorithms for Kayles},
number = {UU-CS-2011-003},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2011/2011-003.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2010022,
author = {Bodlaender, Hans~L. and Koster, Arie~M.~C.~A.},
year = 2010,
title = {Treewidth Computations II. Lower Bounds},
number = {UU-CS-2010-022},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2010/2010-022.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2009035,
author = {Buchin, Kevin and Kreveld, Marc~van and Meijer, Henk and Speckmann, Bettina and Verbeek, Kevin},
year = 2009,
title = {On Planar Supports for Hypergraphs},
number = {UU-CS-2009-035},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2009/2009-035.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2009023,
author = {Bodlaender, Hans~L. and Fomin, Fedor~V. and Koster, Arie~M.~C.~A. and Kratsch, Dieter and Thilikos, Dimitrios~M.},
year = 2009,
title = {A Note on Exact Algorithms for Vertex Ordering Problems on Graphs},
number = {UU-CS-2009-023},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2009/2009-023.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2008032,
author = {L.Bodlaender, Hans and M.C.A.Koster, Arie},
year = 2008,
title = {Treewidth Computations I Upper Bounds},
number = {UU-CS-2008-032},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2008/2008-032.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2008008,
author = {Cabello, Sergio and Haverkort, Herman and Kreveld, Marc~van and Speckmann, Bettina},
year = 2008,
title = {Algorithmic Aspects of Proportional Symbol Maps},
number = {UU-CS-2008-008},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2008/2008-008.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2007054,
author = {Giacomo, Emilio~Di and Didimo, Walter and Kreveld, Marc~van and Liotta, Giuseppe and Speckmann, Bettina},
year = 2007,
title = {Matched Drawings of Planar Graphs},
number = {UU-CS-2007-054},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-054.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2007045,
author = {Kreveld, Marc~van and Speckmann, Bettina},
year = 2007,
title = {On the Number of Empty Pseudo-Triangles in Point Sets},
number = {UU-CS-2007-045},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-045.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2007042,
author = {Eppstein, D. and Kreveld, M.~van and Mumford, E. and Speckmann, B.},
year = 2007,
title = {Edges and Switches, Tunnels and Bridges},
number = {UU-CS-2007-042},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-042.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2006032,
author = {Bodlaender, Hans~L. and Fomin, Fedor~V. and Koster, Arie~M.~C.~A. and Kratsch, Dieter and Thilikos, Dimitrios~M.},
year = 2006,
title = {On exact algorithms for treewidth},
number = {UU-CS-2006-032},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-032.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-032.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2006015,
author = {Bodlaender, Hans~L. and Kratsch, Dieter},
year = 2006,
title = {An exact algorithm for graph coloring with polynomial memory},
number = {UU-CS-2006-015},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-015.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-015.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2005051,
author = {Bodlaender, Hans~L. and Grigoriev, Alexander and Koster, Arie~M.~C.~A.},
year = 2005,
title = {Treewidth Lower Bounds with Brambles},
number = {UU-CS-2005-051},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2005/2005-051.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2005/2005-051.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2005049,
author = {Moet, Esther and Knauer, Christian and Kreveld, Marc~van},
year = 2005,
title = {Visibility Maps of Segments and Triangles in 3D},
number = {UU-CS-2005-049},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2005/2005-049.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2005/2005-049.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2005044,
author = {Gudmundsson, Joachim and Kreveld, Marc~van and Speckmann, Bettina},
year = 2005,
title = {Efficient Detection of Motion Patterns in Spatio-Temporal Data Sets},
number = {UU-CS-2005-044},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2005/2005-044.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2005/2005-044.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2005037,
author = {Demaine, Erik and Erickson, Jeff and Krizanc, Danny and Meijer, Henk and Morin, Pat and Overmars, Mark and Whitesides, Sue},
year = 2005,
title = {Realizing partitions respecting full and partial order information},
number = {UU-CS-2005-037},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2005/2005-037.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2004053,
author = {Bodlaender, Hans~L. and Koster, Arie~M.~C.~A.},
year = 2004,
title = {On the Maximum Cardinality Search Lower Bound for Treewidth},
number = {UU-CS-2004-053},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-053.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-053.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2004050,
author = {Koster, Arie~M.~C.~A. and Wolle, Thomas and Bodlaender, Hans~L.},
year = 2004,
title = {Degree-Based Treewidth Lower Bounds},
number = {UU-CS-2004-050},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-050.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-050.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2004043,
author = {Bose, Prosenjit and Cabello, Sergio and Cheong, Otfried and Gudmundsson, Joachim and Kreveld, Marc~van and Speckmann, Bettina},
year = 2004,
title = {Area-Preserving Approximations of Polygonal Paths},
number = {UU-CS-2004-043},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-043.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-043.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2004042,
author = {Wolle, Thomas and Koster, Arie~M.~C.~A. and Bodlaender, Hans~L.},
year = 2004,
title = {A Note on Contraction Degeneracy},
number = {UU-CS-2004-042},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-042.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-042.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2004040,
author = {Kreveld, Marc~van and Speckmann, Bettina},
year = 2004,
title = {On Rectangular Cartograms},
number = {UU-CS-2004-040},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-040.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-040.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2004034,
author = {Bodlaender, Hans~L. and Koster, Arie~M.~C.~A. and Wolle, Thomas},
year = 2004,
title = {Contraction and Treewidth Lower Bounds},
number = {UU-CS-2004-034},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-034.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-034.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2003044,
author = {Chwa, Kyung-Yong and Jo, Byung-Cheol and Knauer, Christian and Moet, Esther and Oostrum, René~van and Shin, Chan-Su},
year = 2003,
title = {Guarding Art Galleries by Guarding Witnesses},
number = {UU-CS-2003-044},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2003/2003-044.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2003/2003-044.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2003038,
author = {Bodlaender, Hans~L. and Brandstädt, Andreas and Kratsch, Dieter and Rao, Michaël and Spinrad, Jeremy},
year = 2003,
title = {On Algorithms for (P5,Gem)-Free Graphs},
number = {UU-CS-2003-038},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2003/2003-038.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2003/2003-038.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2003027,
author = {Bodlaender, Hans~L. and Koster, Arie~M.~C.~A.},
year = 2003,
title = {Safe Separators for Treewidth},
number = {UU-CS-2003-027},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2003/2003-027.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2003/2003-027.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2003001,
author = {Bodlaender, Hans~L. and Koster, Arie~M.~C.~A. and Eijkhof, Frank~van~den},
year = 2003,
title = {Pre-processing rules for triangulation of probabilistic networks},
number = {UU-CS-2003-001},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2003/2003-001.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2003/2003-001.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2002051,
author = {Eijkhof, Frank~van~den and Bodlaender, Hans~L. and Koster, Arie~M.C.A.},
year = 2002,
title = {Safe reduction rules for weighted treewidth},
number = {UU-CS-2002-051},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2002/2002-051.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2002/2002-051.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2002048,
author = {Clarke, Dave and Wrigstad, Tobias},
year = 2002,
title = {External Uniqueness is Unique Enough},
number = {UU-CS-2002-048},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2002/2002-048.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2002/2002-048.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2002033,
author = {Aloupis, Greg and Bose, Prosenjit and Demaine, Erik~D. and Langerman, Stefan and Meijer, Henk and Overmars, Mark and Toussaint, Godfried~T.},
year = 2002,
title = {Computing Signed Permutations of Polygons},
number = {UU-CS-2002-033},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2002/2002-033.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2002/2002-033.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2002013,
author = {Cheong, Otfried and Shin, Chan-Su and Vigneron, Antoine},
year = 2002,
title = {Computing farthest neighbors on a convex polytope},
number = {UU-CS-2002-013},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2002/2002-013.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2002/2002-013.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS200149,
author = {Koster, Arie~M.C.A. and Bodlaender, Hans~L. and Hoesel, Stan~P.~M.~van},
year = 2001,
title = {Treewidth: Computational Experiments},
number = {UU-CS-2001-49},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2001/2001-49.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2001/2001-49.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS200121,
author = {Berg, M.~T.~de and Gudmundsson, J.~G. and Hammar, M. and Overmars, M.~H.},
year = 2001,
title = {On R-trees with low query complexity},
number = {UU-CS-2001-21},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2001/2001-21.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS200110,
author = {Agarwal, P.~K. and Berg, M.~T.~de and Gudmundsson, J.~G. and Hammar, M. and Haverkort, H.~J.},
year = 2001,
title = {Box-Trees and R-Trees with Near-Optimal Query Time},
number = {UU-CS-2001-10},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2001/2001-10.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS200105,
author = {Gudmundsson, J.~G. and Hammar, M. and Kreveld, M.~van},
year = 2001,
title = {Higher Order Delaunay Triangulations},
number = {UU-CS-2001-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2001/2001-05.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS200042,
author = {Bodlaender, H.~L. and Kratsch, D.},
year = 2000,
title = {Kayles and nimbers},
number = {UU-CS-2000-42},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-42.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-42.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS200031,
author = {Aichholzer, O. and Cortes, C. and Demaine, E.~D. and Dujmovic, V. and Erickson, J. and Meijer, H. and Overmars, M.~H. and Palop, B. and Ramaswami, S. and Toussaint, G.~T.},
year = 2000,
title = {Flipturning polygons},
number = {UU-CS-2000-31},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-31.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-31.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS200012,
author = {Lucas, P.~J.~F. and Bruijn, N.~de and Schurink, K. and Hoepelman, A.},
year = 2000,
title = {A probabilistic and decision-theoretic approach to the management of infectious disease at the ICU},
number = {UU-CS-2000-12},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-12.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-12.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199941,
author = {Aardal, K.~I. and Weismantel, R. and Wolsey, L.~A.},
year = 1999,
title = {Non-standard approaches to integer programming},
number = {UU-CS-1999-41},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-41.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-41.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199925,
author = {Roorda, J-W.},
year = 1999,
title = {Belief updates in multiple agent systems},
number = {UU-CS-1999-25},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-25.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-25.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199906,
author = {Bruijn, N.~de and Lucas, P.~J.~F. and Schurink, K. and Hoepelman, A.},
year = 1999,
title = {Improving antibiotic therapy of ventilator associated pneumonia using a probabilistic approach},
number = {UU-CS-1999-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-06.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-06.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199705,
author = {Yamazaki, Koichi and Bodlaender, Hans~L. and Fluiter, Babette~de and Thilikos, Dimitrios~M.},
year = 1997,
title = {Isomorphism for graphs of bounded distance width},
number = {UU-CS-1997-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-05.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-05.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199629,
author = {Bodlaender, Hans~L. and Thilikos, Dimitrios~M. and Yamazaki, Koichi},
year = 1996,
title = {It is hard to know when greedy is good for finding independent sets},
number = {UU-CS-1996-29},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-29.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-29.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199625,
author = {Berg, M.~T.~de and Meijer, H. and Overmars, M.~H. and Wilfong, G.},
year = 1996,
title = {Computing the angularity tolerance},
number = {UU-CS-1996-25},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-25.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-25.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199534,
author = {Bodlaender, H.~L. and Kloks, T. and Kratsch, D. and Mueller, H.},
year = 1995,
title = {Treewidth and minimum fill-in on d-trapezoid graphs},
number = {UU-CS-1995-34},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-34.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-34.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199503,
author = {Bodlaender, H.~L. and Deogun, J.~S. and Jansen, K. and Kloks, T. and Kratsch, D. and Mueller, H. and Tuza, Zs.},
year = 1995,
title = {Rankings of graphs},
number = {UU-CS-1995-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-03.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-03.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9332,
author = {Hoek, W.~van~der and Jaspars, J. and Thijsse, E.},
year = 1993,
title = {Honesty in Partial Logic},
number = {RUU-CS-93-32},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-32.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9230,
author = {Bodlaender, H.L. and Kloks, A.J.J. and Kratsch, D.},
year = 1992,
title = {Treewidth and pathwidth of permutation graphs},
number = {RUU-CS-92-30},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-30.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9228,
author = {Kloks, A.J.J. and Kratsch, D.},
year = 1992,
title = {Treewidth of chordal bipartite graphs},
number = {RUU-CS-92-28},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-28.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9103,
author = {Bodlaender, H.L. and Kratsch, D.},
year = 1991,
title = {The complexity of coloring games on perfect graphs},
number = {RUU-CS-91-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-03.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8605,
author = {Franklin, Wm.~R. and Akman, V.},
year = 1986,
title = {Reconstructing visible regions from visible segments},
number = {RUU-CS-86-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1986/1986-05.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8604,
author = {Franklin, Wm.~R. and Akman, V.},
year = 1986,
title = {Adaptive grid for polyhedral visibility in object space; an implementation},
number = {RUU-CS-86-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1986/1986-04.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8603,
author = {Franklin, Wm.~R. and Akman, V.},
year = 1986,
title = {Octree data structures and creation by stacking},
number = {RUU-CS-86-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1986/1986-03.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8528,
author = {Wm.R.Franklin and Akman, V.},
year = 1985,
title = {A simple and efficient halved line algorithm for hidden line elimination},
number = {RUU-CS-85-28},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1985/1985-28.pdf}},
pubcat = {techreport}
}