Mark H. Overmars

According to our database1, Mark H. Overmars
  • authored at least 235 papers between 1980 and 2013.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2013
Learning C# by Programming Games.
Springer, ISBN: 978-3-642-36579-9, 2013

2012
Simulating and Evaluating the Local Behavior of Small Pedestrian Groups.
IEEE Trans. Vis. Comput. Graph., 2012

On a class of O(n2) problems in computational geometry.
Comput. Geom., 2012

2011
Computing Signed Permutations of Polygons.
Int. J. Comput. Geometry Appl., 2011

Interactive Character Animation using Simulated Physics.
Proceedings of the Eurographics 2011, 2011

2010
Real Time Animation of Virtual Humans: A Trade-off Between Naturalness and Control.
Comput. Graph. Forum, 2010

Simulating the local behaviour of small pedestrian groups.
Proceedings of the ACM Symposium on Virtual Reality Software and Technology, 2010

Simulating Human Collision Avoidance Using a Velocity-Based Approach.
Proceedings of the Seventh Workshop on Virtual Reality Interactions and Physical Simulations, 2010

A Velocity-Based Approach for Simulating Human Collision Avoidance.
Proceedings of the Intelligent Virtual Agents, 10th International Conference, 2010

2009
Guest editors' introduction: Special issue on gaming.
Journal of Visualization and Computer Animation, 2009

A Predictive Collision Avoidance Model for Pedestrian Simulation.
Proceedings of the Motion in Games, Second International Workshop, 2009

Density constraints for crowd simulation.
Proceedings of the 2009 International IEEE Consumer Electronics Society's Games Innovations Conference, 2009

Indicative routes for path planning and crowd simulation.
Proceedings of the 4th International Conference on Foundations of Digital Games, 2009

Real Time Animation of Virtual Humans: A Trade-off Between Naturalness and Control.
Proceedings of the Eurographics 2009 - State of the Art Reports, Munich, Germany, March 30, 2009

2008
Adding variation to path planning.
Journal of Visualization and Computer Animation, 2008

Realizing partitions respecting full and partial order information.
J. Discrete Algorithms, 2008

Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles.
I. J. Robotics Res., 2008

Using the Corridor Map Method for Path Planning for a Large Number of Characters.
Proceedings of the Motion in Games, First International Workshop, 2008

Flexible Path Planning Using Corridor Maps.
Proceedings of the Algorithms, 2008

Computational geometry: algorithms and applications, 3rd Edition.
Springer, ISBN: 9783540779735, 2008

2007
Pushing a Disk Using Compliance.
IEEE Trans. Robotics, 2007

High quality navigation in computer games.
Sci. Comput. Program., 2007

Reachability-based analysis for Probabilistic Roadmap planners.
Robotics and Autonomous Systems, 2007

The corridor map method: a general framework for real-time high-quality path planning.
Journal of Visualization and Computer Animation, 2007

Creating High-quality Paths for Motion Planning.
I. J. Robotics Res., 2007

Immobilizing Hinged Polygons.
Int. J. Comput. Geometry Appl., 2007

An intersection-sensitive algorithm for snap rounding.
Comput. Geom., 2007

Efficient path planning in changing environments.
Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 29, 2007

Kinodynamic motion planning on roadmaps in dynamic environments.
Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 29, 2007

The Corridor Map Method: Real-Time High-Quality Path Planning.
Proceedings of the 2007 IEEE International Conference on Robotics and Automation, 2007

2006
Computing Maximally Separated Sets in the Plane.
SIAM J. Comput., 2006

Sampling and node adding in probabilistic roadmap planners.
Robotics and Autonomous Systems, 2006

An Effective Framework for Path Planning Amidst Movable Obstacles.
Proceedings of the Algorithmic Foundation of Robotics VII, 2006

Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles.
Proceedings of the Algorithmic Foundation of Robotics VII, 2006

Scientific challenges ingame technology.
Proceedings of the ACM Symposium on Virtual Reality Software and Technology, 2006

Creating High-quality Roadmaps for Motion Planning in Virtual Environments.
Proceedings of the 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2006

Pushing using Compliance.
Proceedings of the 2006 IEEE International Conference on Robotics and Automation, 2006

Computing Shortest Safe Path amidst Growing Discs in the Plane.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

The game maker's apprentice - game development for beginners.
Apress, ISBN: 978-1-59059-615-9, 2006

2005
Roadmap-based motion planning in dynamic environments.
IEEE Trans. Robotics, 2005

TSP with neighborhoods of varying size.
J. Algorithms, 2005

Editorial: Special Issue on WAFR 2004.
I. J. Robotics Res., 2005

Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners.
I. J. Robotics Res., 2005

Separating Point Sets in Polygonal Environments.
Int. J. Comput. Geometry Appl., 2005

Path planning for pushing a disk using compliance.
Proceedings of the 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2005

On improving the clearance for robots in high-dimensional configuration spaces.
Proceedings of the 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2005

Prioritized motion planning for multiple robots.
Proceedings of the 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2005

Creating robust roadmaps for motion planning in changing environments.
Proceedings of the 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2005

Reachability Analysis of Sampling Based Planners.
Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 2005

2004
Teaching Computer Science through Game Design.
IEEE Computer, 2004

Automatic Generation of Camera Motion to Track a Moving Guide.
Proceedings of the Algorithmic Foundations of Robotics VI, 2004

Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Finding paths for coherent groups using clearance.
Proceedings of the 2004 ACM SIGGRAPH/Eurographics Symposium on Computer Animation, 2004

Roadmap-based motion planning in dynamic environments.
Proceedings of the 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems, Sendai, Japan, September 28, 2004

Motion Planning for Camera Movements.
Proceedings of the 2004 IEEE International Conference on Robotics and Automation, 2004

Useful Cycles in Probabilistic Roadmap Graphs.
Proceedings of the 2004 IEEE International Conference on Robotics and Automation, 2004

Motion Planning for Coherent Groups of Entities.
Proceedings of the 2004 IEEE International Conference on Robotics and Automation, 2004

Clearance based Path Optimization for Motion Planning.
Proceedings of the 2004 IEEE International Conference on Robotics and Automation, 2004

Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners.
Proceedings of the 2004 IEEE International Conference on Robotics and Automation, 2004

Separating point sets in polygonal environments.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
Finding Sets of Points without Empty Convex 6-Gons.
Discrete & Computational Geometry, 2003

Preprocessing chains for fast dihedral rotations is hard or even impossible.
Comput. Geom., 2003

On R-trees with low query complexity.
Comput. Geom., 2003

Guarding scenes against invasive hypercubes.
Comput. Geom., 2003

2002
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
CoRR, 2002

Orienting polyhedral parts by pushing.
Comput. Geom., 2002

Models and motion planning.
Comput. Geom., 2002

Reporting intersecting pairs of convex polytopes in two and three dimensions.
Comput. Geom., 2002

Algorithms for Motion and Navigation in Virtual Environments and Games.
Proceedings of the Algorithmic Foundations of Robotics V, 2002

A Comparative Study of Probabilistic Roadmap Planners.
Proceedings of the Algorithmic Foundations of Robotics V, 2002

Flat-State Connectivity of Linkages under Dihedral Motions.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Fixturing Hinged Polygons.
Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002

Sensorless Orientation of 3D Polyhedral Parts.
Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002

Recent Developments in Motion Planning.
Proceedings of the Computational Science - ICCS 2002, 2002

TSP with Neighborhoods of Varying Size.
Proceedings of the Algorithms, 2002

Computing signed permutations of polygons.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Pin design for part feeding.
Robotica, 2001

Trap Design for Vibratory Bowl Feeders.
I. J. Robotics Res., 2001

Locked and Unlocked Polygonal Chains in Three Dimensions.
Discrete & Computational Geometry, 2001

Reconfiguring convex polygons.
Comput. Geom., 2001

Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Motion Planning in Environments with Dangerzones.
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

Orienting Parts by Inside-out Pulling.
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

2000
Computing Immobilizing Grasps of Polygonal Parts.
I. J. Robotics Res., 2000

Flipturning polygons
CoRR, 2000

The Toppling Graph: Designing Pin Sequences for Part Feeding.
Proceedings of the 2000 IEEE International Conference on Robotics and Automation, 2000

A Robust Affine Invariant Similarity Measure Based on Visibility.
EuroCG, 2000

Orienting Polyhedral Parts by Pushing.
EuroCG, 2000

On R-trees with Low Stabbing Number.
Proceedings of the Algorithms, 2000

A New Visibility Partition for Affine Pattern Matching.
Proceedings of the Discrete Geometry for Computer Imagery, 9th International Conference, 2000

Geometry and Part Feeding.
Proceedings of the Sensor Based Intelligent Robots, 2000

Reconfiguring Convex Polygons.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Locked and Unlocked Polygonal Chains in 3D
CoRR, 1999

Locked and Unlocked Polygonal Chains in 3D.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Computing Form-Closure Configurations.
Proceedings of the 1999 IEEE International Conference on Robotics and Automation, 1999

The Gaussian Sampling Strategy for Probabilistic Roadmap Planners.
Proceedings of the 1999 IEEE International Conference on Robotics and Automation, 1999

Trap Design for Vibratory Bowl Feeders.
Proceedings of the 1999 IEEE International Conference on Robotics and Automation, 1999

Geometric Algorithms for Trap Design.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
Coordinated path planning for multiple robots.
Robotics and Autonomous Systems, 1998

Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems.
I. J. Robotics Res., 1998

Approximating Voronoi Diagrams of Convex Sites in any Dimension.
Int. J. Comput. Geometry Appl., 1998

Computing the Angularity Tolerance.
Int. J. Comput. Geometry Appl., 1998

Motion Planning in Environments with Low Obstacle Density.
Discrete & Computational Geometry, 1998

Locked and Unlocked Polygonal Chains in 3D
CoRR, 1998

Spheres, molecules, and hidden surface removal.
Comput. Geom., 1998

Dynamic motion planning in low obstacle density environments.
Comput. Geom., 1998

Computing fence designs for orienting parts.
Comput. Geom., 1998

Interference-free NC machining using spatial planning and Minkowski operations.
Computer-Aided Design, 1998

Guarding Scenes against Invasive Hypercubes.
Proceedings of the Algorithm Engineering, 1998

Models and Motion Planning.
Proceedings of the Algorithm Theory, 1998

Geometric Algorithms for Robotic Manipulation.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Unfolding some classes of orthogonal polyhedra.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Motion Planning for Carlike Robots Using a Probabilistic Learning Approach.
I. J. Robotics Res., 1997

Motion Planning with Complete Knowledge Using a Colored Som.
Int. J. Neural Syst., 1997

The Floodlight Problem.
Int. J. Comput. Geometry Appl., 1997

Sparse Arrangements and the Number of Views of Polyhedral Scenes.
Int. J. Comput. Geometry Appl., 1997

Simple Traversal of a Subdivision Without Extra Storage.
International Journal of Geographical Information Science, 1997

Perfect Binary Space Partitions.
Comput. Geom., 1997

New Results on Binary Space Partitions in the Plane.
Comput. Geom., 1997

Improved Bounds for Electing a Leader in a Synchronous Ring.
Algorithmica, 1997

Feasibility of Design in Stereolithography.
Algorithmica, 1997

Dynamic Motion Planning in Low Obstacle Density Environments.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

On Fence Design and the Complexity of Push Plans for Orienting Parts.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Probabilistic roadmaps for path planning in high-dimensional configuration spaces.
IEEE Trans. Robotics and Automation, 1996

Range Searching and Point Location among Fat Objects.
J. Algorithms, 1996

Hunting Voronoi Vertices.
Comput. Geom., 1996

The Exact Fitting Problem in Higher Dimensions.
Comput. Geom., 1996

Designing the Computational Geometry Algorithms Library CGAL.
Proceedings of the Applied Computational Geormetry, 1996

Probabilistic Approaches to Motion Planning.
Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

Fixture Design with Edge-Fixels.
Proceedings of the Intelligent Robots: Sensing, 1996

Simple Traversal of a Subdivision Without Extra Storage.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Computing the Angularity Tolerance.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

The Complexity of Rivers in Triangulated Terrains.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
Reaching a Goal with Directional Uncertainty.
Theor. Comput. Sci., 1995

On a Class of O(n2) Problems in Computational Geometry.
Comput. Geom., 1995

Coordinated Motion Planning for Multiple Car-Like Robots Using Probabilistic Roadmaps.
Proceedings of the 1995 International Conference on Robotics and Automation, 1995

Simple Traversal of a Subdivision Without Extra Storage.
Proceedings of the 3rd ACM International Workshop on Advances in Geographic Information Systems, 1995

Immobilizing Polygons against a Wall.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Printed Circuit Board Simplification: Simplifying Subdivisions in Practice.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Concatenable Structures for Decomposable Problems
Inf. Comput., April, 1994

Computing and Verifying Depth Orders.
SIAM J. Comput., 1994

Minimum-link C-oriented paths: Single-source queries.
Int. J. Comput. Geometry Appl., 1994

An Improved Technique for Output-Sensitive Hidden Surface Removal.
Algorithmica, 1994

Efficient Ray Shooting and Hidden Surface Removal.
Algorithmica, 1994

New Results on Binary Space Partitions in the Plane (Extended Abstract).
Proceedings of the Algorithm Theory, 1994

Range Searching and Point Location among Fat Objects.
Proceedings of the Algorithms, 1994

Motion Planning Amidst Fat Obstacles (Extended Abstract).
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Spheres, Molecules, and Hidden Surface Removal.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Hunting Voronoi Vertices in Non-Polygonal Domains.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993
Output-Sensitive Methods for Rectilinear Hidden Surface Removal
Inf. Comput., November, 1993

Intersection Queries in Curved Objects.
J. Algorithms, 1993

Union-Copy Structures and Dynamic Segment Trees.
J. ACM, 1993

Maintenance of 2- and 3-edge- connected components of graphs I.
Discrete Mathematics, 1993

The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles.
Comput. Geom., 1993

Reaching a Goal with Directional Uncertainty.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles.
Proceedings of the 1993 IEEE International Conference on Robotics and Automation, 1993

Feasability of Design in Stereolithography.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

The Floodlight Problem.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Perfect Binary Space Partitions.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
A Simple Output-Sensitive Algorithm for Hidden Surface Removal.
ACM Trans. Graph., 1992

Efficient Motion Planning for an L-Shaped Object.
SIAM J. Comput., 1992

A General Approach to Dominance in the Plane.
J. Algorithms, 1992

Point Location in Fat Subdivisions.
Inf. Process. Lett., 1992

Shortest path queries in rectilinear worlds.
Int. J. Comput. Geometry Appl., 1992

Finding Minimum Area k-gons.
Discrete & Computational Geometry, 1992

Efficient Hidden Surface Removal for Objects with Small Union Size.
Comput. Geom., 1992

Intersection Queries in Sets of Disks.
BIT, 1992

Computing and Verifying Depth Orders.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
New Upper Bounds in Klee's Measure Problem.
SIAM J. Comput., 1991

Merging Visibility Maps.
Comput. Geom., 1991

Hidden Surface Removal for C-oriented Polyhedra.
Comput. Geom., 1991

Dynamic Partition Trees.
BIT, 1991

Divided k-d Trees.
Algorithmica, 1991

Efficient Hidden Surface Removal for Objects with small Union Size.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

Efficient Ray Shooting and Hidden Surface Removal.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

Intersection Queries for Curved Objects (Extended Abstract).
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
Storing Line Segments in Partition Trees.
BIT, 1990

Searching for Empty Convex Polygons.
Algorithmica, 1990

Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds.
Acta Inf., 1990

Maintaining Range Trees in Secondary Memory. Part I: Partitions.
Acta Inf., 1990

Dynamic Partition Trees.
Proceedings of the SWAT 90, 1990

Intersection Queries in Sets of Disks.
Proceedings of the SWAT 90, 1990

Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric.
Proceedings of the SWAT 90, 1990

An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version).
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Merging Visibility Maps.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Maintaining Multiple Representations of Dynamic Data Structures
Inf. Comput., November, 1989

General Methods for Adding Range Restrictions to Decomposable Searching Problems.
J. Symb. Comput., 1989

Data Structures in a Real-Time Environment.
Inf. Process. Lett., 1989

Two Models for the Reconstruction Problem for Dynamic Data Structures.
Elektronische Informationsverarbeitung und Kybernetik, 1989

Sets without emtpy convex 6-gons.
Bulletin of the EATCS, 1989

TIME vs BITS.
Proceedings of the STACS 89, 1989

Concatenable Segment Trees (Extended Abstract).
Proceedings of the STACS 89, 1989

Multiple Representations of Dynamic Data Structures.
IFIP Congress, 1989

Output-Sensitive Hidden Surface Removal
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Computational Geometry and its Application to Computer Graphics.
Proceedings of the Advances in Computer Graphics V (Tutorials from Eurographics'89 Conf.), 1989

Efficient Motion Planning for an L-Shaped Object.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
On Rectangular Visibility.
J. Algorithms, 1988

Efficient Data Structures for Range Searching on a Grid.
J. Algorithms, 1988

Normalized Divide-and-Conquer: A Scaling Technique for Solving Multi-Dimensional Problems.
Inf. Process. Lett., 1988

Scanline Algorithms on a Grid.
BIT, 1988

A Balanced Search Tree with O (1) Worst-case Update Time.
Acta Inf., 1988

Dominance in the Presence of Obstracles.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

Connectability Problems.
Proceedings of the SWAT 88, 1988

Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques.
Proceedings of the SWAT 88, 1988

Maintaining Range Trees in Secondary Memory (Extended Abstract).
Proceedings of the STACS 88, 1988

New upper bounds in Klee's measure problem (extended abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

New Methods for Computing Visibility Graphs.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

Searching for Empty Convex Polygons.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
Zooming by Repeated Range Detection.
Inf. Process. Lett., 1987

New Algorithms for Computer Graphics.
Proceedings of the Advances in Computer Graphics Hardware II (Eurographics'87 Workshop), 1987

Variations on Visibility.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1985
Batched Dynamic Solutions to Decomposable Searching Problems.
J. Algorithms, 1985

A simple method for solving 2-dimensional static range searching.
Bulletin of the EATCS, 1985

The Inverted File Tree Machine: Efficient Multi-Key Retrieval for VLSI.
FODO, 1985

The complexity of cutting paper (extended abstract).
Proceedings of the First Annual Symposium on Computational Geometry, 1985

Range searching in a set of line segments.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
Some methods of computational geometry applied to computer graphics.
Computer Vision, Graphics, and Image Processing, 1984

1983
Corrigendum: Dynamization of Order Decomposable Set Problems.
J. Algorithms, 1983

The Design of Dynamic Data Structures
Lecture Notes in Computer Science 156, Springer, ISBN: 3-540-12330-X, 1983

1982
On the Equivalence of Some Rectangle Problems.
Inf. Process. Lett., 1982

Dynamic Multi-Dimensional Data Structures Based on Quad- and K - D Trees.
Acta Inf., 1982

Stratified Balanced Search Trees.
Acta Inf., 1982

1981
Maintenance of Configurations in the Plane.
J. Comput. Syst. Sci., 1981

Dynamization of Order Decomposable Set Problems.
J. Algorithms, 1981

Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems.
Inf. Process. Lett., 1981

Some Principles for Dynamizing Decomposable Searching Problems.
Inf. Process. Lett., 1981

General Methods for 'All Elements' and 'All Pairs' Problems.
Inf. Process. Lett., 1981

Optimal Dynamization of Decomposable Searching Problems.
Inf. Process. Lett., 1981

Two general methods for dynamizing decomposable searching problems.
Computing, 1981

Transforming Semi-Dynamic Data Structures into Dynamic Structures.
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds.
Proceedings of the Theoretical Computer Science, 1981

The Art of Dynamizing.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980
Further Comments on Bykat's Convex Hull Algorithm.
Inf. Process. Lett., 1980

Dynamically Maintaining Configurations in the Plane (Detailed Abstract)
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980


  Loading...