| techrep_id |
file |
title / author |
| UU-CS-2010-004 |
pdf |
An empirical research to the relationships between software product management and software project management Christina Manteli, Inge van de Weerd, Sjaak Brinkkemper |
| UU-CS-2010-003 |
not online |
Productization: The process of transforming from customer-specific software development to product software development Peter Artz, Inge van de Weerd, Sjaak Brinkkemper |
| UU-CS-2010-002 |
not online |
Identifying and exploiting commonalities for the job-shop scheduling problem M.L. Kammer, J.M. van den Akker en J.A. Hoogeveen |
| UU-CS-2009-035 |
pdf |
On Planar Supports for Hypergraphs Kevin Buchin, Marc van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek |
| UU-CS-2009-034 |
pdf |
Structure of Polynomial-Time Approximation Erik Jan van Leeuwen, Jan van Leeuwen |
| UU-CS-2009-033 |
not online |
Constructing naive Bayesian classifiers for veterinary medicine: a case study in the clinical diagnosis of classical swine fever P.L. Geenen, L.C. van der Gaag, W.L.A. Loeffen, A.R.W. Elbers |
| UU-CS-2009-032 |
not online |
Library-style ontologies to support varying model views Linda C. van der Gaag, Hermi Tabachneck-Schijf |
| UU-CS-2009-031 |
pdf |
Using Strategies for Assessment of Programming Exercises Alex Gerdes, Johan Jeuring, Bastiaan Heeren |
| UU-CS-2009-030 |
pdf |
An Interactive Exercise Player for Math-Bridge Johan Jeuring, Bastiaan Heeren |
| UU-CS-2009-029 |
pdf |
Construct Your Own Favorite Programming Language S.Doaitse Swierstra |
| UU-CS-2009-028 |
pdf |
A Survey of Tools for Software Operation Knowledge Acquisition Baldur Kristjánsson, Henk van der Schuur |
| UU-CS-2009-027 |
pdf |
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights Bart Jansen |
| UU-CS-2009-026 |
pdf |
Robust planning of airport platform buses Guido Diepen, B.Pieters, Marjan van den Akker, Han A. Hoogeveen. |
| UU-CS-2009-025 |
pdf |
Design by Measure and Conquer: Exact algorithms for dominating set Johan M. M. van Rooij, Hans L. Bodlaender |
| UU-CS-2009-024 |
pdf |
Pull-Ups, Push-Downs, and Passing It Around - Exercises in Functional Incrementalization. Sean Leather, Andres Löh, Johan Jeuring |
| UU-CS-2009-023 |
pdf |
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos |
| UU-CS-2009-022 |
pdf |
Optimizing Generics Is Easy! José Pedro Magalhães, Stefan Holdermans, Johan Jeuring, Andres Löh |
| UU-CS-2009-021 |
pdf |
Categorizing impacts of implementing Enterprise Content Management Systems Knut R. Grahlmann, Cokky Hilhorst, Sander van Amerongen, Remko Helms, Sjaak Brinkkemper |
| UU-CS-2009-020 |
pdf |
Mutational data loading routines for human genome databases: the BRCA1 case Matthijs van der Kroon, Ignacio Lereu Ramirez, Ana M. Levin, Oscar Pastor, Sjaak Brinkkemper |
| UU-CS-2009-019 |
pdf |
An abstract framework for argumentation with structured arguments Henry Prakken |
| UU-CS-2009-018 |
pdf |
Conditional Lower Bounds on the Complexity of Probabilistic Inference Johan Kwisthout, Hans L. Bodlaender |
| UU-CS-2009-017 |
pdf |
Enumerating Well-Typed Terms Generically Alexey Rodriguez Yakushev ,Johan Jeuring |
| UU-CS-2009-016 |
pdf |
Generic Programming for Domain Reasoners Johan Jeuring, José Pedro Magalhães, Bastiaan Heeren |
| UU-CS-2009-015 |
pdf |
Developing a Maturity Matrix for Software Product Management Inge van de Weerd, Willem Bekkers, Sjaak Brinkkemper |
| UU-CS-2009-014 |
pdf |
A Modal Representation of Strategic Reasoning Jan Broersen, Rosja Mastop, John-Jules Meyer, Paolo Turrini |
| UU-CS-2009-013 |
pdf |
Shape Fitting on Point Sets with Probability Distributions Maarten Löffler, Jeff Phillips |
| UU-CS-2009-012 |
pdf |
(Meta) Kernelization Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos |
| UU-CS-2009-011 |
pdf |
Canonical Forms in Interactive Exercise Assistants. Bastiaan Heeren, Johan Jeuring |
| UU-CS-2009-010 |
pdf |
Peeling Meshed Potatoes Boris Aronov, Marc van Kreveld, Maarten Löffler, Rodrigo I. Silveira. |
| UU-CS-2009-009 |
pdf |
Corrective Hints for Type Incorrect Generic Java Programs Nabil el Boustani, Jurriaan Hage |
| UU-CS-2009-008 |
pdf |
Fixed Partitioning and Salient Point with MPEG-7 Cluster Correlograms for Image Categorization Azizi Abdullah, Remco Veltkamp, Marco Wiering |
| UU-CS-2009-007 |
pdf |
Preprocessing Imprecise Points and Splitting Triangulations Marc van Kreveld, Maarten Löffler, Joseph Mitchell |
| UU-CS-2009-006 |
pdf |
Wetenschap is voor iedereen Suzanne Haanappel, Sjaak Brinkkemper |
| UU-CS-2009-005 |
pdf |
Case Study Report: Agile Product Management at Planon Kevin Vlaanderen, Sjaak Brinkkemper, Tjan-Hien Cheng, Slinger Jansen |
| UU-CS-2009-004 |
pdf |
Soft Typing PHP Patrick Camphuijsen, Jurriaan Hage and Stefan Holdermans |
| UU-CS-2009-003 |
pdf |
Strategies for Exercises Bastiaan Heeren, Johan Jeuring, Alex Gerdes |
| UU-CS-2009-002 |
pdf |
Transcriptierapport Helpdeskgesprekken Arnout Terpstra, Cliffred van Velzen, Robbert-Jan Beun, Rogier M.van Eijk |
| UU-CS-2009-001 |
pdf |
Geniaal programmeren - Generic programming at Utrecht Johan Jeuring, Lambert Meertens |
| UU-CS-2008-050 |
pdf |
Marginals of DAG-Isomorphic Independence Models Peter de Waal |
| UU-CS-2008-049 |
pdf |
Constructing Strategies for Programming Alex Gerdes, Bastiaan Heeren and Johan Jeuring |
| UU-CS-2008-048 |
pdf |
Best practices voor projecten onder enterprise architectuur Ralph Foorthuis and Sjaak Brinkkemper |
| UU-CS-2008-047 |
pdf |
Best Practices for Business and Systems Analysis in Projects Conforming to Enterprise Architecture Ralph Foorthuis and Sjaak Brinkkemper |
| UU-CS-2008-046 |
pdf |
A Framework for Local Project Architecture in the Context of Enterprise Architecture Ralph Foorthuis and Sjaak Brinkkemper |
| UU-CS-2008-045 |
pdf |
Haskell as an Architecture Description Language Martijn M. Schrage, S. Doaitse Swierstra |
| UU-CS-2008-044 |
pdf |
Combinator Parsing: A Short Tutorial Doaitse Swierstra |
| UU-CS-2008-043 |
pdf |
Inclusion/Exclusion Meets Measure and Conquer: Exact algorithms for counting dominating sets. Johan M.M. van Rooij, Jesper Nederlof and Thomas C. van Dijk |
| UU-CS-2008-042 |
pdf |
Faster parameterized algorithms for Minimum Fill-In Hans L. Bodlaender, Pinar Heggernes and Yngve Villanger |
| UU-CS-2008-041 |
pdf |
Integrated gate and bus assignment at Amsterdam Airport Schiphol Guido Diepen, Marjan van den Akker and Han Hoogeveen |
| UU-CS-2008-040 |
pdf |
Evidence and Scenario Sensitivities in Naive Bayesian Classifiers Silja Renooij en Linda van der Gaag |
| UU-CS-2008-039 |
pdf |
On alignment of eye behaviour in human-agent interaction Huub Prüst, Robbert-Jan Beun and Rogier van Eijk |
| UU-CS-2008-038 |
pdf |
Improving Type Error Messages for Generic Java Nabil el Boustani and Jurriaan Hage |
| UU-CS-2008-037 |
pdf |
Patterns for In-code Algebraic Testing Wishnu Prasetya and Tanja Vos |
| UU-CS-2008-036 |
pdf |
Smoothing imprecise 1.5D terrains Chris Gray, Maarten Löffler and Rodrigo I. Silveira |
| UU-CS-2008-035 |
pdf |
Shunting passenger trains: getting ready for departure Marjan van den Akker, Hilbrandt Baarsma, Johann Hurink, Maciej Modelski, Jacob Jan Paulus, Ingrid Reijnen, Dan Roozemond and Jan Schreuder |
| UU-CS-2008-034 |
pdf |
Krimp Minimisation for Missing Data Estimation J.Vreeken and A.Siebes |
| UU-CS-2008-033 |
pdf |
Clustering with partial information Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos and Frances Rosamond |
| UU-CS-2008-032 |
pdf |
Treewidth Computations I Upper Bounds Hans L.Bodlaender and Arie M.C.A.Koster |
| UU-CS-2008-031 |
pdf |
A formal model of adjudication dialogues Henri Prakken |
| UU-CS-2008-030 |
pdf |
Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels Hans L. Bodlaender, Stéphan Thomassé, and Anders Yeo |
| UU-CS-2008-029 |
pdf |
Detecting Commuting Patterns by Clustering Subtrajectories Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler and Jun Luo |
| UU-CS-2008-028 |
pdf |
Connected Rectilinear Graphs on Point Sets Maarten Löffler and Elena Mumford |
| UU-CS-2008-027 |
pdf |
Efficient Functional Unification and Substitution Atze Dijkstra, Arie Middelkoop, and S. Doaitse Swierstra |
| UU-CS-2008-026 |
pdf |
On Measuring Musical Style - The Case of Some Disputed Organ Fugues in the J. S. Bach (BWV)Catalogue Peter van Kranenburg |
| UU-CS-2008-025 |
pdf |
Libraries for Generic Programming in Haskell Johan Jeuring, Sean Leather, José Pedro Magalhães, and Alexey Rodriguez Yakushev |
| UU-CS-2008-024 |
pdf |
Representing causal knowledge in sense-making software for crime analysis Susan W. van den Braak, Herre van Oostendorp, Henry Prakken and Gerard A. W. Vreeswijk |
| UU-CS-2008-023 |
pdf |
A Process Model for Project Members Conforming to Enterprise Architecture Ralph Foorthuis and Sjaak Brinkkemper |
| UU-CS-2008-022 |
pdf |
Modularity in Agent Programming Languages: An Illustration in Extended 2APL Mehdi Dastani, Christian P. Mol, and Bas R. Steunebrink |
| UU-CS-2008-021 |
pdf |
Typed Transformations of Typed Abstract Syntax Arthur Baars, Doaitse Swierstra |
| UU-CS-2008-020 |
pdf |
A Lightweight Approach to Datatype-Generic Rewriting Thomas van Noort, Alexey Rodriguez, Stefan Holdermans, Johan Jeuring, Bastiaan Heeren |
| UU-CS-2008-019 |
pdf |
Generic programming with fixed points for mutually recursive datatypes Alexey Rodriguez, Stefan Holdermans, Andres Löh, Johan Jeuring |
| UU-CS-2008-018 |
pdf |
Feedback Services for Exercise Assistants Alex Gerdes, Bastiaan Heeren, Johan Jeuring, and Sylvia Stuurman |
| UU-CS-2008-017 |
pdf |
Open Problems in Parameterized and Exact Computation - IWPEC 2008 Hans L. Bodlaender, Erik D. Demaine, Michael R. Fellows, Jiong Guo, Danny Hermelin, Daniel Lokshtanov, Moritz Müller, Venkatesh Raman, Johan van Rooij, Frances A. Rosamond |
| UU-CS-2008-016 |
pdf |
The Relevance of Situational Factors in Software Product Management Willem Bekkers, Inge van de Weerd, Sjaak Brinkkemper, Alain Mahieu |
| UU-CS-2008-015 |
pdf |
Aligning Bayesian Network Classifiers With MedicaL Contexts Linda C. van der Gaag, Silja Renooij, Ad Feelders, Arend de Groote, Marinus J.C. Eijkemans, Frank J. Broekmans, Bart C.J.M. Fauser |
| UU-CS-2008-014 |
ps.gz pdf |
Verifying Monotonicity of Bayesian Networks with Domain Experts Linda C. van der Gaag, Hermina J.M. Tabachneck-Schijf, Petra L. Geenen |
| UU-CS-2008-013 |
pdf |
The Study of Melodic Similarity using Manual Annotation and Melody Feature Sets Anja Volk, Peter van Kranenburg, Joerg Garbers, Frans Wiering, Remco C. Veltkamp, Louis Grijp |
| UU-CS-2008-012 |
pdf |
Recognizing Strategies Bastiaan Heeren and Johan Jeuring |
| UU-CS-2008-011 |
pdf |
The Generic Haskell user's guide, Version 1.80 - Emerald release Andres Löh, Johan Jeuring, Thomas van Noort, Alexey Rodriguez, Dave Clarke, Ralf Hinze, Jan de Wit |
| UU-CS-2008-010 |
pdf |
Comparing Libraries for Generic Programming in Haskell Alexey Rodriguez Yakushev, Johan Jeuring, Patrik Jansson, Alex Gerdes, Oleg Kiselyov, Bruno C. d. S. Oliviera |
| UU-CS-2008-009 |
pdf |
Controlling risk prior to offshore application development - Investigation and mitigation of collaboration and application risk Cor-Jan Jager, Stefan Vos, Michiel Borgers, Frank Harmsen, Sjaak Brinkkemper, Lidwien van de Wijngaert |
| UU-CS-2008-008 |
pdf |
Algorithmic Aspects of Proportional Symbol Maps Sergio Cabello, Herman Haverkort, Marc van Kreveld, Bettina Speckmann |
| UU-CS-2008-007 |
pdf |
Towards a Definition of Higher Order Constrained Delaunay Triangulations Rodrigo I. Silveira and Marc van Kreveld |
| UU-CS-2008-006 |
pdf |
The Generation of Metric Hierarchies using Inner Metric Analysis Anja Volk |
| UU-CS-2008-005 |
pdf |
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, and Jan van Leeuwen |
| UU-CS-2008-004 |
pdf |
Currency Systems for Efficient and Equitable Exchange Among Selfish Agents in the Air Traffic Management Domain Geert Jonker, Frank Dignum and John-Jules Meyer |
| UU-CS-2008-003 |
pdf |
Integrating Timetabling and Vehicle Scheduling in Public Bus Transportation A.P.R. van den Heuvel, J.M. van den Akker, and M.E. van Kooten Niekerk |
| UU-CS-2008-002 |
pdf |
Selecting vantage objects for similarity indexing Reinier H. van Leuken en Remco C. Veltkamp |
| UU-CS-2008-001 |
pdf |
Specifying Strategies for Exercises Bastiaan Heeren, Johan Jeuring, Arthur van Leeuwen and Alex Gerdes |
| UU-CS-2007-054 |
pdf |
Matched Drawings of Planar Graphs Emilio Di Giacomo, Walter Didimo, Marc van Kreveld, Giuseppe Liotta, Bettina Speckmann |
| UU-CS-2007-053 |
pdf |
On Involutive Anti-Automorphisms of Finite Abelian Groups Jurriaan Hage and Tero Harju |
| UU-CS-2007-052 |
pdf |
Experimental Verification of a Realistic Input Model for Polyhedral Terrains Esther Moet |
| UU-CS-2007-051 |
ps.gz pdf |
Exact Algorithms for Edge Domination Johan M. M. van Rooij and Hans L. Bodlaender |
| UU-CS-2007-050 |
ps.gz pdf |
Complexity Results for Local Monotonicity in Probabilistic Networks Johan Kwisthout, Hans L. Bodlaender, Gerard Tel |
| UU-CS-2007-049 |
pdf |
Abstract Interpretation of Functional Programs using an Attribute Grammar System Jeroen Fokker and S. Doaitse Swierstra |
| UU-CS-2007-048 |
pdf |
Formalising ordinary legal disputes: a case study Henry Prakken |
| UU-CS-2007-047 |
pdf |
A 3D Face Matching Framework F.B. ter Haar and R.C. Veltkamp |
| UU-CS-2007-046 |
pdf |
On Problems Without Polynomial Kernels Hans L. Bodlaender, Rodney G. Downey, Michael R, Fellows, and Danny Hermelin |
| UU-CS-2007-045 |
pdf |
On the Number of Empty Pseudo-Triangles in Point Sets Marc van Kreveld and Bettina Speckmann |
| UU-CS-2007-044 |
pdf |
Planar Bichromatic Minimum Spanning Trees Magdalene G. Borgelt, Marc van Kreveld, Maarten Löffler, Jun Luo, Damian Merrick, Rodrigo I. Silveira, Mostafa Vahedi |
| UU-CS-2007-043 |
pdf |
Geodesic Disks and Clustering in a Simple Polygon Magdalene G. Borgelt, Marc van Kreveld, and Jun Luo |
| UU-CS-2007-042 |
pdf |
Edges and Switches, Tunnels and Bridges D. Eppstein, M. van Kreveld, E. Mumford, and B. Speckmann |
| UU-CS-2007-041 |
pdf |
Business Process Improvement in Organizational Design of E-Government Services Ömer Faruk Aydinli, Sjaak Brinkkemper, and Pascal Ravesteyn |
| UU-CS-2007-040 |
ps.gz pdf |
The Computational Complexity of Monotonicity in Probabilistic Networks Johan Kwisthout |
| UU-CS-2007-039 |
ps.gz pdf |
Joint Attention and Language Evolution Johan Kwisthout, Paul Vogt, Pim Haselager and Ton Dijkstra |
| UU-CS-2007-038 |
pdf |
Approximating Largest Convex Hulls for Imprecise Points Marc van Kreveld, Maarten Löffler |
| UU-CS-2007-037 |
pdf |
Trace-based Reflexive Testing of OO Programs I.S.W.B. Prasetya, T.E.J. Vos, A. Baars |
| UU-CS-2007-036 |
pdf |
Feedback in exercise assistants Johan Jeuring |
| UU-CS-2007-035 |
pdf |
Quadratic Kernelization of Convex Recoloring of Trees Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, and Mark Weyer |
| UU-CS-2007-034 |
pdf |
Optimal Higher Order Delaunay Triangulations of Polygons Rodrigo I. Silveira and Marc van Kreveld |
| UU-CS-2007-033 |
ps.gz |
Caging polygons with two and three fingers Mostafa Vahedi and A. Frank van der Stappen |
| UU-CS-2007-032 |
pdf |
Flooding countries and destroying dams Rodrigo I. Silveira and René van Oostrum |
| UU-CS-2007-031 |
ps.gz |
On the minimum corridor connection problem and other generalized geometric problems Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters and Thomas Wolle |
| UU-CS-2007-030 |
pdf |
Emulating BLAST using database technology Hans Philippi |
| UU-CS-2007-029 |
pdf |
Morph Endo! Report on the Tenth Interstellar Contest on Fuun Programming Eelco Dolstra, Jur Hage, Bastiaan Heeren, Stefan Holdermans, Johan Jeuring, Andres Löh, Arie Middelkoop, Alexey Rodriguez, John van Schie, Clara Löh |
| UU-CS-2007-028 |
pdf |
On the Design of Traps for Feeding 3D Parts on Vibratory Tracks Onno C. Goemans, A. Frank van der Stappen |
| UU-CS-2007-027 |
pdf |
Morph Endo! Task Description of the Tenth Interstellar Contest on Fuun Programming Eelco Dolstra, Jur Hage, Bastiaan Heeren, Stefan Holdermans, Johan Jeuring, Andres Löh, Arie Middelkoop, Alexey Rodriguez, John van Schie, Clara Löh |
| UU-CS-2007-026 |
not online |
Poster Proceedings of the IFIP WG8.1 Working Conference on Situational Method Engineering: Fundamentals and Experiences (ME07) Jolita Ralyté, Sjaak Brinkkemper, Brian Henderson-Sellers |
| UU-CS-2007-025 |
pdf |
Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points Maarten Löffler, Marc van Kreveld |
| UU-CS-2007-024 |
ps.gz pdf |
Student Enrollment and Image of the Informatics Discipline Jan van Leeuwen and Letizia Tanca |
| UU-CS-2007-023 |
pdf |
The Neon DSEL for Mining Helium Programs Jurriaan Hage and Peter van Keeken |
| UU-CS-2007-022 |
not online |
SAIM - A situational method for application integration Sj. Brinkkemper |
| UU-CS-2007-021 |
pdf |
Improving offshore communication by choosing the right coordination strategy Matthias Fabriek, Mischa van den Brand, Sjaak Brinkkemper, Frank Harmsen, and Remko Helms |
| UU-CS-2007-020 |
pdf |
Privacy Preservation through Data Generation Vreeken, J., Van Leeuwen, M., and Siebes, A. |
| UU-CS-2007-019 |
ps.gz pdf |
The Valve Location Problem in Simple Network Topologies Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks |
| UU-CS-2007-018 |
pdf |
Using column generation for gate planning at Amsterdam Airport Schiphol G. Diepen, J.M. van den Akker, J.A. Hoogeveen en J.W. Smeltink |
| UU-CS-2007-017 |
pdf |
A Generic Framework for Developing Exercise Assistants Johan Jeuring, Harrie Passier, Sylvia Stuurman |
| UU-CS-2007-016 |
pdf |
Towards Integration of Music Information Retrieval and Folk Song Research Peter van Kranenburg, Jörg Garbers, Anja Volk, Frans Wiering, Louis Grijp, Remco Veltkamp |
| UU-CS-2007-015 |
pdf |
SHREC2007: 3D Shape Retrieval Contest Remco C. Veltkamp and Frank B. ter Haar |
| UU-CS-2007-014 |
pdf |
Characterising the Difference J. Vreeken, M. van Leeuwen, and A. Siebes |
| UU-CS-2007-013 |
pdf |
A Dynamic Bayesian Network for Diagnosing Ventilator-Associated Pneumonia in ICU Patients Theodore Charitos, Linda C. van der Gaag, Stefan Visscher, Karin A.M. Schurink and Peter J.F. Lucas |
| UU-CS-2007-012 |
pdf |
Mining Helium programs with Neon Jurriaan Hage and Peter van Keeken |
| UU-CS-2007-011 |
pdf |
Optimization for First Order Delaunay Triangulations Marc van Kreveld, Maarten Löffler, Rodrigo I. Silveira |
| UU-CS-2007-010 |
pdf |
An Algorithm for Computing Semi-Stable Semantics Martin Caminada |
| UU-CS-2007-009 |
ps.gz pdf |
Wooden Geometric Puzzles: Design and Hardness Proofs Helmut Alt, Hans L. Bodlaender, Marc van Kreveld, Günter Rote, Gerard Tel |
| UU-CS-2007-008 |
pdf |
Turning an interactive tool implemented in Haskell into a web application -- An experience report Sylvia Stuurman and Johan Jeuring |
| UU-CS-2007-007 |
pdf |
Strategy Feedback in an E-learning Tool for Mathematical Exercises Johan Jeuring and Wouter Pasman |
| UU-CS-2007-006 |
pdf |
Emotions as Heuristics for Rational Agents Bas R. Steunebrink, Mehdi Dastani, John-Jules Ch. Meyer |
| UU-CS-2007-005 |
pdf |
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems J.M. van den Akker, G. Diepen, and J.A. Hoogeveen |
| UU-CS-2007-004 |
pdf |
Postulates for Paraconsistent Reasoning and Fault Tolerant Logic Programming Martin Caminada and Jonathan Ben-Naim |
| UU-CS-2007-003 |
pdf |
Existence of Simple Tours of Imprecise Points Maarten Löffler |
| UU-CS-2007-002 |
pdf |
Finding Near-Optimal Rosters Using Column Generation Han Hoogeveen and Eelko Penninkx |
| UU-CS-2007-001 |
pdf |
A column generation approach for examination timetabling Roel Wijgers and Han Hoogeveen |
| UU-CS-2006-065 |
pdf |
An Integer Linear Programming Approach to Product Software Release Planning & Scheduling Chen Li, Marjan van den Akker, Sjaak Brinkkemper |
| UU-CS-2006-064 |
pdf |
The WITCHCRAFFT Baseline Measurement and Pilot Project Jö Garbers, Peter van Kranenburg, Anja Volk, Frans Wiering, Louis Peter Grijp, Remco C. Veltkamp, Martine de Bruin |
| UU-CS-2006-063 |
pdf |
Software product release planning through optimization and what-if analysis Marjan van den Akker, Sjaak Brinkemper, Guido Diepen, Johan Versendaal |
| UU-CS-2006-062 |
pdf |
Programmeerplagiaatdetectie met Marble Jurriaan Hage |
| UU-CS-2006-061 |
pdf |
A Landscape of Agent Systems in the Real World Virginia Dignum, Frank Dignum |
| UU-CS-2006-060 |
pdf |
Towards formal semantics for reorganization Virginia Dignum, Frank Dignum |
| UU-CS-2006-059 |
pdf |
Integrated Requirement Selection and Scheduling for the Release Planning of a Software Product C. Li, J.M. van den Akker, S. Brinkkemper, and G. Diepen |
| UU-CS-2006-058 |
pdf |
Complexity Results for Enhanced Qualitative Probabilistic Networks Johan Kwisthout and Gerard Tel |
| UU-CS-2006-057 |
not online |
Incremental method evolution in requirements management: A case study at Baan 1994-2006 Inge van de Weerd, Sjaak Brinkkemper, Johan Versendaal |
| UU-CS-2006-056 |
pdf |
Multi-dimensional Bayesian Network Classifiers Linda C. van der Gaag and Peter R. de Waal |
| UU-CS-2006-055 |
pdf |
Strategies for solving constraints in program analysis Jurriaan Hage and Bastiaan Heeren |
| UU-CS-2006-054 |
pdf |
Heuristics for type error discovery and recovery (revised revised) Jurriaan Hage and Bastiaan Heeren |
| UU-CS-2006-053 |
pdf |
FAT-miner: Mining Frequent Attribute Trees Jeroen De Knijf |
| UU-CS-2006-052 |
ps.gz pdf |
Open Problems in Parameterized and Exact Computation - IWPEC 2006 Hans L. Bodlaender, Leizhen Cai, Jianer Chen, Michael R. Fellows, Jan Arne Telle, Dániel Marx |
| UU-CS-2006-051 |
pdf |
Exploiting Type Annotations Atze Dijkstra and Doaitse S. Swierstra |
| UU-CS-2006-050 |
pdf |
Compression Picks the Significant Item Sets Matthijs van Leeuwen, Jilles Vreeken and Arno Siebes |
| UU-CS-2006-049 |
pdf |
The Generic Haskell user's guide, Version 1.60 - Diamond release Andres Löh, Johan Jeuring, and Alexey Rodriguez (editors) et al. |
| UU-CS-2006-048 |
pdf |
Frequent Patterns that Compress Ronnie Bathoorn, Arne Koopman, and Arno Siebes |
| UU-CS-2006-047 |
pdf |
Mining for Helium Jurriaan Hage and Peter van Keeken |
| UU-CS-2006-046 |
ps.gz pdf |
Two polynomial algorithms for relabeling non-monotone data Ad Feelders, Marina Velikova, Hennie Daniels |
| UU-CS-2006-045 |
pdf |
Proceedings of the First International Workshop on Software Product Management (Pre-publication) Johan Versendaal, Christof Ebert, Sjaak Brinkkemper (editors) |
| UU-CS-2006-044 |
pdf |
A Case Study of a product software vendor's Customer Configuration Updating Process: GX Creative Online Development Slinger Jansen, Sjaak Brinkkemper, Jurriaan Souer |
| UU-CS-2006-043 |
pdf |
Testing properties of generic functions Patrik Jansson, Johan Jeuring, and students of the Utrecht University Generic Programming class |
| UU-CS-2006-042 |
ps.gz pdf |
A Cubic Kernel for Feedback Vertex Set Hans L. Bodlaender |
| UU-CS-2006-041 |
ps.gz pdf |
Treewidth: Characterizations, Applications, and Computations Hans L. Bodlaender |
| UU-CS-2006-040 |
pdf |
An interactive tool for manipulating logical formulae Josje Lodder, Johan Jeuring, and Harrie Passier |
| UU-CS-2006-039 |
pdf |
Generating generic functions Johan Jeuring, Alexey Rodriguez, and Gideon Smeding |
| UU-CS-2006-038 |
pdf |
Convergence in Markovian Models with Implications for Efficiency of Inference Theodore Charitos, Peter R. de Waal, Linda C. van der Gaag |
| UU-CS-2006-037 |
ps.gz pdf |
On the Representation of Disk Graphs Erik Jan van Leeuwen and J. van Leeuwen |
| UU-CS-2006-036 |
ps.gz pdf |
Pushing using Compliance Dennis Nieuwenhuisen, A. Frank van der Stappen, and Mark H. Overmars |
| UU-CS-2006-035 |
ps.gz pdf |
An Effective Framework for Path Planning amidst Movable Obstacles Dennis Nieuwenhuisen, A. Frank van der Stappen, and Mark H. Overmars |
| UU-CS-2006-034 |
pdf |
Enhanced Qualitative Probabilistic Networks for Resolving Trade-offs Silja Renooij and Linda C. van der Gaag |
| UU-CS-2006-033 |
pdf |
Repairing Conceptual Mismatches in Dialogue: a Computational Approach Robbert-Jan Beun and Rogier M. van Eijk |
| UU-CS-2006-032 |
ps.gz pdf |
On exact algorithms for treewidth Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos |
| UU-CS-2006-031 |
ps.gz pdf |
Region-restricted clustering for geographic data mining Joachim Gudmundsson, Marc van Kreveld, Giri Narasimhan |
| UU-CS-2006-030 |
pdf |
SHREC2006: 3D Shape Retrieval Contest Remco C. Veltkamp, Remco Ruijsenaars, Michela Spagnuolo, Roelof van Zwol, Frank ter Haar |
| UU-CS-2006-029 |
ps.gz pdf |
On Realistic Terrains Esther Moet, Marc van Kreveld, and A. Frank van der Stappen |
| UU-CS-2006-028 |
pdf |
Towards a characterization of bipartite switching classes by means of forbidden subgraphs Jurriaan Hage and Tero Harju |
| UU-CS-2006-027 |
pdf |
Using Closed Sets of Rules for the Entailment of Literals Martin Caminada |
| UU-CS-2006-026 |
pdf |
Typed Contracts for Functional Programming Ralf Hinze, Johan Jeuring, and Andres Löh |
| UU-CS-2006-025 |
pdf |
Customizing an XML-Haskell data binding with type isomorphism inference in Generic Haskell Frank Atanassow and Johan Jeuring |
| UU-CS-2006-024 |
pdf |
Generic Programming for Software Evolution Johan Jeuring and Rinus Plasmeijer |
| UU-CS-2006-023 |
pdf |
On the Issue of Reinstatement in Argumentation Martin Caminada |
| UU-CS-2006-022 |
pdf |
Comparing approaches to generic programming in Haskell Ralf Hinze, Johan Jeuring, Andres Löh |
| UU-CS-2006-021 |
pdf |
Feedback in an interactive equation solver Harrie Passier and Johan Jeuring |
| UU-CS-2006-020 |
pdf |
Generic Views on Data Types Stefan Holdermans, Johan Jeuring, Andres Löh and Alexey Rodriguez |
| UU-CS-2006-019 |
pdf |
Largest and Smallest Convex Hulls for Imprecise Points Maarten Löffler en Marc van Kreveld |
| UU-CS-2006-018 |
ps.gz pdf |
Lazy Autoconfiguration in Mobile Ad Hoc Networks and Dynamic Sets of Mobile Agents Jan van Leeuwen and Jiri Wiederman |
| UU-CS-2006-017 |
pdf |
Geheimschrift op de TI-83+ Gerard Tel |
| UU-CS-2006-016 |
pdf |
Netherware: analysis, results, and success factors of the designed curriculum unit Hanne ten Berge, Stephan Ramaekers, Sjaak Brinkkemper, Albert Pilot |
| UU-CS-2006-015 |
ps.gz pdf |
An exact algorithm for graph coloring with polynomial memory Hans L. Bodlaender and Dieter Kratsch |
| UU-CS-2006-014 |
pdf |
A Reference Framework for Software Product Management Inge van de Weerd, Sjaak Brinkkemper, Richard Nieuwenhuis, Johan Versendaal and Lex Bijlsma |
| UU-CS-2006-013 |
ps.gz pdf |
Weighted Treewidth: Algorithmic Techniques and Results Emgad Bachoore and Hans L. Bodlaender |
| UU-CS-2006-012 |
ps.gz pdf |
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth Emgad Bachoore and Hans L. Bodlaender |
| UU-CS-2006-011 |
ps.gz pdf |
Scale-Dependent Definitions of Gradient and Aspect and their Computation Iris Reinbacher, Marc van Kreveld, Tim Adelaar and Marc Benkert |
| UU-CS-2006-010 |
ps.gz pdf |
Convex recoloring of leaf-colored trees Emgad H. Bachoore and Hans L. Bodlaender |
| UU-CS-2006-009 |
pdf |
MetaBorg in Action: Examples of Domain-specific Language Embedding and Assimilation using Stratego/XT Martin Bravenboer, René de Groot, Eelco Visser |
| UU-CS-2006-008 |
pdf |
A Product Software Knowledge Infrastructure for Situational Capability Maturation: Vision and Case Studies in Product Management Inge van de Weerd, Johan Versendaal and Sjaak Brinkkemper |
| UU-CS-2006-007 |
pdf |
Heuristics for type error discovery and recovery (revised) Jurriaan Hage, Bastiaan Heeren |
| UU-CS-2006-006 |
ps.gz pdf |
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin |
| UU-CS-2006-005 |
ps.gz |
Descisiveness in Loopy Propagation Janneke H. Bolt, Linda C. van der Gaag |
| UU-CS-2006-004 |
pdf |
An Inquiry Tool for Stakeholder Concerns of Architectural Viewpoints: a Case Study at a large Financial Service Provider Henk Koning, Rik Box, Sjaak Brinkkemper |
| UU-CS-2006-003 |
pdf |
A Lightweight Method for the Modeling of Enterprise Architectures: Introduction and Emperical Validation Henk Koning, Rik Bos, Sjaak Brinkkemper |
| UU-CS-2006-002 |
pdf |
Alignment matters - Improving business functions using the Procurement Alignment Framework Ronald Batenburg and Johan Versendaal |
| UU-CS-2006-001 |
ps.gz pdf |
Interval Routing and Minor-Monotone Graph Parameters Erwin M. Bakker, Hans L. Bodlaender, Richard B. Tan, and Jan van Leeuwen |
| UU-CS-2005-060 |
pdf |
Type Inference for Generic Haskell Alexey Rodriguez, Johan Jeuring, Andres Löh |
| UU-CS-2005-059 |
pdf |
Het IT-methodenlandschap in Nederland anno 2005 Via selectie, implementatie en toepassing naar succes? Rob Neering Msc., Dr. Ronald Batenburg, Drs. Erik Bunk, Dr. Frank Harmsen, Prof. dr. Sjaak Brinkkemper |
| UU-CS-2005-058 |
pdf |
Learning Bayesian Network Parameters Under Order Constraints A. Feelders, L.C. van der Gaag |
| UU-CS-2005-057 |
pdf |
Stable independence in perfect maps P.R. de Waal and L.C. van der Gaag |
| UU-CS-2005-056 |
pdf |
Stable Independence and Complexity of Representation P.R. de Waal and L.C. van der Gaag |
| UU-CS-2005-055 |
pdf |
The Helium Logging Facility Jurriaan Hage |
| UU-CS-2005-054 |
ps.gz pdf |
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. Hoogeveen |
| UU-CS-2005-053 |
pdf |
Proceedings of the Sixth Stratego Users Day Karl Trygve Kallenberg and Eelco Visser (editor) |
| UU-CS-2005-052 |
pdf |
Stratego/XT 0.16. Components for Transformation Systems Martin Bravenboer, Karl Trygve Kallenberg, Rob Vermaas, Eelco Visser |
| UU-CS-2005-051 |
ps.gz pdf |
Treewidth Lower Bounds with Brambles Hans L. Bodlaender, Alexander Grigoriev, and Arie M. C. A. Koster |
| UU-CS-2005-050 |
pdf |
Situational Requirements Engineering for the Development of Content Management System-based Web Applications Jurriaan Souer, Inge van de Weerd, Johan Versendaal, and Sjaak Brinkkemper |
| UU-CS-2005-049 |
ps.gz pdf |
Visibility Maps of Segments and Triangles in 3D Esther Moet, Christian Knauer, and Marc van Kreveld |
| UU-CS-2005-048 |
pdf |
Learning to Play Board Games using Temporal Difference Methods Marco Wiering, Jan Peter Patist, Henk Mannen |
| UU-CS-2005-047 |
pdf |
Alignment, Merging and Hole Filling Experiments with 3D Range Scans F. B. ter Haar and R. C. Veltkamp |
| UU-CS-2005-046 |
pdf |
Theorem Prover Supported Logics for Small Imperative Languages I.S.W.B. Prasetya, A. Azurat, T.E.J. Vos, A. van Leeuwen, H. Suhartanto |
| UU-CS-2005-045 |
pdf |
On the Issue of Reinstatement in Argumentation Martin Caminada |
| UU-CS-2005-044 |
ps.gz pdf |
Efficient Detection of Motion Patterns in Spatio-Temporal Data Sets Joachim Gudmundsson, Marc van Kreveld, Bettina Speckmann |
| UU-CS-2005-043 |
pdf |
WEM: A design method for CMS-based web implementations Inge van de Weerd |
| UU-CS-2005-042 |
ps.gz pdf |
Generalizing Monotonicity: On Recognizing Special Classes of Polygons and Polyhedra Prosenjit Bose and Marc van Kreveld |
| UU-CS-2005-041 |
pdf |
Definition and Validation of the Key Process Areas of Release, Delivery and Deployment of Product Software Vendors: turning the ugly duckling into a swan Slinger Jansen and Sjaak Brinkkemper |
| UU-CS-2005-040 |
ps.gz pdf |
The Visibility-Voronoi Complex and Its Applications Ron Wein, Jur P. van den Berg, Dan Halperin |
| UU-CS-2005-039 |
pdf |
Service Configuration Management Eelco Dolstra, Martin Bravenboer, Eelco Visser |
| UU-CS-2005-038 |
pdf |
A Collection of XML documents and Query Tasks Joris Graaumans |
| UU-CS-2005-037 |
pdf |
Realizing partitions respecting full and partial order information Erik Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark Overmars, Sue Whitesides |
| UU-CS-2005-036 |
pdf |
Web-based Delineation of Imprecise Regions Avi Arampatzis, Marc van Kreveld, Iris Reinbacher, Christopher B. Jones, Subodh Vaid, Paul Clough, Hideo Joho, and Mark Sanderson |
| UU-CS-2005-035 |
pdf |
Generalized Type-Based Disambiguation of Meta Programs with Concrete Object Syntax Martin Bravenboer, Rob Vermaas, Jurgen Vinju, Eelco Visser |
| UU-CS-2005-034 |
pdf |
Transformations for Abstractions Eelco Visser |
| UU-CS-2005-033 |
pdf |
Ruler: Programming Type Rules Atze Dijkstra and S. Doaitse Swierstra |
| UU-CS-2005-032 |
pdf |
Making Implicit Parameters Explicit Atze Dijkstra and S. Doaitse Swierstra |
| UU-CS-2005-031 |
pdf |
Adaptive Code Reuse by Aspects, Cloning and Renaming Anya Helene Bagge, Martin Bravenboer, Karl Trygve Kalleberg, Koen Muilwijk, Eelco Visser |
| UU-CS-2005-030 |
pdf |
Combining Aspect-Oriented and Strategic Programming Karl Trygve Kalleberg, Eelco Visser |
| UU-CS-2005-029 |
pdf |
Heuristics for type error discovery and recovery Jurriaan Hage and Bastiaan Heeren |
| UU-CS-2005-028 |
ps.gz pdf |
Region Intervisibility in Terrains Esther Moet, Marc van Kreveld en René van Oostrum |
| UU-CS-2005-027 |
pdf |
Parallel machine scheduling through column generation: minimax objective functions, release dates, deadlines and/or generalized precedence constraints J. M. van den Akker, J. A. Hoogeveen, J. W. van Kempen |
| UU-CS-2005-026 |
pdf |
Delineating Boundaries for Imprecise Regions Iris Reinbacher, Marc Benkert, Marc van Kreveld, Joseph Mitchell, Jack Snoeyink, and Alexander Wolff |
| UU-CS-2005-025 |
pdf |
Preserving order in non-order preserving parsers Rui Guerra, Arthur I. Baars, S. Doaitse Swierstra, and João Saraiva |
| UU-CS-2005-024 |
ps.gz pdf |
On Improving the Clearance for Robots in High-Dimensional Configuration Spaces Roland Geraerts |
| UU-CS-2005-023 |
pdf |
Collapse in formal argumentation systems Martin Caminada |
| UU-CS-2005-022 |
pdf |
A Survey of Strategies in Rule-Based Program Transformation Systems E. Visser |
| UU-CS-2005-021 |
ps.gz pdf |
Coherence and Flexibility in Dialogue Games for Argumentation Henry Prakken |
| UU-CS-2005-020 |
pdf |
Generating Realistic Terrains with Higher-Order Delauney Triangulations Thierry de Kok, Marc van Kreveld, Maarten Löffler |
| UU-CS-2005-019 |
pdf |
Content Authoring in an XML-based and Author Friendly Environment Roelof van Zwol, Astrid Callista |
| UU-CS-2005-018 |
ps.gz pdf |
Discovering Treewidth Hans L. Bodlaender |
| UU-CS-2005-017 |
pdf |
Multiple polyline to polygon matching M. Tanase, R. C. Veltkamp, Herman Haverkort |
| UU-CS-2005-016 |
pdf |
Ordering Type Constraints: A Structured Approach Jurriaan Hage and Bastiaan Heeren |
| UU-CS-2005-015 |
pdf |
Task and Social Coordination in Agent Organizations Virginia Dignum and Frank Dignum |
| UU-CS-2005-014 |
pdf |
Generic Knowledge Structures for Probabilistic-Network Engineering Eveline M. Helsper and Linda C. van der Gaag |
| UU-CS-2005-013 |
pdf |
Dynamic logic for plan revision in intelligent agents M. Birna van Riemsdijk, Frank S. de Boer, and John-Jules Meyer |
| UU-CS-2005-012 |
pdf |
Generic Views on Data Types Stefan Holdermans, Johan Jeuring and Andres L\"oh |
| UU-CS-2005-011 |
ps.gz pdf |
Online Topological Ordering Irit Katriel and Hans L. Bodlaender |
| UU-CS-2005-010 |
ps.gz |
Proving Norm Compliancy of Protocols in Electronic Institutions Huib Aldewereld, Frank Dignum, John-Jules Meyer, and Javier Vázquez-Salceda |
| UU-CS-2005-009 |
pdf |
The Maturity of Product Lifecycle Management in Dutch Organizations. A Strategic Perspective Ronald Batenburg, Remko Helms, Johan Versendaal |
| UU-CS-2005-008 |
pdf |
Inferring Type Isomorphisms Generically - With an application to an XML Schema-Haskell data binding Frank Atanassow and Johan Jeuring |
| UU-CS-2005-007 |
pdf |
The Embedding Problem for Switching Classes Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg |
| UU-CS-2005-006 |
pdf |
Composing Source-to-Source Data-Flow Transformations with Rewriting Strategies and Dependent Dynamic Rewrite Rules K. Olmos and E. Visser |
| UU-CS-2005-005 |
pdf |
Program Transformation with Scoped Dynamic Rewrite Rules M. Bravenboer, A. van Dam, K. Olmos, and E. Visser |
| UU-CS-2005-004 |
pdf |
Generic Haskell User's Guide -- Version 1.42 (Coral) Andres Loeh, Johan Jeuring (editors); Dave Clarke, Ralf Hinze, Alexey Rodriguez, Jan de Wit |
| UU-CS-2005-003 |
pdf |
Approximation Algorithms for the Earth Mover's Distance Under Transformations Using Reference Points Oliver Klein, Remco C. Veltkamp |
| UU-CS-2005-002 |
pdf |
Web Cube: a Programming Model for Reliable Web Applications I.S.W.B. Prasetya, T.E.J. Vos, S.D. Swierstra, B. Widjaja |
| UU-CS-2005-001 |
pdf |
Busines Alignment in the Procurement Domain Johan Versendaal, Mark Beukers, Ronald Batenburg |
| UU-CS-2004-068 |
ps.gz pdf |
Automatic Construction of High Quality Roadmaps for Path Planning D. Nieuwenhuisen, A. Kamphuis, M. Mooijekind, M. H. Overmars |
| UU-CS-2004-067 |
ps.gz pdf |
Minimizing the number of late jobs in case of stochastic processing times with minimum success probabilities Marjan van den Akker and Han Hoogeveen |
| UU-CS-2004-066 |
ps.gz pdf |
Approximation Algorithms for Unit Disk Graphs Erik Jan van Leeuwen |
| UU-CS-2004-065 |
pdf |
Knowledge Entry Maps: structuring of method knowledge in the IT industry Remko Helms, Sjaak Brinkkemper, Job van Oosterum, Frank de Nijs |
| UU-CS-2004-064 |
ps.gz pdf |
Useful Cycles in Probabilistic Roadmap Graphs Dennis Nieuwenhuisen and Mark H. Overmars |
| UU-CS-2004-063 |
ps.gz pdf |
Flexible Release Composition using Integer Linear Programming Marjan van den Akker, Sjaak Brinkkemper, Guido Diepen, Johan Versendaal |
| UU-CS-2004-062 |
ps.gz pdf |
Finding Paths for Coherent Groups using Clearance Arno Kamphuis en Mark H. Overmars |
| UU-CS-2004-061 |
ps.gz pdf |
Approximate Unions of Lines and Minkowski Sums Marc van Kreveld and A. Frank van der Stappen |
| UU-CS-2004-060 |
pdf |
A Ground Truth For Half A Million Musical Incipits Rainer Typke, Marc den Hoed, Justin de Nooijer, Frans Wiering, Remco C. Veltkamp |
| UU-CS-2004-059 |
pdf |
Explicit implicit parameters Atze Dijkstra and S. Doaitse Swierstra |
| UU-CS-2004-058 |
ps.gz pdf |
Algorithms for graphs embeddable with few crossings per edge Alexander Grigoriev and Hans L. Bodlaender |
| UU-CS-2004-057 |
pdf |
Learning Object-Oriented Design by Creating Games Mark Overmars |
| UU-CS-2004-056 |
pdf |
Game Design in Education Mark Overmars |
| UU-CS-2004-055 |
ps.gz pdf |
An Intersection-Sensitive Algorithm for Snap Routing Mark de Berg, Dan Halperin, Mark Overmars |
| UU-CS-2004-054 |
pdf |
Building Verification Condition Generators by Compositional Extensions I. S. W. B. Prasetya, A. Azurat, and T.E.J. Vos |
| UU-CS-2004-053 |
ps.gz pdf |
On the Maximum Cardinality Search Lower Bound for Treewidth Hans L. Bodlaender and Arie M. C. A. Koster |
| UU-CS-2004-052 |
pdf |
The lazy virtual machine specification Daan Leijen |
| UU-CS-2004-051 |
pdf |
First-class labels for extensible rows Daan Leijen |
| UU-CS-2004-050 |
ps.gz pdf |
Degree-Based Treewidth Lower Bounds Arie M. C. A. Koster, Thomas Wolle, and Hans L. Bodlaender |
| UU-CS-2004-049 |
pdf |
Bringing IDEAs into Practice: Optimization in a Minimally Invasive Vascular Intervention Simulation System Peter A.N. Bosman and Tanja Alderliesten |
| UU-CS-2004-048 |
pdf |
Learning Probabilistic Tree Grammars for Genetic Programming Peter A.N. Bosman and Edwin D. de Jong |
| UU-CS-2004-047 |
pdf |
Grammar Transformations in an EDA for Genetic Programming Peter A.N. Bosman and Edwin D. de Jong |
| UU-CS-2004-046 |
pdf |
Build-level Component-Based Software Engineering Merijn de Jonge |
| UU-CS-2004-045 |
pdf |
Nix: A Safe and Policy-Free System for Software Deployment Eelco Dolstra, Merijn de Jonge and Eelco Visser |
| UU-CS-2004-044 |
pdf |
Imposing a Memory Management Discipline on Software Deployment Eelco Dolstra, Eelco Visser and Merijn de Jonge |
| UU-CS-2004-043 |
ps.gz pdf |
Area-Preserving Approximations of Polygonal Paths Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc van Kreveld, and Bettina Speckmann |
| UU-CS-2004-042 |
ps.gz pdf |
A Note on Contraction Degeneracy Thomas Wolle, Arie M. C. A. Koster, Hans L. Bodlaender |
| UU-CS-2004-040 |
ps.gz pdf |
On Rectangular Cartograms Marc van Kreveld, Bettina Speckmann |
| UU-CS-2004-039 |
pdf |
A first attempt at type class directives Bastiaan Heeren en Jurriaan Hage |
| UU-CS-2004-038 |
pdf |
Normative Agents in Health Care: Uses and Challenges Javier Vazquez-Salceda |
| UU-CS-2004-037 |
pdf |
Typing Haskell with an Attribute Grammar (Part I) Atze Dijkstra, Doaitse Swierstra |
| UU-CS-2004-036 |
ps.gz pdf |
New Upper Bound Heuristics for Treewidth Emgad H. Bachoore and Hans L. Bodlaender |
| UU-CS-2004-035 |
pdf |
Knowledge Entry Maps: ontology to structure method knowledge in the IT industry Remko Helms, Sjaak Brinkkemper, Frank de Nijs, Job van Oosterum |
| UU-CS-2004-034 |
ps.gz pdf |
Contraction and Treewidth Lower Bounds Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle |
| UU-CS-2004-033 |
pdf |
Automatic Generation of Camera Motion to Track a Moving Guide Onno Goemans and Mark Overmars |
| UU-CS-2004-032 |
ps.gz pdf |
Set Induced Relations and Relational Semantics Paul Harrenstein |
| UU-CS-2004-031 |
ps.gz pdf |
Contraction Degeneracy on Cographs Hans L. Bodlaender and Thomas Wolle |
| UU-CS-2004-030 |
ps.gz pdf |
Space-efficient construction variants of dynamic programming Hans L. Bodlaender and Jan Arne Telle |
| UU-CS-2004-029 |
pdf |
Intelligent Traffic Light Control Marco Wiering, Jelle van Veenen, Jilles Vreeken, Arne Koopman |
| UU-CS-2004-028 |
ps.gz pdf |
A Note on Edge Contraction Thomas Wolle and Hans L. Bodlaender |
| UU-CS-2004-027 |
ps.gz pdf |
Distributed Ranking Methods for Geographic Information Retrieval Marc van Kreveld, Iris Reinbacher, Avi Arampatzis, Roelof van Zwol |
| UU-CS-2004-026 |
pdf |
A Comparison of Text and Shape Matching for Retrieval of Online 3D Models Patrick Min |
| UU-CS-2004-025a |
pdf |
Linear, Online, Functional Pretty Printing (corrected and extended version) S. Doaitse Swierstra |
| UU-CS-2004-024 |
pdf |
Decoupling Source Trees into Build-level Components Merijn de Jonge |
| UU-CS-2004-023 |
pdf |
Embedding in Switching Classes with Skew Gains Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, and Grzegorz Rosenberg |
| UU-CS-2004-022 |
pdf |
The Priority R-Tree: a practically efficient and worst-case-optimal R-tree Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi |
| UU-CS-2004-021 |
pdf |
ICT-Kanskaart Vergrijzing: Innovatieve ICT-Kansen op het Terrein van de Vergrijzingsproblematiek Ronald Batenburg, Elly Breedveld, Jolijn van Haaf, Kitty Pardoel, Johan Versendaal |
| UU-CS-2004-020 |
ps.gz pdf |
Roadmap-based Motion Planning in Dynamic Environments Jur P. van den Berg and Mark H. Overmars |
| UU-CS-2004-019 |
ps.gz pdf |
An Agent-Mediated Approach to the Support of Knowledge Sharing in Organizations V. Dignum, F. Dignum, J.J. Meyer |
| UU-CS-2004-018 |
ps.gz pdf |
Lineages of Automata Peter Verbaan, Jan van Leeuwen, Jiri Wiedermann |
| UU-CS-2004-017 |
pdf |
An Overview of Agents in Knowledge Management Virginia Dignum |
| UU-CS-2004-016 |
pdf |
Abstract and Concrete Norms in Institutions Davide Grossi and Frank Dignum |
| UU-CS-2004-015 |
pdf |
Organizing Multi-Agent Systems Javier Vázquez-Salceda, Virginia Dignum, Frank Dignum |
| UU-CS-2004-014 |
ps.gz pdf |
Maximizing the Area of Overlap of two Unions of Disks under Rigid Motion Mark de Berg, Sergio Cabello, Panos Giannopoulos, Remco C. Veltkamp |
| UU-CS-2004-013 |
ps.gz pdf |
On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen |
| UU-CS-2004-012 |
pdf |
Retrofitting the AutoBayes Program Synthesis System with Concrete Syntax Bernd Fischer and Eelco Visser |
| UU-CS-2004-011 |
pdf |
Program Transformation with Stratego/XT. Rules, Strategies, Tools, and Systems in Stratego/XT 0.9 Eelco Visser |
| UU-CS-2004-010 |
ps.gz pdf |
Equitable colorings of bounded treewidth graphs Hans L. Bodlaender, Fedor V. Fomin |
| UU-CS-2004-009 |
ps.gz pdf |
Significant-Presence Range Queries in Categorical Data Mark de Berg and Herman J. Haverkort |
| UU-CS-2004-008 |
ps.gz pdf |
Optimal Spanners for Axis-Aligned Rectangles Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett,
Herman J. Haverkort, Naoki Katoh and Alexander Wolff |
| UU-CS-2004-007 |
ps.gz pdf |
Constrained Higher Order Delaunay Triangulations Joachim Gudmundsson, Herman J. Haverkort, Marc van Kreveld |
| UU-CS-2004-006 |
ps.gz pdf |
Introducing Situational Signs in Qualitative Probabilistic Networks Janneke H. Bolt, Linda C. van der Gaag, Silja Renooij |
| UU-CS-2004-005 |
pdf |
Ontological Feedback in Multiagent Systems Robbert-Jan Beun, Rogier M. van Eijk, and Huub Prüst |
| UU-CS-2004-004 |
pdf |
Immobilizing Hinged Polygons Jae-Sook Cheong, A. Frank van der Stappen, Ken Goldberg, Mark H. Overmars, Elon Rimon |
| UU-CS-2004-003 |
pdf |
Optimal communication vocubularies in the presence of heterogeneous ontologies Jurriaan van Diggelen, Robbert Jan Beun, Frank Dignum, Rogier M. van Eijk, John-Jules Meyer |
| UU-CS-2004-002 |
pdf |
Semantics of Plan Revision in Intelligent Agents M. Birna van Riemsdijk, John-Jules Ch. Meyer, Frank S. de Boer |
| UU-CS-2004-001 |
ps.gz pdf |
A Note on the Complexity of Network Reliability Problems Hans L. Bodlaender and Thomas Wolle |
| UU-CS-2003-055 |
pdf |
Feedback in Human Computer Interaction: Resolving Ontological discrepancies Robbert-Jan Beun and Rogier M. van Eijk |
| UU-CS-2003-054 |
pdf |
Putting Engineering into the Enterprise System Remko Helms |
| UU-CS-2003-053 |
ps.gz pdf |
The elicitation of test-selection strategies: a case study in oncology Danielle Sent, Linda C. van der Gaag, Cilia L.M. Witteman, Berthe M.P. Aleman, and Babs G. Taal |
| UU-CS-2003-052 |
pdf |
Timeline Variability: The Variability of Binding Time of Variation Points E. Dolstra, G. Florijn, and E. Visser |
| UU-CS-2003-051 |
pdf |
Capturing Timeline Variability with Transparent Configuration Environments E. Dolstra, G. Florijn, M. de Jonge, and E. Visser |
| UU-CS-2003-050 |
pdf |
Strategies for Fusing Logic and Control via Local, Application-Specific Transformations P. Johann and E. Visser |
| UU-CS-2003-049 |
pdf |
Turning dynamic typing into static typing by program specialization K. Olmos and E. Visser |
| UU-CS-2003-048 |
pdf |
Program Transformation Mechanics. A Classification of Mechanisms for Program Transformation with a Survey of Existing Transformation Systems Jonne van Wijngaarden and Eelco Visser |
| UU-CS-2003-047 |
ps.gz |
Evolutionary Markov chain Monte Carlo
Madalina M. Drugan, Dirk Thierens |
| UU-CS-2003-046 |
ps.gz pdf |
Convergence Time Analysis for the Multi-objective Counting Ones Problem Dirk Thierens |
| UU-CS-2003-045 |
pdf |
Turntaking: a case for agent-based programming Joris Hulstijn and Gerard A. W. Vreeswijk |
| UU-CS-2003-044 |
ps.gz pdf |
Guarding Art Galleries by Guarding Witnesses Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, and Chan-Su Shin |
| UU-CS-2003-043 |
pdf |
A UNITY-based Framework towards Component Based Systems I.S.W.B. Prasetya, T.E.J. Vos, A. Azurat, and S.D. Swierstra |
| UU-CS-2003-042 |
ps.gz pdf |
Ontologies for Probabilistic Networks Eveline M. Helsper and Linda C. van der Gaag |
| UU-CS-2003-041 |
ps.gz pdf |
Sampling Techniques for Probabilistic Roadmap Planners Roland Geraerts, Mark H. Overmars |
| UU-CS-2003-040 |
ps.gz pdf |
Approximation Algorithms for Spreading Points Sergio Cabello |
| UU-CS-2003-039 |
ps.gz pdf |
Clearance Based Path Optimization for Motion Planning Roland Geraerts, Mark Overmars |
| UU-CS-2003-038 |
ps.gz pdf |
On Algorithms for (P5,Gem)-Free Graphs Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad |
| UU-CS-2003-037 |
ps.gz pdf |
Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners Jur van den Berg, Mark H. Overmars |
| UU-CS-2003-036 |
ps.gz pdf |
Motion Planning for Coherent Groups of Entities Arno Kamphuis, Mark H. Overmars |
| UU-CS-2003-035 |
ps.gz pdf |
Computing Maximally Separated Sets in the Plane and Independent Sets in the Intersection Graph of Unit Disks Pankaj K. Agarwal, Mark Overmars, and Micha Sharir |
| UU-CS-2003-034 |
pdf |
A simple scheme to structure and process the information of parties in online forms of alternative dispute resolution Gerard Vreeswijk |
| UU-CS-2003-033 |
ps.gz pdf |
Rectilinear Graphs and Angular Resolution Hans L. Bodlaender and Gerard Tel |
| UU-CS-2003-032 |
ps.gz pdf |
A Rule of Adaptation for OO Cees Pierik and Frank S. de Boer |
| UU-CS-2003-031 |
ps.gz pdf |
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard Sergii Cabello |
| UU-CS-2003-030 |
pdf |
Proceedings of the First International Workshop on Aliasing, Confinement and Ownership in Object-oriented Programming (IWACO) Dave Clark (editor) |
| UU-CS-2003-029 |
pdf |
On the Education of GIS Algorithm Design Marc van Kreveld |
| UU-CS-2003-028 |
pdf |
Improvement Framework for Buyer-Owned Trading Exchanges: Procurement at Komatsu America Corp. - Peoria Manufacturing Operations Johan Versendaal and Sjaak Brinkkemper |
| UU-CS-2003-027 |
ps.gz pdf |
Safe Separators for Treewidth Hans L. Bodlaender and Arie M. C. A. Koster |
| UU-CS-2003-026 |
ps.gz pdf |
A Framework for Network Reliability Problems on Graphs of Bounded Treewidth Thomas Wolle |
| UU-CS-2003-025 |
ps.gz |
The Area of Overlap of two Unions of Convex Objects under Translations Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp |
| UU-CS-2003-024 |
ps.gz pdf |
Using Transportation Distances for Measuring Melodic Similarity Rainer Typke, Panos Giannopoulos, Remco C. Veltkamp, Frans Wiering, René van Oostrum |
| UU-CS-2003-023 |
ps.gz pdf |
Scripting XML with Generic Haskell Frank Atanassow, Dave Clarke, Johan Jeuring |
| UU-CS-2003-022 |
pdf |
Dependency-style Generic Haskell Andres Lö, Dave Clarke, and Johan Jeuring |
| UU-CS-2003-021 |
pdf |
Post-Processing for MCMC Edwin de Jong, Marco Wiering, and Madalina Drugan |
| UU-CS-2003-020 |
pdf |
Good NEWS: Partitioning a Simple Polygon by Compass Direction Marc van Kreveld, Iris Reinbacher |
| UU-CS-2003-019 |
pdf |
Interactive needle insertions in 3D nonlinear material Han-Wen Nienhuys, A. Frank van der Stappen |
| UU-CS-2003-018 |
pdf |
Maintaining mesh connectivity using a simplex-based data structure Han-Wen Nienhuys, A. Frank van der Stappen |
| UU-CS-2003-017 |
pdf |
Collaborative Frame Selection: Exact and Distributed Algorithms for a Networked Robotic Camera with Discrete Zoom Levels Dezhen Song, A. Frank van der Stappen, Ken Goldberg |
| UU-CS-2003-016 |
pdf |
Generic Haskell: Applications Ralf Hinze and Johan Jeuring |
| UU-CS-2003-015 |
pdf |
Generic Haskell: Practice and Theory Ralf Hinze and Johan Jeuring |
| UU-CS-2003-014 |
pdf |
Automated segmentation of abdominal aortic aneurysms in multi-spectral MR images Marleen de Bruijne, Bram van Ginneken, Wilbert Bartels, Maarten J. van der Laan, Jan D. Blankensteijn, Wiro J. Niessen, Max A. Viergever |
| UU-CS-2003-013 |
pdf |
Active shape model segmentation using a non-linear appearance model: application to 3D AAA segmentation Marleen de Bruijne, Bram van Ginneken, Wiro J. Niessen, Max A. Viergever |
| UU-CS-2003-012 |
pdf |
Three-dimensional point distribution models for tubular objects Marleen de Bruijne, Bram van Ginneken, Max A. Viergever, Wiro J. Niessen |
| UU-CS-2003-011 |
pdf |
Interactive segmentation of abdominal aortic aneurysms in CTA images Marleen de Bruijne, Bram van Ginneken, Max A. Viergever, Wiro J. Niessen |
| UU-CS-2003-010 |
ps.gz pdf |
A Syntax-Directed Hoare Logic for Object-Oriented Programming Concepts Cees Pierik, Frank S. de Boer |
| UU-CS-2003-009 |
ps.gz pdf |
Modular Variable-length Representations from Pareto-Coevolution Edwin D. de Jong |
| UU-CS-2003-008 |
pdf |
Spiking neural networks, an introduction Jilles Vreeken |
| UU-CS-2003-007 |
pdf |
Dynamic neural networks, comparing spiking circuits and LSTM Arne Koopman, Matthijs van Leeuwen, Jilles Vreeken |
| UU-CS-2003-006 |
pdf |
Facility Location and the Geometric Minimum-Diameter Spanning Tree Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, and Alexander Wolff |
| UU-CS-2003-005 |
ps.gz pdf |
On the Implementation of Polygonal Approximation Algorithms Ovidiu Grigore, Remco C. Veltkamp |
| UU-CS-2003-004 |
pdf |
Motion Planning for Camera Movements in Virtual Environments Dennis Nieuwenhuisen, Mark H. Overmars |
| UU-CS-2003-003 |
ps.gz pdf |
Approximation algorithms for aligning points Sergio Cabello, Marc van Kreveld |
| UU-CS-2003-002 |
ps.gz pdf |
Towards an environment for the verification of annotated object-oriented programs Frank S. de Boer, Cees Pierik |
| UU-CS-2003-001 |
ps.gz pdf |
Pre-processing rules for triangulation of probabilistic networks Hans L. Bodlaender, Arie M. C. A. Koster, and Frank van den Eijkhof |
| UU-CS-2002-056 |
ps.gz pdf |
Adaptive mutation rate control schemes in genetic algorithms Dirk Thierens |
| UU-CS-2002-055 |
ps.gz pdf |
Predictive measures for problem representation and genetic operator design Dirk Thierens |
| UU-CS-2002-054 |
ps.gz pdf |
Random Keys on ICE: Marginal Product Factorized Probability Distributions in Permutation Optimization Peter A. N. Bosman, Dirk Thierens |
| UU-CS-2002-053 |
ps.gz pdf |
Permutation Optimization by Iterated Estimation of Random Keys Marginal Product Factorizations Peter A. N. Bosman and Dirk Thierens |
| UU-CS-2002-052 |
ps.gz pdf |
A Thorough Documentation of Obtained Results on Real-Valued Continious and Combinatorial Multi-Objective Optimization Problems Using Diversity Preserving Mixture-Based Iterated Density Estimation Evolutionary Algorithms Peter A. N. Bosman, Dirk Thierens |
| UU-CS-2002-051 |
ps.gz pdf |
Safe reduction rules for weighted treewidth Frank van den Eijkhof, Hans L. Bodlaender, and Arie M.C.A. Koster |
| UU-CS-2002-050 |
ps.gz pdf |
Parametric Search Made Practical René van Oostrum and Remco C. Veltkamp |
| UU-CS-2002-049 |
pdf |
Mutual Information Aspects of Scale Space Images Arjan Kuijper |
| UU-CS-2002-048 |
ps.gz pdf |
External Uniqueness is Unique Enough Dave Clarke, Tobias Wrigstad |
| UU-CS-2002-047 |
pdf |
The Generic Haskell User's Guide. Version 1.23 - Beryl release David Clarke, Johan Jeuring, Andres Löh |
| UU-CS-2002-046 |
pdf |
Proceedings of the 12th Belgian-Dutch Conference on Machine Learning Marco Wiering (editor) |
| UU-CS-2002-045 |
pdf |
XML query requirements Joris Graaumans |
| UU-CS-2002-044 |
ps.gz pdf |
A Delaunay approach to interactive cutting in triangulated surfaces Han-Wen Nienhuys, A. Frank van der Stappen |
| UU-CS-2002-043 |
ps.gz pdf |
Spatial Information Retrieval and Geographical Ontologies. An Overview of the SPIRIT Project Christopher B. Jones, R. Purves, A. Ruas, M. Sanderson, M. Sester, M. van Kreveld, R. Weibel |
| UU-CS-2002-042 |
ps.gz pdf |
Strategies for Source-to-Source Constant Propagation Karina Olmos and Eelco Visser |
| UU-CS-2002-041 |
ps.gz pdf |
A Comparative Study of Probabilistic Roadmap Planners Roland Geraerts, Mark H. Overmars |
| UU-CS-2002-040 |
ps.gz pdf |
Schematization of Networks Sergio Cabello, Mark de Berg, Marc van Kreveld |
| UU-CS-2002-039 |
ps.gz pdf |
Efficient algorithms for maximum regression depth Marc van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckman |
| UU-CS-2002-038 |
ps.gz pdf |
On Simplifying Dot Maps Mark de Berg, Prosenjit Bose, Otfried Cheong, Pat Morin |
| UU-CS-2002-037 |
ps.gz pdf |
Balanced partition of minimum spanning trees Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan |
| UU-CS-2002-036 |
ps.gz pdf |
TSP with Neighborhoods of Varying Size Mark de Berg, Joachim Gudmondsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen |
| UU-CS-2002-035 |
ps.gz pdf |
Parametric Type Inferencing for Helium Bastiaan Heeren and Jurriaan Hage |
| UU-CS-2002-034 |
ps.gz pdf |
The One-Round Voronoi Game Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jiri Matousek |
| UU-CS-2002-033 |
ps.gz pdf |
Computing Signed Permutations of Polygons Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark Overmars, Godfried T. Toussaint |
| UU-CS-2002-032 |
ps.gz pdf |
Derivation of algorithms for cutwidth and related graph layout problems Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos |
| UU-CS-2002-031 |
ps.gz pdf |
Generalizing Hindley-Milner Type Inference Algorithms Bastiaan Heeren, Jurriaan Hage, Doaitse Swierstra |
| UU-CS-2002-030 |
ps.gz pdf |
Combinators for layered software architectures Martijn M. Schrage, Johan Jeuring, S. Doaitse Swierstra |
| UU-CS-2002-029 |
ps.gz pdf |
Model-based reinforcement learning in dynamic environments Marco A. Wiering |
| UU-CS-2002-028 |
pdf |
Meta-programming with concrete object syntax E. Visser |
| UU-CS-2002-027 |
pdf |
Box-Trees for Collision Checking in Industrial Installations Herman J. Haverkort, Mark de Berg |
| UU-CS-2002-026 |
ps.gz pdf |
Radio labeling with pre-assigned frequencies Hans L. Bodlaender, Hajo J. Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginer |
| UU-CS-2002-025 |
pdf |
!UNITY: A Theory of General UNITY I.S.W.B. Prasetya, T.E.J. Vos, A. Azurat, S.D. Swierstra |
| UU-CS-2002-024 |
pdf |
Context-specific Sign-propagation in Qualitative Probabilistic Networks Silja Renooij, Linda C. van der Gaag, Simon Parsons |
| UU-CS-2002-023 |
pdf |
Generic Programming for XML Tools Johan Jeuring, Paul Hagg |
| UU-CS-2002-022 |
pdf |
Building interpreters with rewriting strategies E. Dolstra, E. Visser |
| UU-CS-2002-021 |
pdf |
Rewriting Strategies for Instruction Selection Martin Bravenboer, Eelco Visser |
| UU-CS-2002-020 |
ps.gz pdf |
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible Michael Soss, Jeff Erickson, Mark Overmars |
| UU-CS-2002-019 |
ps.gz pdf |
Polyhedral model retrieval using weighted point sets Johan W.H. Tangelder, Remco C. Veltkamp |
| UU-CS-2002-018 |
ps.gz pdf |
Logical Filtering in Scale Space Arjan Kuijper, Luc Florack |
| UU-CS-2002-017 |
ps.gz pdf |
Euler graphs, triangle-free graphs and bipartite graphs in switching classes Jurriaan Hage, Tero Harju, and Emo Welzl |
| UU-CS-2002-016 |
ps.gz pdf |
Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons Siu-Wing Cheng, Otfried Cheong, Hazel Everett, René van Oostrum |
| UU-CS-2002-015 |
ps.gz pdf |
On the design and analysis of competent GAs Steven van Dijk, Dirk Thierens, Mark de Berg |
| UU-CS-2002-014 |
ps.gz pdf |
A pseudo-metric for weighted point sets Panos Giannopoulos and Remco C. Veltkamp |
| UU-CS-2002-013 |
ps.gz pdf |
Computing farthest neighbors on a convex polytope Otfried Cheong, Chan-Su Shin, Antoine Vigneron |
| UU-CS-2002-012 |
ps.gz pdf |
Spanning trees crossing few barriers Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki |
| UU-CS-2002-011 |
ps.gz pdf |
Type-indexed data types Ralf Hinze, Johan Jeuring, Andres Löh |
| UU-CS-2002-010 |
ps.gz pdf |
Scale-invariant segmentation of dynamic contrast-enhanced perfusion MR-images with inherent scale selection J.P. Jansen, M. Egmont-Petersen, E.A. Hendriks, M.J.T. Reinders, R.J. van der Geest, P.C.W. Hogendoorn, J.H.C. Reiber |
| UU-CS-2002-009 |
ps.gz pdf |
Improving type-error messages in functional languages Bastiaan Heeren, Johan Jeuring, Doaitse Swierstra, Pablo Azero Alcocer |
| UU-CS-2002-008 |
ps.gz pdf |
A preliminary report on xMECH A. Azurat and I.S.W.B. Prasetya |
| UU-CS-2002-007 |
ps.gz pdf |
A Survey on Embedding Programming Logics in a Theorem Prover A. Azurat and I.S.W.B. Prasetya |
| UU-CS-2002-006 |
ps.gz pdf |
Computing Tolerance Parameters for Fixturing and Feeding JingLiang Chen, Ken Goldberg, Mark H. Overmars, Dan Halperin, Karl F. Böhringer, Yan Zhuang |
| UU-CS-2002-005 |
ps.gz pdf |
Towards an inclusion driven learning of Bayesian Networks Robert Castelo, Tomas Kocka |
| UU-CS-2002-004 |
ps.gz pdf |
Recent developments in motion planning Mark H. Overmars |
| UU-CS-2002-003 |
ps.gz pdf |
Hierarchical mixtures of naive Bayes classifiers Marco A. Wiering |
| UU-CS-2002-002 |
ps.gz pdf |
The emergent computational potential of evolving artificial living systems J. Wiedermann, J. van Leeuwen |
| UU-CS-2002-001 |
ps.gz pdf |
Tree decompositions with small cost Hans L. Bodlaender, Fedor V. Fomin |
| UU-CS-2001-62 |
pdf |
Preliminary proceedings of the 2001 ACM SIGPLAN Haskell Workshop (HW'2001) Ralf Hinze (editor) |
| UU-CS-2001-61 |
pdf |
Active shape models exploiting slice-to-slice correlation in segmentation of 3D CTA AAA images Marleen de Bruijne, Bram van Ginneken, Wiro J. Niessen, J. B. Antoine Maintz, Max A. Viergever |
| UU-CS-2001-60 |
pdf |
Semi-automatic aortic endograft location for post-operative evaluation of endovascular aneurysm treatment Marleen de Bruijne, Wiro J. Niessen, J. B. Antoine Maintz, Max A. Viergever |
| UU-CS-2001-59 |
ps.gz pdf |
Multi-objective mixture based iterated density estimation evolutionary algorithms Dirk Thierens and Peter A. N. Bosman |
| UU-CS-2001-58 |
ps.gz pdf |
Learning Bayesian network classifiers for credit scoring using Markov Chain Monte Carlo search B. Baesens, M. Egmont-Petersen, R. Castelo, J. Vanthienen |
| UU-CS-2001-57 |
ps.gz pdf |
Accurate object localization in gray level images using the center of gravity measure; accuracy versus precision H. C. van Assen, M. Egmont-Petersen, J. H. C. Reiber |
| UU-CS-2001-56 |
pdf |
Facility location on terrains Boris Aronov, Marc van Kreveld, René van Oostrum, Kasturi Varadarajan |
| UU-CS-2001-55 |
pdf |
The relevance of non-generic events in scale space models Arjan Kuijper and Luc Florack |
| UU-CS-2001-54 |
ps.gz pdf |
Proceedings of the Second Stratego Users Day Eelco Visser (editor) |
| UU-CS-2001-53 |
pdf |
Exploiting gradient information in continuous iterated density estimation evolutionary algorithms Peter A. N. Bosman and Dirk Thierens |
| UU-CS-2001-52 |
pdf |
New IDEAs and more ICE by learning and using unconditional permutation factorizations Peter A. N. Bosman and Dirk Thierens |
| UU-CS-2001-51 |
pdf |
Advancing continuous IDEAs with mixed distributions and factorization selection metrics Peter A. N. Bosman and Dirk Thierens |
| UU-CS-2001-50 |
pdf |
Crossing the road to efficient IDEAs for permutation problems Peter A. N. Bosman and Dirk Thierens |
| UU-CS-2001-49 |
ps.gz pdf |
Treewidth: Computational Experiments Arie M.C.A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel |
| UU-CS-2001-48 |
pdf |
Casting a polyhedron with directional uncertainty Hee-kap Ahn, Otfried Cheong, Rene van Oostrum |
| UU-CS-2001-47 |
pdf |
Voronoi diagrams on the sphere Hyeon-Suk Na, Chung-Nim Lee, Otfried Cheong |
| UU-CS-2001-46 |
pdf |
Building bridges between convex regions Hee-Kap Ahn, Otfried Cheong, Chan-Su Shin |
| UU-CS-2001-45 |
pdf |
Competitive facility location along a highway Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai Golin, Rene van Oostrum |
| UU-CS-2001-44 |
pdf |
A simple and efficient algorithm for high-quality line labeling Alexander Wolff, Lars Knipping, Marc van Kreveld, Tycho Strijk, Pankaj K. Agarwal |
| UU-CS-2001-43 |
pdf |
Towards an evaluation of quality for names placement methods Steven van Dijk, Marc van Kreveld, Tycho Strijk, Alexander Wolff |
| UU-CS-2001-42 |
pdf |
Guiding visitors: separating navigation from computation Martin Bravenboer, Eelco Visser |
| UU-CS-2001-41 |
ps.gz pdf |
Program refinement in UNITY T.E.J. Vos and S.D. Swierstra |
| UU-CS-2001-40 |
pdf |
Proving distributed hylomorphisms T.E.J. Vos, S.D. Swierstra |
| UU-CS-2001-39 |
pdf |
Disambiguation filters for scannerless generalized LR parsers M.G.J. van den Brand, J. Scheerder, J.J. Vinju, E. Visser |
| UU-CS-2001-38 |
pdf |
First-class rules and generic traversal E. Dolstra, E. Visser |
| UU-CS-2001-37 |
pdf |
It's all in the game Mark Overmars |
| UU-CS-2001-36 |
pdf |
Gaussian sampling for probabilistic roadmap planners V. Boor, M. H. Overmars, A. F. van der Stappen |
| UU-CS-2001-35 |
pdf |
Parsec: Direct style monadic parser combinators for the real world D. J. P. Leijen, H. J. M. Meijer |
| UU-CS-2001-34 |
pdf |
Polytypic data conversion programs P. Jansson, J. T. Jeuring |
| UU-CS-2001-33 |
pdf |
Functional Pearl. Weaving a Web R. Hinze, J. T. Jeuring |
| UU-CS-2001-32 |
ps.gz pdf |
CodeBoost. A framework for transforming C++ programs O. S. Bagge, M. Haveraaen, E. Visser |
| UU-CS-2001-31 |
pdf |
A survey of rewriting strategies in program transformation systems E. Visser |
| UU-CS-2001-30 |
pdf |
Fusing logic and control with local transformations: an example optimization P. Johann, E. Visser |
| UU-CS-2001-29 |
pdf |
Scoped dynamic rewrite rules E. Visser |
| UU-CS-2001-28 |
pdf |
Stratego: A language for program transformation based on rewriting strategies. System description of Stratego 0.5 E. Visser |
| UU-CS-2001-27 |
pdf |
Enumerating submultisets of multisets J. Hage |
| UU-CS-2001-26 |
pdf |
The Generic Haskell User's Guide D. Clarke, R. T. W. Hinze, J. T. Jeuring, A. Löh, J. de Wit |
| UU-CS-2001-25 |
pdf |
On the creations of critical points in scale space with applications to medical image analysis A. Kuijper, L. M. J. Florack |
| UU-CS-2001-24 |
pdf |
The application of catastrophe theory to medical image analysis A. Kuijper, L. M. J. Florack |
| UU-CS-2001-23 |
pdf |
The application of catastrophe theory to image analysis A. Kuijper, L. M. J. Florack |
| UU-CS-2001-22 |
ps.gz pdf |
Computing the treewidth and the minimum fill-in with the modular decomposition H. L. Bodlaender, U. Rotics |
| UU-CS-2001-21 |
pdf |
On R-trees with low query complexity M. T. de Berg, J. G. Gudmundsson, M. Hammar, M. H. Overmars |
| UU-CS-2001-20 |
pdf |
Translating a Regular Grid over a Point Set P. Bose, M. van Kreveld, A. Maheshwari, P. Morin, J. Morisson |
| UU-CS-2001-19 |
pdf |
Scale Space Hierarchy A. Kuijper, L. M. J. Florack, M. A. Viergever |
| UU-CS-2001-18 |
pdf |
Lazy Functional Parser Combinators in Java Atze Dijkstra, Doaitse S. Swierstra |
| UU-CS-2001-17 |
pdf |
Hierarchical pre-segmentation without prior knowledge A. Kuijper, L. M. J. Florack |
| UU-CS-2001-16 |
pdf |
Supporting cuts and finite element deformation in interactive surgery simulation H. W. Nienhuys, A. F. van der Stappen |
| UU-CS-2001-15 |
ps.gz pdf |
Relaxed Update and Partition Network Games H. L. Bodlaender, M. J. Dinneen, B. Khoussainov |
| UU-CS-2001-14 |
pdf |
A Survey on Multidimensional Access Methods H. K. Ahn, N. Mamoulis, H. M. Wong |
| UU-CS-2001-13 |
pdf |
Flipping Your Lid H. K. Ahn, P. Bose, J. Czyzowicz, N. Hanusse, E. Kranakis, P. Morin |
| UU-CS-2001-12 |
pdf |
Enumeration of P4-free Chordal Graphs J. R. Castelo, N. Wormald |
| UU-CS-2001-11 |
pdf |
Geometry and Part Feeding A. F. van der Stappen, R-P. M. Berretty, K. Goldberg, M. H. Overmars |
| UU-CS-2001-10 |
pdf |
Box-Trees and R-Trees with Near-Optimal Query Time P. K. Agarwal, M. T. de Berg, J. G. Gudmundsson, M. Hammar, H. J. Haverkort |
| UU-CS-2001-09 |
pdf |
A Simple Implementation Technique for Priority Search Queues R. T. W. Hinze |
| UU-CS-2001-08 |
ps.gz pdf |
A generic NP-hardness proof for a variant of Graph Coloring H. L. Bodlaender |
| UU-CS-2001-07 |
pdf |
Finding sets of points without empty convex 6-gons M. H. Overmars |
| UU-CS-2001-06 |
pdf |
Motion Planning in Environments with Dangerzones D. Sent, M. H. Overmars |
| UU-CS-2001-05 |
pdf |
Higher Order Delaunay Triangulations J. G. Gudmundsson, M. Hammar, M. van Kreveld |
| UU-CS-2001-04 |
ps.gz pdf |
A polynomial algorithm for the cutwidth of bounded degree graphs with small treewidth D. M. Thilikos, M. J. Serna, H. L. Bodlaender |
| UU-CS-2001-03 |
pdf |
Shape matching: Similarity Measures and Algorithms R. C. Veltkamp |
| UU-CS-2001-02 |
ps.gz pdf |
A computational model of interaction in embedded systems J. van Leeuwen, J. Wiedermann |
| UU-CS-2001-01 |
ps.gz pdf |
Probabilities for a probabilistic network: A case-study in Oesophageal Carcinoma L. C. van der Gaag, S. Renooij, C. L. M. Witteman, B. M. P. Aleman, B. G. Taal |
| UU-CS-2000-45 |
ps.gz pdf |
Mixed IDEAs P. A. N. Bosman, D. Thierens |
| UU-CS-2000-44 |
ps.gz pdf |
A characterization of moral transitive directed acyclic graph Markov models as trees and its properties J. R. Castelo, A. P. J. M. Siebes |
| UU-CS-2000-43 |
ps.gz pdf |
Warm fusion in Stratego - A case study in the generation of program transformation systems P. Johann, E. Visser |
| UU-CS-2000-42 |
ps.gz pdf |
Kayles and nimbers H. L. Bodlaender, D. Kratsch |
| UU-CS-2000-41 |
ps.gz pdf |
Models and motion planning M. T. de Berg, M. J. Katz, M. H. Overmars, A. F. van der Stappen, J. M. Vleugels |
| UU-CS-2000-40 |
ps.gz pdf |
Guarding scenes against invasive hypercubes M. T. de Berg, H. David, M. J. Katz, M. H. Overmars, A. F. van der Stappen, J. M. Vleugels |
| UU-CS-2000-39 |
ps.gz pdf |
Trap design for vibratory bowl feeders R-P. M. Berretty, K. Goldberg, M. H. Overmars, A. F. van der Stappen |
| UU-CS-2000-38 |
ps.gz pdf |
Constructive linear time algorithms for branchwidth D. M. Thilikos, H. L. Bodlaender |
| UU-CS-2000-37 |
ps.gz pdf |
Shape similarity measures, properties, and constructions R. C. Veltkamp, M. Hagedoorn |
| UU-CS-2000-36 |
ps.gz pdf |
Negative log-likelihood and statistical hypothesis testing as the basis of model selection in IDEAs P. A. N. Bosman, D. Thierens |
| UU-CS-2000-35 |
ps.gz pdf |
The merchant subtour problem A. M. Verweij, K. I. Aardal |
| UU-CS-2000-34 |
ps.gz pdf |
Content-based image retrieval systems: A survey R. C. Veltkamp, M. Tanase |
| UU-CS-2000-33 |
ps.gz pdf |
The Turing machine paradigm in contemporary computing J. van Leeuwen, J. Wiedermann |
| UU-CS-2000-32 |
ps.gz pdf |
Using genetic algorithms for solving hard problems in GIS S. van Dijk, D. Thierens, M. T. de Berg |
| UU-CS-2000-31 |
ps.gz pdf |
Flipturning polygons O. Aichholzer, C. Cortes, E. D. Demaine, V. Dujmovic, J. Erickson, H. Meijer, M. H. Overmars, B. Palop, S. Ramaswami, G. T. Toussaint |
| UU-CS-2000-30 |
ps.gz pdf |
Reconfiguring convex polygons O. Aichholzer, E. D. Demaine, J. Erickson, F. Hurtado, M. H. Overmars, M. Soss, G. T. Toussaint |
| UU-CS-2000-29 |
ps.gz pdf |
Finding a Delta-regular supergraph of minimum order H. L. Bodlaender, R. B. Tan, J. van Leeuwen |
| UU-CS-2000-28 |
ps.gz pdf |
Fixed parameter algorithms for planar dominating set J. Alber, H. L. Bodlaender, H. Fernau, R. Niedermeier |
| UU-CS-2000-27 |
ps.gz pdf |
Necessary edges in k-chordalizations of graphs H. L. Bodlaender |
| UU-CS-2000-26 |
ps.gz pdf |
Expanding from discrete to continuous estimation of distribution algorithms: The IDEA P. A. N. Bosman, D. Thierens |
| UU-CS-2000-25 |
ps.gz pdf |
Approximations for Lambda-coloring of graphs H. L. Bodlaender, T. Kloks, R. B. Tan, J. van Leeuwen |
| UU-CS-2000-24 |
ps.gz pdf |
A constructive linear time algorithm for small cutwidth D. M. Thilikos, M. J. Serna, H. L. Bodlaender |
| UU-CS-2000-23 |
ps.gz pdf |
Approximation of pathwidth of outerplanar graphs H. L. Bodlaender, F. V. Fomin |
| UU-CS-2000-22 |
ps.gz pdf |
Algorithms for maximum independent set applied to map labelling T. W. Strijk, A. M. Verweij, K. I. Aardal |
| UU-CS-2000-21 |
ps.gz pdf |
Orienting polyhedral parts by pushing R-P. M. Berretty, M. H. Overmars, A. F. van der Stappen |
| UU-CS-2000-20 |
ps.gz pdf |
Building probabilistic networks: Where do the numbers come from? - a guide to the literature M. J. Druzdzel, L. C. van der Gaag |
| UU-CS-2000-19 |
ps.gz pdf |
Proceedings Workshop on Generic Programming (WGP2000) J. T. Jeuring |
| UU-CS-2000-18 |
ps.gz pdf |
Pivotal pruning of trade-offs in QPNs S. Renooij, L. C. van der Gaag, S. Parsons, S. Green |
| UU-CS-2000-17 |
ps.gz pdf |
Exploiting non-monotonic influences in qualitative belief networks S. Renooij, L. C. van der Gaag |
| UU-CS-2000-16 |
ps.gz pdf |
Evaluation of a probabilistic model for staging of oesophageal carcinoma L. C. van der Gaag, S. Renooij, B. M. P. Aleman, B. G. Taal |
| UU-CS-2000-15 |
ps.gz pdf |
Continuous iterated density estimation evolutionary algorithms within the IDEA framework P. A. N. Bosman, D. Thierens |
| UU-CS-2000-14 |
ps.gz pdf |
Resolution and binary decision diagrams cannot simulate each other polynomially J. F. Groote, H. Zantema |
| UU-CS-2000-13 |
ps.gz pdf |
An embedding of ConGolog in 3APL K. V. Hindriks, Y. Lesperance, H. Levesque |
| UU-CS-2000-12 |
ps.gz pdf |
A probabilistic and decision-theoretic approach to the management of infectious disease at the ICU P. J. F. Lucas, N. de Bruijn, K. Schurink, A. Hoepelman |
| UU-CS-2000-11 |
ps.gz pdf |
IDEAs based on the normal kernels probability density function P. A. N. Bosman, D. Thierens |
| UU-CS-2000-10 |
ps.gz pdf |
Sequential program composition in Unity T.E.J. Vos, S. D. Swierstra |
| UU-CS-2000-09 |
ps.gz pdf |
Defining a non-concrete recursive type in HOL which includes sets T.E.J. Vos, S. D. Swierstra |
| UU-CS-2000-08 |
ps.gz pdf |
Practical extensions of point labeling in the slider model T. W. Strijk, M. van Kreveld |
| UU-CS-2000-07 |
ps.gz pdf |
Formal design of self-stabilizing programs: Theory and examples S. W. B. Prasetya, S. D. Swierstra |
| UU-CS-2000-06 |
ps.gz pdf |
Binary decision diagrams by shared rewriting J. van de Pol, H. Zantema |
| UU-CS-2000-05 |
ps.gz pdf |
On equicut graphs M. Deza, D. Pasechnik |
| UU-CS-2000-04 |
ps.gz pdf |
Termination of Term Rewriting H. Zantema |
| UU-CS-2000-03 |
ps.gz pdf |
Geometric Modelling with a-Complexes B. H. M. Gerritsen, K. van der Werff, R. C. Veltkamp |
| UU-CS-2000-02 |
ps.gz pdf |
Factorizing fault tolerance S. W. B. Prasetya, S. D. Swierstra |
| UU-CS-2000-01 |
ps.gz pdf |
Component-wise formal approach to design distributed systems S. W. B. Prasetya, S. D. Swierstra, B. Widjaja |
| UU-CS-1999-49 |
ps.gz pdf |
A case study of a multiobjective elitist recombinative genetic algorithm with coevolutionary sharing M. Neef, D. Thierens, H. Arciszweski |
| UU-CS-1999-48 |
ps.gz pdf |
On the scalability of simple genetic algorithms D. Thierens |
| UU-CS-1999-47 |
ps.gz pdf |
Estimating the significant non-linearities in the genome problem-coding D. Thierens |
| UU-CS-1999-46 |
ps.gz pdf |
An algorithmic framework for density estimation based evolutionary algorithms P. A. N. Bosman, D. Thierens |
| UU-CS-1999-45 |
ps.gz pdf |
Focused quantification of a belief network using sensitivity analysis N. B. Peek, V. M. H. Coupe, J. Ottenkamp |
| UU-CS-1999-44 |
ps.gz pdf |
Using sensitivity analysis for efficient quantification of a belief network V. M. H. Coupe, N. B. Peek, J. Ottenkamp, J. D. F. Habbema |
| UU-CS-1999-43 |
ps.gz pdf |
A specialized POMDP form and algorithm for clinical patient management N. B. Peek |
| UU-CS-1999-42 |
ps.gz pdf |
Explicit temporal models for decision-theoretic planning of clinical management N. B. Peek |
| UU-CS-1999-41 |
ps.gz pdf |
Non-standard approaches to integer programming K. I. Aardal, R. Weismantel, L. A. Wolsey |
| UU-CS-1999-40 |
ps.gz pdf |
Lower bounds for kinetic planar subdivisions P. K. Agarwal, J. Basch, M. T. de Berg, L. J. Guibas, J. Hershberger |
| UU-CS-1999-39 |
ps.gz pdf |
On the fatness of Minkowski sums M. T. de Berg, A. F. van der Stappen |
| UU-CS-1999-38 |
ps.gz pdf |
Logic engineering in medicine P. J. F. Lucas |
| UU-CS-1999-37 |
ps.gz pdf |
Lattice basis reduction and integer programming K. I. Aardal |
| UU-CS-1999-36 |
ps.gz pdf |
Algorithms for the radio link frequency assignment problem K. I. Aardal, C. A. J. Hurkens, J. K. Lenstra, S. Tiourine |
| UU-CS-1999-35 |
ps.gz pdf |
A geometric model of retinocortical mechanisms L. M. J. Florack |
| UU-CS-1999-34 |
ps.gz pdf |
Certainty-factor-like structures in Bayesian belief networks P. J. F. Lucas |
| UU-CS-1999-32 |
ps.gz pdf |
Sensitivity analysis for threshold decision making with Bayesian belief networks L. C. van der Gaag, V. M. H. Coupe |
| UU-CS-1999-31 |
ps.gz pdf |
Sizes of decision tables and decision trees H. Zantema, H. L. Bodlaender |
| UU-CS-1999-30 |
ps.gz pdf |
An operational semantics for the single agent core of AGENT0 K. V. Hindriks, F. S. de Boer, W. van der Hoek, J-J. Ch. Meyer |
| UU-CS-1999-29 |
ps.gz pdf |
Properties of sensitivity analysis of Bayesian belief networks V. M. H. Coupe, L. C. van der Gaag |
| UU-CS-1999-28 |
ps.gz pdf |
Proceedings of the 1999 Haskell Workshop H. J. M. Meijer |
| UU-CS-1999-27 |
ps.gz pdf |
State-of-the-art in shape matching R. C. Veltkamp, M. Hagedoorn |
| UU-CS-1999-26 |
ps.gz pdf |
SKIT, An open architecture for courseware authoring Atze Dijkstra, Martijn Schrage, Doaitse Swierstra |
| UU-CS-1999-25 |
ps.gz pdf |
Belief updates in multiple agent systems J-W. Roorda |
| UU-CS-1999-24 |
ps.gz pdf |
Labeling points with circles T. W. Strijk, A. Wolff |
| UU-CS-1999-23 |
ps.gz pdf |
Enhancing QPNs for trade-off resolution S. Renooij, L. C. van der Gaag |
| UU-CS-1999-22 |
ps.gz pdf |
The termination hierarchy for term rewriting H. Zantema |
| UU-CS-1999-21 |
ps.gz pdf |
New visibility partitions with applications in affine pattern matching M. Hagedoorn, M. H. Overmars, R. C. Veltkamp |
| UU-CS-1999-20 |
ps.gz pdf |
EA Visualizer Tutorial P. A. N. Bosman |
| UU-CS-1999-19 |
ps.gz pdf |
Talking probabilities: communicating probabilistic information with words and numbers S. Renooij, C. L. M. Witteman |
| UU-CS-1999-18 |
ps.gz pdf |
Efficient evaluation of triangular B-splines M. Franssen, R. C. Veltkamp, W. Wesselink |
| UU-CS-1999-17 |
ps.gz pdf |
Open multi-agent systems: Agent communication and integration R. M. van Eijk, F. S. de Boer, W. van der Hoek, J-J. Ch. Meyer |
| UU-CS-1999-16 |
ps.gz pdf |
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. Smeltink |
| UU-CS-1999-15 |
ps.gz pdf |
How to elicit many probabilities L. C. van der Gaag, S. Renooij, C. L. M. Witteman, B. M. P. Aleman, B. G. Taal |
| UU-CS-1999-14 |
ps.gz pdf |
Computing immobilizing grasps of polygonal parts A. F. van der Stappen, C. Wentink, M. H. Overmars |
| UU-CS-1999-13 |
ps.gz pdf |
Sensitivity analysis: an aid for belief-network quantification V. M. H. Coupe, L. C. van der Gaag, J. D. F. Habbema |
| UU-CS-1999-12 |
ps.gz pdf |
Calculations on critical points under Gaussian blurring A. Kuijper, L. M. J. Florack |
| UU-CS-1999-11 |
ps.gz pdf |
On the modelling of evolutionary algorithms P. A. N. Bosman, D. Thierens |
| UU-CS-1999-10 |
ps.gz pdf |
Linkage information processing in distribution estimation algorithms P. A. N. Bosman, D. Thierens |
| UU-CS-1999-09 |
ps.gz pdf |
Semantics of communicating agents based on deduction and abduction K. V. Hindriks, F. S. de Boer, W. van der Hoek, J-J. Ch. Meyer |
| UU-CS-1999-08 |
ps.gz pdf |
Operational semantics for agent communication languages R. M. van Eijk, F. S. de Boer, W. van der Hoek, J-J. Ch. Meyer |
| UU-CS-1999-07 |
ps.gz pdf |
Visual representations embodying spacetime structure L. M. J. Florack |
| UU-CS-1999-06 |
ps.gz pdf |
Improving antibiotic therapy of ventilator associated pneumonia using a probabilistic approach N. de Bruijn, P. J. F. Lucas, K. Schurink, A. Hoepelman |
| UU-CS-1999-05 |
ps.gz pdf |
An intelligent system for pacemaker reprogramming P. J. F. Lucas, A. Tholen, G. van Oort |
| UU-CS-1999-04 |
ps.gz pdf |
A diagnostic advice system based on pathophysiological models of diseases W. J. ter Burg, P. J. F. Lucas, E. ter Braak |
| UU-CS-1999-03 |
ps.gz pdf |
Metric pattern spaces M. Hagedoorn, R. C. Veltkamp |
| UU-CS-1999-02 |
ps.gz pdf |
Finding small equivalent decision trees is hard H. Zantema, H. L. Bodlaender |
| UU-CS-1999-01 |
ps.gz pdf |
Efficient image retrieval through vantage objects J. M. Vleugels, R. C. Veltkamp |
| UU-CS-1998-49 |
ps.gz pdf |
Domino convergence, drift, and the temporal-salience structure of problems D. Thierens, D. E. Goldberg, A. G. Pereira |
| UU-CS-1998-48 |
ps.gz pdf |
Selection schemes, elitist recombination, and selection intensity D. Thierens |
| UU-CS-1998-47 |
ps.gz pdf |
Dimensional analysis of Allele-Wise mixing revisited D. Thierens |
| UU-CS-1998-46 |
ps.gz pdf |
Non-redundant genetic coding of neural networks D. Thierens |
| UU-CS-1998-45 |
ps.gz pdf |
A 3-approximation algorithm for the k-level uncapacitated facility location problem K. I. Aardal, F. A. Chudak, D. B. Shmoys |
| UU-CS-1998-44 |
ps.gz pdf |
Spatio-frequency analysis of scale-space filtering L. M. J. Florack |
| UU-CS-1998-43 |
ps.gz pdf |
Cryptografie: van DES tot Chipknip G. Tel |
| UU-CS-1998-42 |
ps.gz pdf |
Time and bit optimal broadcasting on anonymous unoriented hypercubes S. Dobrev, P. Ruzicka, G. Tel |
| UU-CS-1998-41 |
ps.gz pdf |
Robust genetic algorithms for high quality map labeling S. van Dijk, D. Thierens, M. T. de Berg |
| UU-CS-1998-40 |
ps.gz pdf |
Point labeling with sliding labels M. van Kreveld, T. W. Strijk, A. Wolff |
| UU-CS-1998-39 |
ps.gz pdf |
Applications of the generic programming paradigm in the design of CGAL H. Broennimann, L. Kettner, S. Schirra, R. C. Veltkamp |
| UU-CS-1998-38 |
ps.gz pdf |
Prognostic methods in medicine P. J. F. Lucas, A. Abu-Hanna |
| UU-CS-1998-37 |
ps.gz pdf |
Non-linear scale-spaces isomorphic to the linear case L. M. J. Florack |
| UU-CS-1998-36 |
ps.gz pdf |
Solving a system of diophantine equations with lower and upper bounds on the variables K. I. Aardal, C. A. J. Hurkens, A. K. Lenstra |
| UU-CS-1998-35 |
ps.gz pdf |
Generic geometric programming in the Computational Geometry Algorithms Library R. C. Veltkamp |
| UU-CS-1998-34 |
ps.gz pdf |
On the behaviour of critical points under Gaussian blurring L. M. J. Florack, A. Kuijper |
| UU-CS-1998-33 |
ps.gz pdf |
Computer-based decision support in the management of primary gastric non-Hodgkin lymphoma P. J. F. Lucas, H. Boot, B. G. Taal |
| UU-CS-1998-32 |
pdf |
De evaluatie van kennissytemen. P.J.F. Lucas |
| UU-CS-1998-31 |
ps.gz pdf |
The topological structure of scale-space images L. M. J. Florack, A. Kuijper |
| UU-CS-1998-30 |
ps.gz pdf |
Motion planning for multiple robots B. Aronov, M. T. de Berg, A. F. van der Stappen, P. Svestka, J. M. Vleugels |
| UU-CS-1998-29 |
ps.gz pdf |
Labeling a rectilinear map more efficiently T. W. Strijk, M. van Kreveld |
| UU-CS-1998-28 |
ps.gz pdf |
Finding the wood by the trees M. van Kreveld |
| UU-CS-1998-27 |
ps.gz pdf |
Duality principles in image processing and analysis L. M. J. Florack |
| UU-CS-1998-26 |
ps.gz pdf |
The complexity of scheduling typed task systems with and without communication delays J. Verriet |
| UU-CS-1998-25 |
ps.gz pdf |
Contour trees and small seed sets for isosurface traversal C. Bajaj, M. van Kreveld, R. W. van Oostrum, V. Pascucci, D. R. Schikore |
| UU-CS-1998-24 |
ps.gz pdf |
Scheduling outtrees of height one in the LogP model J. Verriet |
| UU-CS-1998-23 |
pdf |
Registration of 3D Medical Images using Simple Morphlogical Tools J.B.A. Maintz and P.A. van den Elsen and M.A. Viergever |
| UU-CS-1998-22 |
pdf |
An Overview of Medical Image Registration Methods J.B.A. Maintz and M.A. Viergever |
| UU-CS-1998-21 |
pdf |
A Multiscale Approach to Mutual Information Matching J.P.W. Pluim and J.B.A. Maintz and M.A. Viergever |
| UU-CS-1998-20 |
pdf |
A Survey of Medical Image Registration J.B.A. Maintz and M.A. Viergever |
| UU-CS-1998-19 |
pdf |
Comparison and Evaluation of Retrospective Intermodality Brain Image Registration Techniques J. West et al. |
| UU-CS-1998-18 |
ps.gz pdf |
General multimodal elastic registration based on mutual information J. B. A. Maintz, E. H. W. Meijering, M. A. Viergever |
| UU-CS-1998-17 |
ps.gz pdf |
Distributed control for AI G. Tel |
| UU-CS-1998-16 |
ps.gz pdf |
Separating an object from its cast H. K. Ahn, M. T. de Berg, P. Bose, S-W. Cheng, D. Halperin, J. Matousek, O. Schwarzkopf |
| UU-CS-1998-15 |
ps.gz pdf |
A note on domino treewidth H. L. Bodlaender |
| UU-CS-1998-14 |
ps.gz pdf |
Decision trees: equivalence and propositional operations H. Zantema |
| UU-CS-1998-13 |
ps.gz pdf |
Realistic input models for geometric algorithms M. T. de Berg, M. J. Katz, A. F. van der Stappen, J. M. Vleugels |
| UU-CS-1998-12 |
ps.gz pdf |
Linear size binary space partitions for uncluttered scenes M. T. de Berg |
| UU-CS-1998-11 |
ps.gz pdf |
Reaching a polygon with directional uncertainty O. Cheong, R. W. van Oostrum |
| UU-CS-1998-10 |
ps.gz pdf |
Practicable sensitivity analysis of Bayesian belief networks V. M. H. Coupe, L. C. van der Gaag |
| UU-CS-1998-09 |
ps.gz pdf |
Motion extraction - An approach based on duality and Gauge theory L. M. J. Florack |
| UU-CS-1998-08 |
ps.gz pdf |
Formalising abilities and opportunities of agents B. van Linder, W. van der Hoek, J-J. Ch. Meyer |
| UU-CS-1998-07 |
ps.gz pdf |
A formal embedding of AgentSpeak(L) in 3APL K. V. Hindriks, F. S. de Boer, W. van der Hoek, J-J. Ch. Meyer |
| UU-CS-1998-06 |
ps.gz pdf |
Algorithms for fence design R-P. M. Berretty, K. Goldberg, M. H. Overmars, A. F. van der Stappen |
| UU-CS-1998-05 |
ps.gz pdf |
Computing small search numbers in linear time H. L. Bodlaender, D. M. Thilikos |
| UU-CS-1998-04 |
ps.gz pdf |
Label placement by maximum independent set in rectangles P. K. Agarwal, M. van Kreveld, S. Suri |
| UU-CS-1998-03 |
ps.gz pdf |
Decision making in qualitative influence diagrams S. Renooij, L. C. van der Gaag |
| UU-CS-1998-02 |
ps.gz pdf |
Predictive probabilistic models for treatment planning in paediatric cardiology N. B. Peek |
| UU-CS-1998-01 |
ps.gz pdf |
Trade-offs in decision-theoretic planning N. B. Peek, P. J. F. Lucas |
| UU-CS-1997-42 |
ps.gz pdf |
Comparing loop cutsets and clique trees in probabilistic inference L. C. van der Gaag, H. L. Bodlaender |
| UU-CS-1997-41 |
ps.gz pdf |
Computing fence designs for orienting parts R-P. M. Berretty, K. Goldberg, M. H. Overmars, A. F. van der Stappen |
| UU-CS-1997-40 |
ps.gz pdf |
An algorithm for solving a diophantine equation with lower and upper bounds on the variables K. I. Aardal, A. K. Lenstra, C. A. J. Hurkens |
| UU-CS-1997-39 |
ps.gz pdf |
Approximation algorithms for facility location problems D. B. Shmoys, E. Tardos, K. I. Aardal |
| UU-CS-1997-38 |
ps.gz pdf |
On an integer multicommodity flow problem from the airplane industry A. M. Verweij, K. I. Aardal, G. Kant |
| UU-CS-1997-37 |
ps.gz pdf |
Graphs with branchwidth at most three H. L. Bodlaender, D. M. Thilikos |
| UU-CS-1997-36 |
ps.gz pdf |
On applying separator decompositions to path problems and network flow M. J. Jansen |
| UU-CS-1997-35 |
ps.gz pdf |
Algorithms and obstructions for linear-width and related search parameters D. M. Thilikos |
| UU-CS-1997-34 |
ps.gz pdf |
Recovery of nonmonotonic theories C. Witteveen, W. van der Hoek |
| UU-CS-1997-33 |
ps.gz pdf |
Reliable and efficient pattern matching using an affine invariant metric M. Hagedoorn, R. C. Veltkamp |
| UU-CS-1997-32 |
ps.gz pdf |
Algorithms for triangulated terrains M. van Kreveld |
| UU-CS-1997-31 |
ps.gz pdf |
Treewidth: Algorithmic results and techniques H. L. Bodlaender |
| UU-CS-1997-30 |
ps.gz pdf |
Strictification of computations on trees J. Saraiva, S. D. Swierstra, M. F. Kuiper |
| UU-CS-1997-29 |
ps.gz pdf |
Visual exploration of uncertainty in remote-sensing classification F. J. M. van der Wel, L. C. van der Gaag, B. G. H. Gorte |
| UU-CS-1997-28 |
ps.gz pdf |
A way to account for models in image analysis illustrated by motion extraction L. M. J. Florack, W. Niessen |
| UU-CS-1997-27 |
ps.gz pdf |
Measurement duality L. M. J. Florack |
| UU-CS-1997-26 |
ps.gz pdf |
A priori scale in classical scalar and density fields L. M. J. Florack, J. Koenderink |
| UU-CS-1997-25 |
ps.gz pdf |
Pseudo-linear scale-space theory Towards the integration of linear and morphologic scale-space paradigms L. M. J. Florack, R. Maas |
| UU-CS-1997-24 |
ps.gz pdf |
Reduction algorithms for graphs of small treewidth Hans L. Bodlaender, Babette de Fluiter |
| UU-CS-1997-23 |
ps.gz pdf |
Parallel algorithms for treewidth two Babette de Fluiter, Hans L. Bodlaender |
| UU-CS-1997-22 |
ps.gz pdf |
Visualization of TINs M. T. de Berg |
| UU-CS-1997-21 |
ps.gz pdf |
Parallel algorithms for series parallel graphs Hans L. Bodlaender, Babette de Fluiter |
| UU-CS-1997-20 |
ps.gz pdf |
Dynamic motion planning in low obstacle density environments R-P. M. Berretty, M. H. Overmars, A. F. van der Stappen |
| UU-CS-1997-19 |
ps.gz pdf |
Motion planning in environments with low obstacle density A. F. van der Stappen, M. H. Overmars, M. T. de Berg, J. M. Vleugels |
| UU-CS-1997-18 |
ps.gz pdf |
Scheduling tree-structured programs in the LogP model J. Verriet |
| UU-CS-1997-17 |
ps.gz pdf |
Informational independence: Models and normal forms L. C. van der Gaag, J-J. Ch. Meyer |
| UU-CS-1997-16 |
ps.gz pdf |
A language for Modular Information-passing Agents R. M. van Eijk, F. S. de Boer, W. van der Hoek, J-J. Ch. Meyer |
| UU-CS-1997-15 |
ps.gz pdf |
Computing a single cell in the overlay of two simple polygons M. T. de Berg, O. Devillers, K. T. G. Dobrindt, O. Schwarzkopf |
| UU-CS-1997-14 |
ps.gz pdf |
Group knowledge isn't always distributed (neither is it always implicit) W. van der Hoek, B. van Linder, J-J. Ch. Meyer |
| UU-CS-1997-13 |
ps.gz pdf |
Recursively defined (quasi) orders on terms M. C. F. Ferreira |
| UU-CS-1997-12 |
ps.gz pdf |
A decade of combinatorial optimization K. I. Aardal, S. van Hoesel, J. K. Lenstra, L. Stougie |
| UU-CS-1997-11 |
ps.gz pdf |
Constraints on objects, conceptual model and implementation R. H. M. C. Kelleners, R. C. Veltkamp, E. H. Blake |
| UU-CS-1997-10 |
ps.gz pdf |
Symbolic diagnosis and its formalisation P. J. F. Lucas |
| UU-CS-1997-09 |
ps.gz pdf |
The intrinsic structure of optic flow incorporating measurement duality L. M. J. Florack, W. Niessen, M. Nielsen |
| UU-CS-1997-08 |
ps.gz pdf |
Termination of context-sensitive rewriting H. Zantema |
| UU-CS-1997-07 |
ps.gz pdf |
Proving innermost normalisation automatically T. Arts, J. Giesl |
| UU-CS-1997-06 |
ps.gz pdf |
An integrated modal approach to rational agents W. van der Hoek, B. van Linder, J-J. Ch. Meyer |
| UU-CS-1997-05 |
ps.gz pdf |
Isomorphism for graphs of bounded distance width Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos |
| UU-CS-1997-04 |
ps.gz pdf |
Intervalizing sandwich graphs Babette de Fluiter, Hans L. Bodlaender |
| UU-CS-1997-03 |
ps.gz pdf |
Formalizing motivational attitudes of agents using the KARO framework B. van Linder, J-J. Ch. Meyer, W. van der Hoek |
| UU-CS-1997-02 |
ps.gz pdf |
Developing a decision-theoretic network for a congenital heart disease N. B. Peek, J. Ottenkamp |
| UU-CS-1997-01 |
ps.gz pdf |
The complexity of scheduling graphs of bounded width subject to non-zero communication delays J. Verriet |
| UU-CS-1996-55 |
pdf |
The Role of Deontic Logic in the Specification of Information Languages J.-J. Ch. Meyer and R.J. Wieringa and F.P.M. Dignum |
| UU-CS-1996-54 |
ps.gz pdf |
Computing constrained minimum-width annuli of point sets M. T. de Berg, P. Bose, D. Bremmer, S. Ramaswami, G. Wilfong |
| UU-CS-1996-53 |
ps.gz pdf |
Reformulation of capacitated facility location problems: How redundant information can help K. I. Aardal |
| UU-CS-1996-52 |
pdf |
A Complete Epistemic Logic for Multiple Agents: Combining Distributed and Common Knowledge W. van der Hoek and J.J.-Ch. Meyer |
| UU-CS-1996-51 |
ps.gz pdf |
Strictification of lazy functions J. Saraiva, S. D. Swierstra, M. F. Kuiper, M. Pennings |
| UU-CS-1996-50 |
ps.gz pdf |
Effective function cache management for incremental attribute evaluation J. Saraiva, M. F. Kuiper, S. D. Swierstra |
| UU-CS-1996-49 |
ps.gz pdf |
Geometrix eccentricity and the complexity of manipulation plans A. F. van der Stappen, K. Y. Goldberg, M. H. Overmars |
| UU-CS-1996-48 |
pdf |
Utiliteitsmeting ten behoeve van Geautomatiseerde Behandelingskeuze voor Oesofagus Carcinoom M.W.M. Jaspers and L.C. van der Gaag and A.J. Derksen and B.G. Taal and B.M.P. Aleman |
| UU-CS-1996-47 |
ps.gz pdf |
The dynamics of probabilistic structural relevance L. C. van der Gaag, J-J. Ch. Meyer |
| UU-CS-1996-46 |
ps.gz pdf |
Knowledge acquisition for decision-theoretic expert systems P. J. F. Lucas |
| UU-CS-1996-45 |
ps.gz pdf |
Relative undecidability in term rewriting A. Geser, A. Middeldorp, E. Ohlebusch, H. Zantema |
| UU-CS-1996-44 |
ps.gz pdf |
Automatically proving termination where simplification orderings fail T. Arts, J. Giesl |
| UU-CS-1996-43 |
ps.gz pdf |
Coordinated path planning for multiple robots P. Svestka, M. H. Overmars |
| UU-CS-1996-42 |
ps.gz pdf |
A theory of diagnosis as hypothesis refinement P. J. F. Lucas |
| UU-CS-1996-41 |
ps.gz pdf |
On Interval Routing Schemes and Treewidth H. L. Bodlaender, J. van Leeuwen, R. B. Tan, D. M. Thilikos |
| UU-CS-1996-40 |
ps.gz pdf |
Variational modeling of triangular Bezier surfaces R. C. Veltkamp, W. Wesselink |
| UU-CS-1996-39 |
ps.gz pdf |
Multiple destination bin packing A. M. Verweij |
| UU-CS-1996-38 |
ps.gz pdf |
Algorithms for fixture design C. Wentink, A. F. van der Stappen, M. H. Overmars |
| UU-CS-1996-37 |
ps.gz pdf |
Formal methods and mechanical verification applied to the development of a convergent distributed sorting program T.E.J. Vos, S. D. Swierstra, S. W. B. Prasetya |
| UU-CS-1996-36 |
ps.gz pdf |
Interactive geometric constraint satisfaction R. C. Veltkamp, F. Arbab |
| UU-CS-1996-35 |
ps.gz pdf |
On piercing sets of objects M. J. Katz, F. Nielsen |
| UU-CS-1996-34 |
ps.gz pdf |
Optimal line bipartitions of point sets O. Devillers, M. J. Katz |
| UU-CS-1996-33 |
pdf |
Computing the Maximum Overlap of Two Convex Polygons Under Translations M. de Berg and O. Devillers and M. van Kreveld and O. Schwarzkopf and M. Teillaud |
| UU-CS-1996-32 |
pdf |
Preferential Action Semantics (Preliminary Report) J.-J. Ch. Meyer and P. Doherty |
| UU-CS-1996-31 |
ps.gz pdf |
Decision-analytic interpretation of remotely sensed data B. G. H. Gorte, L. C. van der Gaag, F. J. M. van der Wal |
| UU-CS-1996-30 |
ps.gz pdf |
Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems D. M. Thilikos, H. L. Bodlaender |
| UU-CS-1996-29 |
ps.gz pdf |
It is hard to know when greedy is good for finding independent sets Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi Yamazaki |
| UU-CS-1996-28 |
ps.gz pdf |
On evidence absorption for belief networks L. C. van der Gaag |
| UU-CS-1996-27 |
ps.gz pdf |
Polyhedral combinatorics: An annotated bibliography K. I. Aardal, R. Weismantel |
| UU-CS-1996-26 |
ps.gz pdf |
Range searching in low-density environments O. Schwarzkopf, J. M. Vleugels |
| UU-CS-1996-25 |
ps.gz pdf |
Computing the angularity tolerance M. T. de Berg, H. Meijer, M. H. Overmars, G. Wilfong |
| UU-CS-1996-24 |
pdf |
Freeform Shape Machining Using Minkowski Operations J.W.H. Tangelder and J.S.M. Vergeest and M.H. Overmars |
| UU-CS-1996-23 |
pdf |
Computation of Voxel Maps Containing Tool Access Directions for Machining Free-form Shapes J.W.H. Tangelder and J.S.M. Vergeest and M.H. Overmars |
| UU-CS-1996-22 |
ps.gz pdf |
Variations on sweep algorithms: efficient computation of extended viewsheds and class intervals M. van Kreveld |
| UU-CS-1996-21 |
ps.gz pdf |
Characterizing normal forms for informational independence L. C. van der Gaag, J-J. Ch. Meyer |
| UU-CS-1996-20 |
ps.gz pdf |
On probabilistic completeness and expected complexity for probabilistic path planning P. Svestka |
| UU-CS-1996-19 |
pdf |
A Knowledge-Based Compositional Proof System for Parallel Processes M. van Hulst and J.-J.Ch. Meyer |
| UU-CS-1996-18 |
ps.gz pdf |
Modelling interactions for diagnosis P. J. F. Lucas |
| UU-CS-1996-17 |
ps.gz pdf |
Simple traversal of a subdivision without extra storage M. T. de Berg, M. van Kreveld, R. W. van Oostrum, M. H. Overmars |
| UU-CS-1996-16 |
ps.gz pdf |
Interleaved contractions W. van der Hoek, M. de Rijke |
| UU-CS-1996-15 |
ps.gz pdf |
Transforming termination by self-labelling A. Middeldorp, H. Ohsaki, H. Zantema |
| UU-CS-1996-14 |
ps.gz pdf |
Bayesian belief networks: Odds and ends L. C. van der Gaag |
| UU-CS-1996-13 |
ps.gz pdf |
Parallel algorithms for series parallel graphs Hans L. Bodlaender, Babette de Fluiter |
| UU-CS-1996-12 |
ps.gz pdf |
Scheduling interval orders with release dates and deadlines J. Verriet |
| UU-CS-1996-11 |
ps.gz pdf |
Immobilizing polygons against a wall M. H. Overmars, A. S. Rao, O. Schwarzkopf, C. Wentink |
| UU-CS-1996-10 |
ps.gz pdf |
Robot motion planning in unknown environments using Neural Networks A. J. Knobbe, J. N. Kok, M. H. Overmars |
| UU-CS-1996-09 |
ps.gz pdf |
Exact motion planning for tractor-trailer robots P. Svestka, J. M. Vleugels |
| UU-CS-1996-08 |
ps.gz pdf |
Multi-level path planning for nonholonomic robots using semi-holonomic subsystems S. Sekhavat, P. Svestka, J-P. Laumond, M. H. Overmars |
| UU-CS-1996-07 |
ps.gz pdf |
Termination of constructor systems T. Arts, J. Giesl |
| UU-CS-1996-06 |
pdf |
A Compositional Proof System for Asynchronously Communicating Processes F.S. de Boer and M. van Hulst |
| UU-CS-1996-05 |
pdf |
A Proof Theory of Asynchronously Communicating Sequential Processes F.S. de Boer and N. Francez and M. van Hulst and F.A. Stomp |
| UU-CS-1996-04 |
ps.gz pdf |
Information retrieval and simulation theory T. W. C. Huibers, M. Lalmas, C. J. van Rijsbergen |
| UU-CS-1996-03 |
ps.gz pdf |
Non-looping rewriting H. Zantema, A. Geser |
| UU-CS-1996-02 |
ps.gz pdf |
A partial k-arboretum of graphs with bounded treewidth H. L. Bodlaender |
| UU-CS-1996-01 |
ps.gz pdf |
Formalizing UNITY with HOL S. W. B. Prasetya |
| UU-CS-1995-42 |
ps.gz pdf |
Polyhedral techniques in combinatorial optimization II: Computations K. I. Aardal, S. van Hoesel |
| UU-CS-1995-41 |
ps.gz pdf |
On the two-level uncapacitated facility location problem K. I. Aardal, M. Labbe, J. Leung, M. Queyranne |
| UU-CS-1995-40 |
ps.gz pdf |
A dynamic logic of iterated belief change B. van Linder |
| UU-CS-1995-39 |
pdf |
Semantic Based Theory Revision in Nonmonotonic Logic C. Witteveen and W. van der Hoek |
| UU-CS-1995-38 |
pdf |
Possible World Semantics for Analogous Reasoning J.-J.Ch. Meyer and J.C. van Leeuwen |
| UU-CS-1995-37 |
ps.gz pdf |
Reduction algorithms for graphs with small treewidth Hans L. Bodlaender, Babette de Fluiter |
| UU-CS-1995-36 |
ps.gz pdf |
The hardness of problems on thin colored graphs H. L. Bodlaender, M. R. Fellows, M. T. Hallett, H. T. Wareham, T. J. Warnow |
| UU-CS-1995-35 |
ps.gz pdf |
Capacitated facility location: separation algorithms and computational experience K. I. Aardal |
| UU-CS-1995-34 |
ps.gz pdf |
Treewidth and minimum fill-in on d-trapezoid graphs H. L. Bodlaender, T. Kloks, D. Kratsch, H. Mueller |
| UU-CS-1995-33 |
ps.gz pdf |
Motion planning in environments with low obstacle density A. F. van der Stappen, M. H. Overmars |
| UU-CS-1995-32 |
ps.gz pdf |
A technique for automatically proving termination of constructor systems T. Arts |
| UU-CS-1995-31 |
ps.gz pdf |
Scheduling UET, UCT dags with release dates and deadlines J. Verriet |
| UU-CS-1995-30 |
pdf |
An Integrated framework for ought-to-be and ought-to-do constraints P. d'Altan and J.-J.Ch. Meyer and R.J. Wieringa |
| UU-CS-1995-29 |
ps.gz pdf |
Polyhredral techniques in combinatorial optimization I: Theory K. I. Aardal, S. van Hoesel |
| UU-CS-1995-28 |
ps.gz pdf |
The union of moving polygonal pseudodiscs - combinatorial bounds and applications M. T. de Berg, H. Everett, L. J. Guibas |
| UU-CS-1995-27 |
pdf |
On Triangulating Planar Graphs under the Four-Connectivity Constraint T. Biedl and G. Kant and M. Kaufmann |
| UU-CS-1995-26 |
ps.gz pdf |
A new approach to subdivision simplification M. T. de Berg, M. van Kreveld, S. Schirra |
| UU-CS-1995-25 |
ps.gz pdf |
Parallel algorithms with optimal speedup for bounded treewidth H. L. Bodlaender, T. Hagerup |
| UU-CS-1995-24 |
pdf |
On Belief Networks and Diagnosis M.L. Wessels |
| UU-CS-1995-23 |
pdf |
Elicitation of Probabilities for Belief Networks: Combining Qualitative and Quantitative Information M.J. Druzdzel and L.C. van der Gaag |
| UU-CS-1995-22 |
ps.gz pdf |
Probabilistic path planning P. Svestka, M. H. Overmars |
| UU-CS-1995-21 |
pdf |
Trends and Developments in Computational Geometry M. de Berg |
| UU-CS-1995-20 |
ps.gz pdf |
On intervalizing k-colored graphs for DNA physical mapping Hans L. Bodlaender, Babette de Fluiter |
| UU-CS-1995-19 |
pdf |
Modal Logics for Representing Incoherent Knowledge J.J.Ch. Meyer and W. van der Hoek |
| UU-CS-1995-18 |
pdf |
A Modal Contrastive Logic: The Logic of `But' (revised version of UU-CS-1994-07) J.J.Ch. Meyer and W. van der Hoek |
| UU-CS-1995-17 |
ps.gz pdf |
Termination of constructor systems using semantic unification T. Arts, H. Zantema |
| UU-CS-1995-16 |
pdf |
The Complexity of Interval Routing on Random Graphs M. Flammini and J. van Leeuwen and A. Marchetti-Spaccamela |
| UU-CS-1995-15 |
ps.gz pdf |
Intervalizing k-colored graphs Hans L. Bodlaender, Babette de Fluiter |
| UU-CS-1995-14 |
ps.gz pdf |
Approximating generalized Voronoi diagrams in any dimension J. M. Vleugels, M. H. Overmars |
| UU-CS-1995-13 |
pdf |
Guessing Games, Binomial Sum Trees and Distributed Computations in Synchronous Networks J. van Leeuwen and N. Santoro and J. Urrutia and S. Zaks |
| UU-CS-1995-12 |
ps.gz pdf |
On levels of detail in terrains M. T. de Berg, K. T. G. Dobrindt |
| UU-CS-1995-11 |
ps.gz pdf |
A Case-Based Filter for Diagnostic Belief Networks N. B. Peek, L. C. van der Gaag |
| UU-CS-1995-10 |
ps.gz pdf |
A Complete Equational Axiomatization for BPA-delta-epsilon with Prefix Iteration W. J. Fokkink, H. Zantema |
| UU-CS-1995-09 |
ps.gz pdf |
How nonmonotonic is aboutness? P. D. Bruza, T. W. C. Huibers |
| UU-CS-1995-08 |
ps.gz pdf |
Seeing is believing - And so are hearing and jumping B. van Linder, W. van der Hoek, J-J. Ch. Meyer |
| UU-CS-1995-07 |
ps.gz pdf |
Formal design of self-stabilizing programs S. W. B. Prasetya, S. D. Swierstra |
| UU-CS-1995-06 |
ps.gz pdf |
Constructing levels in arrangements and higher order Voronoi diagrams P. K. Agarwal, M. T. de Berg, J. Matousek, O. Schwarzkopf |
| UU-CS-1995-05 |
pdf |
Compact Routing Methods: A Survey J. van Leeuwen and R.B. Tan |
| UU-CS-1995-04 |
ps.gz pdf |
A better heuristic for ortogobal graph drawings T. Biedl, G. Kant |
| UU-CS-1995-03 |
ps.gz pdf |
Rankings of graphs H. L. Bodlaender, J. S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Mueller, Zs. Tuza |
| UU-CS-1995-02 |
ps.gz pdf |
Treewidth and small separators for graphs with small chordality H. L. Bodlaender, D. M. Thilikos |
| UU-CS-1995-01 |
ps.gz pdf |
The parameterized complexity of sequence alignment and consensus H. L. Bodlaender, R. G. Downey, M. R. Fellows, H. T. Wareham |
| UU-CS-1994-56 |
pdf |
Revision by Communication: Program by Consulting Weaker Semantics C. Witteveen and W. van der Hoek |
| UU-CS-1994-55 |
ps.gz pdf |
Total termination of term rewriting is undecidable H. Zantema |
| UU-CS-1994-54 |
pdf |
Temporalizing Epistemic Default Logic W. van der Hoek and J.-J. Ch. Meyer and J. Treur |
| UU-CS-1994-53 |
ps.gz pdf |
Actions that Make you Change your Mind --- Belief Revision in an Agent-Oriented Setting B. van Linder, W. van der Hoek, J-J. Ch. Meyer |
| UU-CS-1994-52 |
ps.gz pdf |
Evolutionary Computation for the Job-shop Scheduling Problem C. Soares |
| UU-CS-1994-51 |
pdf |
New Results on Binary Space Partitions in the Plane M. de Berg and M. de Groot and M. Overmars |
| UU-CS-1994-50 |
pdf |
Modelling Office Processes with Functional Parsers G. Florijn |
| UU-CS-1994-49 |
ps.gz pdf |
Complete algorithms for feeding polyhedral parts using pivot grasps A. S. Rao, D. Kriegman, K. Y. Goldberg |
| UU-CS-1994-48 |
ps.gz pdf |
The dynamics of default reasoning B. van Linder, W. van der Hoek, J-J. Ch. Meyer |
| UU-CS-1994-47 |
ps.gz pdf |
Dummy elimination: making termination easier M. C. F. Ferreira, H. Zantema |
| UU-CS-1994-46 |
ps.gz pdf |
Well-foundedness of term orderings M. C. F. Ferreira, H. Zantema |
| UU-CS-1994-45 |
ps.gz pdf |
A proof system for asynchronously communicating deterministic processes F. S. de Boer, M. van Hulst |
| UU-CS-1994-44 |
ps.gz pdf |
A complete characterization of termination of 0^p 1^q -> 1^r 0^s H. Zantema, A. Geser |
| UU-CS-1994-43 |
ps.gz pdf |
Rewrite systems for integer arithmetic H. R. Walters, H. Zantema |
| UU-CS-1994-42 |
ps.gz pdf |
Evidence absorption -- Experiments on different classes of randomly generated belief networks L. C. van der Gaag |
| UU-CS-1994-41 |
ps.gz pdf |
Folding rulers inside triangles M. van Kreveld, J. Snoeyink, S. Whitesides |
| UU-CS-1994-40 |
ps.gz pdf |
The overlay of lower envelopes and its applications P. K. Agarwal, O. Schwarzkopf, M. Sharir |
| UU-CS-1994-39 |
ps.gz pdf |
Computing many faces in arrangements of lines and segments P. K. Agarwal, J. Matousek, O. Schwarzkopf |
| UU-CS-1994-38 |
pdf |
The Paradoxes of Deontic Logic Revisited: A Computer Science Perspective (Or: Should computer scientists be bothered by the concerns of philosophers?) J.-J. Ch. Meyer and F.P.M. Dignum and R.J. Wieringa |
| UU-CS-1994-37 |
ps.gz pdf |
Een theorie voor het bestuderen van information retrieval modellen (in Dutch) T. W. C. Huibers, B. van Linder, P. D. Bruza |
| UU-CS-1994-36 |
ps.gz pdf |
Spheres, molecules, and hidden surface removal D. Halperin, M. H. Overmars |
| UU-CS-1994-35 |
pdf |
Properties of Measures for Bayesian Belief Network Learning R.R. Bouckaert |
| UU-CS-1994-34 |
ps.gz pdf |
Computing half-plane and strip discrepancy of planar point sets M. T. de Berg |
| UU-CS-1994-33 |
ps.gz pdf |
Motion planning for car-like robots using a probabilistic learning approach P. Svestka, M. H. Overmars |
| UU-CS-1994-32 |
ps.gz pdf |
Probabilistic roadmaps for path planning in high-dimensional configuration spaces L. Kavraki, P. Svestka, J-C. Latombe, M. H. Overmars |
| UU-CS-1994-31 |
ps.gz pdf |
Hunting Voronoi vertices V. Ferrucci, M. H. Overmars, A. S. Rao, J. M. Vleugels |
| UU-CS-1994-30 |
ps.gz pdf |
Range searching and point location among fat objects M. H. Overmars, A. F. van der Stappen |
| UU-CS-1994-29 |
ps.gz pdf |
Vertical decompositions for triangles in 3-space M. T. de Berg, L. J. Guibas, D. Halperin |
| UU-CS-1994-28 |
ps.gz pdf |
Syntactical analysis of total termination M. C. F. Ferreira, H. Zantema |
| UU-CS-1994-27 |
ps.gz pdf |
Probabilistic network construction using the minimum description length principle R. R. Bouckaert |
| UU-CS-1994-26 |
ps.gz pdf |
Determining the castability of simple polyhedra P. Bose, D. Bremmer, M. van Kreveld |
| UU-CS-1994-25 |
ps.gz pdf |
Feasibility of design in stereolithography B. Asberg, G. Blanco, P. Bose, J. Garcia-Lopez, M. H. Overmars, G. T. Toussaint, G. Wilfong, B. Zhu |
| UU-CS-1994-24 |
ps.gz pdf |
Friction and part curvature in parallel-jaw grasping A. S. Rao, K. Y. Goldberg |
| UU-CS-1994-23 |
ps.gz pdf |
Efficient multiple-disorder diagnosis by strategy focusing L. C. van der Gaag, M. L. Wessels |
| UU-CS-1994-22 |
ps.gz pdf |
IDAGs: a perfect map for any distribution R. R. Bouckaert |
| UU-CS-1994-21 |
ps.gz pdf |
Efficient methods for isoline extraction from a digital elevation model based on triangulated irregular networks M. van Kreveld |
| UU-CS-1994-20 |
ps.gz pdf |
Termination of logic programs via labelled term rewrite systems T. Arts, H. Zantema |
| UU-CS-1994-19 |
pdf |
Mechanization of Substitution Rule and Compostionality of UNITY in HOL I.S.W.B. Prasetya |
| UU-CS-1994-18 |
pdf |
Computing Grasp Functions A.S. Rao and K.Y. Goldberg |
| UU-CS-1994-17 |
ps.gz pdf |
The floodlight problem F. Bose, L. J. Guibas, A. Lubiw, M. H. Overmars, D. Souvaine, J. Urrutia |
| UU-CS-1994-16 |
ps.gz pdf |
A stratified simulation scheme for inference in Bayesian belief networks R. R. Bouckaert |
| UU-CS-1994-15 |
ps.gz pdf |
Situations, a General Framework for Studying Information Retrieval T. W. C. Huibers, P. D. Bruza |
| UU-CS-1994-14 |
ps.gz pdf |
W[2]-hardness of Precedence Constrained K-processor Scheduling H. L. Bodlaender, M. R. Fellows |
| UU-CS-1994-13 |
pdf |
Reason Maintenance for Production Systems L.C. van der Gaag and C. de Koning |
| UU-CS-1994-12 |
ps.gz pdf |
On lazy randomized incremental construction M. T. de Berg, K. T. G. Dobrindt, O. Schwarzkopf |
| UU-CS-1994-11 |
ps.gz pdf |
Domino treewidth H. L. Bodlaender, J. Engelfriet |
| UU-CS-1994-10 |
ps.gz pdf |
Connected component and simple polygon intersection searching P. K. Agarwal, M. van Kreveld |
| UU-CS-1994-09 |
ps.gz pdf |
Reaching a goal with directional uncertainty M. T. de Berg, L. J. Guibas, D. Halperin, M. H. Overmars, O. Schwarzkopf, M. Sharir, M. Teillaud |
| UU-CS-1994-08 |
ps.gz pdf |
Tests as epistemic updates - pursuit of knowledge B. van Linder, W. van der Hoek, J-J. Ch. Meyer |
| UU-CS-1994-07 |
pdf |
A Modal Contrastive Logic: The Logic of `But` J.J.-Ch. Meyer and W. van der Hoek |
| UU-CS-1994-06 |
pdf |
Hazard Algebra for Asynchronous Circuits E. Meijer |
| UU-CS-1994-05 |
pdf |
More Advice on Proving a Compiler Correct: Improve a Correct Compiler E. Meijer |
| UU-CS-1994-04 |
pdf |
Back to Basics: Deriving Presentations Changers Without Relations G. Hutton and E. Meijer |
| UU-CS-1994-03 |
ps.gz pdf |
A probablisitic learning approach to motion planning M. H. Overmars, P. Svestka |
| UU-CS-1994-02 |
ps.gz pdf |
Trekking in the Alps without freezing or getting tired M. T. de Berg, M. van Kreveld |
| UU-CS-1994-01 |
ps.gz pdf |
Bottom-up grammar analysis - A functional formulation J. T. Jeuring, S. D. Swierstra |
| RUU-CS-93-46 |
ps.gz pdf |
Multi-traversal tree-decoration in a functional setting: monads versus bindings M. Pennings |
| RUU-CS-93-45 |
ps.gz pdf |
Convex grid drawings of 3-connected planar graphs M. Chrobak, G. Kant |
| RUU-CS-93-44 |
pdf |
Graded Modal and Epistemic Logic J.-J. Ch. Meyer and W. van der Hoek |
| RUU-CS-93-43 |
ps.gz pdf |
Manipulating algebraic parts in the plane A. S. Rao, K. Y. Goldberg |
| RUU-CS-93-42 |
ps.gz pdf |
Efficient context-sensitive plausible inference for information disclosure P. D. Bruza, L. C. van der Gaag |
| RUU-CS-93-41 |
ps.gz pdf |
Simple termination revisited A. Middeldorp, H. Zantema |
| RUU-CS-93-40 |
ps.gz pdf |
Basic process algebra with iteration: completeness of its equational axioms W. J. Fokkink, H. Zantema |
| RUU-CS-93-39 |
ps.gz pdf |
Linear election for oriented hypercubes G. Tel |
| RUU-CS-93-38 |
ps.gz pdf |
Motion planning using a colored Kohonen network J. M. Vleugels, J. N. Kok, M. H. Overmars |
| RUU-CS-93-37 |
pdf |
Advanced Distributed Algorithms T. Herman and G. Tel |
| RUU-CS-93-36 |
pdf |
On Fat Partioning, Fat Covering and the Union Size of Polygons M. van Kreveld |
| RUU-CS-93-35 |
pdf |
Evidence Absorption for Belief Networks L. v.d. Gaag |
| RUU-CS-93-34 |
ps.gz pdf |
Teaching computational geometry M. H. Overmars |
| RUU-CS-93-33 |
pdf |
Area Requirement of Visibility Representations of Trees G. Kant, G. Liotta, R. Tamassia, and I.G. Tollis |
| RUU-CS-93-32 |
pdf |
Honesty in Partial Logic W. van der Hoek, J. Jaspars and E. Thijsse |
| RUU-CS-93-31 |
ps.gz pdf |
Selective evidence gathering for diagnostic belief networks L. C. van der Gaag, M. L. Wessels |
| RUU-CS-93-30 |
ps.gz pdf |
Unravelling nondeterminism: On having the ability to choose W. van der Hoek, B. van Linder, J-J. Ch. Meyer |
| RUU-CS-93-29 |
pdf |
The Secrets of Causality F. Rietman |
| RUU-CS-93-28 |
pdf |
Efficient Bounded Timestamping Using traceable Use Abstraction - Is Writer's Guessing Better Than Reader's Telling? S. Haldar |
| RUU-CS-93-27 |
ps.gz pdf |
Efficient and constructive algorithms for the pathwidth and treewidth of graphs H. L. Bodlaender, T. Kloks |
| RUU-CS-93-26 |
ps.gz pdf |
A more compact visibility representation G. Kant |
| RUU-CS-93-25 |
pdf |
Rectilinear Decompositions with Low Stabbing Number M. de Berg and M. van Kreveld |
| RUU-CS-93-24 |
ps.gz pdf |
Termination of term rewriting by semantic labelling H. Zantema |
| RUU-CS-93-23 |
pdf |
Perfect Binary Space Partitions M. de Berg, M. de Groot and M. Overmars |
| RUU-CS-93-22 |
pdf |
Dynamic Microsets for RAMs J.A. La Poutré |
| RUU-CS-93-21 |
ps.gz pdf |
Placing registration marks A. S. Rao, K. Y. Goldberg |
| RUU-CS-93-20 |
ps.gz pdf |
Piecewise linear paths among convex obstacles M. T. de Berg, J. Matousek, O. Schwarzkopf |
| RUU-CS-93-19 |
pdf |
An `All Pairs Shortest Paths' Distributed Algorithm Using $2n^{2}$ Messages S. Haldar |
| RUU-CS-93-18 |
ps.gz pdf |
A probabilistic approach to motion planning for car-like robots P. Svestka |
| RUU-CS-93-17 |
ps.gz pdf |
Shape from diameter: positive results A. S. Rao, K. Y. Goldberg |
| RUU-CS-93-16 |
ps.gz pdf |
Shape from diameter: negative results A. S. Rao, K. Y. Goldberg |
| RUU-CS-93-15 |
ps.gz pdf |
On a class of O(n2) problems in computational geometry A. Gajentaan, M. H. Overmars |
| RUU-CS-93-14 |
pdf |
Heapsort with n log(n+1)+n-2 log(n+1)-2 Key Comparisons Using |_ n/2 _| Additional Bits S. Haldar |
| RUU-CS-93-13 |
pdf |
Lp Optimal d Dimensional Triangualtions for Piecewise Linear Interpolation: A New Result on data Dependent Triangulations Elefterios A. Melissaratos |
| RUU-CS-93-12 |
pdf |
Treewidth of Circle Graphs T. Kloks |
| RUU-CS-93-11 |
pdf |
Minimum Fill-in for Chordal Bipartite Graphs T. Kloks |
| RUU-CS-93-10 |
ps.gz pdf |
Detecting the erosion of hierarchic information structures P. D. Bruza, T. W. C. Huibers, J. van der Linden, T. van Opstal |
| RUU-CS-93-09 |
pdf |
Isomorphisms between Predicate and State Transformers Marcello Bonsangue and Joost N. Kok |
| RUU-CS-93-08 |
pdf |
Mapping objects to files: a UNIX file system interface to an object management system Gert Florijn and Leo Soepenberg and Atze Dijkstra |
| RUU-CS-93-07 |
ps.gz pdf |
On the relation between Unity properties and sequences of states R. T. Udink, J. N. Kok |
| RUU-CS-93-06 |
pdf |
A Multiscale Approach to Image Segmentation Using Kohonen Networks S. Haring and M.A. Viergever and J.N. Kok |
| RUU-CS-93-05 |
pdf |
Generalized Hidden Surface Removal Mark de Berg |
| RUU-CS-93-04 |
pdf |
A linear time algorithm to schedule trees with communication delays optimally on two machines Marinus Veldhorst |
| RUU-CS-93-03 |
pdf |
Algebraic Domains, Chain Completion and the Plotkin Powerdomain Construction Peter Knijnenburg |
| RUU-CS-93-02 |
pdf |
A Note on the Smyth Powerdomain Construction Peter Knijnenburg |
| RUU-CS-93-01 |
pdf |
Self-stabilizing l-Exclusion Algorithms M. Flatebo and A.K. Datta and A.A. Schoonen |
| RUU-CS-92-47 |
pdf |
Pearl's belief propagation; the proofs L.C. van der Gaag |
| RUU-CS-92-46 |
pdf |
A lateral inhibition neural network that emulates a winner-takes-all algorithm B. Krekelberg and J.N. Kok |
| RUU-CS-92-45 |
pdf |
A deterministic algorithm for the three-dimensional diameter problem J. Matouv{s}ek and O. Schwarzkopf |
| RUU-CS-92-44 |
pdf |
On blocks; locality and asynchronous communication (extended abstract) F.S. de Boer and J.N. Kok and C. Palamidessi and J.J.M.M. Rutten |
| RUU-CS-92-43 |
pdf |
Derivation lengths in terms rewriting from interpretations in the naturals V.C.S. Meeussen and H. Zantema |
| RUU-CS-92-42 |
pdf |
Total termination of term rewriting M.C.F. Ferreira and H. Zantema |
| RUU-CS-92-41 |
ps.gz pdf |
Two algorithms for finding rectangular duals of planar graphs G. Kant |
| RUU-CS-92-40 |
pdf |
Semantics, orderings and recursion in the weakest precondition calculus M. Bonsangue and J.N. Kok |
| RUU-CS-92-39 |
pdf |
Optimal size finite element meshes without obtuse and small angles E.A. Melissaratos |
| RUU-CS-92-38 |
pdf |
Termination of term rewriting by semantic labelling H. Zantema |
| RUU-CS-92-37 |
pdf |
The exact fitting problem in higher dimensions J.-M. Robert and L.J. Guibas and M.H. Overmars |
| RUU-CS-92-36 |
ps.gz pdf |
Bayesian belief networks and conditional independencies R. R. Bouckaert |
| RUU-CS-92-35 |
pdf |
Only few graphs have bounded treewidth T. Kloks and H. Bodlaender |
| RUU-CS-92-34 |
ps.gz pdf |
Conditional dependence in probablistic networks R. R. Bouckaert |
| RUU-CS-92-33 |
ps.gz pdf |
Drawing planar graphs using the lmc-ordering G. Kant |
| RUU-CS-92-32 |
pdf |
A random approach to motion planning M.H. Overmars |
| RUU-CS-92-31 |
pdf |
The complexity of the free space for motion planning amidst fat obstacles A.F. van der Stappen |
| RUU-CS-92-30 |
pdf |
Treewidth and pathwidth of permutation graphs H.L. Bodlaender and A.J.J. Kloks and D. Kratsch |
| RUU-CS-92-29 |
pdf |
Approximating treewidth and pathwidth of some classes of perfect graphs A.J.J. Kloks and H.L. Bodlaender |
| RUU-CS-92-28 |
pdf |
Treewidth of chordal bipartite graphs A.J.J. Kloks and D. Kratsch |
| RUU-CS-92-27 |
ps.gz pdf |
A linear time algorithm for finding tree-decompositions of small treewidth H. L. Bodlaender |
| RUU-CS-92-26 |
pdf |
Cuttings and Applications M.T. de Berg and O. Schwarzkopf |
| RUU-CS-92-25 |
pdf |
Towards the formal design of self-stabilizing distributed algorithms P.J.A. Lentfert and S.D. Swierstra |
| RUU-CS-92-24 |
pdf |
Sparse arrangements and the number of views of polyhedral scenes M. de Berg and D. Halperin and M. Overmars and M. van Kreveld |
| RUU-CS-92-23 |
pdf |
Congruences and quotients in categories of algebras N. Verwer |
| RUU-CS-92-22 |
pdf |
Current trends in the semantics of dataflow J.N. Kok |
| RUU-CS-92-21 |
pdf |
Index expression belief networks for information disclosure P.D. Bruza and L.C. van der Gaag |
| RUU-CS-92-20 |
ps.gz pdf |
The LazyRMS: Avoiding work in the ATMS G. Kelleher, L. C. van der Gaag |
| RUU-CS-92-19 |
pdf |
On parallel data structuring; A parallel priority queue S.T. Fischer and M. Veldhorst |
| RUU-CS-92-18 |
pdf |
Speeding up parallelism detection for attribute grammars M.F. Kuiper |
| RUU-CS-92-17 |
pdf |
The power of parallel projection M. van Kreveld |
| RUU-CS-92-16 |
pdf |
Virtual data structures D. Swierstra and O. de Moor |
| RUU-CS-92-15 |
pdf |
Implicit point location in arrangements of line segments, with an application to motion planning P.K. Agarwal and M. van Kreveld |
| RUU-CS-92-14 |
pdf |
Termination of term rewriting by interpretation H. Zantema |
| RUU-CS-92-13 |
pdf |
On the Treewidth and Pathwidth of Permutation Graphs T. Kloks and H.L. Bodlaender |
| RUU-CS-92-12 |
ps.gz pdf |
A tourist guide through Treewidth H. L. Bodlaender |
| RUU-CS-92-11 |
pdf |
Using cached functions and constructors for incremental attribute evaluation M. Pennings and D. Swierstra and H. Vogt |
| RUU-CS-92-10 |
pdf |
Abstracts of the Workshop on Computational Geometry (CG '92) unknown |
| RUU-CS-92-09 |
pdf |
Testing superperfection of $k-$trees T. Kloks and H.L. Bodlaender |
| RUU-CS-92-08 |
pdf |
Two strikes against perfect phylogeny H.L. Bodlaender and M.R. Fellows and T.J. Warnow |
| RUU-CS-92-07 |
pdf |
Triangslating planar graphs while minimizing the maximum degree G. Kant and H.L. Bodlaender |
| RUU-CS-92-06 |
pdf |
Hexagonal grid drawings G. Kant |
| RUU-CS-92-05 |
pdf |
The complexity of the free space for a robot moving amidst fat obstacles M.H. Overmars and A.F. van der Stappen and D. Halperin |
| RUU-CS-92-04 |
pdf |
Redesigning the window protocol; the block acknowledgement revisited A.A. Schoone |
| RUU-CS-92-03 |
ps.gz pdf |
An O(n2) maximal planarization algorithm based on PQ-trees G. Kant |
| RUU-CS-92-02 |
pdf |
An order-theoretic model for the algebra of communicating processes P.M.W. Knijnenburg |
| RUU-CS-92-01 |
pdf |
On efficiently characterizing solutions of linear Diophantine equations and its application to data dependence analysis C. Eisenbeis and O. Temam and H. Wijshoff |
| RUU-CS-91-49 |
ps.gz pdf |
Kayles on special classes of graphs - An application of Sprague-Grundy theory H. L. Bodlaender |
| RUU-CS-91-48 |
pdf |
Randomized multi-packet routing on meshes Michael Kaufmann, Jop F. Sibeyn |
| RUU-CS-91-47 |
pdf |
Linear planar augmentation algorithms for outerplanar graphs Goos Kant |
| RUU-CS-91-46 |
pdf |
A paradigm for asynchronous communication and its application to concurrent constraint programming F. S. de Boer, J. N. Kok, C. Palamidessi, J. J. M. M. Rutten |
| RUU-CS-91-45 |
pdf |
Towards a complete hierarchy of compositional dataflow models B. Jonsson, J. N. Kok |
| RUU-CS-91-44 |
pdf |
Restrictions of graph partition problems. Part I. H.L. Bodlaender and K. Jansen |
| RUU-CS-91-43 |
pdf |
A protocol scheme for a class of minimum delay routing algorithms P.J.M. van Haaften |
| RUU-CS-91-42 |
pdf |
Classifying termination of term rewriting H. Zantema |
| RUU-CS-91-41 |
pdf |
Computing and verifying depth orders M.T. de Berg and M.H. Overmars and O. Schwarzkopf |
| RUU-CS-91-40 |
pdf |
Point location in fat subdivisions M.H. Overmars |
| RUU-CS-91-39 |
ps.gz pdf |
On the complexity of the maximum cut problem H. L. Bodlaender, K. Jansen |
| RUU-CS-91-38 |
pdf |
A bibliography on network flow problems M. Veldhorst |
| RUU-CS-91-37 |
pdf |
The sum of weighted balls J.F. Sibeijn |
| RUU-CS-91-36 |
pdf |
MCSPARSE A parallel sparse unsymmetric linear system solver K.A. Gallivan and B.A. Marsolf and H.A.G. Wijshoff |
| RUU-CS-91-35 |
pdf |
Complexity aspects of 2-dimensional data compression H.L. Bodlaender and T. Gonzalez and T. Kloks |
| RUU-CS-91-34 |
pdf |
Superposition refinement of parallel algorithms R.J.R. Back and K. Sere |
| RUU-CS-91-33 |
pdf |
UNIX System Security. Recente ervaringen en aanbevelingen. E.H. Kremer |
| RUU-CS-91-32 |
ps.gz pdf |
Global virtual time approximation with distributed termination detection algorithms F. Mattern, H. Mehl, A. A. Schoone, G. Tel |
| RUU-CS-91-31 |
pdf |
Efficient hidden surface removal for objects with small union size M.J. Katz and M.H. Overmars and M. Sharir |
| RUU-CS-91-30 |
pdf |
Translating Queries for Sets of polygons M.T. de Berg and H. Everett and H. Wagner |
| RUU-CS-91-29 |
pdf |
Two- and three-dimensional point location in Rectangular subdivisions M.T. de Berg and M. van Kreveld and J. Snoeyink |
| RUU-CS-91-28 |
pdf |
Efficient ray shooting and hidden surface removal M.T. de Berg and D. Halperin and M.H. Overmars |
| RUU-CS-91-27 |
pdf |
Minimum-link c-oriented path queries J. Adegeest and M.H. Overmars and J. Snoeyink |
| RUU-CS-91-26 |
pdf |
Cautious backtracking and well-founded semantics in truth maintenance systems C.M. Jonker |
| RUU-CS-91-25 |
pdf |
Planar graph augmentation problems G. Kant and H.L. Bodlaender |
| RUU-CS-91-24 |
pdf |
Embedding as a tool for language comparison, On the CSP hierarchy F.S. de Boer and C. Palamidessi |
| RUU-CS-91-23 |
pdf |
The optimal placement of replicated items in distributed databases on tree-like networks E.M. Bakker and J. van Leeuwen |
| RUU-CS-91-22 |
pdf |
Some domination problems on trees and on general grahps E.M. Bakker and J. van Leeuwen |
| RUU-CS-91-21 |
pdf |
Uniform d-emulations of rings, with an application to distributed virtual ring contruction E.M. Bakker and J. van Leeuwen |
| RUU-CS-91-20 |
pdf |
Shortest path queries in rectilinear words M.T. de Berg and M. van Kreveld and B.J. Nilsson and M.H. Overmars |
| RUU-CS-91-19 |
pdf |
Symmetric orderings for unsymmetric sparse matrices H.A.G. Wijshoff |
| RUU-CS-91-18 |
pdf |
Termination of term rewriting, from many-sorted to one-sorted H. Zantema |
| RUU-CS-91-17 |
pdf |
Stepwise refinement of reactive processor farms K. Sere |
| RUU-CS-91-16 |
pdf |
Evaluation of the Cedar memory system, configuration 16 x 16 K. Gallivan and W. Jalby and H.A.G. Wijshoff |
| RUU-CS-91-15 |
pdf |
Preliminary basic performance analysis of the Cedar multiprocessor memory system H.A.G. Wijshoff |
| RUU-CS-91-14 |
pdf |
Higher order attribute grammars, Lecture notes of the International Summer School on Attribute Grammars, applications and systems S.D. Swierstra and H.H. Vogt |
| RUU-CS-91-13 |
pdf |
A simple linear time algorithm for triangulating three-colored graphs H.L. Bodlaender and A.J.. Kloks |
| RUU-CS-91-12 |
pdf |
Intersection queries in curved objects P.A. Agarwal and M. van Kreveld and M.H. Overmars |
| RUU-CS-91-11 |
pdf |
Mechanising proofs of program transformaton rules K. Sere and J. von Wright |
| RUU-CS-91-10 |
pdf |
A fully abstract model for Concurrent Constraint Programming F.S. de Boer and C. Palamidessi |
| RUU-CS-91-09 |
pdf |
Point location in zones of k-flats in arrangements M.T. de Berg and M. van Kreveld and J. Snoeyink |
| RUU-CS-91-08 |
ps.gz pdf |
Network Orientation G. Tel |
| RUU-CS-91-07 |
pdf |
Linear interval routing schemes E.M. Bakker and J. van Leeuwen and R.B. Tan |
| RUU-CS-91-06 |
pdf |
Dynamic output-sensitive hidden surface removal for c-Oriented polyhedra M. de Berg |
| RUU-CS-91-05 |
pdf |
Union-copy structures and dynamic segment trees M. van Kreveld and M.H. Overmars |
| RUU-CS-91-04 |
pdf |
The linear decomposition of lambda 2-models R. Hoofman |
| RUU-CS-91-03 |
pdf |
The complexity of coloring games on perfect graphs H.L. Bodlaender and D. Kratsch |
| RUU-CS-91-02 |
pdf |
Synchronous link-level protocols A.A.Schoone |
| RUU-CS-91-01 |
pdf |
Approximating treewidth, pathwidth, and minimum elimination tree height H.L. Bodlaender and J.R. Gilbert and H. Hafsteinsson and T. Kloks |
| RUU-CS-90-43 |
pdf |
From game trees to game graphs W.T.M. Kars |
| RUU-CS-90-42 |
pdf |
A pragmatical view on the certainty factor model L.C. van der Gaag |
| RUU-CS-90-41 |
pdf |
A note on semi-adjunctions R. Hoofman |
| RUU-CS-90-40 |
pdf |
The failure of failures towards a paradigm for asynchronous communication F.S. de Boer and J.N. Kok and C. Palamidessi and J.J.M.M. Rutten |
| RUU-CS-90-39 |
pdf |
On logic programming and the refinement calculus semantics based program transformations J.N. Kok |
| RUU-CS-90-38 |
pdf |
Categorical semantics as a basis for program transformation N. Verwer |
| RUU-CS-90-37 |
pdf |
Computing minimum length paths of a given homotopy class J. Hershberger and J. Snoeyink |
| RUU-CS-90-36 |
pdf |
On the efficient incremental evaluation of higher order attribute grammars H. Vogt and D. Swierstra and M. Kuiper |
| RUU-CS-90-35 |
pdf |
Perfect Colorings E.M. Bakker and J. van Leeuwen and R.B. Tan |
| RUU-CS-90-34 |
pdf |
Linear logic, domain theory and semi-functors R. Hoofman |
| RUU-CS-90-33 |
pdf |
Hidden surface removel for $c$-oriented polyhedra M. de Berg and M.H. Overmars |
| RUU-CS-90-32 |
pdf |
Covering a set of points with fixed size hypersquares and related problems T.F. Gonzalez |
| RUU-CS-90-31 |
pdf |
The on-line d-dimensional dictionary problem T.F. Gonzalez |
| RUU-CS-90-30 |
pdf |
Distributed incremental maximum finding in hierarchically divided graphs P.J.A. Lentfert and S.D. Swierstra and A.H. Uittenbogaard |
| RUU-CS-90-29 |
pdf |
On disjoint cycles in graphs H.L. Bodlaender |
| RUU-CS-90-28 |
pdf |
Longest segment problems H. Zantema |
| RUU-CS-90-27 |
pdf |
Maintaining 2- and 3-connected components in graphs, Part II: 2- and 3-edge-connected components and 2-vertex-connected components J.A. La Poutré |
| RUU-CS-90-26 |
pdf |
Maintaining 2- and 3-connected components in graphs, Part I: 2- and 3-edge-connected components J.A. La Poutré and J. van Leeuwen and M.H. Overmars |
| RUU-CS-90-25 |
pdf |
Continuous information systems R. Hoofman |
| RUU-CS-90-24 |
ps.gz pdf |
The derivation of distributed termination detection algorithms from garbage collection schemes G. Tel, F. Mattern |
| RUU-CS-90-23 |
pdf |
Rapid development of a program transformation system with attribute grammars and dynamic transformations H. Vogt and A. van den Berg and A. Freije |
| RUU-CS-90-22 |
pdf |
On probability intervals and their updating L.C. van der Gaag |
| RUU-CS-90-21 |
pdf |
Hidden surface removal for axis-parallel polyhedra (extended abstract) M. de Berg and M.H. Overmars |
| RUU-CS-90-20 |
pdf |
Finding shortest paths in the presence of orthogonal obstacles using a combined L1 and link metric M. de Berg and M. van Kreveld and B.J. Nilsson and M.H. Overmars |
| RUU-CS-90-19 |
pdf |
Matrix techniques for faster routing of affine permutations on a mesh interconnection network J.F. Sibeyn |
| RUU-CS-90-18 |
pdf |
Minimum hop route maintenance in static and dynamic networks A.A. Schoone |
| RUU-CS-90-17 |
pdf |
A pseudo-polylog average time parallel maxflow algorithm J.F. Sibeyn |
| RUU-CS-90-16 |
pdf |
The file distribution problem for processor networks G. Kant and J. van Leeuwen |
| RUU-CS-90-15 |
pdf |
Strong colorings of graphs G. Kant and J. van Leeuwen |
| RUU-CS-90-14 |
pdf |
A lower bound for full polymorphic type inference: Girard-Reynolds Typability is DEXPTIME-hard F. Henglein |
| RUU-CS-90-13 |
pdf |
Intersection queries in sets of disks M. van Kreveld and M. Overmars and P. Agarwal |
| RUU-CS-90-12 |
pdf |
Higher order attribute grammars: a merge between functional and object oriented programming S.D. Swierstra and H.H. Vogt |
| RUU-CS-90-11 |
pdf |
Fast algorithms for the Tron game on trees H. Bodlaender and T. Kloks |
| RUU-CS-90-10 |
pdf |
Prefix routing schemes in dynamic networks E.M. Bakker and J. van Leeuwen and R.B. Tan |
| RUU-CS-90-09 |
pdf |
Merging visibility maps M.H. Overmars and M. Sharir |
| RUU-CS-90-08 |
pdf |
Tools for the rectilinear steiner tree problem C.M. Jonker and V.C.J. Disselkoen |
| RUU-CS-90-07 |
pdf |
The pathwidth and treewidth of cographs H.L. Bodlaender and R.H. Möhring |
| RUU-CS-90-06 |
pdf |
Deriving programming laws categorically N. Verwer |
| RUU-CS-90-05 |
pdf |
Homomorphisms, factorisation and promotion N. Verwer |
| RUU-CS-90-04 |
pdf |
Paramorphisms L. Meertens |
| RUU-CS-90-03 |
pdf |
Algorithms from theorems J. Jeuring |
| RUU-CS-90-02 |
pdf |
From posets to coherence spaces R. Hoofman |
| RUU-CS-90-01 |
pdf |
Properties of models which are complete for Hoare logic R. Hoofman |
| RUU-CS-89-34 |
pdf |
Correctness of the two-phase commit protocol J. van Leeuwen |
| RUU-CS-89-33 |
pdf |
Fast left-linear semi-unification F. Henglein |
| RUU-CS-89-32 |
pdf |
An improved technique for output-sensitive hidden surface removal M. Sharir and M.H. Overmars |
| RUU-CS-89-31 |
pdf |
Translating polygons with applications to hidden surface removal M. de Berg |
| RUU-CS-89-30 |
pdf |
Finding complete bipartite subgraphs in bipartite graphs M. de Berg and M.H. Overmars and M. van Kreveld |
| RUU-CS-89-29 |
pdf |
Complexity of path-forming games H.L. Bodlaender |
| RUU-CS-89-28 |
pdf |
New upperbounds in Klee's measure problem M.H. Overmars and C.K. Yap |
| RUU-CS-89-27 |
pdf |
On the complexity of some coloring games H.L. Bodlaender |
| RUU-CS-89-26 |
pdf |
A simple output-sensitive algorithm for hidden surface removal M. Sharir and M.H. Overmars |
| RUU-CS-89-25 |
pdf |
Dynamic partition trees H. Schipper and M.H. Overmars |
| RUU-CS-89-24 |
pdf |
An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal M.T. Goodrich and M.J. Atallah and M.H. Overmars |
| RUU-CS-89-23 |
pdf |
The one-dimensional skewing problem G. Tel and J. van Leeuwen and H.A.G. Wijshoff |
| RUU-CS-89-22 |
ps.gz pdf |
Trade-offs in non-reversing diameter H. L. Bodlaender, G. Tel, N. Santoro |
| RUU-CS-89-21 |
pdf |
Lowerbounds for the UNION-FIND and the SPLIT-FIND problem on pointer machines J.A. La Poutré |
| RUU-CS-89-20 |
not online |
A fast and optimal algorithm for the SPLIT-FIND problem on pointer machines (vervallen) J.A. La Poutré |
| RUU-CS-89-19 |
pdf |
New techniques for the UNION-FIND problem J.A. La Poutré |
| RUU-CS-89-18 |
pdf |
Ranking intervals under visibility constraints H. Edelsbrunner and M.H. Overmars and E. Welzl |
| RUU-CS-89-17 |
pdf |
Storing line segments in partition trees M.H. Overmars and H. Schipper and M. Sharir |
| RUU-CS-89-16 |
pdf |
Concatenable structures for decomposable problems M.J. van Kreveld and M.H. Overmars |
| RUU-CS-89-15 |
pdf |
Minimizing sums of addition chains H. Zantema |
| RUU-CS-89-14 |
pdf |
The systematic construction of a one-combinator basis J. Fokker |
| RUU-CS-89-13 |
pdf |
On rectilinear link distance M. de Berg |
| RUU-CS-89-12 |
pdf |
Counting and reporting intersections in arrangements L.J. Guibas and M.H. Overmars and M. Sharir |
| RUU-CS-89-11 |
pdf |
Ray shooting, implicit point location, and related queries in arrangements of segments L. Guibas and M. Overmars and M. Sharir |
| RUU-CS-89-10 |
pdf |
Finding squares and rectangles in sets of points M.J. van Kreveld and M.T. de Berg |
| RUU-CS-89-09 |
pdf |
Constructing a calculus of programs L. Meertens |
| RUU-CS-89-08 |
pdf |
Computational geometry and its application to computer graphics M.H. Overmars |
| RUU-CS-89-07 |
pdf |
Finding minimum area k-gons M. Overmars and G. Rote and G. Woeginger |
| RUU-CS-89-06 |
pdf |
Structured NC B. Scholten and J. van Leeuwen |
| RUU-CS-89-05 |
pdf |
Distributed hierarchical routing P.J.A. Lentfert and A.H. Uittenbogaard and S.D. Swierstra |
| RUU-CS-89-04 |
pdf |
Higher order attribute grammars H.H. Vogt and S.D. Swierstra and M.F. Kuiper |
| RUU-CS-89-03 |
pdf |
On models for Propositional Dynamic Logic P.M.W. Knijnenburg and J. van Leeuwen |
| RUU-CS-89-02 |
pdf |
Bit-optimal election in synchronous rings H.L. Bodlaender and G. Tel |
| RUU-CS-89-01 |
pdf |
On linear time minor tests and depth first search H.L. Bodlaender |
| RUU-CS-88-40 |
pdf |
Transformation of a termination detection algorithm and its assertional correctness proof A.A. Schoone and G. Tel |
| RUU-CS-88-39 |
pdf |
Some observations for the pigeon hole principle F.J. Brandenburg and J. van Leeuwen and R.B. Tan |
| RUU-CS-88-38 |
pdf |
Efficient motion planning for an L-shaped object D. Halperin and M.H. Overmars and M. Sharir |
| RUU-CS-88-37 |
pdf |
Intelligent Tutoring Systems (in Dutch) P. Bergervoet |
| RUU-CS-88-36 |
pdf |
Concatenable segment trees M.J. van Kreveld and M.H. Overmars |
| RUU-CS-88-35 |
pdf |
A general approach to dominance in the plane M.T. de Berg and S. Carlsson and M.H. Overmars |
| RUU-CS-88-34 |
pdf |
On axiomatizations for propositional logics of programs P.M.W. Knijnenburg |
| RUU-CS-88-33 |
pdf |
The distributed bit complexity of the ring; from the anonymous to the non-anonymous case H.L. Bodlaender and S. Moran and M.K. Warmuth |
| RUU-CS-88-32 |
pdf |
Majority voting; characterization and algorithms H. Zantema |
| RUU-CS-88-31 |
pdf |
Distributed computing on transitive networks; the torus P.W. Beame and H.L. Bodlaender |
| RUU-CS-88-30 |
pdf |
Data conversions in abstract data types N. Verwer |
| RUU-CS-88-29 |
pdf |
Improved self-reduction algorithms for graphs with bounded treewidth H.L. Bodlaender |
| RUU-CS-88-28 |
pdf |
Divided k-d trees M.J. van Kreveld and M.H. Overmars |
| RUU-CS-88-27 |
pdf |
Maintaining multiple representations of dynamic data structures M.H.M. Smid and M.H. Overmars and L. Torenvliet and P. van Emde Boas |
| RUU-CS-88-26 |
pdf |
Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques L. Guibas and M.H. Overmars and M. Sharir |
| RUU-CS-88-25 |
pdf |
ACHROMATIC NUMBER is NP-complete for cographs and interval graphs H.L. Bodlaender |
| RUU-CS-88-24 |
pdf |
Binary structures in program transformations H. Zantema |
| RUU-CS-88-23 |
ps.gz pdf |
Optimal Synchronization of ABD Networks G. Tel, E. Korach, S. Zaks |
| RUU-CS-88-22 |
pdf |
New upper bounds in Klees measure problem (extended abstract) M.H. Overmars and C.K. Yap |
| RUU-CS-88-21 |
pdf |
Connectability problems M.H. Overmars |
| RUU-CS-88-20 |
pdf |
Bit-serial systolic squaring algorithms M.R. Kramer |
| RUU-CS-88-19 |
pdf |
Parallel aspects of numerical weather prediction on a grid of transputers H. Middelkoop and D. Streefland |
| RUU-CS-88-18 |
pdf |
New lower bound techniques for distributed leader finding and other problems on rings of processors H.L. Bodlaender |
| RUU-CS-88-17 |
pdf |
An optimal pointer machine algorithm for finding nearest common ancestors J. van Leeuwen and A.K. Tsakalides |
| RUU-CS-88-16 |
ps.gz pdf |
Total algorithms G. Tel |
| RUU-CS-88-15 |
pdf |
On randomizing decision problems; a survey of the theory of randomized NP P.M.W. Knijnenburg |
| RUU-CS-88-14 |
pdf |
Planar graphs with bounded treewidth H.L. Bodlaender |
| RUU-CS-88-13 |
pdf |
Assertional verification of a majority consensus algorithm for concurrency control in multiple copy databases N.J. Drost and J. van Leeuwen |
| RUU-CS-88-12 |
pdf |
Sets without empty convex 6-gons M.H. Overmars and B. Scholten and I. Vincent |
| RUU-CS-88-11 |
pdf |
Searching for empty convex polygons D.P. Dobkin and H. Edelsbrunner and M.H. Overmars |
| RUU-CS-88-10 |
pdf |
Dominance in the presence of obstacles M.T. de Berg and M.H. Overmars |
| RUU-CS-88-09 |
pdf |
The client/server model in distributed computing J. van Leeuwen |
| RUU-CS-88-08 |
pdf |
Authorization and transaction management in distributed database systems G.M.J. Pluimakers |
| RUU-CS-88-07 |
pdf |
New methods for computing visibility graphs (extended abstract) M.H. Overmars and E. Welzl |
| RUU-CS-88-06 |
pdf |
Assertional verification of a termination detection algorithm A.A. Schoone and G. Tel |
| RUU-CS-88-05 |
pdf |
Assertional verification of a reset algorithm N.J. Drost and A.A. Schoone |
| RUU-CS-88-04 |
pdf |
NC-algorithms for graphs of small treewidth H.L. Bodlaender |
| RUU-CS-88-03 |
pdf |
A unifying approach to the denotational semantics of Communicating Sequential Processes M.J. Walsteijn |
| RUU-CS-88-02 |
pdf |
Protocols for local area networks; a survey N.J. Drost |
| RUU-CS-88-01 |
pdf |
Data structures in a real-time environment P. Lentfert and M.H. Overmars |
| RUU-CS-87-26 |
pdf |
The role of divide in divide-and-rule algorithms O. de Moor |
| RUU-CS-87-25 |
pdf |
Maintenance of transitive closures and transitive reductions of graphs J.A. La Poutré and J. van Leeuwen |
| RUU-CS-87-24 |
pdf |
Elimination of variables from functional programs O. de Moor |
| RUU-CS-87-23 |
pdf |
Powerdomains R. Hoofman |
| RUU-CS-87-22 |
pdf |
Dynamic programming on graphs with bounded treewidth H.L. Bodlaender |
| RUU-CS-87-21 |
pdf |
Maintaining range trees in secondary memory Part II; lower bounds M.H.M. Smid and M.H. Overmars |
| RUU-CS-87-20 |
pdf |
Maintaining range trees in secondary memory Part I; Partitions M.H. Overmars and M.H.M. Smid and M.T. de Berg and M.J. van Kreveld |
| RUU-CS-87-19 |
pdf |
Een datastructuur met zoektijd O(logn) en constante update-tijd J.H. van der Erf |
| RUU-CS-87-18 |
pdf |
Linked allocation for parallel data structures M. Veldhorst |
| RUU-CS-87-17 |
pdf |
Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees H.L. Bodlaender |
| RUU-CS-87-16 |
pdf |
Two models for the reconstruction problem for dynamic data structures M.H.M. Smid and L. Torenvliet and P. van Emde Boas and M.H. Overmars |
| RUU-CS-87-15 |
pdf |
Assertional verification of a timer-based protocol G. Tel |
| RUU-CS-87-14 |
pdf |
Verification of connection-management protocols A.A. Schoone |
| RUU-CS-87-13 |
pdf |
A better lowerbound for distributed leader finding in bidirectional asynchronous rings of processors H.L. Bodlaender |
| RUU-CS-87-12 |
pdf |
The maximum cut and minimum cut into bounded sets problems on cographs H.L. Bodlaender |
| RUU-CS-87-11 |
pdf |
A new lowerbound technique for distributed extrema finding on rings of processors H.L. Bodlaender |
| RUU-CS-87-10 |
not online |
2nd International Workshop on Distributed Algorithms (draft papers) E. Gafni and M. Raynal and N. Santoro and J. van Leeuwen and S. Zaks (no longer available, revised version to appear in the series Lecture Notes in Computer Science) |
| RUU-CS-87-09 |
pdf |
Construction of sparse visibility graphs M.H. Overmars and E. Welzl |
| RUU-CS-87-08 |
pdf |
A balanced search tree with 0(1) worst-case update time C. Levcopoulos and M.H. Overmars |
| RUU-CS-87-07 |
pdf |
Enumeration in graphs G.J. Bezem and J. van Leeuwen |
| RUU-CS-87-06 |
pdf |
Directed network protocols (revised edition) G. Tel |
| RUU-CS-87-05 |
pdf |
Geometric data structures for computer graphics; an overview M.H. Overmars |
| RUU-CS-87-04 |
pdf |
Computational geometry on a grid; an overview M.H. Overmars |
| RUU-CS-87-03 |
pdf |
Partitioning range trees M.H. Overmars and M.H.M. Smid |
| RUU-CS-87-02 |
pdf |
Efficient data structures for range searching on a grid M.H. Overmars |
| RUU-CS-87-01 |
pdf |
Interval heaps J. van Leeuwen and D. Wood |
| RUU-CS-86-22 |
pdf |
Classes of graphs with bounded tree-width H.L. Bodlaender |
| RUU-CS-86-21 |
pdf |
The reconstruction of dynamic data structures M.H.M. Smid and L. Torenvliet and P. van Emde Boas and M.H. Overmars |
| RUU-CS-86-20 |
pdf |
On rectangular visibility M.H. Overmars and D. Wood |
| RUU-CS-86-19 |
pdf |
Normalized divide and conquer ; a scaling technique for solving multi-dimensional problems R.G. Karlsson and M.H. Overmars |
| RUU-CS-86-18 |
pdf |
Scanline algorithms on a grid R.G. Karlsson and M.H. Overmars |
| RUU-CS-86-17 |
pdf |
Graph algorithms (95 p.) J. van Leeuwen |
| RUU-CS-86-16 |
ps.gz pdf |
Using attribute grammars to derive efficient functional programs M. F. Kuiper, S. D. Swierstra |
| RUU-CS-86-15 |
pdf |
How to prove the first and second incompleteness theorem using concatenation A. Visser and O. de Moor and M.J. Walsteijn |
| RUU-CS-86-14 |
pdf |
Attribute grammars in Prolog M.J. Walsteijn and M.F. Kuiper |
| RUU-CS-86-13 |
pdf |
A dataflow graph code generator R. Nieuwenhout |
| RUU-CS-86-12 |
pdf |
Distributed infimum approximation G. Tel |
| RUU-CS-86-11 |
pdf |
The derivation of graph marking algorithms from distributed termination detection protocols G.Tel and R.B. Tan and J. van Leeuwen |
| RUU-CS-86-10 |
not online |
Compactly representable skewing schemes for trees H.A.G. Wijshoff |
| RUU-CS-86-09 |
not online |
General skewing schemes for trees H.A.G. Wijshoff |
| RUU-CS-86-08 |
not online |
The one-dimensional skewing problem G.Tel and J. van Leeuwen and H.A.G. Wijshoff |
| RUU-CS-86-07 |
pdf |
Very thin VLSI-layouts of complete binary trees J. van Leeuwen and R.B. Tan |
| RUU-CS-86-06 |
pdf |
Distribution of records on a ring of processors H.L. Bodlaender and J. van Leeuwen |
| RUU-CS-86-05 |
pdf |
Reconstructing visible regions from visible segments Wm. R. Franklin and V. Akman |
| RUU-CS-86-04 |
pdf |
Adaptive grid for polyhedral visibility in object space; an implementation Wm. R. Franklin and V. Akman |
| RUU-CS-86-03 |
pdf |
Octree data structures and creation by stacking Wm. R. Franklin and V. Akman |
| RUU-CS-86-02 |
pdf |
General symmetric distributed termination detection R.B. Tan and J. van Leeuwen |
| RUU-CS-86-01 |
pdf |
Simulation of parallel algorithms on a distributed network A.A. Schoone and J. van Leeuwen |
| RUU-CS-85-29 |
pdf |
Storing trees into parallel memories (extended abstract) H.A.G. Wijshoff |
| RUU-CS-85-28 |
pdf |
A simple and efficient halved line algorithm for hidden line elimination Wm.R.Franklin and V. Akman |
| RUU-CS-85-27 |
pdf |
Parallel dynamic programming algorithms M.Veldhorst |
| RUU-CS-85-26 |
pdf |
Diameter increase caused by edge deletion A.Schoone and H.L.Bodlaender and J.van Leeuwen |
| RUU-CS-85-25 |
pdf |
Deadlock-free packet switching networks with variable packet size H.L.Bodlaender |
| RUU-CS-85-24 |
pdf |
Hierarchical memory systems in multiprocessors and multi-periodic skewing schemes G.Tel and H.A.G. Wijshoff |
| RUU-CS-85-23 |
pdf |
An improved upperbound for distributed election in bidirectional rings of processors J. van Leeuwen and R.B. Tan |
| RUU-CS-85-22 |
pdf |
Some lowerbound results for decentralized extrema-finding in rings of processors H.L.Bodlaender |
| RUU-CS-85-21 |
pdf |
General methods for adding range restrictions to decomposable searching problems H.W.Scholten and M.H. Overmars |
| RUU-CS-85-20 |
pdf |
Emulations of processor networks with buses H.L.Bodlaender |
| RUU-CS-85-19 |
pdf |
A LAN with real-time facilities based on OSI concepts A.J. de Raaf and A.Dijkstra and S.D. Swierstra |
| RUU-CS-85-18 |
pdf |
Finding grid embeddings with bounded maximum edge length is NP-complete H.L.Bodlaender |
| RUU-CS-85-17 |
pdf |
Range searching on a grid M.H. Overmars |
| RUU-CS-85-16 |
pdf |
Interval routing J. van Leeuwen and R.B. Tan |
| RUU-CS-85-15 |
pdf |
New upperbounds for decentralized extremafinding in a ring of processors H.L.Bodlaender and J. van Leeuwen |
| RUU-CS-85-14 |
pdf |
The complexity of finding uniform emulations on fixed graphs H.L.Bodlaender |
| RUU-CS-85-13 |
pdf |
Geometric data structures for computer graphics M.H. Overmars |
| RUU-CS-85-12 |
pdf |
Verification of balanced link-level protocols A.A. Schoone and J. van Leeuwen |
| RUU-CS-85-11 |
pdf |
The classification of coverings of processor networks H.L.Bodlaender |
| RUU-CS-85-10 |
pdf |
On Approximation algorithms for determining minimum cost emulations H.L.Bodlaender |
| RUU-CS-85-09 |
pdf |
Authentication (abstract in het engels als -85-9a) G.M.J. Pluimakers and J. van Leeuwen |
| RUU-CS-85-08 |
pdf |
The inverted file tree machine!: efficient multi-key retrieval for VLSI H.P. Kriegel and R.Mannss and M.H. Overmars |
| RUU-CS-85-07 |
pdf |
Fast simulation of Turing machines by random access machines J. Katajainen and J. van Leeuwen and M. Penttonen |
| RUU-CS-85-06 |
pdf |
The complexity of cutting paper M.H. Overmars and E. Welzl |
| RUU-CS-85-05 |
pdf |
The complexity of finding uniform emulations on paths and ring networks H.L.Bodlaender |
| RUU-CS-85-04 |
pdf |
On the complexity of finding uniform emulations H.L.Bodlaender and J.van Leeuwen |
| RUU-CS-85-03 |
pdf |
Program derivation through transformations; the evolution of list-copying algorithms N.W.P. van Diepen and W.P. de Roever |
| RUU-CS-85-02 |
pdf |
The quest for compositionality - a survey of assertion - based proof systems for concurrent programs. Part 1 ; concurrency based on shared variables W.P. de Roever |
| RUU-CS-85-01 |
not online |
$ast$ Pascal; compact reference guide to the programming language J. van Leeuwen |
| RUU-CS-84-14 |
pdf |
A note on Gaussian elimination with partial pivoting on an MIMD computer M. Veldhorst |
| RUU-CS-84-13 |
pdf |
Array Processing Machines J. van Leeuwen and J. Wiedermann |
| RUU-CS-84-12 |
pdf |
The $mu$-calculus as an assertion language for fairness arguments F.A. Stomp and W.P. de Roever and R.T. Gerth |
| RUU-CS-84-11 |
pdf |
Parallel Turing Machines J.Wiedermann |
| RUU-CS-84-10 |
pdf |
Zooming by repeated range detection H. Edelsbrunner and M.H. Overmars |
| RUU-CS-84-09 |
pdf |
Uniform emulations of two different types of shuffle-exchange networks H.L. Bodlaender |
| RUU-CS-84-08 |
not online |
$ast$ Data structures (190 p., in Dutch) M.H. Overmars |
| RUU-CS-84-07 |
pdf |
Parallel memories, periodic skewing schemes, and the theory of finite abelian groups J.Tappe and J. van Leeuwen and H.A.G. Wijshoff |
| RUU-CS-84-06 |
pdf |
Compositional semantics for real-time distributed computing R.K. Shyamasundar and W.P. de Roever and R. Gerth and R. Koymans and S. Arun-Kumar |
| RUU-CS-84-05 |
pdf |
Uniform emulations of the shuffle-exchange network H.L. Bodlaender and J. van Leeuwen |
| RUU-CS-84-04 |
pdf |
Simulation of large networks on smaller networks H.L. Bodlaender and J. van Leeuwen |
| RUU-CS-84-03 |
pdf |
A direct routing algorithm for the bit-reversal permutation on a shuffle-exchange network I.J.M. Birkhoff |
| RUU-CS-84-02 |
pdf |
The minimum bisection width of (three-dimensional) blocks H.L. Bodlaender and J. van Leeuwen |
| RUU-CS-84-01 |
pdf |
The structure of periodic storage schemes for parallel memories H.A.G. Wijshoff and J. van Leeuwen |
| RUU-CS-83-18 |
not online |
Operating Systems (231 p. in Dutch) H.P. Penning and J. van Leeuwen |
| RUU-CS-83-17 |
pdf |
Transition logic R. Gerth |
| RUU-CS-83-16 |
pdf |
Routing with compact routing tables J. van Leeuwen and R.B. Tan |
| RUU-CS-83-15 |
pdf |
A proof system for partial correctness of dynamic networks of processes J. Zwiers and A. de Bruin and W.P. de Roever |
| RUU-CS-83-14 |
not online |
The technological image of ``1984'' (in Dutch) J. van Leeuwen |
| RUU-CS-83-13 |
pdf |
Parallel computers and algorithms J. van Leeuwen |
| RUU-CS-83-12 |
pdf |
The locus approach M.H. Overmars |
| RUU-CS-83-11 |
pdf |
Data mappings in large parallel computers J. van Leeuwen and H.A.G. Wijshoff |
| RUU-CS-83-10 |
pdf |
A linearity condition for periodic skewing schemes H.A.G. Wijshoff and J. van Leeuwen |
| RUU-CS-83-09 |
pdf |
Real time programming and asynchronous message passing R. Koymans and J. Vytopil and W.P. de Roever |
| RUU-CS-83-08 |
pdf |
Batched dynamic solutions to decomposable searching problems H. Edelsbrunner and M.H. Overmars |
| RUU-CS-83-07 |
pdf |
On linear skewing schemes and d ordered vectors H.A.G. Wijshoff and J. van Leeuwen |
| RUU-CS-83-06 |
pdf |
Range searching in a set of line segments M.H. Overmars |
| RUU-CS-83-05 |
pdf |
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 Roever |
| RUU-CS-83-04 |
pdf |
Periodic storage schemes with a minimum number of memory banks H.A.G. Wijshoff and J. van Leeuwen |
| RUU-CS-83-03 |
pdf |
Interaction with personal information systems (in Dutch) P. van Oostrum |
| RUU-CS-83-02 |
pdf |
A proof system for concurrent ADA programs R.T. Gerth and W.P. de Roever |
| RUU-CS-83-01 |
pdf |
Compositions of double diagonal and cross Latin squares H.L. Bodlaender and H.A.G. Wijshoff and J. van Leeuwen |
| RUU-CS-82-15 |
pdf |
PRAXIS handleiding voor praktikumstaf en PRAXIS-beheerder (in Dutch) H.P. Penning and L. Wolters |
| RUU-CS-82-14 |
pdf |
PRAXIS gebruikershandleiding (in Dutch) H.P. Penning and L. Wolters |
| RUU-CS-82-13 |
pdf |
The denotational semantics of dynamic networks of processes A.P.W. Bohm and A. de Bruin |
| RUU-CS-82-12 |
pdf |
Rendezvous with ADA - a Proof Theoretical View A. Pnueli and W.P. de Roever |
| RUU-CS-82-11 |
pdf |
Periodic versus arbitrary tessellations of the plane using polyominos of single type H.A.G. Wijshoff and J. van Leeuwen |
| RUU-CS-82-10 |
pdf |
A study in distributed systems and Dutch patriotism R.T. Gerth and W.P. de Roever and M. Roncken |
| RUU-CS-82-09 |
pdf |
Systolic computation and VLSI M.R. Kramer and J. van Leeuwen. |
| RUU-CS-82-08 |
pdf |
Distributed computing J. van Leeuwen. |
| RUU-CS-82-07 |
pdf |
The complexity of VLSI-circuits for arbitrary Boolean functions (to appear) M.R. Kramer and J. van Leeuwen |
| RUU-CS-82-06 |
pdf |
The NP-completeness of finding minimum area Layouts for VLSI-circuits (to appear) M.R. Kramer and J. van Leeuwen |
| RUU-CS-82-05 |
pdf |
A sound and complete Hoare axiomatization of the ADA-rendezvous (extended abstract.) R. Gerth |
| RUU-CS-82-04 |
pdf |
Wire routing in NP-complete M.R. Kramer and J. van Leeuwen |
| RUU-CS-82-03 |
pdf |
FANLAN GUID (in Dutch) FANLAN inc. S.G. van der Meulen et al |
| RUU-CS-82-02 |
pdf |
Introduction to Computer Architecture (in Dutch) S.G. van der Meulen |
| RUU-CS-82-01 |
not online |
Fundamental Algorithms (in Dutch) S.G. van der Meulen et al |
| RUU-CS-81-18 |
pdf |
Graphics and computational geometry J. van Leeuwen |
| RUU-CS-81-17 |
pdf |
A proof system for a subset of the concurrency section of ADA R.T. Gerth |
| RUU-CS-81-16 |
pdf |
The bounded aspect ratio problem for VLSI J. van Leeuwen |
| RUU-CS-81-15 |
pdf |
On the equivalence of some rectangle problems H. Edelsbrunner and M.H. Overmars |
| RUU-CS-81-14 |
pdf |
Organisatie van bedrijfssystemen voor computer netwerken I.J.M. Birkhoff and J. van Leeuwen |
| RUU-CS-81-13 |
not online |
VLSI layouts of perfect binary trees (to appear) J. van Leeuwen and M.H. Overmars and D. Wood |
| RUU-CS-81-12 |
not online |
A proof system for Brinch Hansen's distributed processes (extended abstract) M. Roncken and R. Gerth and W.P. de Roever |
| RUU-CS-81-11 |
not online |
A formalism for reasoning about fair termination W.P. de Roever |
| RUU-CS-81-10 |
pdf |
Transforming semi-dynamic data structures into dynamic structures M.H. Overmars |
| RUU-CS-81-09 |
pdf |
Searching in the past II- general transformations M.H. Overmars |
| RUU-CS-81-08 |
pdf |
The art of dynamizing J. van Leeuwen and M.H. Overmars |
| RUU-CS-81-07 |
pdf |
Searching in the past I M.H. Overmars |
| RUU-CS-81-06 |
pdf |
A basis for dataflow computing A.P.W. Bohm and J. van Leeuwen |
| RUU-CS-81-05 |
pdf |
A proof system for Brinch Hansen's distributed processes M. Roncken and N. van Diepen and M. Kramer and W.P. de Roever |
| RUU-CS-81-04 |
pdf |
Stratified balanced search trees J. van Leeuwen and M.H. Overmars |
| RUU-CS-81-03 |
pdf |
Maintenance of configurations in the plane (revised edition) M.H. Overmars and J. van Leeuwen |
| RUU-CS-81-02 |
pdf |
A proof rule for fair termination of quarded commands O. Grumberg and N. Francez and J.A. Makowsky and W.P. de Roever |
| RUU-CS-81-01 |
pdf |
On the equivalence of rectangle containment, rectangle enclosure and ECDF-searching M.H. Overmars |
| RUU-CS-80-12 |
pdf |
Efficient recognition of rational relations J. van Leeuwen and M. Nivat |
| RUU-CS-80-11 |
pdf |
Untangling a traveling salesman tour in the plane J. van Leeuwen and A.A. Schoone |
| RUU-CS-80-10 |
pdf |
Worst case optimal insertion and deletion methods for decomposable searching problems M.H. Overmars and J. van Leeuwen |
| RUU-CS-80-09 |
pdf |
Dynamization of order decomposable set problems M.H. Overmars |
| RUU-CS-80-08 |
pdf |
Computers en (on)doenlijke problemen J. van Leeuwen |
| RUU-CS-80-07 |
pdf |
General methods for the all elements and all pairs problem M.H. Overmars |
| RUU-CS-80-06 |
pdf |
Dynamization of decomposable searching problems yielding good worst case bounds M.H. Overmars and J. van Leeuwen |
| RUU-CS-80-05 |
pdf |
Notes on maintenance of configurations in the plane M.H. Overmars and J. van Leeuwen |
| RUU-CS-80-04 |
pdf |
A proof system for communicating sequential processes -final edition K.R. Apt and N. Francez and W.P. de Roever |
| RUU-CS-80-03 |
pdf |
Triangulating a starshaped polygon A.A. Schoone and J. van Leeuwen |
| RUU-CS-80-02 |
pdf |
Dynamic multi-dimensional data structures based on quad- and k-d trees M.H. Overmars and J. van Leeuwen |
| RUU-CS-80-01 |
pdf |
Some principles for dynamizing decomposable searching problems M.H. Overmars and J. van Leeuwen |
| RUU-CS-79-11 |
pdf |
Software support for an intelligent terminal W. Boerhout and A.P.W. Bohm and R. Gerth |
| RUU-CS-79-10 |
pdf |
Two general methods for dynamizing decomposable searching problems M.H. Overmars and J. van Leeuwen |
| RUU-CS-79-09 |
pdf |
Maintenance of configurations in the plane M.H. Overmars and J. van Leeuwen |
| RUU-CS-79-08 |
pdf |
A proof system for communicating sequential processes K.R. Apt and N. Francez and W.P. de Roever |
| RUU-CS-79-07 |
not online |
Further comments on Bykat's convex hull algorithm M.H. Overmars and J. van Leeuwen |
| RUU-CS-79-06 |
pdf |
The measure problem for rectangular ranges in d-space J. van Leeuwen and D. Wood |
| RUU-CS-79-05 |
pdf |
Dynamization of decomposable searching problems J. van Leeuwen and D. Wood |
| RUU-CS-79-04 |
pdf |
The complexity of basic complex operations H. Alt and J. van Leeuwen |
| RUU-CS-79-03 |
pdf |
Rapid subtree indentification revisited M.H. Overmars and J. van Leeuwen |
| RUU-CS-79-02 |
not online |
Computers en informatie-verwerking J. van Leeuwen |
| RUU-CS-79-01 |
pdf |
On program efficiency and algebraic complexity - (or- how to compute the Schur transform of a complex polynomial) J. van Leeuwen |
| RUU-CS-78-07 |
pdf |
The evolution of list-copying algorithms and the need for structured program verification S. Lee and W.P. de Roever and S.L. Gerhart |
| RUU-CS-78-06 |
pdf |
An essay on trees and iteration W.P. de Roever |
| RUU-CS-78-05 |
pdf |
The composition of fast priority queues J. van Leeuwen |
| RUU-CS-78-04 |
pdf |
Move-rules and trade-offs in the pebble game P. Emde Boas and J. van Leeuwen |
| RUU-CS-78-03 |
pdf |
Linear time generation of a new fixed-length data-compression code J. van Leeuwen |
| RUU-CS-78-02 |
pdf |
Compromising statistical data-base with a few known elements in a combinatorial model J. van Leeuwen |
| RUU-CS-78-01 |
pdf |
A useful lemma for context-free programmed grammers J. van Leeuwen |
| RUU-CS-78-00 |
not online |
Semantics of nondeterminism, concurrency and communication N. Francez and C.A.R. Hoare and D.J. Lehmann and W.P. de Roever |
| RUU-CS-77-04 |
not online |
Inleiding tot database systems J. van Leeuwen |
| RUU-CS-77-03 |
pdf |
Alternative path compression techniques J. van Leeuwen and Th.P. van der Weide |
| RUU-CS-77-02 |
pdf |
Stack machines and classes of nonnested macro-languages J. Engelfriet and E.Meineche Schmidt and J. van Leeuwen |
| RUU-CS-77-01 |
not online |
Datastructuren voor lineaire ruimten ``Torrix'' S.G. van der Meulen and M. Veldhorst |