Stefan Langerman

According to our database1, Stefan Langerman authored at least 253 papers between 1994 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Pole Dancing: 3D Morphs for Tree Drawings.
J. Graph Algorithms Appl., 2019

Subquadratic Algorithms for Algebraic 3SUM.
Discrete & Computational Geometry, 2019

Competitive Online Search Trees on Trees.
CoRR, 2019

Belga B-trees.
CoRR, 2019

Encoding 3SUM.
CoRR, 2019

Bottleneck detour tree of points on a path.
Comput. Geom., 2019

Dynamic Graph Coloring.
Algorithmica, 2019

Belga B-Trees.
Proceedings of the Computer Science - Theory and Applications, 2019

2018
Threes!, Fives, 1024!, and 2048 are hard.
Theor. Comput. Sci., 2018

Weighted dynamic finger in binary search trees.
CoRR, 2018

Pole Dancing: 3D Morphs for Tree Drawings.
CoRR, 2018

Cookie Clicker.
CoRR, 2018

Dynamic Trees with Almost-Optimal Access Cost.
CoRR, 2018

On the Diameter of Tree Associahedra.
CoRR, 2018

An Optimal Algorithm to Compute the Inverse Beacon Attraction Region.
CoRR, 2018

Polyhedral Characterization of Reversible Hinged Dissections.
CoRR, 2018

Subquadratic Encodings for Point Configurations.
CoRR, 2018

The dual diameter of triangulations.
Comput. Geom., 2018

On the Diameter of Tree Associahedra.
Electr. J. Comb., 2018

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.
Algorithmica, 2018

Pole Dancing: 3D Morphs for Tree Drawings.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Dynamic Trees with Almost-Optimal Access Cost.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

An Optimal Algorithm to Compute the Inverse Beacon Attraction Region.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Subquadratic Encodings for Point Configurations.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
Induced Ramsey-type results and binary predicates for point sets.
Electronic Notes in Discrete Mathematics, 2017

Incremental Voronoi Diagrams.
Discrete & Computational Geometry, 2017

Dynamic Graph Coloring.
CoRR, 2017

Helly Numbers of Polyominoes.
CoRR, 2017

Searching edges in the overlap of two plane graphs.
CoRR, 2017

Self-approaching paths in simple polygons.
CoRR, 2017

Induced Ramsey-Type Results and Binary Predicates for Point Sets.
Electr. J. Comb., 2017

Searching Edges in the Overlap of Two Plane Graphs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Dynamic Graph Coloring.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Self-Approaching Paths in Simple Polygons.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Subquadratic Algorithms for Algebraic Generalizations of 3SUM.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Tilers, Tilemakers, Transformers!
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Optimizing some constructions with bars: new geometric knapsack problems.
J. Comb. Optim., 2016

Reconstructing Point Set Order Types from Radial Orderings.
Int. J. Comput. Geometry Appl., 2016

Subquadratic Algorithms for Algebraic Generalizations of 3SUM.
CoRR, 2016

Incremental Voronoi Diagrams.
CoRR, 2016

Reversible Nets of Polyhedra.
CoRR, 2016

A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters.
Algorithmica, 2016

The Power and Limitations of Static Binary Search Trees with Lazy Finger.
Algorithmica, 2016

Weighted dynamic finger in binary search trees.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Threes!, Fives, 1024!, and 2048 are Hard.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Incremental Voronoi diagrams.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Generalized River Crossing Problems.
Theory Comput. Syst., 2015

Cannibal Animal Games: a new variant of Tic-Tac-Toe.
JIP, 2015

Isoperimetric Enclosures.
Graphs and Combinatorics, 2015

A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino.
CoRR, 2015

Threes!, Fives, 1024!, and 2048 are Hard.
CoRR, 2015

The Dual Diameter of Triangulations.
CoRR, 2015

Bust-a-Move/Puzzle Bobble is NP-Complete.
CoRR, 2015

Bichromatic compatible matchings.
Comput. Geom., 2015

Worst-Case Optimal Tree Layout in External Memory.
Algorithmica, 2015

Space-Time Trade-offs for Stack-Based Algorithms.
Algorithmica, 2015

Optimal detection of intersections between convex polyhedra.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Bust-a-Move/Puzzle Bobble Is NP-complete.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Reversible Nets of Polyhedra.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014
Online graph exploration algorithms for cycles and trees by multiple searchers.
J. Comb. Optim., 2014

Computing a visibility polygon using few variables.
Comput. Geom., 2014

Draining a polygon - or - rolling a ball out of a polygon.
Comput. Geom., 2014

Triangulating and guarding realistic polygons.
Comput. Geom., 2014

Necklaces, Convolutions, and X+Y.
Algorithmica, 2014

The Complexity of Order Type Isomorphism.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Optimal Algorithms for Constrained 1-Center Problems.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

The Power and Limitations of Static Binary Search Trees with Lazy Finger.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Reconstructing Point Set Order Typesfrom Radial Orderings.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013
Helly Numbers of Polyominoes.
Graphs and Combinatorics, 2013

Coloring and Guarding Arrangements.
Discrete Mathematics & Theoretical Computer Science, 2013

A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing.
Discrete & Computational Geometry, 2013

The Clique Problem in Ray Intersection Graphs.
Discrete & Computational Geometry, 2013

Combining Binary Search Trees
CoRR, 2013

The Power and Limitations of Static Binary Search Trees with Lazy Finger
CoRR, 2013

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
CoRR, 2013

A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters.
CoRR, 2013

Cannibal Animal Games: a new variant of Tic-Tac-Toe.
CoRR, 2013

Detecting intersections between convex polyhedra.
CoRR, 2013

The Complexity of Order Type Isomorphism.
CoRR, 2013

Editorial.
Comput. Geom., 2013

Oja centers and centers of gravity.
Comput. Geom., 2013

Some properties of k-Delaunay and k-Gabriel graphs.
Comput. Geom., 2013

Stable Roommates Spanner.
Comput. Geom., 2013

Non-crossing matchings of points with geometric objects.
Comput. Geom., 2013

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Space-Time Trade-offs for Stack-Based Algorithms.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Combining Binary Search Trees.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Bichromatic compatible matchings.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

2012
Entropy, triangulation, and point location in planar subdivisions.
ACM Trans. Algorithms, 2012

Approximating the average stretch factor of geometric graphs.
JoCG, 2012

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω.
Int. J. Comput. Geometry Appl., 2012

Necklaces, Convolutions, and X+Y
CoRR, 2012

Space-Time Trade-offs for Stack-Based Algorithms
CoRR, 2012

Bichromatic compatible matchings
CoRR, 2012

Coloring and Guarding Arrangements
CoRR, 2012

Circle separability queries in logarithmic time
CoRR, 2012

Confluent persistence revisited.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

De-amortizing Binary Search Trees.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Algorithms and Complexity of Generalized River Crossing Problems.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

The Clique Problem in Ray Intersection Graphs.
Proceedings of the Algorithms - ESA 2012, 2012

Circle Separability Queries in Logarithmic Time.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Efficient constant-velocity reconfiguration of crystalline robots.
Robotica, 2011

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

Continuous Blooming of Convex Polyhedra.
Graphs and Combinatorics, 2011

Algorithmic Folding Complexity.
Graphs and Combinatorics, 2011

Colorful Strips.
Graphs and Combinatorics, 2011

Every Large Point Set contains Many Collinear Points or an Empty Pentagon.
Graphs and Combinatorics, 2011

The Clique Problem in Ray Intersection Graphs
CoRR, 2011

Computing a visibility polygon using few variables
CoRR, 2011

De-amortizing Binary Search Trees
CoRR, 2011

Confluent Persistence Revisited
CoRR, 2011

The Stackelberg Minimum Spanning Tree Game.
Algorithmica, 2011

Computing the Visibility Polygon Using Few Variables.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

A center transversal theorem for hyperplanes and applications to graph drawing.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Helly Numbers of Polyominoes.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Sigma-local graphs.
J. Discrete Algorithms, 2010

Grid Vertex-Unfolding Orthostacks.
Int. J. Comput. Geometry Appl., 2010

Facility location problems in the plane based on reverse nearest neighbor queries.
European Journal of Operational Research, 2010

Locked and Unlocked Chains of Planar Shapes.
Discrete & Computational Geometry, 2010

Decomposition of Multiple Coverings into More Parts.
Discrete & Computational Geometry, 2010

A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing
CoRR, 2010

Highway hull revisited.
Comput. Geom., 2010

Near-Entropy Hotlink Assignments.
Algorithmica, 2010

Confluently Persistent Tries for Efficient Version Control.
Algorithmica, 2010

Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Colorful Strips.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010


Approximating the Average Stretch Factor of Geometric Graphs.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Common Unfoldings of Polyominoes and Polycubes.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

Determination of All Tessellation Polyhedra with Regular Polygonal Faces.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

Oja medians and centers of gravity.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Some properties of higher order delaunay and gabriel graphs.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Improved approximation bounds for edge dominating set in dense graphs.
Theor. Comput. Sci., 2009

Pricing Geometric Transportation Networks.
Int. J. Comput. Geometry Appl., 2009

A Polynomial Bound for Untangling Geometric Planar Graphs.
Discrete & Computational Geometry, 2009

Coloring Geometric Range Spaces.
Discrete & Computational Geometry, 2009

Detecting all regular polygons in a point set
CoRR, 2009

Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves
CoRR, 2009

Continuous Blooming of Convex Polyhedra
CoRR, 2009

Colorful Strips
CoRR, 2009

Entropy, Triangulation, and Point Location in Planar Subdivisions
CoRR, 2009

Every Large Point Set contains Many Collinear Points or an Empty Pentagon.
CoRR, 2009

Wrapping spheres with flat paper.
Comput. Geom., 2009

Empty region graphs.
Comput. Geom., 2009

Small weak epsilon-nets.
Comput. Geom., 2009

Linear reconfiguration of cube-style modular robots.
Comput. Geom., 2009

Dynamic ham-sandwich cuts in the plane.
Comput. Geom., 2009

Decomposition of multiple coverings into more parts.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Executing code in the past: efficient in-memory object graph versioning.
Proceedings of the 24th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2009

Algorithmic Folding Complexity.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Every Large Point Set contains Many Collinear Points or an Empty Pentagon.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Output-sensitive algorithms for Tukey depth and related problems.
Statistics and Computing, 2008

A Characterization of the degree sequences of 2-trees.
Journal of Graph Theory, 2008

A Polynomial Bound for Untangling Geometric Planar Graphs.
Electronic Notes in Discrete Mathematics, 2008

Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D.
Discrete & Computational Geometry, 2008

Decomposition of Multiple Coverings into More Parts
CoRR, 2008

Highway Hull Revisited
CoRR, 2008

Cauchy's Arm Lemma on a Growing Sphere
CoRR, 2008

Local properties of geometric graphs.
Comput. Geom., 2008

Optimal location of transportation devices.
Comput. Geom., 2008

Edge-unfolding nested polyhedral bands.
Comput. Geom., 2008

Dynamic Hotlinks.
Algorithmica, 2008

Realistic Reconfiguration of Crystalline (and Telecube) Robots.
Proceedings of the Algorithmic Foundation of Robotics VIII, 2008

Confluently Persistent Tries for Efficient Version Control.
Proceedings of the Algorithm Theory, 2008

Distribution-sensitive point location in convex subdivisions.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Dynamic optimality for skip lists and B-trees.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Coloring Geometric Range Spaces.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Smallest enclosing circle centered on a query line segment.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Draining a Polygon - or - Rolling a Ball out of a Polygon.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Triangulating and Guarding Realistic Polygons.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Implementing Partial Persistence in Object-Oriented Languages.
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007
Retroactive data structures.
ACM Trans. Algorithms, 2007

Efficient Many-To-Many Point Matching in One Dimension.
Graphs and Combinatorics, 2007

Geodesic Ham-Sandwich Cuts.
Discrete & Computational Geometry, 2007

The Stackelberg Minimum Spanning Tree Game
CoRR, 2007

A polynomial bound for untangling geometric planar graphs
CoRR, 2007

Moving Walkways, Escalators, and Elevators
CoRR, 2007

The Stackelberg Minimum Spanning Tree Game.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Linear Reconfiguration of Cube-Style Modular Robots.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Vertex Pops and Popturns.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

A Characterization of the Degree Sequences of 2-trees.
Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2006
Morpion Solitaire.
Theory Comput. Syst., 2006

Juggling with Pattern Matching.
Theory Comput. Syst., 2006

A Characterization of the Degree Sequences of 2-Trees
CoRR, 2006

Locked and Unlocked Chains of Planar Shapes
CoRR, 2006

Algorithms for Computing Geometric Measures of Melodic Similarity.
Computer Music Journal, 2006

Geometric Restrictions on Producible Polygonal Protein Chains.
Algorithmica, 2006

Improved Approximation Bounds for Edge Dominating Set in Dense Graphs.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Near-Entropy Hotlink Assignments.
Proceedings of the Algorithms, 2006

Necklaces, Convolutions, and X + Y.
Proceedings of the Algorithms, 2006

Locked and unlocked chains of planar shapes.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

LUMINESStrategies.
Proceedings of the Computers and Games, 5th International Conference, 2006

Curves in the Sand: Algorithmic Drawing.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Designing small keyboards is hard.
Theor. Comput. Sci., 2005

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

Covering Things with Things.
Discrete & Computational Geometry, 2005

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
Discrete & Computational Geometry, 2005

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
CoRR, 2005

Queaps.
Algorithmica, 2005

Dynamic Hotlinks.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Region counting graphs.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Optimizing a 2D Function Satisfying Unimodality Properties.
Proceedings of the Algorithms, 2005

A Tight Analysis of the Maximal Matching Heuristic.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Pricing of Geometric Transportation Networks.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Region Counting Distances and Region Counting Circles.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Reverse facility location problems.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Small weak epsilon nets.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Worst-Case Optimal Tree Layout in a Memory Hierarchy
CoRR, 2004

A 2-chain can interlock with a k-chain
CoRR, 2004

Proximate point searching.
Comput. Geom., 2004

Retroactive data structures.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Designing Small Keyboards Is Hard.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Grid Vertex-Unfolding Orthostacks.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Weighted Ham-Sandwich Cuts.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

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

Geodesic ham-sandwich cuts.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Local properties of geometric graphs.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

Unfolding polyhedral bands.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Asymmetric Communication Protocols via Hotlink Assignments.
Theory Comput. Syst., 2003

The Complexity of Hyperplane Depth in the Plane.
Discrete & Computational Geometry, 2003

On the Complexity of Halfspace Area Queries.
Discrete & Computational Geometry, 2003

Interlocked open and closed linkages with few joints.
Comput. Geom., 2003

Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
Comput. Geom., 2003

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Optimization in Arrangements.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Geometric Restrictions on Producible Polygonal Protein Chains.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Proximate planar point location.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

On the Complexity of Halfspace Volume Queries.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

Computing the Similarity of two Melodies.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Asymmetric Communication Protocols via Hotlink Assignments.
Proceedings of the SIROCCO 9, 2002

The Convex Hull for Random Lines in the Plane.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Queaps.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

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

Covering Things with Things.
Proceedings of the Algorithms, 2002

Interlocked open linkages with few joints.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

Proximate point searching.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

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

2001
Algorithms for Efficient Filtering in Content-Based Multicast.
Proceedings of the Algorithms, 2001

On the complexity of halfspace area queries.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Short interlocked linkages.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

Algorithms for bivariate medians and a fermat-torricelli problem for lines.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
An optimal algorithm for hyperplane depth in the plane.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Volume Queries in Polyhedra.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

On the Shooter Location Problem.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

Dynamic point location in fat hyperrectangles with integer coordinates.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1996
Results of the First International Contest on Evolutionary Optimisation (1st ICEO).
Proceedings of 1996 IEEE International Conference on Evolutionary Computation, 1996

1994
S.T.E.P.: The Easiest Way to Optimize a Function.
Proceedings of the First IEEE Conference on Evolutionary Computation, 1994


  Loading...