Department of Information and Computing Sciences

technical reports : Algorithms and Complexity

select other reports

• technical report index page
• below : list of indexed authors

this selection

group	Algorithms and Complexity

reports (279)

techrep_id	file	title / author
UU-CS-2019-012	pdf	Understanding Computation: A General Theory of Computational Processes Jan van Leeuwen and Jiri Wiedermann
UU-CS-2017-010	pdf	Tracking Maximum Ascending Subsequences in Sequences of Partially Ordered Data Ton Kloks, Richard B. Tan and Jan van Leeuwen
UU-CS-2016-007	pdf	Question Answering and Cognitive Automata with Background Intelligence Jan van Leeuwen and Jiri Wiedermann
UU-CS-2016-004	pdf	On the Subsequence Theorem of Erdős and Szekeres Jan van Leeuwen
UU-CS-2015-016	pdf	Open Problems of the Lorentz Workshop, "Enumeration Algorithms using Structure" Hans Bodlaender, Endre Boros, Pinar Heggernes, Dieter Kratsch
UU-CS-2015-001	pdf	A Note on Recursively Enumerable Classes of Partial Recursive Functions Jan van Leeuwen
UU-CS-2014-020	pdf	Shortcutting Directed and Undirected Networks with a Degree Constraint Richard B. Tan, Erik Jan van Leeuwen and Jan van Leeuwen
UU-CS-2014-014	pdf	Separating the Classes of Recursively Enumerable Languages Based on Machine Size Jan van Leeuwen and Jiri Wiedermann
UU-CS-2014-003	pdf	Turing Machines with One-sided Advice and the Acceptance of the co-RE Languages Jan van Leeuwen and Jiri Wiedermann
UU-CS-2012-001	pdf	Exact algorithms for Kayles Hans L.Bodlaender, Dieter Kratsch and Sjoerd T.Timmer
UU-CS-2011-003	pdf	Exact Algorithms for Kayles Hans L. Bodlaender and Dieter Kratsch
UU-CS-2010-027	pdf	Spanning tree congestion of k-outerplanar graphs Hans L. Bodlaender, Kyohei Kozawa, Takayoshi Matsushima, Yota Otachi
UU-CS-2010-026	pdf	Convex Polygon Intersection Graphs Erik Jan van Leeuwen, Jan van Leeuwen
UU-CS-2010-024	pdf	Exact algorithms for Intervalizing Colored Graphs Hans L. Bodlaender and Johan M. M. van Rooij
UU-CS-2010-022	pdf	Treewidth Computations II. Lower Bounds Hans L. Bodlaender and Arie M. C. A. Koster
UU-CS-2010-007	pdf	Complexity Results for the Spanning Tree Congestion Problem Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen
UU-CS-2010-005	pdf	Partitioning Sparse Graphs Into Triangles: Relations to exact satisfiability and very fast exponential time algorithms Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender
UU-CS-2009-034	pdf	Structure of Polynomial-Time Approximation Erik Jan van Leeuwen, Jan van Leeuwen
UU-CS-2009-025	pdf	Design by Measure and Conquer: Exact algorithms for dominating set Johan M. M. van Rooij, Hans L. Bodlaender
UU-CS-2009-023	pdf	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. Thilikos
UU-CS-2009-018	pdf	Conditional Lower Bounds on the Complexity of Probabilistic Inference Johan Kwisthout, Hans L. Bodlaender
UU-CS-2009-012	pdf	(Meta) Kernelization Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
UU-CS-2008-043	pdf	Inclusion/Exclusion Meets Measure and Conquer: Exact algorithms for counting dominating sets. Johan M.M. van Rooij, Jesper Nederlof and Thomas C. van Dijk
UU-CS-2008-042	pdf	Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender, Pinar Heggernes and Yngve Villanger
UU-CS-2008-033	pdf	Clustering with partial information Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos and Frances Rosamond
UU-CS-2008-032	pdf	Treewidth Computations I Upper Bounds Hans L.Bodlaender and Arie M.C.A.Koster
UU-CS-2008-030	pdf	Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels Hans L. Bodlaender, Stéphan Thomassé, and Anders Yeo
UU-CS-2008-017	pdf	Open Problems in Parameterized and Exact Computation - IWPEC 2008 Hans L. Bodlaender, Erik D. Demaine, Michael R. Fellows, Jiong Guo, Danny Hermelin, Daniel Lokshtanov, Moritz Müller, Venkatesh Raman, Johan van Rooij, Frances A. Rosamond
UU-CS-2008-005	pdf	Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, and Jan van Leeuwen
UU-CS-2007-051	ps.gz pdf	Exact Algorithms for Edge Domination Johan M. M. van Rooij and Hans L. Bodlaender
UU-CS-2007-050	ps.gz pdf	Complexity Results for Local Monotonicity in Probabilistic Networks Johan Kwisthout, Hans L. Bodlaender, Gerard Tel
UU-CS-2007-046	pdf	On Problems Without Polynomial Kernels Hans L. Bodlaender, Rodney G. Downey, Michael R, Fellows, and Danny Hermelin
UU-CS-2007-035	pdf	Quadratic Kernelization of Convex Recoloring of Trees Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, and Mark Weyer
UU-CS-2007-031	ps.gz	On the minimum corridor connection problem and other generalized geometric problems Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters and Thomas Wolle
UU-CS-2007-024	ps.gz pdf	Student Enrollment and Image of the Informatics Discipline Jan van Leeuwen and Letizia Tanca
UU-CS-2007-019	ps.gz pdf	The Valve Location Problem in Simple Network Topologies Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks
UU-CS-2007-009	ps.gz pdf	Wooden Geometric Puzzles: Design and Hardness Proofs Helmut Alt, Hans L. Bodlaender, Marc van Kreveld, Günter Rote, Gerard Tel
UU-CS-2006-058	pdf	Complexity Results for Enhanced Qualitative Probabilistic Networks Johan Kwisthout and Gerard Tel
UU-CS-2006-052	ps.gz pdf	Open Problems in Parameterized and Exact Computation - IWPEC 2006 Hans L. Bodlaender, Leizhen Cai, Jianer Chen, Michael R. Fellows, Jan Arne Telle, Dániel Marx
UU-CS-2006-042	ps.gz pdf	A Cubic Kernel for Feedback Vertex Set Hans L. Bodlaender
UU-CS-2006-041	ps.gz pdf	Treewidth: Characterizations, Applications, and Computations Hans L. Bodlaender
UU-CS-2006-037	ps.gz pdf	On the Representation of Disk Graphs Erik Jan van Leeuwen and J. van Leeuwen
UU-CS-2006-032	ps.gz pdf	On exact algorithms for treewidth Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
UU-CS-2006-018	ps.gz pdf	Lazy Autoconfiguration in Mobile Ad Hoc Networks and Dynamic Sets of Mobile Agents Jan van Leeuwen and Jiri Wiederman
UU-CS-2006-017	pdf	Geheimschrift op de TI-83+ Gerard Tel
UU-CS-2006-015	ps.gz pdf	An exact algorithm for graph coloring with polynomial memory Hans L. Bodlaender and Dieter Kratsch
UU-CS-2006-013	ps.gz pdf	Weighted Treewidth: Algorithmic Techniques and Results Emgad Bachoore and Hans L. Bodlaender
UU-CS-2006-012	ps.gz pdf	A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth Emgad Bachoore and Hans L. Bodlaender
UU-CS-2006-010	ps.gz pdf	Convex recoloring of leaf-colored trees Emgad H. Bachoore and Hans L. Bodlaender
UU-CS-2006-006	ps.gz pdf	Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
UU-CS-2006-001	ps.gz pdf	Interval Routing and Minor-Monotone Graph Parameters Erwin M. Bakker, Hans L. Bodlaender, Richard B. Tan, and Jan van Leeuwen
UU-CS-2005-051	ps.gz pdf	Treewidth Lower Bounds with Brambles Hans L. Bodlaender, Alexander Grigoriev, and Arie M. C. A. Koster
UU-CS-2005-018	ps.gz pdf	Discovering Treewidth Hans L. Bodlaender
UU-CS-2005-011	ps.gz pdf	Online Topological Ordering Irit Katriel and Hans L. Bodlaender
UU-CS-2004-066	ps.gz pdf	Approximation Algorithms for Unit Disk Graphs Erik Jan van Leeuwen
UU-CS-2004-058	ps.gz pdf	Algorithms for graphs embeddable with few crossings per edge Alexander Grigoriev and Hans L. Bodlaender
UU-CS-2004-053	ps.gz pdf	On the Maximum Cardinality Search Lower Bound for Treewidth Hans L. Bodlaender and Arie M. C. A. Koster
UU-CS-2004-050	ps.gz pdf	Degree-Based Treewidth Lower Bounds Arie M. C. A. Koster, Thomas Wolle, and Hans L. Bodlaender
UU-CS-2004-042	ps.gz pdf	A Note on Contraction Degeneracy Thomas Wolle, Arie M. C. A. Koster, Hans L. Bodlaender
UU-CS-2004-036	ps.gz pdf	New Upper Bound Heuristics for Treewidth Emgad H. Bachoore and Hans L. Bodlaender
UU-CS-2004-034	ps.gz pdf	Contraction and Treewidth Lower Bounds Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle
UU-CS-2004-031	ps.gz pdf	Contraction Degeneracy on Cographs Hans L. Bodlaender and Thomas Wolle
UU-CS-2004-030	ps.gz pdf	Space-efficient construction variants of dynamic programming Hans L. Bodlaender and Jan Arne Telle
UU-CS-2004-028	ps.gz pdf	A Note on Edge Contraction Thomas Wolle and Hans L. Bodlaender
UU-CS-2004-018	ps.gz pdf	Lineages of Automata Peter Verbaan, Jan van Leeuwen, Jiri Wiedermann
UU-CS-2004-010	ps.gz pdf	Equitable colorings of bounded treewidth graphs Hans L. Bodlaender, Fedor V. Fomin
UU-CS-2004-001	ps.gz pdf	A Note on the Complexity of Network Reliability Problems Hans L. Bodlaender and Thomas Wolle
UU-CS-2003-038	ps.gz pdf	On Algorithms for (P5,Gem)-Free Graphs Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
UU-CS-2003-033	ps.gz pdf	Rectilinear Graphs and Angular Resolution Hans L. Bodlaender and Gerard Tel
UU-CS-2003-027	ps.gz pdf	Safe Separators for Treewidth Hans L. Bodlaender and Arie M. C. A. Koster
UU-CS-2003-001	ps.gz pdf	Pre-processing rules for triangulation of probabilistic networks Hans L. Bodlaender, Arie M. C. A. Koster, and Frank van den Eijkhof
UU-CS-2002-051	ps.gz pdf	Safe reduction rules for weighted treewidth Frank van den Eijkhof, Hans L. Bodlaender, and Arie M.C.A. Koster
UU-CS-2002-032	ps.gz pdf	Derivation of algorithms for cutwidth and related graph layout problems Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
UU-CS-2002-026	ps.gz pdf	Radio labeling with pre-assigned frequencies Hans L. Bodlaender, Hajo J. Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginer
UU-CS-2002-002	ps.gz pdf	The emergent computational potential of evolving artificial living systems J. Wiedermann, J. van Leeuwen
UU-CS-2002-001	ps.gz pdf	Tree decompositions with small cost Hans L. Bodlaender, Fedor V. Fomin
UU-CS-2001-49	ps.gz pdf	Treewidth: Computational Experiments Arie M.C.A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel
UU-CS-2001-22	ps.gz pdf	Computing the treewidth and the minimum fill-in with the modular decomposition H. L. Bodlaender, U. Rotics
UU-CS-2001-15	ps.gz pdf	Relaxed Update and Partition Network Games H. L. Bodlaender, M. J. Dinneen, B. Khoussainov
UU-CS-2001-08	ps.gz pdf	A generic NP-hardness proof for a variant of Graph Coloring H. L. Bodlaender
UU-CS-2001-04	ps.gz pdf	A polynomial algorithm for the cutwidth of bounded degree graphs with small treewidth D. M. Thilikos, M. J. Serna, H. L. Bodlaender
UU-CS-2001-02	ps.gz pdf	A computational model of interaction in embedded systems J. van Leeuwen, J. Wiedermann
UU-CS-2000-42	ps.gz pdf	Kayles and nimbers H. L. Bodlaender, D. Kratsch
UU-CS-2000-38	ps.gz pdf	Constructive linear time algorithms for branchwidth D. M. Thilikos, H. L. Bodlaender
UU-CS-2000-33	ps.gz pdf	The Turing machine paradigm in contemporary computing J. van Leeuwen, J. Wiedermann
UU-CS-2000-29	ps.gz pdf	Finding a Delta-regular supergraph of minimum order H. L. Bodlaender, R. B. Tan, J. van Leeuwen
UU-CS-2000-28	ps.gz pdf	Fixed parameter algorithms for planar dominating set J. Alber, H. L. Bodlaender, H. Fernau, R. Niedermeier
UU-CS-2000-27	ps.gz pdf	Necessary edges in k-chordalizations of graphs H. L. Bodlaender
UU-CS-2000-25	ps.gz pdf	Approximations for Lambda-coloring of graphs H. L. Bodlaender, T. Kloks, R. B. Tan, J. van Leeuwen
UU-CS-2000-24	ps.gz pdf	A constructive linear time algorithm for small cutwidth D. M. Thilikos, M. J. Serna, H. L. Bodlaender
UU-CS-2000-23	ps.gz pdf	Approximation of pathwidth of outerplanar graphs H. L. Bodlaender, F. V. Fomin
UU-CS-1999-31	ps.gz pdf	Sizes of decision tables and decision trees H. Zantema, H. L. Bodlaender
UU-CS-1999-02	ps.gz pdf	Finding small equivalent decision trees is hard H. Zantema, H. L. Bodlaender
UU-CS-1998-43	ps.gz pdf	Cryptografie: van DES tot Chipknip G. Tel
UU-CS-1998-42	ps.gz pdf	Time and bit optimal broadcasting on anonymous unoriented hypercubes S. Dobrev, P. Ruzicka, G. Tel
UU-CS-1998-17	ps.gz pdf	Distributed control for AI G. Tel
UU-CS-1998-15	ps.gz pdf	A note on domino treewidth H. L. Bodlaender
UU-CS-1998-05	ps.gz pdf	Computing small search numbers in linear time H. L. Bodlaender, D. M. Thilikos
UU-CS-1997-42	ps.gz pdf	Comparing loop cutsets and clique trees in probabilistic inference L. C. van der Gaag, H. L. Bodlaender
UU-CS-1997-37	ps.gz pdf	Graphs with branchwidth at most three H. L. Bodlaender, D. M. Thilikos
UU-CS-1997-31	ps.gz pdf	Treewidth: Algorithmic results and techniques H. L. Bodlaender
UU-CS-1997-24	ps.gz pdf	Reduction algorithms for graphs of small treewidth Hans L. Bodlaender, Babette de Fluiter
UU-CS-1997-23	ps.gz pdf	Parallel algorithms for treewidth two Babette de Fluiter, Hans L. Bodlaender
UU-CS-1997-21	ps.gz pdf	Parallel algorithms for series parallel graphs Hans L. Bodlaender, Babette de Fluiter
UU-CS-1997-05	ps.gz pdf	Isomorphism for graphs of bounded distance width Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
UU-CS-1997-04	ps.gz pdf	Intervalizing sandwich graphs Babette de Fluiter, Hans L. Bodlaender
UU-CS-1996-41	ps.gz pdf	On Interval Routing Schemes and Treewidth H. L. Bodlaender, J. van Leeuwen, R. B. Tan, D. M. Thilikos
UU-CS-1996-30	ps.gz pdf	Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems D. M. Thilikos, H. L. Bodlaender
UU-CS-1996-29	ps.gz pdf	It is hard to know when greedy is good for finding independent sets Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi Yamazaki
UU-CS-1996-13	ps.gz pdf	Parallel algorithms for series parallel graphs Hans L. Bodlaender, Babette de Fluiter
UU-CS-1996-02	ps.gz pdf	A partial k-arboretum of graphs with bounded treewidth H. L. Bodlaender
UU-CS-1995-37	ps.gz pdf	Reduction algorithms for graphs with small treewidth Hans L. Bodlaender, Babette de Fluiter
UU-CS-1995-36	ps.gz pdf	The hardness of problems on thin colored graphs H. L. Bodlaender, M. R. Fellows, M. T. Hallett, H. T. Wareham, T. J. Warnow
UU-CS-1995-34	ps.gz pdf	Treewidth and minimum fill-in on d-trapezoid graphs H. L. Bodlaender, T. Kloks, D. Kratsch, H. Mueller
UU-CS-1995-25	ps.gz pdf	Parallel algorithms with optimal speedup for bounded treewidth H. L. Bodlaender, T. Hagerup
UU-CS-1995-20	ps.gz pdf	On intervalizing k-colored graphs for DNA physical mapping Hans L. Bodlaender, Babette de Fluiter
UU-CS-1995-16	pdf	The Complexity of Interval Routing on Random Graphs M. Flammini and J. van Leeuwen and A. Marchetti-Spaccamela
UU-CS-1995-15	ps.gz pdf	Intervalizing k-colored graphs Hans L. Bodlaender, Babette de Fluiter
UU-CS-1995-13	pdf	Guessing Games, Binomial Sum Trees and Distributed Computations in Synchronous Networks J. van Leeuwen and N. Santoro and J. Urrutia and S. Zaks
UU-CS-1995-05	pdf	Compact Routing Methods: A Survey J. van Leeuwen and R.B. Tan
UU-CS-1995-03	ps.gz pdf	Rankings of graphs H. L. Bodlaender, J. S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Mueller, Zs. Tuza
UU-CS-1995-02	ps.gz pdf	Treewidth and small separators for graphs with small chordality H. L. Bodlaender, D. M. Thilikos
UU-CS-1995-01	ps.gz pdf	The parameterized complexity of sequence alignment and consensus H. L. Bodlaender, R. G. Downey, M. R. Fellows, H. T. Wareham
UU-CS-1994-14	ps.gz pdf	W[2]-hardness of Precedence Constrained K-processor Scheduling H. L. Bodlaender, M. R. Fellows
UU-CS-1994-11	ps.gz pdf	Domino treewidth H. L. Bodlaender, J. Engelfriet
RUU-CS-93-39	ps.gz pdf	Linear election for oriented hypercubes G. Tel
RUU-CS-93-37	pdf	Advanced Distributed Algorithms T. Herman and G. Tel
RUU-CS-93-27	ps.gz pdf	Efficient and constructive algorithms for the pathwidth and treewidth of graphs H. L. Bodlaender, T. Kloks
RUU-CS-92-35	pdf	Only few graphs have bounded treewidth T. Kloks and H. Bodlaender
RUU-CS-92-30	pdf	Treewidth and pathwidth of permutation graphs H.L. Bodlaender and A.J.J. Kloks and D. Kratsch
RUU-CS-92-29	pdf	Approximating treewidth and pathwidth of some classes of perfect graphs A.J.J. Kloks and H.L. Bodlaender
RUU-CS-92-27	ps.gz pdf	A linear time algorithm for finding tree-decompositions of small treewidth H. L. Bodlaender
RUU-CS-92-13	pdf	On the Treewidth and Pathwidth of Permutation Graphs T. Kloks and H.L. Bodlaender
RUU-CS-92-12	ps.gz pdf	A tourist guide through Treewidth H. L. Bodlaender
RUU-CS-92-09	pdf	Testing superperfection of $k-$trees T. Kloks and H.L. Bodlaender
RUU-CS-92-08	pdf	Two strikes against perfect phylogeny H.L. Bodlaender and M.R. Fellows and T.J. Warnow
RUU-CS-92-07	pdf	Triangslating planar graphs while minimizing the maximum degree G. Kant and H.L. Bodlaender
RUU-CS-91-49	ps.gz pdf	Kayles on special classes of graphs - An application of Sprague-Grundy theory H. L. Bodlaender
RUU-CS-91-44	pdf	Restrictions of graph partition problems. Part I. H.L. Bodlaender and K. Jansen
RUU-CS-91-39	ps.gz pdf	On the complexity of the maximum cut problem H. L. Bodlaender, K. Jansen
RUU-CS-91-35	pdf	Complexity aspects of 2-dimensional data compression H.L. Bodlaender and T. Gonzalez and T. Kloks
RUU-CS-91-32	ps.gz pdf	Global virtual time approximation with distributed termination detection algorithms F. Mattern, H. Mehl, A. A. Schoone, G. Tel
RUU-CS-91-25	pdf	Planar graph augmentation problems G. Kant and H.L. Bodlaender
RUU-CS-91-23	pdf	The optimal placement of replicated items in distributed databases on tree-like networks E.M. Bakker and J. van Leeuwen
RUU-CS-91-22	pdf	Some domination problems on trees and on general grahps E.M. Bakker and J. van Leeuwen
RUU-CS-91-21	pdf	Uniform d-emulations of rings, with an application to distributed virtual ring contruction E.M. Bakker and J. van Leeuwen
RUU-CS-91-13	pdf	A simple linear time algorithm for triangulating three-colored graphs H.L. Bodlaender and A.J.. Kloks
RUU-CS-91-08	ps.gz pdf	Network Orientation G. Tel
RUU-CS-91-07	pdf	Linear interval routing schemes E.M. Bakker and J. van Leeuwen and R.B. Tan
RUU-CS-91-03	pdf	The complexity of coloring games on perfect graphs H.L. Bodlaender and D. Kratsch
RUU-CS-91-01	pdf	Approximating treewidth, pathwidth, and minimum elimination tree height H.L. Bodlaender and J.R. Gilbert and H. Hafsteinsson and T. Kloks
RUU-CS-90-35	pdf	Perfect Colorings E.M. Bakker and J. van Leeuwen and R.B. Tan
RUU-CS-90-29	pdf	On disjoint cycles in graphs H.L. Bodlaender
RUU-CS-90-26	pdf	Maintaining 2- and 3-connected components in graphs, Part I: 2- and 3-edge-connected components J.A. La Poutré and J. van Leeuwen and M.H. Overmars
RUU-CS-90-24	ps.gz pdf	The derivation of distributed termination detection algorithms from garbage collection schemes G. Tel, F. Mattern
RUU-CS-90-16	pdf	The file distribution problem for processor networks G. Kant and J. van Leeuwen
RUU-CS-90-15	pdf	Strong colorings of graphs G. Kant and J. van Leeuwen
RUU-CS-90-11	pdf	Fast algorithms for the Tron game on trees H. Bodlaender and T. Kloks
RUU-CS-90-10	pdf	Prefix routing schemes in dynamic networks E.M. Bakker and J. van Leeuwen and R.B. Tan
RUU-CS-90-07	pdf	The pathwidth and treewidth of cographs H.L. Bodlaender and R.H. Möhring
RUU-CS-89-34	pdf	Correctness of the two-phase commit protocol J. van Leeuwen
RUU-CS-89-29	pdf	Complexity of path-forming games H.L. Bodlaender
RUU-CS-89-27	pdf	On the complexity of some coloring games H.L. Bodlaender
RUU-CS-89-23	pdf	The one-dimensional skewing problem G. Tel and J. van Leeuwen and H.A.G. Wijshoff
RUU-CS-89-22	ps.gz pdf	Trade-offs in non-reversing diameter H. L. Bodlaender, G. Tel, N. Santoro
RUU-CS-89-06	pdf	Structured NC B. Scholten and J. van Leeuwen
RUU-CS-89-03	pdf	On models for Propositional Dynamic Logic P.M.W. Knijnenburg and J. van Leeuwen
RUU-CS-89-02	pdf	Bit-optimal election in synchronous rings H.L. Bodlaender and G. Tel
RUU-CS-89-01	pdf	On linear time minor tests and depth first search H.L. Bodlaender
RUU-CS-88-40	pdf	Transformation of a termination detection algorithm and its assertional correctness proof A.A. Schoone and G. Tel
RUU-CS-88-39	pdf	Some observations for the pigeon hole principle F.J. Brandenburg and J. van Leeuwen and R.B. Tan
RUU-CS-88-33	pdf	The distributed bit complexity of the ring; from the anonymous to the non-anonymous case H.L. Bodlaender and S. Moran and M.K. Warmuth
RUU-CS-88-31	pdf	Distributed computing on transitive networks; the torus P.W. Beame and H.L. Bodlaender
RUU-CS-88-29	pdf	Improved self-reduction algorithms for graphs with bounded treewidth H.L. Bodlaender
RUU-CS-88-25	pdf	ACHROMATIC NUMBER is NP-complete for cographs and interval graphs H.L. Bodlaender
RUU-CS-88-23	ps.gz pdf	Optimal Synchronization of ABD Networks G. Tel, E. Korach, S. Zaks
RUU-CS-88-18	pdf	New lower bound techniques for distributed leader finding and other problems on rings of processors H.L. Bodlaender
RUU-CS-88-17	pdf	An optimal pointer machine algorithm for finding nearest common ancestors J. van Leeuwen and A.K. Tsakalides
RUU-CS-88-16	ps.gz pdf	Total algorithms G. Tel
RUU-CS-88-14	pdf	Planar graphs with bounded treewidth H.L. Bodlaender
RUU-CS-88-13	pdf	Assertional verification of a majority consensus algorithm for concurrency control in multiple copy databases N.J. Drost and J. van Leeuwen
RUU-CS-88-09	pdf	The client/server model in distributed computing J. van Leeuwen
RUU-CS-88-06	pdf	Assertional verification of a termination detection algorithm A.A. Schoone and G. Tel
RUU-CS-88-04	pdf	NC-algorithms for graphs of small treewidth H.L. Bodlaender
RUU-CS-87-25	pdf	Maintenance of transitive closures and transitive reductions of graphs J.A. La Poutré and J. van Leeuwen
RUU-CS-87-22	pdf	Dynamic programming on graphs with bounded treewidth H.L. Bodlaender
RUU-CS-87-17	pdf	Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees H.L. Bodlaender
RUU-CS-87-15	pdf	Assertional verification of a timer-based protocol G. Tel
RUU-CS-87-13	pdf	A better lowerbound for distributed leader finding in bidirectional asynchronous rings of processors H.L. Bodlaender
RUU-CS-87-12	pdf	The maximum cut and minimum cut into bounded sets problems on cographs H.L. Bodlaender
RUU-CS-87-11	pdf	A new lowerbound technique for distributed extrema finding on rings of processors H.L. Bodlaender
RUU-CS-87-10	not online	2nd International Workshop on Distributed Algorithms (draft papers) E. Gafni and M. Raynal and N. Santoro and J. van Leeuwen and S. Zaks (no longer available, revised version to appear in the series Lecture Notes in Computer Science)
RUU-CS-87-07	pdf	Enumeration in graphs G.J. Bezem and J. van Leeuwen
RUU-CS-87-06	pdf	Directed network protocols (revised edition) G. Tel
RUU-CS-87-01	pdf	Interval heaps J. van Leeuwen and D. Wood
RUU-CS-86-22	pdf	Classes of graphs with bounded tree-width H.L. Bodlaender
RUU-CS-86-17	pdf	Graph algorithms (95 p.) J. van Leeuwen
RUU-CS-86-12	pdf	Distributed infimum approximation G. Tel
RUU-CS-86-11	pdf	The derivation of graph marking algorithms from distributed termination detection protocols G.Tel and R.B. Tan and J. van Leeuwen
RUU-CS-86-08	not online	The one-dimensional skewing problem G.Tel and J. van Leeuwen and H.A.G. Wijshoff
RUU-CS-86-07	pdf	Very thin VLSI-layouts of complete binary trees J. van Leeuwen and R.B. Tan
RUU-CS-86-06	pdf	Distribution of records on a ring of processors H.L. Bodlaender and J. van Leeuwen
RUU-CS-86-02	pdf	General symmetric distributed termination detection R.B. Tan and J. van Leeuwen
RUU-CS-86-01	pdf	Simulation of parallel algorithms on a distributed network A.A. Schoone and J. van Leeuwen
RUU-CS-85-26	pdf	Diameter increase caused by edge deletion A.Schoone and H.L.Bodlaender and J.van Leeuwen
RUU-CS-85-25	pdf	Deadlock-free packet switching networks with variable packet size H.L.Bodlaender
RUU-CS-85-24	pdf	Hierarchical memory systems in multiprocessors and multi-periodic skewing schemes G.Tel and H.A.G. Wijshoff
RUU-CS-85-23	pdf	An improved upperbound for distributed election in bidirectional rings of processors J. van Leeuwen and R.B. Tan
RUU-CS-85-22	pdf	Some lowerbound results for decentralized extrema-finding in rings of processors H.L.Bodlaender
RUU-CS-85-20	pdf	Emulations of processor networks with buses H.L.Bodlaender
RUU-CS-85-18	pdf	Finding grid embeddings with bounded maximum edge length is NP-complete H.L.Bodlaender
RUU-CS-85-16	pdf	Interval routing J. van Leeuwen and R.B. Tan
RUU-CS-85-15	pdf	New upperbounds for decentralized extremafinding in a ring of processors H.L.Bodlaender and J. van Leeuwen
RUU-CS-85-14	pdf	The complexity of finding uniform emulations on fixed graphs H.L.Bodlaender
RUU-CS-85-12	pdf	Verification of balanced link-level protocols A.A. Schoone and J. van Leeuwen
RUU-CS-85-11	pdf	The classification of coverings of processor networks H.L.Bodlaender
RUU-CS-85-10	pdf	On Approximation algorithms for determining minimum cost emulations H.L.Bodlaender
RUU-CS-85-09	pdf	Authentication (abstract in het engels als -85-9a) G.M.J. Pluimakers and J. van Leeuwen
RUU-CS-85-07	pdf	Fast simulation of Turing machines by random access machines J. Katajainen and J. van Leeuwen and M. Penttonen
RUU-CS-85-05	pdf	The complexity of finding uniform emulations on paths and ring networks H.L.Bodlaender
RUU-CS-85-04	pdf	On the complexity of finding uniform emulations H.L.Bodlaender and J.van Leeuwen
RUU-CS-85-01	not online	$ast$ Pascal; compact reference guide to the programming language J. van Leeuwen
RUU-CS-84-13	pdf	Array Processing Machines J. van Leeuwen and J. Wiedermann
RUU-CS-84-09	pdf	Uniform emulations of two different types of shuffle-exchange networks H.L. Bodlaender
RUU-CS-84-07	pdf	Parallel memories, periodic skewing schemes, and the theory of finite abelian groups J.Tappe and J. van Leeuwen and H.A.G. Wijshoff
RUU-CS-84-05	pdf	Uniform emulations of the shuffle-exchange network H.L. Bodlaender and J. van Leeuwen
RUU-CS-84-04	pdf	Simulation of large networks on smaller networks H.L. Bodlaender and J. van Leeuwen
RUU-CS-84-02	pdf	The minimum bisection width of (three-dimensional) blocks H.L. Bodlaender and J. van Leeuwen
RUU-CS-84-01	pdf	The structure of periodic storage schemes for parallel memories H.A.G. Wijshoff and J. van Leeuwen
RUU-CS-83-18	not online	Operating Systems (231 p. in Dutch) H.P. Penning and J. van Leeuwen
RUU-CS-83-16	pdf	Routing with compact routing tables J. van Leeuwen and R.B. Tan
RUU-CS-83-14	not online	The technological image of ``1984'' (in Dutch) J. van Leeuwen
RUU-CS-83-13	pdf	Parallel computers and algorithms J. van Leeuwen
RUU-CS-83-11	pdf	Data mappings in large parallel computers J. van Leeuwen and H.A.G. Wijshoff
RUU-CS-83-10	pdf	A linearity condition for periodic skewing schemes H.A.G. Wijshoff and J. van Leeuwen
RUU-CS-83-07	pdf	On linear skewing schemes and d ordered vectors H.A.G. Wijshoff and J. van Leeuwen
RUU-CS-83-04	pdf	Periodic storage schemes with a minimum number of memory banks H.A.G. Wijshoff and J. van Leeuwen
RUU-CS-83-01	pdf	Compositions of double diagonal and cross Latin squares H.L. Bodlaender and H.A.G. Wijshoff and J. van Leeuwen
RUU-CS-82-11	pdf	Periodic versus arbitrary tessellations of the plane using polyominos of single type H.A.G. Wijshoff and J. van Leeuwen
RUU-CS-82-09	pdf	Systolic computation and VLSI M.R. Kramer and J. van Leeuwen.
RUU-CS-82-08	pdf	Distributed computing J. van Leeuwen.
RUU-CS-82-07	pdf	The complexity of VLSI-circuits for arbitrary Boolean functions (to appear) M.R. Kramer and J. van Leeuwen
RUU-CS-82-06	pdf	The NP-completeness of finding minimum area Layouts for VLSI-circuits (to appear) M.R. Kramer and J. van Leeuwen
RUU-CS-82-04	pdf	Wire routing in NP-complete M.R. Kramer and J. van Leeuwen
RUU-CS-82-01	not online	Fundamental Algorithms (in Dutch) J, van Leeuwen
RUU-CS-81-18	pdf	Graphics and computational geometry J. van Leeuwen
RUU-CS-81-16	pdf	The bounded aspect ratio problem for VLSI J. van Leeuwen
RUU-CS-81-14	pdf	Organisatie van bedrijfssystemen voor computer netwerken I.J.M. Birkhoff and J. van Leeuwen
RUU-CS-81-13	not online	VLSI layouts of perfect binary trees (to appear) J. van Leeuwen and M.H. Overmars and D. Wood
RUU-CS-81-08	pdf	The art of dynamizing J. van Leeuwen and M.H. Overmars
RUU-CS-81-06	pdf	A basis for dataflow computing A.P.W. Bohm and J. van Leeuwen
RUU-CS-81-04	pdf	Stratified balanced search trees J. van Leeuwen and M.H. Overmars
RUU-CS-81-03	pdf	Maintenance of configurations in the plane (revised edition) M.H. Overmars and J. van Leeuwen
RUU-CS-80-12	pdf	Efficient recognition of rational relations J. van Leeuwen and M. Nivat
RUU-CS-80-11	pdf	Untangling a traveling salesman tour in the plane J. van Leeuwen and A.A. Schoone
RUU-CS-80-10	pdf	Worst case optimal insertion and deletion methods for decomposable searching problems M.H. Overmars and J. van Leeuwen
RUU-CS-80-08	pdf	Computers en (on)doenlijke problemen J. van Leeuwen
RUU-CS-80-06	pdf	Dynamization of decomposable searching problems yielding good worst case bounds M.H. Overmars and J. van Leeuwen
RUU-CS-80-05	pdf	Notes on maintenance of configurations in the plane M.H. Overmars and J. van Leeuwen
RUU-CS-80-03	pdf	Triangulating a starshaped polygon A.A. Schoone and J. van Leeuwen
RUU-CS-80-02	pdf	Dynamic multi-dimensional data structures based on quad- and k-d trees M.H. Overmars and J. van Leeuwen
RUU-CS-80-01	pdf	Some principles for dynamizing decomposable searching problems M.H. Overmars and J. van Leeuwen
RUU-CS-79-10	pdf	Two general methods for dynamizing decomposable searching problems M.H. Overmars and J. van Leeuwen
RUU-CS-79-09	pdf	Maintenance of configurations in the plane M.H. Overmars and J. van Leeuwen
RUU-CS-79-07	not online	Further comments on Bykat's convex hull algorithm M.H. Overmars and J. van Leeuwen
RUU-CS-79-06	pdf	The measure problem for rectangular ranges in d-space J. van Leeuwen and D. Wood
RUU-CS-79-05	pdf	Dynamization of decomposable searching problems J. van Leeuwen and D. Wood
RUU-CS-79-04	pdf	The complexity of basic complex operations H. Alt and J. van Leeuwen
RUU-CS-79-03	pdf	Rapid subtree indentification revisited M.H. Overmars and J. van Leeuwen
RUU-CS-79-02	not online	Computers en informatie-verwerking J. van Leeuwen
RUU-CS-79-01	pdf	On program efficiency and algebraic complexity - (or- how to compute the Schur transform of a complex polynomial) J. van Leeuwen
RUU-CS-78-05	pdf	The composition of fast priority queues J. van Leeuwen
RUU-CS-78-04	pdf	Move-rules and trade-offs in the pebble game P. Emde Boas and J. van Leeuwen
RUU-CS-78-03	pdf	Linear time generation of a new fixed-length data-compression code J. van Leeuwen
RUU-CS-78-02	pdf	Compromising statistical data-base with a few known elements in a combinatorial model J. van Leeuwen
RUU-CS-78-01	pdf	A useful lemma for context-free programmed grammers J. van Leeuwen
RUU-CS-77-04	not online	Inleiding tot database systems J. van Leeuwen
RUU-CS-77-03	pdf	Alternative path compression techniques J. van Leeuwen and Th.P. van der Weide
RUU-CS-77-02	pdf	Stack machines and classes of nonnested macro-languages J. Engelfriet and E.Meineche Schmidt and J. van Leeuwen

indexed authors

author		group
Alt, prof. dr. H.	all reports	Games and Virtual Worlds	all reports
Böhm, prof. dr. ir. A.P.W.	all reports	Algorithmic Systems	all reports
Bachoore, MSc E.	all reports	Algorithmic Systems	all reports
Bakker, dr. E.M.	all reports	Algorithmic Systems	all reports
Bodlaender, prof. dr. H.L.	all reports	Algorithms and Complexity	all reports
Dijk, MSc T.C. van	all reports	Algorithmic Systems	all reports
Eijkhof, drs. F van den	all reports	Decision Support Systems	all reports
Fluiter, dr. ir. B.L.E. de	all reports	Algorithmic Systems	all reports
Gaag, prof. dr. ir. L.C. van der	all reports	Decision Support Systems	all reports
Kant, dr. G.	all reports	Algorithmic Systems	all reports
Kloks, dr. A.J.J.	all reports	Algorithmic Systems	all reports
Knijnenburg, dr. P.M.W.	all reports	Algorithmic Systems	all reports
Koster, dr. ir. A.M.C.A.	all reports	Guests and Others	all reports
Kratsch, prof. dr. D.	all reports	Guests and Others	all reports
Kreveld, prof. dr. M.J. van	all reports	Geometric Computing	all reports
Kwisthout, dr. ir. J.H.P.	all reports	Algorithmic Systems	all reports
La Poutré, prof. dr. ir. J.A.	all reports	Decision Support Systems	all reports
Leeuwen, dr. E.J. van	all reports	Algorithms and Complexity	all reports
Leeuwen, prof. dr. (em.) J. van	all reports	Algorithms and Complexity	all reports
Lokshtanow, MSc D.	all reports	Algorithmic Systems	all reports
Otachi, MSc Y.	all reports	Algorithmic Systems	all reports
Overmars, prof. dr. M.H.	all reports	Games and Virtual Worlds	all reports
Penning, drs. H.P.	all reports	Extern	all reports
Penninkx, MSc E.	all reports	Algorithmic Systems	all reports
Rooij, dr. J.M.M. van	all reports	Algorithms and Complexity	all reports
Schoone, dr. A.A.	all reports	Algorithmic Systems	all reports
Tan, dr. R.B.	all reports	Algorithmic Systems	all reports
Tel, dr. G.	all reports	Algorithms and Complexity	all reports
Thilikos, dr. D.M.	all reports	Algorithmic Systems	all reports
Timmer, MSc S.T.	all reports	Intelligent Systems	all reports
Verbaan, drs. P.R.A.	all reports	Algorithmic Systems	all reports
Wiedermann, prof. dr. J.	all reports	Algorithmic Systems	all reports
Wijshoff, prof. dr. H.A.G.	all reports	Algorithmic Systems	all reports
Wolle, Dipl Inf T.	all reports	Algorithmic Systems	all reports
Yamazaki, K.	all reports	Guests and Others	all reports
Zantema, dr. H.	all reports	Intelligent Systems	all reports

BibTeX entries

@TECHREPORT{UUCS2019012,
author = {Leeuwen, Jan~van and Wiedermann, Jiri},
year = 2019,
title = {Understanding Computation: A General Theory of Computational Processes},
number = {UU-CS-2019-012},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2019/2019-012.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2017010,
author = {Kloks, Ton and Tan, Richard~B. and Leeuwen, Jan~van},
year = 2017,
title = {Tracking Maximum Ascending Subsequences in Sequences of Partially Ordered Data},
number = {UU-CS-2017-010},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2017/2017-010.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2016007,
author = {Leeuwen, Jan~van and Wiedermann, Jiri},
year = 2016,
title = {Question Answering and Cognitive Automata with Background Intelligence},
number = {UU-CS-2016-007},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2016/2016-007.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2016004,
author = {Leeuwen, Jan~van},
year = 2016,
title = {On the Subsequence Theorem of Erdős and Szekeres},
number = {UU-CS-2016-004},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2016/2016-004.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2015016,
author = {Bodlaender, Hans and Boros, Endre and Heggernes, Pinar and Kratsch, Dieter},
year = 2015,
title = {Open Problems of the Lorentz Workshop, "Enumeration Algorithms using Structure"},
number = {UU-CS-2015-016},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2015/2015-016.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2015001,
author = {Leeuwen, Jan~van},
year = 2015,
title = {A Note on Recursively Enumerable Classes of Partial Recursive Functions},
number = {UU-CS-2015-001},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2015/2015-001.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2014020,
author = {Tan, Richard~B. and Leeuwen, Erik~Jan~van and Leeuwen, Jan~van},
year = 2014,
title = {Shortcutting Directed and Undirected Networks with a Degree Constraint},
number = {UU-CS-2014-020},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2014/2014-020.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2014014,
author = {Leeuwen, Jan~van and Wiedermann, Jiri},
year = 2014,
title = {Separating the Classes of Recursively Enumerable Languages Based on Machine Size},
number = {UU-CS-2014-014},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2014/2014-014.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2014003,
author = {Leeuwen, Jan~van and Wiedermann, Jiri},
year = 2014,
title = {Turing Machines with One-sided Advice and the Acceptance of the co-RE Languages},
number = {UU-CS-2014-003},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2014/2014-003.pdf}},
pubcat = {techreport}
}

@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 = {{http://www.cs.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2011/2011-003.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2010027,
author = {Bodlaender, Hans~L. and Kozawa, Kyohei and Matsushima, Takayoshi and Otachi, Yota},
year = 2010,
title = {Spanning tree congestion of k-outerplanar graphs},
number = {UU-CS-2010-027},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2010/2010-027.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2010026,
author = {Leeuwen, Erik~Jan~van and Leeuwen, Jan~van},
year = 2010,
title = {Convex Polygon Intersection Graphs},
number = {UU-CS-2010-026},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2010/2010-026.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2010024,
author = {Bodlaender, Hans~L. and Rooij, Johan~M.~M.~van},
year = 2010,
title = {Exact algorithms for Intervalizing Colored Graphs},
number = {UU-CS-2010-024},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2010/2010-024.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2010/2010-022.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2010007,
author = {Otachi, Yota and Bodlaender, Hans~L. and Leeuwen, Erik~Jan~van},
year = 2010,
title = {Complexity Results for the Spanning Tree Congestion Problem},
number = {UU-CS-2010-007},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2010/2010-007.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2010005,
author = {Rooij, Johan~M.~M.~van and Niekerk, Marcel~E.~van~Kooten and Bodlaender, Hans~L.},
year = 2010,
title = {Partitioning Sparse Graphs Into Triangles: Relations to exact satisfiability and very fast exponential time algorithms},
number = {UU-CS-2010-005},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2010/2010-005.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2009034,
author = {Leeuwen, Erik~Jan~van and Leeuwen, Jan~van},
year = 2009,
title = {Structure of Polynomial-Time Approximation},
number = {UU-CS-2009-034},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2009/2009-034.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2009025,
author = {Rooij, Johan~M.~M.~van and Bodlaender, Hans~L.},
year = 2009,
title = {Design by Measure and Conquer: Exact algorithms for dominating set},
number = {UU-CS-2009-025},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2009/2009-025.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2009/2009-023.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2009018,
author = {Kwisthout, Johan and Bodlaender, Hans~L.},
year = 2009,
title = {Conditional Lower Bounds on the Complexity of Probabilistic Inference},
number = {UU-CS-2009-018},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2009/2009-018.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2009012,
author = {Bodlaender, Hans~L. and Fomin, Fedor~V. and Lokshtanov, Daniel and Penninkx, Eelko and Saurabh, Saket and Thilikos, Dimitrios~M.},
year = 2009,
title = {(Meta) Kernelization},
number = {UU-CS-2009-012},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2009/2009-012.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2008043,
author = {Rooij, Johan~M.M.~van and Nederlof, Jesper and Dijk, Thomas~C.~van},
year = 2008,
title = {Inclusion/Exclusion Meets Measure and Conquer: Exact algorithms for counting dominating sets.},
number = {UU-CS-2008-043},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2008/2008-043.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2008042,
author = {Bodlaender, Hans~L. and Heggernes, Pinar and Villanger, Yngve},
year = 2008,
title = {Faster parameterized algorithms for Minimum Fill-In},
number = {UU-CS-2008-042},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2008/2008-042.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2008033,
author = {Bodlaender, Hans~L. and Fellows, Michael~R. and Heggernes, Pinar and Mancini, Federico and Papadopoulos, Charis and Rosamond, Frances},
year = 2008,
title = {Clustering with partial information},
number = {UU-CS-2008-033},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2008/2008-033.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2008/2008-032.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2008030,
author = {Bodlaender, Hans~L. and Thomassé, Stéphan and Yeo, Anders},
year = 2008,
title = {Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels},
number = {UU-CS-2008-030},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2008/2008-030.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2008017,
author = {Bodlaender, Hans~L. and Demaine, Erik~D. and Fellows, Michael~R. and Guo, Jiong and Hermelin, Danny and Lokshtanov, Daniel and Müller, Moritz and Raman, Venkatesh and Rooij, Johan~van and Rosamond, Frances~A.},
year = 2008,
title = {Open Problems in Parameterized and Exact Computation - IWPEC 2008},
number = {UU-CS-2008-017},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2008/2008-017.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2008005,
author = {Bodlaender, Hans~L. and Tan, Richard~B. and Dijk, Thomas~C.~van and Leeuwen, Jan~van},
year = 2008,
title = {Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint},
number = {UU-CS-2008-005},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2008/2008-005.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2007051,
author = {Rooij, Johan~M.~M.~van and Bodlaender, Hans~L.},
year = 2007,
title = {Exact Algorithms for Edge Domination},
number = {UU-CS-2007-051},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-051.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-051.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2007050,
author = {Kwisthout, Johan and Bodlaender, Hans~L. and Tel, Gerard},
year = 2007,
title = {Complexity Results for Local Monotonicity in Probabilistic Networks},
number = {UU-CS-2007-050},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-050.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-050.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2007046,
author = {Bodlaender, Hans~L. and Downey, Rodney~G. and R, Michael and Fellows and Hermelin, Danny},
year = 2007,
title = {On Problems Without Polynomial Kernels},
number = {UU-CS-2007-046},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-046.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2007035,
author = {Bodlaender, Hans~L. and Fellows, Michael~R. and Langston, Michael~A. and Ragan, Mark~A. and Rosamond, Frances~A. and Weyer, Mark},
year = 2007,
title = {Quadratic Kernelization of Convex Recoloring of Trees},
number = {UU-CS-2007-035},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-035.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2007031,
author = {Bodlaender, Hans~L. and Feremans, Corinne and Grigoriev, Alexander and Penninkx, Eelko and Sitters, René and Wolle, Thomas},
year = 2007,
title = {On the minimum corridor connection problem and other generalized geometric problems},
number = {UU-CS-2007-031},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-031.ps.gz}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2007024,
author = {Leeuwen, Jan~van and Tanca, Letizia},
year = 2007,
title = {Student Enrollment and Image of the Informatics Discipline},
number = {UU-CS-2007-024},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-024.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-024.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2007019,
author = {Bodlaender, Hans~L. and Grigoriev, Alexander and Grigorieva, Nadejda~V. and Hendriks, Albert},
year = 2007,
title = {The Valve Location Problem in Simple Network Topologies},
number = {UU-CS-2007-019},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-019.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-019.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2007009,
author = {Alt, Helmut and Bodlaender, Hans~L. and Kreveld, Marc~van and Rote, Günter and Tel, Gerard},
year = 2007,
title = {Wooden Geometric Puzzles: Design and Hardness Proofs},
number = {UU-CS-2007-009},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-009.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-009.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2006058,
author = {Kwisthout, Johan and Tel, Gerard},
year = 2006,
title = {Complexity Results for Enhanced Qualitative Probabilistic Networks},
number = {UU-CS-2006-058},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-058.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2006052,
author = {Bodlaender, Hans~L. and Cai, Leizhen and Chen, Jianer and Fellows, Michael~R. and Telle, Jan~Arne and Marx, Dániel},
year = 2006,
title = {Open Problems in Parameterized and Exact Computation - IWPEC 2006},
number = {UU-CS-2006-052},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-052.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-052.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2006042,
author = {Bodlaender, Hans~L.},
year = 2006,
title = {A Cubic Kernel for Feedback Vertex Set},
number = {UU-CS-2006-042},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-042.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-042.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2006041,
author = {Bodlaender, Hans~L.},
year = 2006,
title = {Treewidth: Characterizations, Applications, and Computations},
number = {UU-CS-2006-041},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-041.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-041.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2006037,
author = {Leeuwen, Erik~Jan~van and Leeuwen, J.~van},
year = 2006,
title = {On the Representation of Disk Graphs},
number = {UU-CS-2006-037},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-037.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-037.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-032.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-032.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2006018,
author = {Leeuwen, Jan~van and Wiederman, Jiri},
year = 2006,
title = {Lazy Autoconfiguration in Mobile Ad Hoc Networks and Dynamic Sets of Mobile Agents},
number = {UU-CS-2006-018},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-018.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-018.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2006017,
author = {Tel, Gerard},
year = 2006,
title = {Geheimschrift op de TI-83+},
number = {UU-CS-2006-017},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-017.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-015.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-015.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2006013,
author = {Bachoore, Emgad and Bodlaender, Hans~L.},
year = 2006,
title = {Weighted Treewidth: Algorithmic Techniques and Results},
number = {UU-CS-2006-013},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-013.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-013.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2006012,
author = {Bachoore, Emgad and Bodlaender, Hans~L.},
year = 2006,
title = {A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth},
number = {UU-CS-2006-012},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-012.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-012.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2006010,
author = {Bachoore, Emgad~H. and Bodlaender, Hans~L.},
year = 2006,
title = {Convex recoloring of leaf-colored trees},
number = {UU-CS-2006-010},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-010.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-010.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2006006,
author = {Dorn, Frederic and Penninkx, Eelko and Bodlaender, Hans~L. and Fomin, Fedor~V.},
year = 2006,
title = {Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions},
number = {UU-CS-2006-006},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-006.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-006.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2006001,
author = {Bakker, Erwin~M. and Bodlaender, Hans~L. and Tan, Richard~B. and Leeuwen, Jan~van},
year = 2006,
title = {Interval Routing and Minor-Monotone Graph Parameters},
number = {UU-CS-2006-001},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-001.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-001.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2005/2005-051.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2005/2005-051.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2005018,
author = {Bodlaender, Hans~L.},
year = 2005,
title = {Discovering Treewidth},
number = {UU-CS-2005-018},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2005/2005-018.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2005/2005-018.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2005011,
author = {Katriel, Irit and Bodlaender, Hans~L.},
year = 2005,
title = {Online Topological Ordering},
number = {UU-CS-2005-011},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2005/2005-011.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2005/2005-011.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2004066,
author = {Leeuwen, Erik~Jan~van},
year = 2004,
title = {Approximation Algorithms for Unit Disk Graphs},
number = {UU-CS-2004-066},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-066.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-066.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2004058,
author = {Grigoriev, Alexander and Bodlaender, Hans~L.},
year = 2004,
title = {Algorithms for graphs embeddable with few crossings per edge},
number = {UU-CS-2004-058},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-058.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-058.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-053.ps.gz}},
urlpdf = {{http://www.cs.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-050.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-050.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-042.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-042.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2004036,
author = {Bachoore, Emgad~H. and Bodlaender, Hans~L.},
year = 2004,
title = {New Upper Bound Heuristics for Treewidth},
number = {UU-CS-2004-036},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-036.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-036.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-034.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-034.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2004031,
author = {Bodlaender, Hans~L. and Wolle, Thomas},
year = 2004,
title = {Contraction Degeneracy on Cographs},
number = {UU-CS-2004-031},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-031.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-031.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2004030,
author = {Bodlaender, Hans~L. and Telle, Jan~Arne},
year = 2004,
title = {Space-efficient construction variants of dynamic programming},
number = {UU-CS-2004-030},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-030.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-030.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2004028,
author = {Wolle, Thomas and Bodlaender, Hans~L.},
year = 2004,
title = {A Note on Edge Contraction},
number = {UU-CS-2004-028},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-028.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-028.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2004018,
author = {Verbaan, Peter and Leeuwen, Jan~van and Wiedermann, Jiri},
year = 2004,
title = {Lineages of Automata},
number = {UU-CS-2004-018},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-018.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-018.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2004010,
author = {Bodlaender, Hans~L. and Fomin, Fedor~V.},
year = 2004,
title = {Equitable colorings of bounded treewidth graphs},
number = {UU-CS-2004-010},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-010.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-010.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2004001,
author = {Bodlaender, Hans~L. and Wolle, Thomas},
year = 2004,
title = {A Note on the Complexity of Network Reliability Problems},
number = {UU-CS-2004-001},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-001.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-001.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2003/2003-038.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2003/2003-038.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2003033,
author = {Bodlaender, Hans~L. and Tel, Gerard},
year = 2003,
title = {Rectilinear Graphs and Angular Resolution},
number = {UU-CS-2003-033},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2003/2003-033.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2003/2003-033.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2003/2003-027.ps.gz}},
urlpdf = {{http://www.cs.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2003/2003-001.ps.gz}},
urlpdf = {{http://www.cs.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2002/2002-051.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2002/2002-051.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2002032,
author = {Bodlaender, Hans~L. and Fellows, Michael~R. and Thilikos, Dimitrios~M.},
year = 2002,
title = {Derivation of algorithms for cutwidth and related graph layout problems},
number = {UU-CS-2002-032},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2002/2002-032.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2002/2002-032.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2002026,
author = {Bodlaender, Hans~L. and Broersma, Hajo~J. and Fomin, Fedor~V. and Pyatkin, Artem~V. and Woeginer, Gerhard~J.},
year = 2002,
title = {Radio labeling with pre-assigned frequencies},
number = {UU-CS-2002-026},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2002/2002-026.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2002/2002-026.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2002002,
author = {Wiedermann, J. and Leeuwen, J.~van},
year = 2002,
title = {The emergent computational potential of evolving artificial living systems},
number = {UU-CS-2002-002},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2002/2002-002.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2002/2002-002.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS2002001,
author = {Bodlaender, Hans~L. and Fomin, Fedor~V.},
year = 2002,
title = {Tree decompositions with small cost},
number = {UU-CS-2002-001},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2002/2002-001.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2002/2002-001.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-49.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-49.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS200122,
author = {Bodlaender, H.~L. and Rotics, U.},
year = 2001,
title = {Computing the treewidth and the minimum fill-in with the modular decomposition},
number = {UU-CS-2001-22},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-22.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-22.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS200115,
author = {Bodlaender, H.~L. and Dinneen, M.~J. and Khoussainov, B.},
year = 2001,
title = {Relaxed Update and Partition Network Games},
number = {UU-CS-2001-15},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-15.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-15.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS200108,
author = {Bodlaender, H.~L.},
year = 2001,
title = {A generic NP-hardness proof for a variant of Graph Coloring},
number = {UU-CS-2001-08},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-08.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-08.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS200104,
author = {Thilikos, D.~M. and Serna, M.~J. and Bodlaender, H.~L.},
year = 2001,
title = {A polynomial algorithm for the cutwidth of bounded degree graphs with small treewidth},
number = {UU-CS-2001-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-04.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-04.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS200102,
author = {Leeuwen, J.~van and Wiedermann, J.},
year = 2001,
title = {A computational model of interaction in embedded systems},
number = {UU-CS-2001-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-02.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-02.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-42.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-42.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS200038,
author = {Thilikos, D.~M. and Bodlaender, H.~L.},
year = 2000,
title = {Constructive linear time algorithms for branchwidth},
number = {UU-CS-2000-38},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-38.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-38.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS200033,
author = {Leeuwen, J.~van and Wiedermann, J.},
year = 2000,
title = {The Turing machine paradigm in contemporary computing},
number = {UU-CS-2000-33},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-33.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-33.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS200029,
author = {Bodlaender, H.~L. and Tan, R.~B. and Leeuwen, J.~van},
year = 2000,
title = {Finding a Delta-regular supergraph of minimum order},
number = {UU-CS-2000-29},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-29.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-29.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS200028,
author = {Alber, J. and Bodlaender, H.~L. and Fernau, H. and Niedermeier, R.},
year = 2000,
title = {Fixed parameter algorithms for planar dominating set},
number = {UU-CS-2000-28},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-28.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-28.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS200027,
author = {Bodlaender, H.~L.},
year = 2000,
title = {Necessary edges in k-chordalizations of graphs},
number = {UU-CS-2000-27},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-27.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-27.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS200025,
author = {Bodlaender, H.~L. and Kloks, T. and Tan, R.~B. and Leeuwen, J.~van},
year = 2000,
title = {Approximations for Lambda-coloring of graphs},
number = {UU-CS-2000-25},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-25.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-25.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS200024,
author = {Thilikos, D.~M. and Serna, M.~J. and Bodlaender, H.~L.},
year = 2000,
title = {A constructive linear time algorithm for small cutwidth},
number = {UU-CS-2000-24},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-24.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-24.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS200023,
author = {Bodlaender, H.~L. and Fomin, F.~V.},
year = 2000,
title = {Approximation of pathwidth of outerplanar graphs},
number = {UU-CS-2000-23},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-23.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-23.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199931,
author = {Zantema, H. and Bodlaender, H.~L.},
year = 1999,
title = {Sizes of decision tables and decision trees},
number = {UU-CS-1999-31},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1999/1999-31.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1999/1999-31.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199902,
author = {Zantema, H. and Bodlaender, H.~L.},
year = 1999,
title = {Finding small equivalent decision trees is hard},
number = {UU-CS-1999-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1999/1999-02.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1999/1999-02.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199843,
author = {Tel, G.},
year = 1998,
title = {Cryptografie: van DES tot Chipknip},
number = {UU-CS-1998-43},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-43.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-43.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199842,
author = {Dobrev, S. and Ruzicka, P. and Tel, G.},
year = 1998,
title = {Time and bit optimal broadcasting on anonymous unoriented hypercubes},
number = {UU-CS-1998-42},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-42.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-42.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199817,
author = {Tel, G.},
year = 1998,
title = {Distributed control for AI},
number = {UU-CS-1998-17},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-17.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-17.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199815,
author = {Bodlaender, H.~L.},
year = 1998,
title = {A note on domino treewidth},
number = {UU-CS-1998-15},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-15.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-15.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199805,
author = {Bodlaender, H.~L. and Thilikos, D.~M.},
year = 1998,
title = {Computing small search numbers in linear time},
number = {UU-CS-1998-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-05.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-05.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199742,
author = {Gaag, L.~C.~van~der and Bodlaender, H.~L.},
year = 1997,
title = {Comparing loop cutsets and clique trees in probabilistic inference},
number = {UU-CS-1997-42},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-42.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-42.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199737,
author = {Bodlaender, H.~L. and Thilikos, D.~M.},
year = 1997,
title = {Graphs with branchwidth at most three},
number = {UU-CS-1997-37},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-37.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-37.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199731,
author = {Bodlaender, H.~L.},
year = 1997,
title = {Treewidth: Algorithmic results and techniques},
number = {UU-CS-1997-31},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-31.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-31.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199724,
author = {Bodlaender, Hans~L. and Fluiter, Babette~de},
year = 1997,
title = {Reduction algorithms for graphs of small treewidth},
number = {UU-CS-1997-24},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-24.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-24.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199723,
author = {Fluiter, Babette~de and Bodlaender, Hans~L.},
year = 1997,
title = {Parallel algorithms for treewidth two},
number = {UU-CS-1997-23},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-23.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-23.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199721,
author = {Bodlaender, Hans~L. and Fluiter, Babette~de},
year = 1997,
title = {Parallel algorithms for series parallel graphs},
number = {UU-CS-1997-21},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-21.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-21.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-05.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-05.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199704,
author = {Fluiter, Babette~de and Bodlaender, Hans~L.},
year = 1997,
title = {Intervalizing sandwich graphs},
number = {UU-CS-1997-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-04.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-04.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199641,
author = {Bodlaender, H.~L. and Leeuwen, J.~van and Tan, R.~B. and Thilikos, D.~M.},
year = 1996,
title = {On Interval Routing Schemes and Treewidth},
number = {UU-CS-1996-41},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-41.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-41.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199630,
author = {Thilikos, D.~M. and Bodlaender, H.~L.},
year = 1996,
title = {Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems},
number = {UU-CS-1996-30},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-30.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-30.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-29.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-29.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199613,
author = {Bodlaender, Hans~L. and Fluiter, Babette~de},
year = 1996,
title = {Parallel algorithms for series parallel graphs},
number = {UU-CS-1996-13},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-13.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-13.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199602,
author = {Bodlaender, H.~L.},
year = 1996,
title = {A partial k-arboretum of graphs with bounded treewidth},
number = {UU-CS-1996-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-02.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-02.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199537,
author = {Bodlaender, Hans~L. and Fluiter, Babette~de},
year = 1995,
title = {Reduction algorithms for graphs with small treewidth},
number = {UU-CS-1995-37},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-37.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-37.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199536,
author = {Bodlaender, H.~L. and Fellows, M.~R. and Hallett, M.~T. and Wareham, H.~T. and Warnow, T.~J.},
year = 1995,
title = {The hardness of problems on thin colored graphs},
number = {UU-CS-1995-36},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-36.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-36.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-34.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-34.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199525,
author = {Bodlaender, H.~L. and Hagerup, T.},
year = 1995,
title = {Parallel algorithms with optimal speedup for bounded treewidth},
number = {UU-CS-1995-25},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-25.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-25.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199520,
author = {Bodlaender, Hans~L. and Fluiter, Babette~de},
year = 1995,
title = {On intervalizing k-colored graphs for DNA physical mapping},
number = {UU-CS-1995-20},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-20.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-20.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199516,
author = {Flammini, M. and Leeuwen, J.~van and Marchetti-Spaccamela, A.},
year = 1995,
title = {The Complexity of Interval Routing on Random Graphs},
number = {UU-CS-1995-16},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-16.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199515,
author = {Bodlaender, Hans~L. and Fluiter, Babette~de},
year = 1995,
title = {Intervalizing k-colored graphs},
number = {UU-CS-1995-15},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-15.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-15.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199513,
author = {Leeuwen, J.~van and Santoro, N. and Urrutia, J. and Zaks, S.},
year = 1995,
title = {Guessing Games, Binomial Sum Trees and Distributed Computations in Synchronous Networks},
number = {UU-CS-1995-13},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-13.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199505,
author = {Leeuwen, J.~van and Tan, R.B.},
year = 1995,
title = {Compact Routing Methods: A Survey},
number = {UU-CS-1995-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-05.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-03.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-03.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199502,
author = {Bodlaender, H.~L. and Thilikos, D.~M.},
year = 1995,
title = {Treewidth and small separators for graphs with small chordality},
number = {UU-CS-1995-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-02.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-02.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199501,
author = {Bodlaender, H.~L. and Downey, R.~G. and Fellows, M.~R. and Wareham, H.~T.},
year = 1995,
title = {The parameterized complexity of sequence alignment and consensus},
number = {UU-CS-1995-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-01.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-01.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199414,
author = {Bodlaender, H.~L. and Fellows, M.~R.},
year = 1994,
title = {W[2]-hardness of Precedence Constrained K-processor Scheduling},
number = {UU-CS-1994-14},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-14.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-14.pdf}},
pubcat = {techreport}
}

@TECHREPORT{UUCS199411,
author = {Bodlaender, H.~L. and Engelfriet, J.},
year = 1994,
title = {Domino treewidth},
number = {UU-CS-1994-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-11.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-11.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9339,
author = {Tel, G.},
year = 1993,
title = {Linear election for oriented hypercubes},
number = {RUU-CS-93-39},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-39.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-39.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9337,
author = {Herman, T. and Tel, G.},
year = 1993,
title = {Advanced Distributed Algorithms},
number = {RUU-CS-93-37},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-37.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9327,
author = {Bodlaender, H.~L. and Kloks, T.},
year = 1993,
title = {Efficient and constructive algorithms for the pathwidth and treewidth of graphs},
number = {RUU-CS-93-27},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-27.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-27.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9235,
author = {Kloks, T. and Bodlaender, H.},
year = 1992,
title = {Only few graphs have bounded treewidth},
number = {RUU-CS-92-35},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-35.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-30.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9229,
author = {Kloks, A.J.J. and Bodlaender, H.L.},
year = 1992,
title = {Approximating treewidth and pathwidth of some classes of perfect graphs},
number = {RUU-CS-92-29},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-29.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9227,
author = {Bodlaender, H.~L.},
year = 1992,
title = {A linear time algorithm for finding tree-decompositions of small treewidth},
number = {RUU-CS-92-27},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-27.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-27.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9213,
author = {Kloks, T. and Bodlaender, H.L.},
year = 1992,
title = {On the Treewidth and Pathwidth of Permutation Graphs},
number = {RUU-CS-92-13},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-13.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9212,
author = {Bodlaender, H.~L.},
year = 1992,
title = {A tourist guide through Treewidth},
number = {RUU-CS-92-12},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-12.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-12.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9209,
author = {Kloks, T. and Bodlaender, H.L.},
year = 1992,
title = {Testing superperfection of $k-$trees},
number = {RUU-CS-92-09},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-09.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9208,
author = {Bodlaender, H.L. and Fellows, M.R. and Warnow, T.J.},
year = 1992,
title = {Two strikes against perfect phylogeny},
number = {RUU-CS-92-08},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-08.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9207,
author = {Kant, G. and Bodlaender, H.L.},
year = 1992,
title = {Triangslating planar graphs while minimizing the maximum degree},
number = {RUU-CS-92-07},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-07.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9149,
author = {Bodlaender, H.~L.},
year = 1991,
title = {Kayles on special classes of graphs - An application of Sprague-Grundy theory},
number = {RUU-CS-91-49},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-49.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-49.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9144,
author = {Bodlaender, H.L. and Jansen, K.},
year = 1991,
title = {Restrictions of graph partition problems. Part I.},
number = {RUU-CS-91-44},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-44.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9139,
author = {Bodlaender, H.~L. and Jansen, K.},
year = 1991,
title = {On the complexity of the maximum cut problem},
number = {RUU-CS-91-39},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-39.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-39.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9135,
author = {Bodlaender, H.L. and Gonzalez, T. and Kloks, T.},
year = 1991,
title = {Complexity aspects of 2-dimensional data compression},
number = {RUU-CS-91-35},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-35.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9132,
author = {Mattern, F. and Mehl, H. and Schoone, A.~A. and Tel, G.},
year = 1991,
title = {Global virtual time approximation with distributed termination detection algorithms},
number = {RUU-CS-91-32},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-32.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-32.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9125,
author = {Kant, G. and Bodlaender, H.L.},
year = 1991,
title = {Planar graph augmentation problems},
number = {RUU-CS-91-25},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-25.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9123,
author = {Bakker, E.M. and Leeuwen, J.~van},
year = 1991,
title = {The optimal placement of replicated items in distributed databases on tree-like networks},
number = {RUU-CS-91-23},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-23.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9122,
author = {Bakker, E.M. and Leeuwen, J.~van},
year = 1991,
title = {Some domination problems on trees and on general grahps},
number = {RUU-CS-91-22},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-22.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9121,
author = {Bakker, E.M. and Leeuwen, J.~van},
year = 1991,
title = {Uniform d-emulations of rings, with an application to distributed virtual ring contruction},
number = {RUU-CS-91-21},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-21.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9113,
author = {Bodlaender, H.L. and Kloks, A.J..},
year = 1991,
title = {A simple linear time algorithm for triangulating three-colored graphs},
number = {RUU-CS-91-13},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-13.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9108,
author = {Tel, G.},
year = 1991,
title = {Network Orientation},
number = {RUU-CS-91-08},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-08.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-08.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9107,
author = {Bakker, E.M. and Leeuwen, J.~van and Tan, R.B.},
year = 1991,
title = {Linear interval routing schemes},
number = {RUU-CS-91-07},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-07.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 = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-03.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9101,
author = {Bodlaender, H.L. and Gilbert, J.R. and Hafsteinsson, H. and Kloks, T.},
year = 1991,
title = {Approximating treewidth, pathwidth, and minimum elimination tree height},
number = {RUU-CS-91-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-01.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9035,
author = {Bakker, E.M. and Leeuwen, J.~van and Tan, R.B.},
year = 1990,
title = {Perfect Colorings},
number = {RUU-CS-90-35},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-35.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9029,
author = {Bodlaender, H.L.},
year = 1990,
title = {On disjoint cycles in graphs},
number = {RUU-CS-90-29},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-29.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9026,
author = {Poutré, J.A.~La and Leeuwen, J.~van and Overmars, M.H.},
year = 1990,
title = {Maintaining 2- and 3-connected components in graphs, Part I: 2- and 3-edge-connected components},
number = {RUU-CS-90-26},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-26.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9024,
author = {Tel, G. and Mattern, F.},
year = 1990,
title = {The derivation of distributed termination detection algorithms from garbage collection schemes},
number = {RUU-CS-90-24},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-24.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-24.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9016,
author = {Kant, G. and Leeuwen, J.~van},
year = 1990,
title = {The file distribution problem for processor networks},
number = {RUU-CS-90-16},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-16.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9015,
author = {Kant, G. and Leeuwen, J.~van},
year = 1990,
title = {Strong colorings of graphs},
number = {RUU-CS-90-15},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-15.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9011,
author = {Bodlaender, H. and Kloks, T.},
year = 1990,
title = {Fast algorithms for the Tron game on trees},
number = {RUU-CS-90-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-11.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9010,
author = {Bakker, E.M. and Leeuwen, J.~van and Tan, R.B.},
year = 1990,
title = {Prefix routing schemes in dynamic networks},
number = {RUU-CS-90-10},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-10.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS9007,
author = {Bodlaender, H.L. and Möhring, R.H.},
year = 1990,
title = {The pathwidth and treewidth of cographs},
number = {RUU-CS-90-07},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-07.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8934,
author = {Leeuwen, J.~van},
year = 1989,
title = {Correctness of the two-phase commit protocol},
number = {RUU-CS-89-34},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1989/1989-34.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8929,
author = {Bodlaender, H.L.},
year = 1989,
title = {Complexity of path-forming games},
number = {RUU-CS-89-29},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1989/1989-29.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8927,
author = {Bodlaender, H.L.},
year = 1989,
title = {On the complexity of some coloring games},
number = {RUU-CS-89-27},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1989/1989-27.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8923,
author = {Tel, G. and Leeuwen, J.~van and Wijshoff, H.A.G.},
year = 1989,
title = {The one-dimensional skewing problem},
number = {RUU-CS-89-23},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1989/1989-23.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8922,
author = {Bodlaender, H.~L. and Tel, G. and Santoro, N.},
year = 1989,
title = {Trade-offs in non-reversing diameter},
number = {RUU-CS-89-22},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1989/1989-22.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1989/1989-22.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8906,
author = {Scholten, B. and Leeuwen, J.~van},
year = 1989,
title = {Structured NC},
number = {RUU-CS-89-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1989/1989-06.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8903,
author = {Knijnenburg, P.M.W. and Leeuwen, J.~van},
year = 1989,
title = {On models for Propositional Dynamic Logic},
number = {RUU-CS-89-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1989/1989-03.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8902,
author = {Bodlaender, H.L. and Tel, G.},
year = 1989,
title = {Bit-optimal election in synchronous rings},
number = {RUU-CS-89-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1989/1989-02.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8901,
author = {Bodlaender, H.L.},
year = 1989,
title = {On linear time minor tests and depth first search},
number = {RUU-CS-89-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1989/1989-01.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8840,
author = {Schoone, A.A. and Tel, G.},
year = 1988,
title = {Transformation of a termination detection algorithm and its assertional correctness proof},
number = {RUU-CS-88-40},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-40.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8839,
author = {Brandenburg, F.J. and Leeuwen, J.~van and Tan, R.B.},
year = 1988,
title = {Some observations for the pigeon hole principle},
number = {RUU-CS-88-39},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-39.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8833,
author = {Bodlaender, H.L. and Moran, S. and Warmuth, M.K.},
year = 1988,
title = {The distributed bit complexity of the ring; from the anonymous to the non-anonymous case},
number = {RUU-CS-88-33},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-33.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8831,
author = {Beame, P.W. and Bodlaender, H.L.},
year = 1988,
title = {Distributed computing on transitive networks; the torus},
number = {RUU-CS-88-31},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-31.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8829,
author = {Bodlaender, H.L.},
year = 1988,
title = {Improved self-reduction algorithms for graphs with bounded treewidth},
number = {RUU-CS-88-29},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-29.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8825,
author = {Bodlaender, H.L.},
year = 1988,
title = {ACHROMATIC NUMBER is NP-complete for cographs and interval graphs},
number = {RUU-CS-88-25},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-25.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8823,
author = {Tel, G. and Korach, E. and Zaks, S.},
year = 1988,
title = {Optimal Synchronization of ABD Networks},
number = {RUU-CS-88-23},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-23.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-23.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8818,
author = {Bodlaender, H.L.},
year = 1988,
title = {New lower bound techniques for distributed leader finding and other problems on rings of processors},
number = {RUU-CS-88-18},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-18.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8817,
author = {Leeuwen, J.~van and Tsakalides, A.K.},
year = 1988,
title = {An optimal pointer machine algorithm for finding nearest common ancestors},
number = {RUU-CS-88-17},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-17.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8816,
author = {Tel, G.},
year = 1988,
title = {Total algorithms},
number = {RUU-CS-88-16},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-16.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-16.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8814,
author = {Bodlaender, H.L.},
year = 1988,
title = {Planar graphs with bounded treewidth},
number = {RUU-CS-88-14},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-14.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8813,
author = {Drost, N.J. and Leeuwen, J.~van},
year = 1988,
title = {Assertional verification of a majority consensus algorithm for concurrency control in multiple copy databases},
number = {RUU-CS-88-13},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-13.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8809,
author = {Leeuwen, J.~van},
year = 1988,
title = {The client/server model in distributed computing},
number = {RUU-CS-88-09},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-09.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8806,
author = {Schoone, A.A. and Tel, G.},
year = 1988,
title = {Assertional verification of a termination detection algorithm},
number = {RUU-CS-88-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-06.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8804,
author = {Bodlaender, H.L.},
year = 1988,
title = {NC-algorithms for graphs of small treewidth},
number = {RUU-CS-88-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-04.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8725,
author = {Poutré, J.A.~La and Leeuwen, J.~van},
year = 1987,
title = {Maintenance of transitive closures and transitive reductions of graphs},
number = {RUU-CS-87-25},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1987/1987-25.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8722,
author = {Bodlaender, H.L.},
year = 1987,
title = {Dynamic programming on graphs with bounded treewidth},
number = {RUU-CS-87-22},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1987/1987-22.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8717,
author = {Bodlaender, H.L.},
year = 1987,
title = {Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees},
number = {RUU-CS-87-17},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1987/1987-17.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8715,
author = {Tel, G.},
year = 1987,
title = {Assertional verification of a timer-based protocol},
number = {RUU-CS-87-15},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1987/1987-15.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8713,
author = {Bodlaender, H.L.},
year = 1987,
title = {A better lowerbound for distributed leader finding in bidirectional asynchronous rings of processors},
number = {RUU-CS-87-13},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1987/1987-13.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8712,
author = {Bodlaender, H.L.},
year = 1987,
title = {The maximum cut and minimum cut into bounded sets problems on cographs},
number = {RUU-CS-87-12},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1987/1987-12.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8711,
author = {Bodlaender, H.L.},
year = 1987,
title = {A new lowerbound technique for distributed extrema finding on rings of processors},
number = {RUU-CS-87-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1987/1987-11.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8710,
author = {Gafni, E. and Raynal, M. and Santoro, N. and Leeuwen, J.~van and Zaks, S. (no~longer~available and Science), revised~version~to~appear~in~the~series~Lecture~Notes~in~Computer},
year = 1987,
title = {2nd International Workshop on Distributed Algorithms (draft papers)},
number = {RUU-CS-87-10},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8707,
author = {Bezem, G.J. and Leeuwen, J.~van},
year = 1987,
title = {Enumeration in graphs},
number = {RUU-CS-87-07},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1987/1987-07.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8706,
author = {Tel, G.},
year = 1987,
title = {Directed network protocols (revised edition)},
number = {RUU-CS-87-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1987/1987-06.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8701,
author = {Leeuwen, J.~van and Wood, D.},
year = 1987,
title = {Interval heaps},
number = {RUU-CS-87-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1987/1987-01.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8622,
author = {Bodlaender, H.L.},
year = 1986,
title = {Classes of graphs with bounded tree-width},
number = {RUU-CS-86-22},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1986/1986-22.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8617,
author = {Leeuwen, J.~van},
year = 1986,
title = {Graph algorithms (95 p.)},
number = {RUU-CS-86-17},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1986/1986-17.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8612,
author = {Tel, G.},
year = 1986,
title = {Distributed infimum approximation},
number = {RUU-CS-86-12},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1986/1986-12.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8611,
author = {G.Tel and Tan, R.B. and Leeuwen, J.~van},
year = 1986,
title = {The derivation of graph marking algorithms from distributed termination detection protocols},
number = {RUU-CS-86-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1986/1986-11.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8608,
author = {G.Tel and Leeuwen, J.~van and Wijshoff, H.A.G.},
year = 1986,
title = {The one-dimensional skewing problem},
number = {RUU-CS-86-08},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8607,
author = {Leeuwen, J.~van and Tan, R.B.},
year = 1986,
title = {Very thin VLSI-layouts of complete binary trees},
number = {RUU-CS-86-07},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1986/1986-07.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8606,
author = {Bodlaender, H.L. and Leeuwen, J.~van},
year = 1986,
title = {Distribution of records on a ring of processors},
number = {RUU-CS-86-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1986/1986-06.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8602,
author = {Tan, R.B. and Leeuwen, J.~van},
year = 1986,
title = {General symmetric distributed termination detection},
number = {RUU-CS-86-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1986/1986-02.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8601,
author = {Schoone, A.A. and Leeuwen, J.~van},
year = 1986,
title = {Simulation of parallel algorithms on a distributed network},
number = {RUU-CS-86-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1986/1986-01.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8526,
author = {A.Schoone and H.L.Bodlaender and Leeuwen, J.van},
year = 1985,
title = {Diameter increase caused by edge deletion},
number = {RUU-CS-85-26},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-26.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8525,
author = {H.L.Bodlaender},
year = 1985,
title = {Deadlock-free packet switching networks with variable packet size},
number = {RUU-CS-85-25},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-25.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8524,
author = {G.Tel and Wijshoff, H.A.G.},
year = 1985,
title = {Hierarchical memory systems in multiprocessors and multi-periodic skewing schemes},
number = {RUU-CS-85-24},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-24.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8523,
author = {Leeuwen, J.~van and Tan, R.B.},
year = 1985,
title = {An improved upperbound for distributed election in bidirectional rings of processors},
number = {RUU-CS-85-23},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-23.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8522,
author = {H.L.Bodlaender},
year = 1985,
title = {Some lowerbound results for decentralized extrema-finding in rings of processors},
number = {RUU-CS-85-22},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-22.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8520,
author = {H.L.Bodlaender},
year = 1985,
title = {Emulations of processor networks with buses},
number = {RUU-CS-85-20},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-20.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8518,
author = {H.L.Bodlaender},
year = 1985,
title = {Finding grid embeddings with bounded maximum edge length is NP-complete},
number = {RUU-CS-85-18},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-18.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8516,
author = {Leeuwen, J.~van and Tan, R.B.},
year = 1985,
title = {Interval routing},
number = {RUU-CS-85-16},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-16.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8515,
author = {H.L.Bodlaender and Leeuwen, J.~van},
year = 1985,
title = {New upperbounds for decentralized extremafinding in a ring of processors},
number = {RUU-CS-85-15},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-15.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8514,
author = {H.L.Bodlaender},
year = 1985,
title = {The complexity of finding uniform emulations on fixed graphs},
number = {RUU-CS-85-14},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-14.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8512,
author = {Schoone, A.A. and Leeuwen, J.~van},
year = 1985,
title = {Verification of balanced link-level protocols},
number = {RUU-CS-85-12},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-12.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8511,
author = {H.L.Bodlaender},
year = 1985,
title = {The classification of coverings of processor networks},
number = {RUU-CS-85-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-11.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8510,
author = {H.L.Bodlaender},
year = 1985,
title = {On Approximation algorithms for determining minimum cost emulations},
number = {RUU-CS-85-10},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-10.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8509,
author = {Pluimakers, G.M.J. and Leeuwen, J.~van},
year = 1985,
title = {Authentication (abstract in het engels als -85-9a)},
number = {RUU-CS-85-09},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-09.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8507,
author = {Katajainen, J. and Leeuwen, J.~van and Penttonen, M.},
year = 1985,
title = {Fast simulation of Turing machines by random access machines},
number = {RUU-CS-85-07},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-07.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8505,
author = {H.L.Bodlaender},
year = 1985,
title = {The complexity of finding uniform emulations on paths and ring networks},
number = {RUU-CS-85-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-05.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8504,
author = {H.L.Bodlaender and Leeuwen, J.van},
year = 1985,
title = {On the complexity of finding uniform emulations},
number = {RUU-CS-85-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1985/1985-04.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8501,
author = {Leeuwen, J.~van},
year = 1985,
title = {$ast$ Pascal; compact reference guide to the programming language},
number = {RUU-CS-85-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8413,
author = {Leeuwen, J.~van and Wiedermann, J.},
year = 1984,
title = {Array Processing Machines},
number = {RUU-CS-84-13},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1984/1984-13.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8409,
author = {Bodlaender, H.L.},
year = 1984,
title = {Uniform emulations of two different types of shuffle-exchange networks},
number = {RUU-CS-84-09},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1984/1984-09.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8407,
author = {J.Tappe and Leeuwen, J.~van and Wijshoff, H.A.G.},
year = 1984,
title = {Parallel memories, periodic skewing schemes, and the theory of finite abelian groups},
number = {RUU-CS-84-07},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1984/1984-07.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8405,
author = {Bodlaender, H.L. and Leeuwen, J.~van},
year = 1984,
title = {Uniform emulations of the shuffle-exchange network},
number = {RUU-CS-84-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1984/1984-05.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8404,
author = {Bodlaender, H.L. and Leeuwen, J.~van},
year = 1984,
title = {Simulation of large networks on smaller networks},
number = {RUU-CS-84-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1984/1984-04.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8402,
author = {Bodlaender, H.L. and Leeuwen, J.~van},
year = 1984,
title = {The minimum bisection width of (three-dimensional) blocks},
number = {RUU-CS-84-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1984/1984-02.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8401,
author = {Wijshoff, H.A.G. and Leeuwen, J.~van},
year = 1984,
title = {The structure of periodic storage schemes for parallel memories},
number = {RUU-CS-84-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1984/1984-01.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8318,
author = {Penning, H.P. and Leeuwen, J.~van},
year = 1983,
title = {Operating Systems (231 p. in Dutch)},
number = {RUU-CS-83-18},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8316,
author = {Leeuwen, J.~van and Tan, R.B.},
year = 1983,
title = {Routing with compact routing tables},
number = {RUU-CS-83-16},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1983/1983-16.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8314,
author = {Leeuwen, J.~van},
year = 1983,
title = {The technological image of ``1984'' (in Dutch)},
number = {RUU-CS-83-14},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8313,
author = {Leeuwen, J.~van},
year = 1983,
title = {Parallel computers and algorithms},
number = {RUU-CS-83-13},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1983/1983-13.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8311,
author = {Leeuwen, J.~van and Wijshoff, H.A.G.},
year = 1983,
title = {Data mappings in large parallel computers},
number = {RUU-CS-83-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1983/1983-11.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8310,
author = {Wijshoff, H.A.G. and Leeuwen, J.~van},
year = 1983,
title = {A linearity condition for periodic skewing schemes},
number = {RUU-CS-83-10},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1983/1983-10.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8307,
author = {Wijshoff, H.A.G. and Leeuwen, J.~van},
year = 1983,
title = {On linear skewing schemes and d ordered vectors},
number = {RUU-CS-83-07},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1983/1983-07.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8304,
author = {Wijshoff, H.A.G. and Leeuwen, J.~van},
year = 1983,
title = {Periodic storage schemes with a minimum number of memory banks},
number = {RUU-CS-83-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1983/1983-04.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8301,
author = {Bodlaender, H.L. and Wijshoff, H.A.G. and Leeuwen, J.~van},
year = 1983,
title = {Compositions of double diagonal and cross Latin squares},
number = {RUU-CS-83-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1983/1983-01.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8211,
author = {Wijshoff, H.A.G. and Leeuwen, J.~van},
year = 1982,
title = {Periodic versus arbitrary tessellations of the plane using polyominos of single type},
number = {RUU-CS-82-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1982/1982-11.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8209,
author = {Kramer, M.R. and Leeuwen., J.~van},
year = 1982,
title = {Systolic computation and VLSI},
number = {RUU-CS-82-09},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1982/1982-09.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8208,
author = {Leeuwen., J.~van},
year = 1982,
title = {Distributed computing},
number = {RUU-CS-82-08},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1982/1982-08.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8207,
author = {Kramer, M.R. and Leeuwen, J.~van},
year = 1982,
title = {The complexity of VLSI-circuits for arbitrary Boolean functions (to appear)},
number = {RUU-CS-82-07},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1982/1982-07.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8206,
author = {Kramer, M.R. and Leeuwen, J.~van},
year = 1982,
title = {The NP-completeness of finding minimum area Layouts for VLSI-circuits (to appear)},
number = {RUU-CS-82-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1982/1982-06.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8204,
author = {Kramer, M.R. and Leeuwen, J.~van},
year = 1982,
title = {Wire routing in NP-complete},
number = {RUU-CS-82-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1982/1982-04.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8201,
author = {J and Leeuwen, van},
year = 1982,
title = {Fundamental Algorithms (in Dutch)},
number = {RUU-CS-82-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8118,
author = {Leeuwen, J.~van},
year = 1981,
title = {Graphics and computational geometry},
number = {RUU-CS-81-18},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1981/1981-18.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8116,
author = {Leeuwen, J.~van},
year = 1981,
title = {The bounded aspect ratio problem for VLSI},
number = {RUU-CS-81-16},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1981/1981-16.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8114,
author = {Birkhoff, I.J.M. and Leeuwen, J.~van},
year = 1981,
title = {Organisatie van bedrijfssystemen voor computer netwerken},
number = {RUU-CS-81-14},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1981/1981-14.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8113,
author = {Leeuwen, J.~van and Overmars, M.H. and Wood, D.},
year = 1981,
title = {VLSI layouts of perfect binary trees (to appear)},
number = {RUU-CS-81-13},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8108,
author = {Leeuwen, J.~van and Overmars, M.H.},
year = 1981,
title = {The art of dynamizing},
number = {RUU-CS-81-08},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1981/1981-08.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8106,
author = {Bohm, A.P.W. and Leeuwen, J.~van},
year = 1981,
title = {A basis for dataflow computing},
number = {RUU-CS-81-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1981/1981-06.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8104,
author = {Leeuwen, J.~van and Overmars, M.H.},
year = 1981,
title = {Stratified balanced search trees},
number = {RUU-CS-81-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1981/1981-04.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8103,
author = {Overmars, M.H. and Leeuwen, J.~van},
year = 1981,
title = {Maintenance of configurations in the plane (revised edition)},
number = {RUU-CS-81-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1981/1981-03.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8012,
author = {Leeuwen, J.~van and Nivat, M.},
year = 1980,
title = {Efficient recognition of rational relations},
number = {RUU-CS-80-12},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1980/1980-12.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8011,
author = {Leeuwen, J.~van and Schoone, A.A.},
year = 1980,
title = {Untangling a traveling salesman tour in the plane},
number = {RUU-CS-80-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1980/1980-11.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8010,
author = {Overmars, M.H. and Leeuwen, J.~van},
year = 1980,
title = {Worst case optimal insertion and deletion methods for decomposable searching problems},
number = {RUU-CS-80-10},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1980/1980-10.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8008,
author = {Leeuwen, J.~van},
year = 1980,
title = {Computers en (on)doenlijke problemen},
number = {RUU-CS-80-08},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1980/1980-08.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8006,
author = {Overmars, M.H. and Leeuwen, J.~van},
year = 1980,
title = {Dynamization of decomposable searching problems yielding good worst case bounds},
number = {RUU-CS-80-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1980/1980-06.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8005,
author = {Overmars, M.H. and Leeuwen, J.~van},
year = 1980,
title = {Notes on maintenance of configurations in the plane},
number = {RUU-CS-80-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1980/1980-05.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8003,
author = {Schoone, A.A. and Leeuwen, J.~van},
year = 1980,
title = {Triangulating a starshaped polygon},
number = {RUU-CS-80-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1980/1980-03.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8002,
author = {Overmars, M.H. and Leeuwen, J.~van},
year = 1980,
title = {Dynamic multi-dimensional data structures based on quad- and k-d trees},
number = {RUU-CS-80-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1980/1980-02.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS8001,
author = {Overmars, M.H. and Leeuwen, J.~van},
year = 1980,
title = {Some principles for dynamizing decomposable searching problems},
number = {RUU-CS-80-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1980/1980-01.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7910,
author = {Overmars, M.H. and Leeuwen, J.~van},
year = 1979,
title = {Two general methods for dynamizing decomposable searching problems},
number = {RUU-CS-79-10},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1979/1979-10.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7909,
author = {Overmars, M.H. and Leeuwen, J.~van},
year = 1979,
title = {Maintenance of configurations in the plane},
number = {RUU-CS-79-09},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1979/1979-09.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7907,
author = {Overmars, M.H. and Leeuwen, J.~van},
year = 1979,
title = {Further comments on Bykat's convex hull algorithm},
number = {RUU-CS-79-07},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7906,
author = {Leeuwen, J.~van and Wood, D.},
year = 1979,
title = {The measure problem for rectangular ranges in d-space},
number = {RUU-CS-79-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1979/1979-06.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7905,
author = {Leeuwen, J.~van and Wood, D.},
year = 1979,
title = {Dynamization of decomposable searching problems},
number = {RUU-CS-79-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1979/1979-05.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7904,
author = {Alt, H. and Leeuwen, J.~van},
year = 1979,
title = {The complexity of basic complex operations},
number = {RUU-CS-79-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1979/1979-04.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7903,
author = {Overmars, M.H. and Leeuwen, J.~van},
year = 1979,
title = {Rapid subtree indentification revisited},
number = {RUU-CS-79-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1979/1979-03.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7902,
author = {Leeuwen, J.~van},
year = 1979,
title = {Computers en informatie-verwerking},
number = {RUU-CS-79-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7901,
author = {Leeuwen, J.~van},
year = 1979,
title = {On program efficiency and algebraic complexity - (or- how to compute the Schur transform of a complex polynomial)},
number = {RUU-CS-79-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1979/1979-01.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7805,
author = {Leeuwen, J.~van},
year = 1978,
title = {The composition of fast priority queues},
number = {RUU-CS-78-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1978/1978-05.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7804,
author = {Boas, P.~Emde and Leeuwen, J.~van},
year = 1978,
title = {Move-rules and trade-offs in the pebble game},
number = {RUU-CS-78-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1978/1978-04.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7803,
author = {Leeuwen, J.~van},
year = 1978,
title = {Linear time generation of a new fixed-length data-compression code},
number = {RUU-CS-78-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1978/1978-03.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7802,
author = {Leeuwen, J.~van},
year = 1978,
title = {Compromising statistical data-base with a few known elements in a combinatorial model},
number = {RUU-CS-78-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1978/1978-02.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7801,
author = {Leeuwen, J.~van},
year = 1978,
title = {A useful lemma for context-free programmed grammers},
number = {RUU-CS-78-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1978/1978-01.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7704,
author = {Leeuwen, J.~van},
year = 1977,
title = {Inleiding tot database systems},
number = {RUU-CS-77-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7703,
author = {Leeuwen, J.~van and Weide, Th.P.~van~der},
year = 1977,
title = {Alternative path compression techniques},
number = {RUU-CS-77-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1977/1977-03.pdf}},
pubcat = {techreport}
}

@TECHREPORT{RUUCS7702,
author = {Engelfriet, J. and Schmidt, E.Meineche and Leeuwen, J.~van},
year = 1977,
title = {Stack machines and classes of nonnested macro-languages},
number = {RUU-CS-77-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1977/1977-02.pdf}},
pubcat = {techreport}
}