Peter Widmayer

According to our database1, Peter Widmayer authored at least 244 papers between 1983 and 2018.

Collaborative distances :

ACM Fellow

ACM Fellow 1997, "For original contributions in data structures and algorithms advancing the areas of geometric and combinatorial computation and spatial databases.".

Book
In proceedings
Article
PhD thesis
Other

Bibliography

2018
Robust optimization in the presence of uncertainty: A generic approach.
J. Comput. Syst. Sci., 2018

2017
A better scoring model for de novo peptide sequencing: the symmetric difference between explained and measured masses.
Algorithms for Molecular Biology, 2017

2016
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs.
Theory Comput. Syst., 2016

Sequence Hypergraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

A Better Scoring Model for De Novo Peptide Sequencing: The Symmetric Difference Between Explained and Measured Masses.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Bribeproof Mechanisms for Two-Values Domains.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

2015
FUN with algorithms.
Theor. Comput. Sci., 2015

Mapping Simple Polygons: The Power of Telling Convex from Reflex.
ACM Trans. Algorithms, 2015

Selecting vertex disjoint paths in plane graphs.
Networks, 2015

Bribeproof mechanisms for two-values domains.
CoRR, 2015

An O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs.
Algorithmica, 2015

Recurring Comparison Faults: Sorting and Finding the Minimum.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past.
Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015

2014
Combinatorial Optimization and Applications.
Theor. Comput. Sci., 2014

Mapping a polygon with holes using a compass.
Theor. Comput. Sci., 2014

Highlights from ACM SIGSPATIAL GIS 2013: the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems: (Orlando, Florida, November 5-8, 2013).
SIGSPATIAL Special, 2014

The Presburger Award 2015 - Call for Nominations.
Bulletin of the EATCS, 2014

Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Data Delivery by Energy-Constrained Mobile Agents on a Line.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Improved bounds for the conflict-free chromatic art gallery problem.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Highlights from ACM SIGSPATIAL GIS 2012 the 20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (Redondo Beach, California, November 6-9, 2012).
SIGSPATIAL Special, 2013

Corner cuts are close to optimal: From solid grids to polygons and back.
Discrete Applied Mathematics, 2013

Simple agents learn to find their way: An introduction on mapping polygons.
Discrete Applied Mathematics, 2013

Mapping Simple Polygons: How Robots Benefit from Looking Back.
Algorithmica, 2013

Counting Approximately-Shortest Paths in Directed Acyclic Graphs.
Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Interval Selection with Machine-Dependent Intervals.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Robust optimization in the presence of uncertainty.
Proceedings of the Innovations in Theoretical Computer Science, 2013

To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations.
Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, 2013

Data Delivery by Energy-Constrained Mobile Agents.
Proceedings of the Algorithms for Sensor Systems, 2013

Polygon-Constrained Motion Planning Problems.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Reconstructing visibility graphs with simple robots.
Theor. Comput. Sci., 2012

Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons
CoRR, 2012

Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff?
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

Mapping Polygons with Agents That Measure Angles.
Proceedings of the Algorithmic Foundations of Robotics X, 2012

Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

Mapping a Polygon with Holes Using a Compass.
Proceedings of the Algorithms for Sensor Systems, 2012

Algorithmen und Datenstrukturen, 5. Auflage.
Spektrum Akademischer Verlag, ISBN: 978-3-8274-2803-5, 2012

2011
Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree.
IEEE Trans. Dependable Sec. Comput., 2011

On robust online scheduling algorithms.
J. Scheduling, 2011

A polygon is determined by its angles.
Comput. Geom., 2011

How to Guard a Graph?
Algorithmica, 2011

Maximum Independent Set in 2-Direction Outersegment Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

DISC 2011 Invited Lecture: Polygon Reconstruction with Little Information: An Example for the Power of Simple Micro-robots.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Telling convex from reflex allows to map a polygon.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

On the Complexity of the Metric TSP under Stability Considerations.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Discovery of network properties with all-shortest-paths queries.
Theor. Comput. Sci., 2010

Computing All Best Swaps for Minimum-Stretch Tree Spanners.
J. Graph Algorithms Appl., 2010

Approximate Shortest Paths Guided by a Small Index.
Algorithmica, 2010

Rendezvous of Mobile Agents in Directed Graphs.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Reconstructing a Simple Polygon from Its Angles.
Proceedings of the Algorithm Theory, 2010

Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids.
Proceedings of the Combinatorial Optimization and Applications, 2010

How Simple Robots Benefit from Looking Back.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

Vertex Disjoint Paths for Dispatching in Railways.
Proceedings of the ATMOS 2010, 2010

2009
Shunting for Dummies: An Introductory Algorithmic Survey.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Online Train Disposition: To Wait or Not to Wait?
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Strongly polynomial-time truthful mechanisms in one shot.
Theor. Comput. Sci., 2009

Single machine batch scheduling with release times.
J. Comb. Optim., 2009

Pseudonyms in Cost-Sharing Games.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Stability of Networks in Stretchable Graphs.
Proceedings of the Structural Information and Communication Complexity, 2009

Reconstructing Visibility Graphs with Simple Robots.
Proceedings of the Structural Information and Communication Complexity, 2009

How to Sort a Train.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots.
Theor. Comput. Sci., 2008

Computing all the best swap edges distributively.
J. Parallel Distrib. Comput., 2008

Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry.
I. J. Robotics Res., 2008

Genevestigator V3: A Reference Expression Database for the Meta-Analysis of Transcriptomes.

Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Reoptimization of Weighted Graph and Covering Problems.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Angle Optimization in Target Tracking.
Proceedings of the Algorithm Theory, 2008

Reoptimization of Steiner Trees.
Proceedings of the Algorithm Theory, 2008

On the Hardness of Reoptimization.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Discovery of Network Properties with All-Shortest-Paths Queries.
Proceedings of the Structural Information and Communication Complexity, 2008

Rendezvous of Mobile Agents When Tokens Fail Anytime.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

How to Guard a Graph?.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Computing Best Swaps in Optimal Tree Spanners.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

ATMOS 2008 Abstracts Collection - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.
Proceedings of the ATMOS 2008, 2008

ATMOS 2008 Preface -- 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.
Proceedings of the ATMOS 2008, 2008

Simple Robots in Polygonal Environments: A Hierarchy.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2008

2007
Distributed Computing in the Presence of Mobile Faults.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Agreement in synchronous networks with ubiquitous faults.
Theor. Comput. Sci., 2007

PepSplice: cache-efficient search algorithms for comprehensive identification of tandem mass spectra.
Bioinformatics, 2007

Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms.
Algorithmic Operations Research, 2007

On the Approximability of TSP on Local Modifications of Optimally Solved Instances.
Algorithmic Operations Research, 2007

An Algorithmic View on OVSF Code Assignment.
Algorithmica, 2007

A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

On the Robustness of Graham's Algorithm for Online Scheduling.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Approximate Shortest Paths Guided by a Small Index.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

A Combinatorial Approach to Multi-Domain Sketch Recognition.
Proceedings of the Sketch Based Interfaces and Modeling, 2007

Locating Facilities on a Network to Minimize Their Average Service Radius.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

07151 Abstracts Collection -- Geometry in Sensor Networks.
Proceedings of the Geometry in Sensor Networks, 09.04. - 13.04.2007, 2007

Counting Targets with Mobile Sensors in an Unknown Environment.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007

Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007

Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Strongly Polynomial-Time Truthful Mechanisms in One Shot.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Online Single Machine Batch Scheduling.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Reusing Optimal TSP Solutions for Locally Modified Input Instances.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

2005
Gathering of asynchronous robots with limited visibility.
Theor. Comput. Sci., 2005

A truthful mechanism for the non-utilitarian minimum radius spanning tree problem.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Geometric Routing Without Geometry.
Proceedings of the Structural Information and Communication Complexity, 2005

Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults.
Proceedings of the Structural Information and Communication Complexity, 2005

2004
Geographic Information Systems.
Proceedings of the Handbook of Data Structures and Applications., 2004

Preface.
Theor. Comput. Sci., 2004

The counting pyramid: an adaptive distributed counting scheme.
J. Parallel Distrib. Comput., 2004

Theory on the Tracks: A Selection of Railway Optimization Problems (Column: Algorithmics).
Bulletin of the EATCS, 2004

Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures.
Algorithmica, 2004

Joint Base Station Scheduling.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Railway Delay Management: Exploring Its Algorithmic Complexity.
Proceedings of the Algorithm Theory, 2004

An Algorithmic View on OVSF Code Assignment.
Proceedings of the STACS 2004, 2004

Computing All the Best Swap Edges Distributively.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

A Hidden Markov Model for de Novo Peptide Sequencing.
Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

Truthful Mechanisms for Generalized Utilitarian Problems.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Scheduling with Release Times and Deadlines on a Minimum Number of Machines.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Online Delay Management on a Single Train Line.
Proceedings of the Algorithmic Methods for Railway Optimization, 2004

2003
Evolutionary multiobjective optimization for base station transmitter placement with frequency assignment.
IEEE Trans. Evolutionary Computation, 2003

Finding the most vital node of a shortest path.
Theor. Comput. Sci., 2003

An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee.
SIAM J. Comput., 2003

Distributed Search Trees: Fault Tolerance in an Asynchronous Environment.
Theory Comput. Syst., 2003

Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast.
Algorithmica, 2003

On producing join results early.
Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003

Flexible Train Rostering.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Improving Customer Proximity to Railway Stations.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis.
Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

2002
Online train disposition: to wait or not to wait?
Electr. Notes Theor. Comput. Sci., 2002

Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm.
Proceedings of the VLDB 2002, 2002

Amortized Complexity of Bulk Updates in AVL-Trees.
Proceedings of the Algorithm Theory, 2002

Distributed Highly Available Search Trees.
Proceedings of the SIROCCO 9, 2002

Server Placements, Roman Domination and other Dominating Set Variants.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001
Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures.
J. Graph Algorithms Appl., 2001

A faster computation of the most vital edge of a shortest path.
Inf. Process. Lett., 2001

Virtual Geoexploration: Concepts and Design Choices.
Int. J. Comput. Geometry Appl., 2001

Relaxed Balance Using Standard Rotations.
Algorithmica, 2001

Inapproximability Results for Guarding Polygons and Terrains.
Algorithmica, 2001

Gathering of Asynchronous Oblivious Robots with Limited Visibility.
Proceedings of the STACS 2001, 2001

Pattern Formation by Anonymous Robots Without Chirality.
Proceedings of the SIROCCO 8, 2001

On the Complexity of Train Assignment Problems.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee.
Proceedings of the Algorithms, 2001

Finding the Most Vital Node of a Shortest Path.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
An image compression method for spatial search.
IEEE Trans. Image Processing, 2000

Approximation Algorithms for Clustering to Minimize the Sum of Diameters.
Nord. J. Comput., 2000

Approximation Algorithms for Clustering to Minimize the Sum of Diameters.
Proceedings of the Algorithm Theory, 2000

Virtual reality and dynamic statistical graphics: A bidirectional link in a heterogeneous, distributed computing environment.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

Maintaining a Minimum Spanning Tree Under Transient Node Failures.
Proceedings of the Algorithms, 2000

1999
Chorochronos: A Research Network for Spatiotemporal Database Systems.
SIGMOD Record, 1999

Class Steiner Trees and VLSI-design.
Discrete Applied Mathematics, 1999

Introduction: Distributed Data & Structures 2.
Proceedings of the Distributed Data & Structures 2, 1999

Concurrency and Recovery in Full-Text Indexing.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

The Bulk Index Join: A Generic Approach to Processing Non-Equijoins.
Proceedings of the 15th International Conference on Data Engineering, 1999

How to Swap a Failing Edge of a Single Source Shortest Paths Tree.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
An Inherent Bottleneck in Distributed Counting.
J. Parallel Distrib. Comput., 1998

Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes.
Inf. Process. Lett., 1998

A Unified Analysis of Distributed Counting with Queueing Theory.
Proceedings of the Distributed Data & Structures, 1998

Introduction: Distributed Data and Structures 1.
Proceedings of the Distributed Data & Structures, 1998

The counting pyramid: an adaptive distributed counting scheme.
Proceedings of the SIROCCO'98, 1998

The Alps at Your Fingertips: Virtual Reality and Geoinformation Systems.
Proceedings of the Fourteenth International Conference on Data Engineering, 1998

Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures.
Proceedings of the Algorithms, 1998

Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result.
Proceedings of the Algorithms, 1998

A Prototype System for Light Propagation in Terrains.
Proceedings of the Computer Graphics International Conference, 1998

Inapproximability of some art gallery problems.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Space-Filling Curves and Their Use in the Design of Geometric Data Structures.
Theor. Comput. Sci., 1997

Relaxed Balance through Standard Rotations.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Proceedings of the VLDB'97, 1997

An Inherent Bottleneck in Distributed Counting.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Singularities Make Spatial Join Scheduling Hard.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Relaxed Balancing in Search Trees.
Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1996
An Asymptotically Optimal Multiversion B-Tree.
VLDB J., 1996

Enclosing a Set of Objects by Two Minimum Area Rectangles.
J. Algorithms, 1996

Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression.
IW-MMDBMS, 1996

Spatial Data Structures: Concepts and Design Choices.
Proceedings of the Algorithmic Foundations of Geographic Information Systems, 1996

Space Filling Curves versus Random Walks.
Proceedings of the Algorithmic Foundations of Geographic Information Systems, 1996

Algorithmen und Datenstrukturen, 3. Auflage.
Spektrum Lehrbuch, Spektrum, ISBN: 978-3-8274-0110-6, 1996

1995
Book reviews.
Math. Meth. of OR, 1995

On Optimal Cuts of Hyperrectangles.
Computing, 1995

Balanced Distributed Search Trees Do Not Exist.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Space Filling Curves and Their Use in the Design of Geometric Data Structures.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

Binary Space Partitions for Sets of Hyperrectangles.
Proceedings of the Algorithms, 1995

1994
k-Violation Linear Programming.
Inf. Process. Lett., 1994

Distributing a Search Tree Among a Growing Number of Processors.
Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, 1994

VisTool: A Visualization Tool for Spatial Access Structures.
Proceedings of the IGIS '94: Geographic Information Systems, International Workshop on Advanced Information Systems, Monte Verita, Ascona, Switzerland, February 28, 1994

A Data Structure for Approximate String Searching.
Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

1993
Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects.
Comput. J., 1993

On Optimal Multiversion Access Structures.
Proceedings of the Advances in Spatial Databases, 1993

Towards an Analysis of Range Query Performance in Spatial Data Structures.
Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993

An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles.
Proceedings of the Graphics, Design and Visualization, Proceedings of the IFIP TC5/WG5.2/WG5.10 CSI International Conference on Computer Graphics, 1993

Geographic Information Systems: An Example.
CISM - Advances in Database Systems, 1993

Data Structures and Algorithms for Geographic Information Systems: Selected Topics.
CISM - Advances in Database Systems, 1993

A Brief Tutorial Introduction to Data Structures for Geometric Databases.
CISM - Advances in Database Systems, 1993

Balanced Cuts of a Set of Hyperrectangles.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Algorithmen und Datenstrukturen, 2. Auflage
Reihe Informatik 70, Bibliographisches Institut, ISBN: 3-411-16602-9, 1993

1992
Enclosing Many Boxes by an Optimal Pair of Boxes.
Proceedings of the STACS 92, 1992

Spatial Access Structures for Geometric Databases.
Proceedings of the Data Structures and Efficient Algorithms, 1992

1991
On graphs preserving rectilinear shortest paths in the presence of obstacles.
Annals OR, 1991

Spatial Priority Search: An Access Technique for Scaleless Maps.
Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data, 1991

On Shortest Networks for Classes of Points in the Plane.
Proceedings of the Computational Geometry, 1991

An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles.
Proceedings of the Computational Geometry, 1991

Anbindung einer rämlich clusternden Zugriffstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle.
Proceedings of the Datenbanksysteme in Büro, 1991

Datenstrukturen für Geodatenbanken.
Entwicklungstendenzen bei Datenbanksystemen, 1991

1990
On the Power of Safe Locking.
J. Comput. Syst. Sci., 1990

Distributed Function Evaluation in the Presence of Transmission Faults.
Proceedings of the Algorithms, 1990

The R-File: An Efficient Access Structure for Proximity Queries.
Proceedings of the Sixth International Conference on Data Engineering, 1990

Ein Vorschlag zur maßstabsunabhängigen Verwaltung von Landschaftsdaten.
Grundlagen von Datenbanken, 1990

Maßstabsunabhängige Verwaltung von Landschaftsdaten.
Proceedings of the GI, 1990

Algorithmen und Datenstrukturen
Reihe Informatik 70, Bibliographisches Institut, ISBN: 3-411-03161-1, 1990

1989
Beyond Steiner's Problem: A VLSI Oriented Generalization.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

Paging Binary Trees with External Balancing.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

Proceedings of the Fifteenth International Conference on Very Large Data Bases, 1989

Time is Not a Healer.
Proceedings of the STACS 89, 1989

Räumliche Suche in geometrischen Datenbanken.
Grundlagen von Datenbanken, 1989

1988
Hole Problems for Rectangles in the Plane.
SIAM J. Discrete Math., 1988

Maximizing pin alignment in semi-custom chip circuit layout.
Integration, 1988

Twin Grid Files: Space Optimizing Access Schemes.
Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, 1988

Spatial Searching in Geometric Databases.
Proceedings of the Fourth International Conference on Data Engineering, 1988

Globally Order Preserving Multidimensional Linear Hashing.
Proceedings of the Fourth International Conference on Data Engineering, 1988

The Twin Grid File: A Nearly Space Optimal Index Structure.
Proceedings of the Advances in Database Technology, 1988

Twin Grid Files: A Performance Evaluation.
Proceedings of the Computational Geometry and its Applications, 1988

1987
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles.
IEEE Trans. Computers, 1987

On Some Distance Problems in Fixed Orientations.
SIAM J. Comput., 1987

Time- and Space-Optimal Contour Computation for a Set of Rectangles.
Inf. Process. Lett., 1987

On the Analysis of Grid Structures for Spatial Objects of Non-Zero Size.
Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987

1986
Pre-analysis Locking
Information and Control, 1986

On some union and intersection problems for polygons with fixed orientations.
Computing, 1986

A Faster Approximation Algorithm for the Steiner Problem in Graphs.
Acta Inf., 1986

An Approximation Algorithms for Steiner's Problem in Graphs.
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen.
Proceedings of the Informatik-Grundbildung in Schule und Beruf, GI-Fachtagung, Kaiserslautern, 29. September, 1986

Towards Online Schedulers Based on Pre-Analysis Locking.
Proceedings of the ICDT'86, 1986

Hintergrundspeicherstrukturen für ausgedehnte Objekte.
Proceedings of the GI - 16. Jahrestagung I, Berlin, 6.-10. Oktober 1986, Proceedings, 1986

1985
An Optimal Algorithm for the Maximum Alignment of Terminals.
Inf. Process. Lett., 1985

A fast algorithm for the Boolean masking problem.
Computer Vision, Graphics, and Image Processing, 1985

Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy.
Proceedings of the VLDB'85, 1985

Distance problems in computational geometry with fixed orientations.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
On the Complexity of Concurrency Control by Locking in Distributed Database Systems
Information and Control, 1984

Maximal Concurrency by Locking.
Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984

Solving Visibility Problems by Using Skeleton Structures.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983
Computational complexity in computer graphics and VLSI design.
PhD thesis, 1983

On translating a set of line segments.
Computer Vision, Graphics, and Image Processing, 1983