Information and Computing Sciences
Technical reports: Algorithmic Systems
reports (236)
techrep_id file title / author UU-CS-2016-007 Question Answering and Cognitive Automata with Background Intelligence
Jan van Leeuwen and Jiri WiedermannUU-CS-2014-020 Shortcutting Directed and Undirected Networks with a Degree Constraint
Richard B. Tan, Erik Jan van Leeuwen and Jan van LeeuwenUU-CS-2014-014 Separating the Classes of Recursively Enumerable Languages Based on Machine Size
Jan van Leeuwen and Jiri WiedermannUU-CS-2014-003 Turing Machines with One-sided Advice and the Acceptance of the co-RE Languages
Jan van Leeuwen and Jiri WiedermannUU-CS-2010-027 Spanning tree congestion of k-outerplanar graphs
Hans L. Bodlaender, Kyohei Kozawa, Takayoshi Matsushima, Yota OtachiUU-CS-2010-007 Complexity Results for the Spanning Tree Congestion Problem
Yota Otachi, Hans L. Bodlaender, Erik Jan van LeeuwenUU-CS-2009-027 Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
Bart JansenUU-CS-2009-026 Robust planning of airport platform buses
Guido Diepen, B.Pieters, Marjan van den Akker, Han A. Hoogeveen.UU-CS-2009-023 A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. ThilikosUU-CS-2009-018 Conditional Lower Bounds on the Complexity of Probabilistic Inference
Johan Kwisthout, Hans L. BodlaenderUU-CS-2009-012 (Meta) Kernelization
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. ThilikosUU-CS-2008-043 Inclusion/Exclusion Meets Measure and Conquer: Exact algorithms for counting dominating sets.
Johan M.M. van Rooij, Jesper Nederlof and Thomas C. van DijkUU-CS-2008-041 Integrated gate and bus assignment at Amsterdam Airport Schiphol
Guido Diepen, Marjan van den Akker and Han HoogeveenUU-CS-2008-017 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. RosamondUU-CS-2008-005 Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, and Jan van LeeuwenUU-CS-2007-050 ps.gz Complexity Results for Local Monotonicity in Probabilistic Networks
Johan Kwisthout, Hans L. Bodlaender, Gerard TelUU-CS-2007-040 ps.gz The Computational Complexity of Monotonicity in Probabilistic Networks
Johan KwisthoutUU-CS-2007-039 ps.gz Joint Attention and Language Evolution
Johan Kwisthout, Paul Vogt, Pim Haselager and Ton DijkstraUU-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 WolleUU-CS-2007-018 Using column generation for gate planning at Amsterdam Airport Schiphol
G. Diepen, J.M. van den Akker, J.A. Hoogeveen en J.W. SmeltinkUU-CS-2007-005 A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
J.M. van den Akker, G. Diepen, and J.A. HoogeveenUU-CS-2007-002 Finding Near-Optimal Rosters Using Column Generation
Han Hoogeveen and Eelko PenninkxUU-CS-2006-063 Software product release planning through optimization and what-if analysis
Marjan van den Akker, Sjaak Brinkemper, Guido Diepen, Johan VersendaalUU-CS-2006-059 Integrated Requirement Selection and Scheduling for the Release Planning of a Software Product
C. Li, J.M. van den Akker, S. Brinkkemper, and G. DiepenUU-CS-2006-058 Complexity Results for Enhanced Qualitative Probabilistic Networks
Johan Kwisthout and Gerard TelUU-CS-2006-032 ps.gz On exact algorithms for treewidth
Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. ThilikosUU-CS-2006-018 ps.gz Lazy Autoconfiguration in Mobile Ad Hoc Networks and Dynamic Sets of Mobile Agents
Jan van Leeuwen and Jiri WiedermanUU-CS-2006-013 ps.gz Weighted Treewidth: Algorithmic Techniques and Results
Emgad Bachoore and Hans L. BodlaenderUU-CS-2006-012 ps.gz A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
Emgad Bachoore and Hans L. BodlaenderUU-CS-2006-010 ps.gz Convex recoloring of leaf-colored trees
Emgad H. Bachoore and Hans L. BodlaenderUU-CS-2006-006 ps.gz Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions
Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. FominUU-CS-2006-001 ps.gz Interval Routing and Minor-Monotone Graph Parameters
Erwin M. Bakker, Hans L. Bodlaender, Richard B. Tan, and Jan van LeeuwenUU-CS-2005-054 ps.gz Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
G. Diepen, J.M. van den Akker and J.A. HoogeveenUU-CS-2004-063 ps.gz Flexible Release Composition using Integer Linear Programming
Marjan van den Akker, Sjaak Brinkkemper, Guido Diepen, Johan VersendaalUU-CS-2004-050 ps.gz Degree-Based Treewidth Lower Bounds
Arie M. C. A. Koster, Thomas Wolle, and Hans L. BodlaenderUU-CS-2004-042 ps.gz A Note on Contraction Degeneracy
Thomas Wolle, Arie M. C. A. Koster, Hans L. BodlaenderUU-CS-2004-036 ps.gz New Upper Bound Heuristics for Treewidth
Emgad H. Bachoore and Hans L. BodlaenderUU-CS-2004-034 ps.gz Contraction and Treewidth Lower Bounds
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas WolleUU-CS-2004-031 ps.gz Contraction Degeneracy on Cographs
Hans L. Bodlaender and Thomas WolleUU-CS-2004-028 ps.gz A Note on Edge Contraction
Thomas Wolle and Hans L. BodlaenderUU-CS-2004-018 ps.gz Lineages of Automata
Peter Verbaan, Jan van Leeuwen, Jiri WiedermannUU-CS-2004-001 ps.gz A Note on the Complexity of Network Reliability Problems
Hans L. Bodlaender and Thomas WolleUU-CS-2003-026 ps.gz A Framework for Network Reliability Problems on Graphs of Bounded Treewidth
Thomas WolleUU-CS-2002-032 ps.gz Derivation of algorithms for cutwidth and related graph layout problems
Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. ThilikosUU-CS-2002-002 ps.gz The emergent computational potential of evolving artificial living systems
J. Wiedermann, J. van LeeuwenUU-CS-2001-04 ps.gz A polynomial algorithm for the cutwidth of bounded degree graphs with small treewidth
D. M. Thilikos, M. J. Serna, H. L. BodlaenderUU-CS-2001-02 ps.gz A computational model of interaction in embedded systems
J. van Leeuwen, J. WiedermannUU-CS-2000-38 ps.gz Constructive linear time algorithms for branchwidth
D. M. Thilikos, H. L. BodlaenderUU-CS-2000-35 ps.gz The merchant subtour problem
A. M. Verweij, K. I. AardalUU-CS-2000-33 ps.gz The Turing machine paradigm in contemporary computing
J. van Leeuwen, J. WiedermannUU-CS-2000-29 ps.gz Finding a Delta-regular supergraph of minimum order
H. L. Bodlaender, R. B. Tan, J. van LeeuwenUU-CS-2000-25 ps.gz Approximations for Lambda-coloring of graphs
H. L. Bodlaender, T. Kloks, R. B. Tan, J. van LeeuwenUU-CS-2000-24 ps.gz A constructive linear time algorithm for small cutwidth
D. M. Thilikos, M. J. Serna, H. L. BodlaenderUU-CS-2000-22 ps.gz Algorithms for maximum independent set applied to map labelling
T. W. Strijk, A. M. Verweij, K. I. AardalUU-CS-1999-41 ps.gz Non-standard approaches to integer programming
K. I. Aardal, R. Weismantel, L. A. WolseyUU-CS-1999-37 ps.gz Lattice basis reduction and integer programming
K. I. AardalUU-CS-1999-36 ps.gz Algorithms for the radio link frequency assignment problem
K. I. Aardal, C. A. J. Hurkens, J. K. Lenstra, S. TiourineUU-CS-1999-16 ps.gz Market split and basis reduction: Towards a solution of the Cornuejols-Dawande Instances
K. I. Aardal, R. E. Bixby, C. A. J. Hurkens, A. K. Lenstra, J. W. SmeltinkUU-CS-1998-45 ps.gz A 3-approximation algorithm for the k-level uncapacitated facility location problem
K. I. Aardal, F. A. Chudak, D. B. ShmoysUU-CS-1998-36 ps.gz Solving a system of diophantine equations with lower and upper bounds on the variables
K. I. Aardal, C. A. J. Hurkens, A. K. LenstraUU-CS-1998-26 ps.gz The complexity of scheduling typed task systems with and without communication delays
J. VerrietUU-CS-1998-24 ps.gz Scheduling outtrees of height one in the LogP model
J. VerrietUU-CS-1998-05 ps.gz Computing small search numbers in linear time
H. L. Bodlaender, D. M. ThilikosUU-CS-1997-40 ps.gz An algorithm for solving a diophantine equation with lower and upper bounds on the variables
K. I. Aardal, A. K. Lenstra, C. A. J. HurkensUU-CS-1997-39 ps.gz Approximation algorithms for facility location problems
D. B. Shmoys, E. Tardos, K. I. AardalUU-CS-1997-38 ps.gz On an integer multicommodity flow problem from the airplane industry
A. M. Verweij, K. I. Aardal, G. KantUU-CS-1997-37 ps.gz Graphs with branchwidth at most three
H. L. Bodlaender, D. M. ThilikosUU-CS-1997-35 ps.gz Algorithms and obstructions for linear-width and related search parameters
D. M. ThilikosUU-CS-1997-24 ps.gz Reduction algorithms for graphs of small treewidth
Hans L. Bodlaender, Babette de FluiterUU-CS-1997-23 ps.gz Parallel algorithms for treewidth two
Babette de Fluiter, Hans L. BodlaenderUU-CS-1997-21 ps.gz Parallel algorithms for series parallel graphs
Hans L. Bodlaender, Babette de FluiterUU-CS-1997-18 ps.gz Scheduling tree-structured programs in the LogP model
J. VerrietUU-CS-1997-12 ps.gz A decade of combinatorial optimization
K. I. Aardal, S. van Hoesel, J. K. Lenstra, L. StougieUU-CS-1997-05 ps.gz Isomorphism for graphs of bounded distance width
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. ThilikosUU-CS-1997-04 ps.gz Intervalizing sandwich graphs
Babette de Fluiter, Hans L. BodlaenderUU-CS-1997-01 ps.gz The complexity of scheduling graphs of bounded width subject to non-zero communication delays
J. VerrietUU-CS-1996-53 ps.gz Reformulation of capacitated facility location problems: How redundant information can help
K. I. AardalUU-CS-1996-41 ps.gz On Interval Routing Schemes and Treewidth
H. L. Bodlaender, J. van Leeuwen, R. B. Tan, D. M. ThilikosUU-CS-1996-39 ps.gz Multiple destination bin packing
A. M. VerweijUU-CS-1996-30 ps.gz Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems
D. M. Thilikos, H. L. BodlaenderUU-CS-1996-29 ps.gz It is hard to know when greedy is good for finding independent sets
Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi YamazakiUU-CS-1996-27 ps.gz Polyhedral combinatorics: An annotated bibliography
K. I. Aardal, R. WeismantelUU-CS-1996-13 ps.gz Parallel algorithms for series parallel graphs
Hans L. Bodlaender, Babette de FluiterUU-CS-1996-12 ps.gz Scheduling interval orders with release dates and deadlines
J. VerrietUU-CS-1996-04 ps.gz Information retrieval and simulation theory
T. W. C. Huibers, M. Lalmas, C. J. van RijsbergenUU-CS-1995-42 ps.gz Polyhedral techniques in combinatorial optimization II: Computations
K. I. Aardal, S. van HoeselUU-CS-1995-41 ps.gz On the two-level uncapacitated facility location problem
K. I. Aardal, M. Labbe, J. Leung, M. QueyranneUU-CS-1995-37 ps.gz Reduction algorithms for graphs with small treewidth
Hans L. Bodlaender, Babette de FluiterUU-CS-1995-35 ps.gz Capacitated facility location: separation algorithms and computational experience
K. I. AardalUU-CS-1995-34 ps.gz Treewidth and minimum fill-in on d-trapezoid graphs
H. L. Bodlaender, T. Kloks, D. Kratsch, H. MuellerUU-CS-1995-31 ps.gz Scheduling UET, UCT dags with release dates and deadlines
J. VerrietUU-CS-1995-29 ps.gz Polyhredral techniques in combinatorial optimization I: Theory
K. I. Aardal, S. van HoeselUU-CS-1995-27 On Triangulating Planar Graphs under the Four-Connectivity Constraint
T. Biedl and G. Kant and M. KaufmannUU-CS-1995-20 ps.gz On intervalizing k-colored graphs for DNA physical mapping
Hans L. Bodlaender, Babette de FluiterUU-CS-1995-15 ps.gz Intervalizing k-colored graphs
Hans L. Bodlaender, Babette de FluiterUU-CS-1995-09 ps.gz How nonmonotonic is aboutness?
P. D. Bruza, T. W. C. HuibersUU-CS-1995-05 Compact Routing Methods: A Survey
J. van Leeuwen and R.B. TanUU-CS-1995-04 ps.gz A better heuristic for ortogobal graph drawings
T. Biedl, G. KantUU-CS-1995-03 ps.gz Rankings of graphs
H. L. Bodlaender, J. S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Mueller, Zs. TuzaUU-CS-1995-02 ps.gz Treewidth and small separators for graphs with small chordality
H. L. Bodlaender, D. M. ThilikosUU-CS-1994-37 ps.gz Een theorie voor het bestuderen van information retrieval modellen (in Dutch)
T. W. C. Huibers, B. van Linder, P. D. BruzaUU-CS-1994-35 Properties of Measures for Bayesian Belief Network Learning
R.R. BouckaertUU-CS-1994-27 ps.gz Probabilistic network construction using the minimum description length principle
R. R. BouckaertUU-CS-1994-22 ps.gz IDAGs: a perfect map for any distribution
R. R. BouckaertUU-CS-1994-16 ps.gz A stratified simulation scheme for inference in Bayesian belief networks
R. R. BouckaertUU-CS-1994-15 ps.gz Situations, a General Framework for Studying Information Retrieval
T. W. C. Huibers, P. D. BruzaRUU-CS-93-45 ps.gz Convex grid drawings of 3-connected planar graphs
M. Chrobak, G. KantRUU-CS-93-33 Area Requirement of Visibility Representations of Trees
G. Kant, G. Liotta, R. Tamassia, and I.G. TollisRUU-CS-93-27 ps.gz Efficient and constructive algorithms for the pathwidth and treewidth of graphs
H. L. Bodlaender, T. KloksRUU-CS-93-26 ps.gz A more compact visibility representation
G. KantRUU-CS-93-12 Treewidth of Circle Graphs
T. KloksRUU-CS-93-11 Minimum Fill-in for Chordal Bipartite Graphs
T. KloksRUU-CS-93-10 ps.gz Detecting the erosion of hierarchic information structures
P. D. Bruza, T. W. C. Huibers, J. van der Linden, T. van OpstalRUU-CS-93-04 A linear time algorithm to schedule trees with communication delays optimally on two machines
Marinus VeldhorstRUU-CS-93-03 Algebraic Domains, Chain Completion and the Plotkin Powerdomain Construction
Peter KnijnenburgRUU-CS-93-02 A Note on the Smyth Powerdomain Construction
Peter KnijnenburgRUU-CS-93-01 Self-stabilizing l-Exclusion Algorithms
M. Flatebo and A.K. Datta and A.A. SchoonenRUU-CS-92-41 ps.gz Two algorithms for finding rectangular duals of planar graphs
G. KantRUU-CS-92-36 ps.gz Bayesian belief networks and conditional independencies
R. R. BouckaertRUU-CS-92-35 Only few graphs have bounded treewidth
T. Kloks and H. BodlaenderRUU-CS-92-34 ps.gz Conditional dependence in probablistic networks
R. R. BouckaertRUU-CS-92-33 ps.gz Drawing planar graphs using the lmc-ordering
G. KantRUU-CS-92-30 Treewidth and pathwidth of permutation graphs
H.L. Bodlaender and A.J.J. Kloks and D. KratschRUU-CS-92-29 Approximating treewidth and pathwidth of some classes of perfect graphs
A.J.J. Kloks and H.L. BodlaenderRUU-CS-92-28 Treewidth of chordal bipartite graphs
A.J.J. Kloks and D. KratschRUU-CS-92-19 On parallel data structuring; A parallel priority queue
S.T. Fischer and M. VeldhorstRUU-CS-92-13 On the Treewidth and Pathwidth of Permutation Graphs
T. Kloks and H.L. BodlaenderRUU-CS-92-09 Testing superperfection of $k-$trees
T. Kloks and H.L. BodlaenderRUU-CS-92-07 Triangslating planar graphs while minimizing the maximum degree
G. Kant and H.L. BodlaenderRUU-CS-92-06 Hexagonal grid drawings
G. KantRUU-CS-92-04 Redesigning the window protocol; the block acknowledgement revisited
A.A. SchooneRUU-CS-92-03 ps.gz An O(n2) maximal planarization algorithm based on PQ-trees
G. KantRUU-CS-92-02 An order-theoretic model for the algebra of communicating processes
P.M.W. KnijnenburgRUU-CS-92-01 On efficiently characterizing solutions of linear Diophantine equations and its application to data dependence analysis
C. Eisenbeis and O. Temam and H. WijshoffRUU-CS-91-48 Randomized multi-packet routing on meshes
Michael Kaufmann, Jop F. SibeynRUU-CS-91-47 Linear planar augmentation algorithms for outerplanar graphs
Goos KantRUU-CS-91-43 A protocol scheme for a class of minimum delay routing algorithms
P.J.M. van HaaftenRUU-CS-91-38 A bibliography on network flow problems
M. VeldhorstRUU-CS-91-37 The sum of weighted balls
J.F. SibeijnRUU-CS-91-36 MCSPARSE A parallel sparse unsymmetric linear system solver
K.A. Gallivan and B.A. Marsolf and H.A.G. WijshoffRUU-CS-91-35 Complexity aspects of 2-dimensional data compression
H.L. Bodlaender and T. Gonzalez and T. KloksRUU-CS-91-32 ps.gz Global virtual time approximation with distributed termination detection algorithms
F. Mattern, H. Mehl, A. A. Schoone, G. TelRUU-CS-91-26 Cautious backtracking and well-founded semantics in truth maintenance systems
C.M. JonkerRUU-CS-91-25 Planar graph augmentation problems
G. Kant and H.L. BodlaenderRUU-CS-91-23 The optimal placement of replicated items in distributed databases on tree-like networks
E.M. Bakker and J. van LeeuwenRUU-CS-91-22 Some domination problems on trees and on general grahps
E.M. Bakker and J. van LeeuwenRUU-CS-91-21 Uniform d-emulations of rings, with an application to distributed virtual ring contruction
E.M. Bakker and J. van LeeuwenRUU-CS-91-19 Symmetric orderings for unsymmetric sparse matrices
H.A.G. WijshoffRUU-CS-91-16 Evaluation of the Cedar memory system, configuration 16 x 16
K. Gallivan and W. Jalby and H.A.G. WijshoffRUU-CS-91-15 Preliminary basic performance analysis of the Cedar multiprocessor memory system
H.A.G. WijshoffRUU-CS-91-13 A simple linear time algorithm for triangulating three-colored graphs
H.L. Bodlaender and A.J.. KloksRUU-CS-91-07 Linear interval routing schemes
E.M. Bakker and J. van Leeuwen and R.B. TanRUU-CS-91-04 The linear decomposition of lambda 2-models
R. HoofmanRUU-CS-91-02 Synchronous link-level protocols
A.A.SchooneRUU-CS-91-01 Approximating treewidth, pathwidth, and minimum elimination tree height
H.L. Bodlaender and J.R. Gilbert and H. Hafsteinsson and T. KloksRUU-CS-90-41 A note on semi-adjunctions
R. HoofmanRUU-CS-90-35 Perfect Colorings
E.M. Bakker and J. van Leeuwen and R.B. TanRUU-CS-90-34 Linear logic, domain theory and semi-functors
R. HoofmanRUU-CS-90-25 Continuous information systems
R. HoofmanRUU-CS-90-19 Matrix techniques for faster routing of affine permutations on a mesh interconnection network
J.F. SibeynRUU-CS-90-18 Minimum hop route maintenance in static and dynamic networks
A.A. SchooneRUU-CS-90-17 A pseudo-polylog average time parallel maxflow algorithm
J.F. SibeynRUU-CS-90-16 The file distribution problem for processor networks
G. Kant and J. van LeeuwenRUU-CS-90-15 Strong colorings of graphs
G. Kant and J. van LeeuwenRUU-CS-90-11 Fast algorithms for the Tron game on trees
H. Bodlaender and T. KloksRUU-CS-90-10 Prefix routing schemes in dynamic networks
E.M. Bakker and J. van Leeuwen and R.B. TanRUU-CS-90-08 Tools for the rectilinear steiner tree problem
C.M. Jonker and V.C.J. DisselkoenRUU-CS-90-02 From posets to coherence spaces
R. HoofmanRUU-CS-90-01 Properties of models which are complete for Hoare logic
R. HoofmanRUU-CS-89-23 The one-dimensional skewing problem
G. Tel and J. van Leeuwen and H.A.G. WijshoffRUU-CS-89-03 On models for Propositional Dynamic Logic
P.M.W. Knijnenburg and J. van LeeuwenRUU-CS-88-40 Transformation of a termination detection algorithm and its assertional correctness proof
A.A. Schoone and G. TelRUU-CS-88-39 Some observations for the pigeon hole principle
F.J. Brandenburg and J. van Leeuwen and R.B. TanRUU-CS-88-34 On axiomatizations for propositional logics of programs
P.M.W. KnijnenburgRUU-CS-88-15 On randomizing decision problems; a survey of the theory of randomized NP
P.M.W. KnijnenburgRUU-CS-88-06 Assertional verification of a termination detection algorithm
A.A. Schoone and G. TelRUU-CS-88-05 Assertional verification of a reset algorithm
N.J. Drost and A.A. SchooneRUU-CS-87-23 Powerdomains
R. HoofmanRUU-CS-87-18 Linked allocation for parallel data structures
M. VeldhorstRUU-CS-87-14 Verification of connection-management protocols
A.A. SchooneRUU-CS-86-11 The derivation of graph marking algorithms from distributed termination detection protocols
G.Tel and R.B. Tan and J. van LeeuwenRUU-CS-86-10 not
onlineCompactly representable skewing schemes for trees
H.A.G. WijshoffRUU-CS-86-09 not
onlineGeneral skewing schemes for trees
H.A.G. WijshoffRUU-CS-86-08 not
onlineThe one-dimensional skewing problem
G.Tel and J. van Leeuwen and H.A.G. WijshoffRUU-CS-86-07 Very thin VLSI-layouts of complete binary trees
J. van Leeuwen and R.B. TanRUU-CS-86-02 General symmetric distributed termination detection
R.B. Tan and J. van LeeuwenRUU-CS-86-01 Simulation of parallel algorithms on a distributed network
A.A. Schoone and J. van LeeuwenRUU-CS-85-29 Storing trees into parallel memories (extended abstract)
H.A.G. WijshoffRUU-CS-85-27 Parallel dynamic programming algorithms
M.VeldhorstRUU-CS-85-26 Diameter increase caused by edge deletion
A.Schoone and H.L.Bodlaender and J.van LeeuwenRUU-CS-85-24 Hierarchical memory systems in multiprocessors and multi-periodic skewing schemes
G.Tel and H.A.G. WijshoffRUU-CS-85-23 An improved upperbound for distributed election in bidirectional rings of processors
J. van Leeuwen and R.B. TanRUU-CS-85-16 Interval routing
J. van Leeuwen and R.B. TanRUU-CS-85-12 Verification of balanced link-level protocols
A.A. Schoone and J. van LeeuwenRUU-CS-85-03 Program derivation through transformations; the evolution of list-copying algorithms
N.W.P. van Diepen and W.P. de RoeverRUU-CS-85-02 The quest for compositionality - a survey of assertion - based proof systems for concurrent programs. Part 1 ; concurrency based on shared variables
W.P. de RoeverRUU-CS-84-14 A note on Gaussian elimination with partial pivoting on an MIMD computer
M. VeldhorstRUU-CS-84-13 Array Processing Machines
J. van Leeuwen and J. WiedermannRUU-CS-84-12 The $mu$-calculus as an assertion language for fairness arguments
F.A. Stomp and W.P. de Roever and R.T. GerthRUU-CS-84-11 Parallel Turing Machines
J.WiedermannRUU-CS-84-07 Parallel memories, periodic skewing schemes, and the theory of finite abelian groups
J.Tappe and J. van Leeuwen and H.A.G. WijshoffRUU-CS-84-06 Compositional semantics for real-time distributed computing
R.K. Shyamasundar and W.P. de Roever and R. Gerth and R. Koymans and S. Arun-KumarRUU-CS-84-01 The structure of periodic storage schemes for parallel memories
H.A.G. Wijshoff and J. van LeeuwenRUU-CS-83-17 Transition logic
R. GerthRUU-CS-83-16 Routing with compact routing tables
J. van Leeuwen and R.B. TanRUU-CS-83-15 A proof system for partial correctness of dynamic networks of processes
J. Zwiers and A. de Bruin and W.P. de RoeverRUU-CS-83-11 Data mappings in large parallel computers
J. van Leeuwen and H.A.G. WijshoffRUU-CS-83-10 A linearity condition for periodic skewing schemes
H.A.G. Wijshoff and J. van LeeuwenRUU-CS-83-09 Real time programming and asynchronous message passing
R. Koymans and J. Vytopil and W.P. de RoeverRUU-CS-83-07 On linear skewing schemes and d ordered vectors
H.A.G. Wijshoff and J. van LeeuwenRUU-CS-83-05 A case study in proofs about realtime programming and asynchronous message passing (A formal system for a telecommunication language)
R. Koymans and J. Vytopil and W.P. de RoeverRUU-CS-83-04 Periodic storage schemes with a minimum number of memory banks
H.A.G. Wijshoff and J. van LeeuwenRUU-CS-83-02 A proof system for concurrent ADA programs
R.T. Gerth and W.P. de RoeverRUU-CS-83-01 Compositions of double diagonal and cross Latin squares
H.L. Bodlaender and H.A.G. Wijshoff and J. van LeeuwenRUU-CS-82-13 The denotational semantics of dynamic networks of processes
A.P.W. Bohm and A. de BruinRUU-CS-82-12 Rendezvous with ADA - a Proof Theoretical View
A. Pnueli and W.P. de RoeverRUU-CS-82-11 Periodic versus arbitrary tessellations of the plane using polyominos of single type
H.A.G. Wijshoff and J. van LeeuwenRUU-CS-82-10 A study in distributed systems and Dutch patriotism
R.T. Gerth and W.P. de Roever and M. RonckenRUU-CS-82-05 A sound and complete Hoare axiomatization of the ADA-rendezvous (extended abstract.)
R. GerthRUU-CS-82-03 FANLAN GUID (in Dutch) FANLAN inc.
S.G. van der Meulen et alRUU-CS-82-02 Introduction to Computer Architecture (in Dutch)
S.G. van der MeulenRUU-CS-81-17 A proof system for a subset of the concurrency section of ADA
R.T. GerthRUU-CS-81-12 not
onlineA proof system for Brinch Hansen's distributed processes (extended abstract)
M. Roncken and R. Gerth and W.P. de RoeverRUU-CS-81-11 not
onlineA formalism for reasoning about fair termination
W.P. de RoeverRUU-CS-81-06 A basis for dataflow computing
A.P.W. Bohm and J. van LeeuwenRUU-CS-81-05 A proof system for Brinch Hansen's distributed processes
M. Roncken and N. van Diepen and M. Kramer and W.P. de RoeverRUU-CS-81-02 A proof rule for fair termination of quarded commands
O. Grumberg and N. Francez and J.A. Makowsky and W.P. de RoeverRUU-CS-80-11 Untangling a traveling salesman tour in the plane
J. van Leeuwen and A.A. SchooneRUU-CS-80-04 A proof system for communicating sequential processes -final edition
K.R. Apt and N. Francez and W.P. de RoeverRUU-CS-80-03 Triangulating a starshaped polygon
A.A. Schoone and J. van LeeuwenRUU-CS-79-11 Software support for an intelligent terminal
W. Boerhout and A.P.W. Bohm and R. GerthRUU-CS-79-08 A proof system for communicating sequential processes
K.R. Apt and N. Francez and W.P. de RoeverRUU-CS-78-07 The evolution of list-copying algorithms and the need for structured program verification
S. Lee and W.P. de Roever and S.L. GerhartRUU-CS-78-06 An essay on trees and iteration
W.P. de RoeverRUU-CS-78-00 Semantics of nondeterminism, concurrency and communication
N. Francez and C.A.R. Hoare and D.J. Lehmann and W.P. de RoeverRUU-CS-77-01 not
onlineDatastructuren voor lineaire ruimten ``Torrix''
S.G. van der Meulen and M. Veldhorst
BibTeX entries
@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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2016/2016-007.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2014/2014-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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2010/2010-027.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2010/2010-007.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2009027,
author = {Jansen, Bart},
year = 2009,
title = {Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights},
number = {UU-CS-2009-027},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2009/2009-027.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2009026,
author = {Diepen, Guido and B.Pieters and Akker, Marjan~van~den and Hoogeveen., Han~A.},
year = 2009,
title = {Robust planning of airport platform buses},
number = {UU-CS-2009-026},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2009/2009-026.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2009023,
author = {Bodlaender, Hans~L. and Fomin, Fedor~V. and Koster, Arie~M.~C.~A. and Kratsch, Dieter and Thilikos, Dimitrios~M.},
year = 2009,
title = {A Note on Exact Algorithms for Vertex Ordering Problems on Graphs},
number = {UU-CS-2009-023},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2009/2009-023.pdf}},
pubcat = {techreport}
}
@TECHREPORT{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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2008/2008-043.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2008041,
author = {Diepen, Guido and Akker, Marjan~van~den and Hoogeveen, Han},
year = 2008,
title = {Integrated gate and bus assignment at Amsterdam Airport Schiphol},
number = {UU-CS-2008-041},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2008/2008-041.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2008/2008-005.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-050.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-050.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2007040,
author = {Kwisthout, Johan},
year = 2007,
title = {The Computational Complexity of Monotonicity in Probabilistic Networks},
number = {UU-CS-2007-040},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-040.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-040.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2007039,
author = {Kwisthout, Johan and Vogt, Paul and Haselager, Pim and Dijkstra, Ton},
year = 2007,
title = {Joint Attention and Language Evolution},
number = {UU-CS-2007-039},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-039.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-039.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-031.ps.gz}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2007018,
author = {Diepen, G. and Akker, J.M.~van~den and Smeltink, J.A.~Hoogeveen~en~J.W.},
year = 2007,
title = {Using column generation for gate planning at Amsterdam Airport Schiphol},
number = {UU-CS-2007-018},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-018.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2007005,
author = {Akker, J.M.~van~den and Diepen, G. and Hoogeveen, J.A.},
year = 2007,
title = {A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems},
number = {UU-CS-2007-005},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-005.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2007002,
author = {Hoogeveen, Han and Penninkx, Eelko},
year = 2007,
title = {Finding Near-Optimal Rosters Using Column Generation},
number = {UU-CS-2007-002},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-002.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2006063,
author = {Akker, Marjan~van~den and Brinkemper, Sjaak and Diepen, Guido and Versendaal, Johan},
year = 2006,
title = {Software product release planning through optimization and what-if analysis},
number = {UU-CS-2006-063},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-063.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2006059,
author = {Li, C. and Akker, J.M.~van~den and Brinkkemper, S. and Diepen, G.},
year = 2006,
title = {Integrated Requirement Selection and Scheduling for the Release Planning of a Software Product},
number = {UU-CS-2006-059},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-059.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-058.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2006032,
author = {Bodlaender, Hans~L. and Fomin, Fedor~V. and Koster, Arie~M.~C.~A. and Kratsch, Dieter and Thilikos, Dimitrios~M.},
year = 2006,
title = {On exact algorithms for treewidth},
number = {UU-CS-2006-032},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-032.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-032.pdf}},
pubcat = {techreport}
}
@TECHREPORT{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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-018.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-018.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-013.ps.gz}},
urlpdf = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-012.ps.gz}},
urlpdf = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-010.ps.gz}},
urlpdf = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-006.ps.gz}},
urlpdf = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-001.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2006/2006-001.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2005054,
author = {Diepen, G. and Akker, J.M.~van~den and Hoogeveen, J.A.},
year = 2005,
title = {Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs},
number = {UU-CS-2005-054},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2005/2005-054.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2005/2005-054.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2004063,
author = {Akker, Marjan~van~den and Brinkkemper, Sjaak and Diepen, Guido and Versendaal, Johan},
year = 2004,
title = {Flexible Release Composition using Integer Linear Programming},
number = {UU-CS-2004-063},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-063.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-063.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2004050,
author = {Koster, Arie~M.~C.~A. and Wolle, Thomas and Bodlaender, Hans~L.},
year = 2004,
title = {Degree-Based Treewidth Lower Bounds},
number = {UU-CS-2004-050},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-050.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-050.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2004042,
author = {Wolle, Thomas and Koster, Arie~M.~C.~A. and Bodlaender, Hans~L.},
year = 2004,
title = {A Note on Contraction Degeneracy},
number = {UU-CS-2004-042},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-042.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-042.pdf}},
pubcat = {techreport}
}
@TECHREPORT{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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-036.ps.gz}},
urlpdf = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-034.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-034.pdf}},
pubcat = {techreport}
}
@TECHREPORT{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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-031.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-031.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-028.ps.gz}},
urlpdf = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-018.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-018.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-001.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2004/2004-001.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS2003026,
author = {Wolle, Thomas},
year = 2003,
title = {A Framework for Network Reliability Problems on Graphs of Bounded Treewidth},
number = {UU-CS-2003-026},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2003/2003-026.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2003/2003-026.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2002/2002-032.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2002/2002-032.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2002/2002-002.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2002/2002-002.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2001/2001-04.ps.gz}},
urlpdf = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2001/2001-02.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2001/2001-02.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-38.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-38.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS200035,
author = {Verweij, A.~M. and Aardal, K.~I.},
year = 2000,
title = {The merchant subtour problem},
number = {UU-CS-2000-35},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-35.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-35.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-33.ps.gz}},
urlpdf = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-29.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-29.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-25.ps.gz}},
urlpdf = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-24.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-24.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS200022,
author = {Strijk, T.~W. and Verweij, A.~M. and Aardal, K.~I.},
year = 2000,
title = {Algorithms for maximum independent set applied to map labelling},
number = {UU-CS-2000-22},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-22.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-2000/2000-22.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199941,
author = {Aardal, K.~I. and Weismantel, R. and Wolsey, L.~A.},
year = 1999,
title = {Non-standard approaches to integer programming},
number = {UU-CS-1999-41},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-41.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-41.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199937,
author = {Aardal, K.~I.},
year = 1999,
title = {Lattice basis reduction and integer programming},
number = {UU-CS-1999-37},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-37.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-37.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199936,
author = {Aardal, K.~I. and Hurkens, C.~A.~J. and Lenstra, J.~K. and Tiourine, S.},
year = 1999,
title = {Algorithms for the radio link frequency assignment problem},
number = {UU-CS-1999-36},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-36.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-36.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199916,
author = {Aardal, K.~I. and Bixby, R.~E. and Hurkens, C.~A.~J. and Lenstra, A.~K. and Smeltink, J.~W.},
year = 1999,
title = {Market split and basis reduction: Towards a solution of the Cornuejols-Dawande Instances},
number = {UU-CS-1999-16},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-16.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1999/1999-16.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199845,
author = {Aardal, K.~I. and Chudak, F.~A. and Shmoys, D.~B.},
year = 1998,
title = {A 3-approximation algorithm for the k-level uncapacitated facility location problem},
number = {UU-CS-1998-45},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1998/1998-45.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1998/1998-45.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199836,
author = {Aardal, K.~I. and Hurkens, C.~A.~J. and Lenstra, A.~K.},
year = 1998,
title = {Solving a system of diophantine equations with lower and upper bounds on the variables},
number = {UU-CS-1998-36},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1998/1998-36.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1998/1998-36.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199826,
author = {Verriet, J.},
year = 1998,
title = {The complexity of scheduling typed task systems with and without communication delays},
number = {UU-CS-1998-26},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1998/1998-26.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1998/1998-26.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199824,
author = {Verriet, J.},
year = 1998,
title = {Scheduling outtrees of height one in the LogP model},
number = {UU-CS-1998-24},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1998/1998-24.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1998/1998-24.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1998/1998-05.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1998/1998-05.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199740,
author = {Aardal, K.~I. and Lenstra, A.~K. and Hurkens, C.~A.~J.},
year = 1997,
title = {An algorithm for solving a diophantine equation with lower and upper bounds on the variables},
number = {UU-CS-1997-40},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-40.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-40.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199739,
author = {Shmoys, D.~B. and Tardos, E. and Aardal, K.~I.},
year = 1997,
title = {Approximation algorithms for facility location problems},
number = {UU-CS-1997-39},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-39.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-39.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199738,
author = {Verweij, A.~M. and Aardal, K.~I. and Kant, G.},
year = 1997,
title = {On an integer multicommodity flow problem from the airplane industry},
number = {UU-CS-1997-38},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-38.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-38.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-37.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-37.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199735,
author = {Thilikos, D.~M.},
year = 1997,
title = {Algorithms and obstructions for linear-width and related search parameters},
number = {UU-CS-1997-35},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-35.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-35.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-24.ps.gz}},
urlpdf = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-23.ps.gz}},
urlpdf = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-21.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-21.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199718,
author = {Verriet, J.},
year = 1997,
title = {Scheduling tree-structured programs in the LogP model},
number = {UU-CS-1997-18},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-18.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-18.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199712,
author = {Aardal, K.~I. and Hoesel, S.~van and Lenstra, J.~K. and Stougie, L.},
year = 1997,
title = {A decade of combinatorial optimization},
number = {UU-CS-1997-12},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-12.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-12.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199705,
author = {Yamazaki, Koichi and Bodlaender, Hans~L. and Fluiter, Babette~de and Thilikos, Dimitrios~M.},
year = 1997,
title = {Isomorphism for graphs of bounded distance width},
number = {UU-CS-1997-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-05.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-05.pdf}},
pubcat = {techreport}
}
@TECHREPORT{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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-04.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-04.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199701,
author = {Verriet, J.},
year = 1997,
title = {The complexity of scheduling graphs of bounded width subject to non-zero communication delays},
number = {UU-CS-1997-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-01.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1997/1997-01.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199653,
author = {Aardal, K.~I.},
year = 1996,
title = {Reformulation of capacitated facility location problems: How redundant information can help},
number = {UU-CS-1996-53},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-53.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-53.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-41.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-41.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199639,
author = {Verweij, A.~M.},
year = 1996,
title = {Multiple destination bin packing},
number = {UU-CS-1996-39},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-39.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-39.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-30.ps.gz}},
urlpdf = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-29.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-29.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199627,
author = {Aardal, K.~I. and Weismantel, R.},
year = 1996,
title = {Polyhedral combinatorics: An annotated bibliography},
number = {UU-CS-1996-27},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-27.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-27.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-13.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-13.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199612,
author = {Verriet, J.},
year = 1996,
title = {Scheduling interval orders with release dates and deadlines},
number = {UU-CS-1996-12},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-12.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-12.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199604,
author = {Huibers, T.~W.~C. and Lalmas, M. and Rijsbergen, C.~J.~van},
year = 1996,
title = {Information retrieval and simulation theory},
number = {UU-CS-1996-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-04.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1996/1996-04.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199542,
author = {Aardal, K.~I. and Hoesel, S.~van},
year = 1995,
title = {Polyhedral techniques in combinatorial optimization II: Computations},
number = {UU-CS-1995-42},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-42.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-42.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199541,
author = {Aardal, K.~I. and Labbe, M. and Leung, J. and Queyranne, M.},
year = 1995,
title = {On the two-level uncapacitated facility location problem},
number = {UU-CS-1995-41},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-41.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-41.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-37.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-37.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199535,
author = {Aardal, K.~I.},
year = 1995,
title = {Capacitated facility location: separation algorithms and computational experience},
number = {UU-CS-1995-35},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-35.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-35.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199534,
author = {Bodlaender, H.~L. and Kloks, T. and Kratsch, D. and Mueller, H.},
year = 1995,
title = {Treewidth and minimum fill-in on d-trapezoid graphs},
number = {UU-CS-1995-34},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-34.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-34.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199531,
author = {Verriet, J.},
year = 1995,
title = {Scheduling UET, UCT dags with release dates and deadlines},
number = {UU-CS-1995-31},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-31.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-31.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199529,
author = {Aardal, K.~I. and Hoesel, S.~van},
year = 1995,
title = {Polyhredral techniques in combinatorial optimization I: Theory},
number = {UU-CS-1995-29},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-29.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-29.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199527,
author = {Biedl, T. and Kant, G. and Kaufmann, M.},
year = 1995,
title = {On Triangulating Planar Graphs under the Four-Connectivity Constraint},
number = {UU-CS-1995-27},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-27.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-20.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-20.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-15.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-15.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199509,
author = {Bruza, P.~D. and Huibers, T.~W.~C.},
year = 1995,
title = {How nonmonotonic is aboutness?},
number = {UU-CS-1995-09},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-09.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-09.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-05.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199504,
author = {Biedl, T. and Kant, G.},
year = 1995,
title = {A better heuristic for ortogobal graph drawings},
number = {UU-CS-1995-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-04.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-04.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199503,
author = {Bodlaender, H.~L. and Deogun, J.~S. and Jansen, K. and Kloks, T. and Kratsch, D. and Mueller, H. and Tuza, Zs.},
year = 1995,
title = {Rankings of graphs},
number = {UU-CS-1995-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-03.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-03.pdf}},
pubcat = {techreport}
}
@TECHREPORT{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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-02.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1995/1995-02.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199437,
author = {Huibers, T.~W.~C. and Linder, B.~van and Bruza, P.~D.},
year = 1994,
title = {Een theorie voor het bestuderen van information retrieval modellen (in Dutch)},
number = {UU-CS-1994-37},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1994/1994-37.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1994/1994-37.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199435,
author = {Bouckaert, R.R.},
year = 1994,
title = {Properties of Measures for Bayesian Belief Network Learning},
number = {UU-CS-1994-35},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1994/1994-35.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199427,
author = {Bouckaert, R.~R.},
year = 1994,
title = {Probabilistic network construction using the minimum description length principle},
number = {UU-CS-1994-27},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1994/1994-27.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1994/1994-27.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199422,
author = {Bouckaert, R.~R.},
year = 1994,
title = {IDAGs: a perfect map for any distribution},
number = {UU-CS-1994-22},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1994/1994-22.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1994/1994-22.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199416,
author = {Bouckaert, R.~R.},
year = 1994,
title = {A stratified simulation scheme for inference in Bayesian belief networks},
number = {UU-CS-1994-16},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1994/1994-16.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1994/1994-16.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199415,
author = {Huibers, T.~W.~C. and Bruza, P.~D.},
year = 1994,
title = {Situations, a General Framework for Studying Information Retrieval},
number = {UU-CS-1994-15},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1994/1994-15.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1994/1994-15.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9345,
author = {Chrobak, M. and Kant, G.},
year = 1993,
title = {Convex grid drawings of 3-connected planar graphs},
number = {RUU-CS-93-45},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-45.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-45.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9333,
author = {Kant, G. and Liotta, G. and Tamassia, R. and Tollis, I.G.},
year = 1993,
title = {Area Requirement of Visibility Representations of Trees},
number = {RUU-CS-93-33},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-33.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-27.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-27.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9326,
author = {Kant, G.},
year = 1993,
title = {A more compact visibility representation},
number = {RUU-CS-93-26},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-26.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-26.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9312,
author = {Kloks, T.},
year = 1993,
title = {Treewidth of Circle Graphs},
number = {RUU-CS-93-12},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-12.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9311,
author = {Kloks, T.},
year = 1993,
title = {Minimum Fill-in for Chordal Bipartite Graphs},
number = {RUU-CS-93-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-11.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9310,
author = {Bruza, P.~D. and Huibers, T.~W.~C. and Linden, J.~van~der and Opstal, T.~van},
year = 1993,
title = {Detecting the erosion of hierarchic information structures},
number = {RUU-CS-93-10},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-10.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-10.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9304,
author = {Veldhorst, Marinus},
year = 1993,
title = {A linear time algorithm to schedule trees with communication delays optimally on two machines},
number = {RUU-CS-93-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-04.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9303,
author = {Knijnenburg, Peter},
year = 1993,
title = {Algebraic Domains, Chain Completion and the Plotkin Powerdomain Construction},
number = {RUU-CS-93-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-03.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9302,
author = {Knijnenburg, Peter},
year = 1993,
title = {A Note on the Smyth Powerdomain Construction},
number = {RUU-CS-93-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-02.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9301,
author = {Flatebo, M. and Datta, A.K. and Schoonen, A.A.},
year = 1993,
title = {Self-stabilizing l-Exclusion Algorithms},
number = {RUU-CS-93-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1993/1993-01.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9241,
author = {Kant, G.},
year = 1992,
title = {Two algorithms for finding rectangular duals of planar graphs},
number = {RUU-CS-92-41},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-41.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-41.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9236,
author = {Bouckaert, R.~R.},
year = 1992,
title = {Bayesian belief networks and conditional independencies},
number = {RUU-CS-92-36},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-36.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-36.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-35.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9234,
author = {Bouckaert, R.~R.},
year = 1992,
title = {Conditional dependence in probablistic networks},
number = {RUU-CS-92-34},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-34.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-34.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9233,
author = {Kant, G.},
year = 1992,
title = {Drawing planar graphs using the lmc-ordering},
number = {RUU-CS-92-33},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-33.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-33.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9230,
author = {Bodlaender, H.L. and Kloks, A.J.J. and Kratsch, D.},
year = 1992,
title = {Treewidth and pathwidth of permutation graphs},
number = {RUU-CS-92-30},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-30.pdf}},
pubcat = {techreport}
}
@TECHREPORT{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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-29.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9228,
author = {Kloks, A.J.J. and Kratsch, D.},
year = 1992,
title = {Treewidth of chordal bipartite graphs},
number = {RUU-CS-92-28},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-28.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9219,
author = {Fischer, S.T. and Veldhorst, M.},
year = 1992,
title = {On parallel data structuring; A parallel priority queue},
number = {RUU-CS-92-19},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-19.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-13.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-09.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-07.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9206,
author = {Kant, G.},
year = 1992,
title = {Hexagonal grid drawings},
number = {RUU-CS-92-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-06.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9204,
author = {Schoone, A.A.},
year = 1992,
title = {Redesigning the window protocol; the block acknowledgement revisited},
number = {RUU-CS-92-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-04.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9203,
author = {Kant, G.},
year = 1992,
title = {An O(n2) maximal planarization algorithm based on PQ-trees},
number = {RUU-CS-92-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-03.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-03.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9202,
author = {Knijnenburg, P.M.W.},
year = 1992,
title = {An order-theoretic model for the algebra of communicating processes},
number = {RUU-CS-92-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-02.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9201,
author = {Eisenbeis, C. and Temam, O. and Wijshoff, H.},
year = 1992,
title = {On efficiently characterizing solutions of linear Diophantine equations and its application to data dependence analysis},
number = {RUU-CS-92-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1992/1992-01.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9148,
author = {Kaufmann, Michael and Sibeyn, Jop~F.},
year = 1991,
title = {Randomized multi-packet routing on meshes},
number = {RUU-CS-91-48},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-48.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9147,
author = {Kant, Goos},
year = 1991,
title = {Linear planar augmentation algorithms for outerplanar graphs},
number = {RUU-CS-91-47},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-47.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9143,
author = {Haaften, P.J.M.~van},
year = 1991,
title = {A protocol scheme for a class of minimum delay routing algorithms},
number = {RUU-CS-91-43},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-43.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9138,
author = {Veldhorst, M.},
year = 1991,
title = {A bibliography on network flow problems},
number = {RUU-CS-91-38},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-38.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9137,
author = {Sibeijn, J.F.},
year = 1991,
title = {The sum of weighted balls},
number = {RUU-CS-91-37},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-37.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9136,
author = {Gallivan, K.A. and Marsolf, B.A. and Wijshoff, H.A.G.},
year = 1991,
title = {MCSPARSE A parallel sparse unsymmetric linear system solver},
number = {RUU-CS-91-36},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-36.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-32.ps.gz}},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-32.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9126,
author = {Jonker, C.M.},
year = 1991,
title = {Cautious backtracking and well-founded semantics in truth maintenance systems},
number = {RUU-CS-91-26},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-26.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-21.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9119,
author = {Wijshoff, H.A.G.},
year = 1991,
title = {Symmetric orderings for unsymmetric sparse matrices},
number = {RUU-CS-91-19},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-19.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9116,
author = {Gallivan, K. and Jalby, W. and Wijshoff, H.A.G.},
year = 1991,
title = {Evaluation of the Cedar memory system, configuration 16 x 16},
number = {RUU-CS-91-16},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-16.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9115,
author = {Wijshoff, H.A.G.},
year = 1991,
title = {Preliminary basic performance analysis of the Cedar multiprocessor memory system},
number = {RUU-CS-91-15},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-15.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-13.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-07.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9104,
author = {Hoofman, R.},
year = 1991,
title = {The linear decomposition of lambda 2-models},
number = {RUU-CS-91-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-04.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9102,
author = {A.A.Schoone},
year = 1991,
title = {Synchronous link-level protocols},
number = {RUU-CS-91-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-02.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1991/1991-01.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9041,
author = {Hoofman, R.},
year = 1990,
title = {A note on semi-adjunctions},
number = {RUU-CS-90-41},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1990/1990-41.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1990/1990-35.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9034,
author = {Hoofman, R.},
year = 1990,
title = {Linear logic, domain theory and semi-functors},
number = {RUU-CS-90-34},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1990/1990-34.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9025,
author = {Hoofman, R.},
year = 1990,
title = {Continuous information systems},
number = {RUU-CS-90-25},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1990/1990-25.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9019,
author = {Sibeyn, J.F.},
year = 1990,
title = {Matrix techniques for faster routing of affine permutations on a mesh interconnection network},
number = {RUU-CS-90-19},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1990/1990-19.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9018,
author = {Schoone, A.A.},
year = 1990,
title = {Minimum hop route maintenance in static and dynamic networks},
number = {RUU-CS-90-18},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1990/1990-18.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9017,
author = {Sibeyn, J.F.},
year = 1990,
title = {A pseudo-polylog average time parallel maxflow algorithm},
number = {RUU-CS-90-17},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1990/1990-17.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1990/1990-10.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9008,
author = {Jonker, C.M. and Disselkoen, V.C.J.},
year = 1990,
title = {Tools for the rectilinear steiner tree problem},
number = {RUU-CS-90-08},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1990/1990-08.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9002,
author = {Hoofman, R.},
year = 1990,
title = {From posets to coherence spaces},
number = {RUU-CS-90-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1990/1990-02.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9001,
author = {Hoofman, R.},
year = 1990,
title = {Properties of models which are complete for Hoare logic},
number = {RUU-CS-90-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1990/1990-01.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1989/1989-23.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1989/1989-03.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1988/1988-39.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8834,
author = {Knijnenburg, P.M.W.},
year = 1988,
title = {On axiomatizations for propositional logics of programs},
number = {RUU-CS-88-34},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1988/1988-34.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8815,
author = {Knijnenburg, P.M.W.},
year = 1988,
title = {On randomizing decision problems; a survey of the theory of randomized NP},
number = {RUU-CS-88-15},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1988/1988-15.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1988/1988-06.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8805,
author = {Drost, N.J. and Schoone, A.A.},
year = 1988,
title = {Assertional verification of a reset algorithm},
number = {RUU-CS-88-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1988/1988-05.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8723,
author = {Hoofman, R.},
year = 1987,
title = {Powerdomains},
number = {RUU-CS-87-23},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1987/1987-23.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8718,
author = {Veldhorst, M.},
year = 1987,
title = {Linked allocation for parallel data structures},
number = {RUU-CS-87-18},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1987/1987-18.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8714,
author = {Schoone, A.A.},
year = 1987,
title = {Verification of connection-management protocols},
number = {RUU-CS-87-14},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1987/1987-14.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1986/1986-11.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8610,
author = {Wijshoff, H.A.G.},
year = 1986,
title = {Compactly representable skewing schemes for trees},
number = {RUU-CS-86-10},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8609,
author = {Wijshoff, H.A.G.},
year = 1986,
title = {General skewing schemes for trees},
number = {RUU-CS-86-09},
institution = {Department of Information and Computing Sciences, Utrecht University},
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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1986/1986-07.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1986/1986-01.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8529,
author = {Wijshoff, H.A.G.},
year = 1985,
title = {Storing trees into parallel memories (extended abstract)},
number = {RUU-CS-85-29},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1985/1985-29.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8527,
author = {M.Veldhorst},
year = 1985,
title = {Parallel dynamic programming algorithms},
number = {RUU-CS-85-27},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1985/1985-27.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1985/1985-26.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1985/1985-23.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1985/1985-16.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1985/1985-12.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8503,
author = {Diepen, N.W.P.~van and Roever, W.P.~de},
year = 1985,
title = {Program derivation through transformations; the evolution of list-copying algorithms},
number = {RUU-CS-85-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1985/1985-03.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8502,
author = {Roever, W.P.~de},
year = 1985,
title = {The quest for compositionality - a survey of assertion - based proof systems for concurrent programs. Part 1 ; concurrency based on shared variables},
number = {RUU-CS-85-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1985/1985-02.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8414,
author = {Veldhorst, M.},
year = 1984,
title = {A note on Gaussian elimination with partial pivoting on an MIMD computer},
number = {RUU-CS-84-14},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1984/1984-14.pdf}},
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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1984/1984-13.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8412,
author = {Stomp, F.A. and Roever, W.P.~de and Gerth, R.T.},
year = 1984,
title = {The $mu$-calculus as an assertion language for fairness arguments},
number = {RUU-CS-84-12},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1984/1984-12.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8411,
author = {J.Wiedermann},
year = 1984,
title = {Parallel Turing Machines},
number = {RUU-CS-84-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1984/1984-11.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1984/1984-07.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8406,
author = {Shyamasundar, R.K. and Roever, W.P.~de and Gerth, R. and Koymans, R. and Arun-Kumar, S.},
year = 1984,
title = {Compositional semantics for real-time distributed computing},
number = {RUU-CS-84-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1984/1984-06.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1984/1984-01.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8317,
author = {Gerth, R.},
year = 1983,
title = {Transition logic},
number = {RUU-CS-83-17},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1983/1983-17.pdf}},
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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1983/1983-16.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8315,
author = {Zwiers, J. and Bruin, A.~de and Roever, W.P.~de},
year = 1983,
title = {A proof system for partial correctness of dynamic networks of processes},
number = {RUU-CS-83-15},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1983/1983-15.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 = {{https://ics-archive.science.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1983/1983-10.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8309,
author = {Koymans, R. and Vytopil, J. and Roever, W.P.~de},
year = 1983,
title = {Real time programming and asynchronous message passing},
number = {RUU-CS-83-09},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1983/1983-09.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1983/1983-07.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8305,
author = {Koymans, R. and Vytopil, J. and Roever, W.P.~de},
year = 1983,
title = {A case study in proofs about realtime programming and asynchronous message passing (A formal system for a telecommunication language)},
number = {RUU-CS-83-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1983/1983-05.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1983/1983-04.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8302,
author = {Gerth, R.T. and Roever, W.P.~de},
year = 1983,
title = {A proof system for concurrent ADA programs},
number = {RUU-CS-83-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1983/1983-02.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1983/1983-01.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8213,
author = {Bohm, A.P.W. and Bruin, A.~de},
year = 1982,
title = {The denotational semantics of dynamic networks of processes},
number = {RUU-CS-82-13},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1982/1982-13.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8212,
author = {Pnueli, A. and Roever, W.P.~de},
year = 1982,
title = {Rendezvous with ADA - a Proof Theoretical View},
number = {RUU-CS-82-12},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1982/1982-12.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1982/1982-11.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8210,
author = {Gerth, R.T. and Roever, W.P.~de and Roncken, M.},
year = 1982,
title = {A study in distributed systems and Dutch patriotism},
number = {RUU-CS-82-10},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1982/1982-10.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8205,
author = {Gerth, R.},
year = 1982,
title = {A sound and complete Hoare axiomatization of the ADA-rendezvous (extended abstract.)},
number = {RUU-CS-82-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1982/1982-05.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8203,
author = {Meulen, S.G.~van~der et~al},
year = 1982,
title = {FANLAN GUID (in Dutch) FANLAN inc.},
number = {RUU-CS-82-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1982/1982-03.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8202,
author = {Meulen, S.G.~van~der},
year = 1982,
title = {Introduction to Computer Architecture (in Dutch)},
number = {RUU-CS-82-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1982/1982-02.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8117,
author = {Gerth, R.T.},
year = 1981,
title = {A proof system for a subset of the concurrency section of ADA},
number = {RUU-CS-81-17},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1981/1981-17.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8112,
author = {Roncken, M. and Gerth, R. and Roever, W.P.~de},
year = 1981,
title = {A proof system for Brinch Hansen's distributed processes (extended abstract)},
number = {RUU-CS-81-12},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8111,
author = {Roever, W.P.~de},
year = 1981,
title = {A formalism for reasoning about fair termination},
number = {RUU-CS-81-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1981/1981-06.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8105,
author = {Roncken, M. and Diepen, N.~van and Kramer, M. and Roever, W.P.~de},
year = 1981,
title = {A proof system for Brinch Hansen's distributed processes},
number = {RUU-CS-81-05},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1981/1981-05.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8102,
author = {Grumberg, O. and Francez, N. and Makowsky, J.A. and Roever, W.P.~de},
year = 1981,
title = {A proof rule for fair termination of quarded commands},
number = {RUU-CS-81-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1981/1981-02.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1980/1980-11.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8004,
author = {Apt, K.R. and Francez, N. and Roever, W.P.~de},
year = 1980,
title = {A proof system for communicating sequential processes -final edition},
number = {RUU-CS-80-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1980/1980-04.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 = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1980/1980-03.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS7911,
author = {Boerhout, W. and Bohm, A.P.W. and Gerth, R.},
year = 1979,
title = {Software support for an intelligent terminal},
number = {RUU-CS-79-11},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1979/1979-11.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS7908,
author = {Apt, K.R. and Francez, N. and Roever, W.P.~de},
year = 1979,
title = {A proof system for communicating sequential processes},
number = {RUU-CS-79-08},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1979/1979-08.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS7807,
author = {Lee, S. and Roever, W.P.~de and Gerhart, S.L.},
year = 1978,
title = {The evolution of list-copying algorithms and the need for structured program verification},
number = {RUU-CS-78-07},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1978/1978-07.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS7806,
author = {Roever, W.P.~de},
year = 1978,
title = {An essay on trees and iteration},
number = {RUU-CS-78-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1978/1978-06.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS7800,
author = {Francez, N. and Hoare, C.A.R. and Lehmann, D.J. and Roever, W.P.~de},
year = 1978,
title = {Semantics of nondeterminism, concurrency and communication},
number = {RUU-CS-78-00},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{https://ics-archive.science.uu.nl/research/techreps/repo/CS-1978/1978-00.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS7701,
author = {Meulen, S.G.~van~der and Veldhorst, M.},
year = 1977,
title = {Datastructuren voor lineaire ruimten ``Torrix''},
number = {RUU-CS-77-01},
institution = {Department of Information and Computing Sciences, Utrecht University},
pubcat = {techreport}
}