Stefan Langerman

Marcelo Mydlarz

Emo Welzl

Discret. Comput. Geom., September, 2024

The Complexity of Order Type Isomorphism.

[BibT_eX]

[DOI]

Discret. Comput. Geom., September, 2024

Tiling with Three Polygons is Undecidable.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Competitive Online Search Trees on Trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, July, 2023

2022

Fragile complexity of adaptive algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Rolling Polyhedra on Tessellations.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021

Belga B-Trees.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

Enumerating All Convex Polyhedra Glued from Squares in Polynomial Time.

[BibT_eX]

[DOI]

Nicolas Potvin

Boris Zolotov

CoRR, 2021

2020

A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons.

[BibT_eX]

[DOI]

Elena Arseneva

Boris Zolotov

J. Inf. Process., 2020

Sublinear Explicit Incremental Planar Voronoi Diagrams.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

Cookie Clicker.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Which Convex Polyhedra Can Be Made by Gluing Regular Hexagons?

[BibT_eX]

[DOI]

Elena Arseneva

Graphs Comb., 2020

Polyhedral Characterization of Reversible Hinged Dissections.

[BibT_eX]

[DOI]

Jin Akiyama

Graphs Comb., 2020

Self-approaching paths in simple polygons.

[BibT_eX]

[DOI]

Irina Kostitsyna

Lilach Chaitman-Yerushalmi

Comput. Geom., 2020

2019

Subquadratic encodings for point configurations.

[BibT_eX]

[DOI]

J. Comput. Geom., 2019

Pole Dancing: 3D Morphs for Tree Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Subquadratic Algorithms for Algebraic 3SUM.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

Encoding 3SUM.

[BibT_eX]

[DOI]

CoRR, 2019

Bottleneck detour tree of points on a path.

[BibT_eX]

[DOI]

Greg Aloupis

Paz Carmi

Matthew J. Katz

Comput. Geom., 2019

Dynamic Graph Coloring.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Threes!, Fives, 1024!, and 2048 are hard.

[BibT_eX]

[DOI]

Yushi Uno

Theor. Comput. Sci., 2018

The dual diameter of triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2018

On the Diameter of Tree Associahedra.

[BibT_eX]

[DOI]

Pablo Pérez-Lantero

Electron. J. Comb., 2018

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.

[BibT_eX]

[DOI]

Algorithmica, 2018

Toward Unfolding Doubly Covered n-Stars.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Dynamic Trees with Almost-Optimal Access Cost.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

An Optimal Algorithm to Compute the Inverse Beacon Attraction Region.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Induced Ramsey-type results and binary predicates for point sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Incremental Voronoi Diagrams.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Searching Edges in the Overlap of Two Plane Graphs.

[BibT_eX]

[DOI]

Elena Khramtcova

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Subquadratic Algorithms for Algebraic Generalizations of 3SUM.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Tilers, Tilemakers, Transformers!

[BibT_eX]

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Optimizing some constructions with bars: new geometric knapsack problems.

[BibT_eX]

[DOI]

Sergey Bereg

José Miguel Díaz-Báñez

David Flores-Peñaloza

Pablo Pérez-Lantero

Jorge Urrutia

J. Comb. Optim., 2016

Reconstructing Point Set Order Types from Radial Orderings.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2016

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

[BibT_eX]

[DOI]

Panagiotis Cheilaris

Elena Khramtcova

Evanthia Papadopoulou

Algorithmica, 2016

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

[BibT_eX]

[DOI]

Algorithmica, 2016

Weighted dynamic finger in binary search trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

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

[BibT_eX]

[DOI]

Andrew Winslow

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Generalized River Crossing Problems.

[BibT_eX]

[DOI]

Hiro Ito

Yuichi Yoshida

Theory Comput. Syst., 2015

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

[BibT_eX]

[DOI]

J. Inf. Process., 2015

Isoperimetric Enclosures.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Bichromatic compatible matchings.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Worst-Case Optimal Tree Layout in External Memory.

[BibT_eX]

[DOI]

Algorithmica, 2015

Space-Time Trade-offs for Stack-Based Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2015

Optimal detection of intersections between convex polyhedra.

[BibT_eX]

[DOI]

Luis Barba

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Bust-a-Move/Puzzle Bobble Is NP-complete.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Reversible Nets of Polyhedra.

[BibT_eX]

[DOI]

Jin Akiyama

Kiyoko Matsunaga

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.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Computing a visibility polygon using few variables.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Draining a polygon - or - rolling a ball out of a polygon.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Triangulating and guarding realistic polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Necklaces, Convolutions, and X+Y.

[BibT_eX]

[DOI]

Algorithmica, 2014

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

[BibT_eX]

[DOI]

Panagiotis Cheilaris

Elena Khramtcova

Evanthia Papadopoulou

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Optimal Algorithms for Constrained 1-Center Problems.

[BibT_eX]

[DOI]

Luis Barba

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Reconstructing Point Set Order Typesfrom Radial Orderings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013

Helly Numbers of Polyominoes.

[BibT_eX]

[DOI]

Graphs Comb., 2013

Coloring and Guarding Arrangements.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing.

[BibT_eX]

[DOI]

Vida Dujmovic

Discret. Comput. Geom., 2013

The Clique Problem in Ray Intersection Graphs.

[BibT_eX]

[DOI]

Sergio Cabello

Discret. Comput. Geom., 2013

Detecting intersections between convex polyhedra.

[BibT_eX]

[DOI]

Luis Barba

CoRR, 2013

The Complexity of Order Type Isomorphism.

[BibT_eX]

[DOI]

CoRR, 2013

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Oja centers and centers of gravity.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Some properties of k-Delaunay and k-Gabriel graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Stable Roommates Spanner.

[BibT_eX]

[DOI]

Lilach Chaitman-Yerushalmi

Paz Carmi

Matthew J. Katz

Comput. Geom., 2013

Non-crossing matchings of points with geometric objects.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Combining Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Entropy, triangulation, and point location in planar subdivisions.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Approximating the average stretch factor of geometric graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2012

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω.

[BibT_eX]

[DOI]

Maria Saumell

David R. Wood

Int. J. Comput. Geom. Appl., 2012

Confluent persistence revisited.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

De-amortizing Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Algorithms and Complexity of Generalized River Crossing Problems.

[BibT_eX]

[DOI]

Hiro Ito

Yuichi Yoshida

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Circle Separability Queries in Logarithmic Time.

[BibT_eX]

[DOI]

Luis Felipe Barba Flores

Greg Aloupis

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

Efficient constant-velocity reconfiguration of crystalline robots.

[BibT_eX]

[DOI]

Robotica, 2011

Computing Signed Permutations of Polygons.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

Continuous Blooming of Convex Polyhedra.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Algorithmic Folding Complexity.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Colorful Strips.

[BibT_eX]

[DOI]

Graphs Comb., 2011

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

[BibT_eX]

[DOI]

Graphs Comb., 2011

The Stackelberg Minimum Spanning Tree Game.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

Sigma-local graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

Grid Vertex-Unfolding Orthostacks.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

Facility location problems in the plane based on reverse nearest neighbor queries.

[BibT_eX]

[DOI]

Sergio Cabello

José Miguel Díaz-Báñez

Carlos Seara

Inmaculada Ventura

Eur. J. Oper. Res., 2010

Locked and Unlocked Chains of Planar Shapes.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Ares Ribó

Günter Rote

Discret. Comput. Geom., 2010

Decomposition of Multiple Coverings into More Parts.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Highway hull revisited.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Near-Entropy Hotlink Assignments.

[BibT_eX]

[DOI]

Karim Douïeb

Algorithmica, 2010

Confluently Persistent Tries for Efficient Version Control.

[BibT_eX]

[DOI]

Eric Price

Algorithmica, 2010

Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Matching Points with Things.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Common Unfoldings of Polyominoes and Polycubes.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry, Graphs and Applications, 2010

Determination of All Tessellation Polyhedra with Regular Polygonal Faces.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry, Graphs and Applications, 2010

Oja medians and centers of gravity.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Some properties of higher order delaunay and gabriel graphs.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Improved approximation bounds for edge dominating set in dense graphs.

[BibT_eX]

[DOI]

Eythan Levy

Theor. Comput. Sci., 2009

Pricing Geometric Transportation Networks.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2009

Coloring Geometric Range Spaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Detecting all regular polygons in a point set

[BibT_eX]

[DOI]

CoRR, 2009

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

[BibT_eX]

[DOI]

CoRR, 2009

Wrapping spheres with flat paper.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Empty region graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Small weak epsilon-nets.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Linear reconfiguration of cube-style modular robots.

[BibT_eX]

[DOI]

Stefanie Wuhrer

Comput. Geom., 2009

Dynamic ham-sandwich cuts in the plane.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Executing code in the past: efficient in-memory object graph versioning.

[BibT_eX]

[DOI]

Frédéric Pluquet

Roel Wuyts

Proceedings of the 24th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2009

Algorithmic Folding Complexity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Output-sensitive algorithms for Tukey depth and related problems.

[BibT_eX]

[DOI]

Stat. Comput., 2008

A Characterization of the degree sequences of 2-trees.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

A Polynomial Bound for Untangling Geometric Planar Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

Cauchy's Arm Lemma on a Growing Sphere

[BibT_eX]

[DOI]

CoRR, 2008

Local properties of geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Optimal location of transportation devices.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Edge-unfolding nested polyhedral bands.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Dynamic Hotlinks.

[BibT_eX]

[DOI]

Karim Douïeb

Algorithmica, 2008

Realistic Reconfiguration of Crystalline (and Telecube) Robots.

[BibT_eX]

[DOI]

Stefanie Wuhrer

Proceedings of the Algorithmic Foundation of Robotics VIII, 2008

Distribution-sensitive point location in convex subdivisions.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Dynamic optimality for skip lists and B-trees.

[BibT_eX]

[DOI]

Karim Douïeb

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves.

[BibT_eX]

[DOI]

Stefanie Wuhrer

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Smallest enclosing circle centered on a query line segment.

[BibT_eX]

Sasanka Roy

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Implementing Partial Persistence in Object-Oriented Languages.

[BibT_eX]

[DOI]

Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

2007

Retroactive data structures.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Efficient Many-To-Many Point Matching in One Dimension.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Geodesic Ham-Sandwich Cuts.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

Moving Walkways, Escalators, and Elevators

[BibT_eX]

[DOI]

CoRR, 2007

Vertex Pops and Popturns.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Morpion Solitaire.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

Juggling with Pattern Matching.

[BibT_eX]

[DOI]

Steve Kremer

Theory Comput. Syst., 2006

Algorithms for Computing Geometric Measures of Melodic Similarity.

[BibT_eX]

[DOI]

Yurai Núñez Rodríguez

David Rappaport

Comput. Music. J., 2006

Geometric Restrictions on Producible Polygonal Protein Chains.

[BibT_eX]

[DOI]

Joseph O'Rourke

Algorithmica, 2006

Necklaces, Convolutions, and <i>X</i> + <i>Y</i>.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

LUMINESStrategies.

[BibT_eX]

[DOI]

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

Curves in the Sand: Algorithmic Drawing.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005

Designing small keyboards is hard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Separating Point Sets in Polygonal Environments.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2005

Covering Things with Things.

[BibT_eX]

[DOI]

Pat Morin

Discret. Comput. Geom., 2005

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

Queaps.

[BibT_eX]

[DOI]

Algorithmica, 2005

Region counting graphs.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Optimizing a 2D Function Satisfying Unimodality Properties.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

A Tight Analysis of the Maximal Matching Heuristic.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Region Counting Distances and Region Counting Circles.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Reverse facility location problems.

[BibT_eX]

[DOI]

Sergio Cabello

José Miguel Díaz-Báñez

Carlos Seara

Inmaculada Ventura

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Worst-Case Optimal Tree Layout in a Memory Hierarchy

[BibT_eX]

[DOI]

CoRR, 2004

A 2-chain can interlock with a k-chain

[BibT_eX]

[DOI]

CoRR, 2004

Proximate point searching.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Weighted Ham-Sandwich Cuts.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Unfolding polyhedral bands.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Asymmetric Communication Protocols via Hotlink Assignments.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2003

The Complexity of Hyperplane Depth in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

On the Complexity of Halfspace Area Queries.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

Interlocked open and closed linkages with few joints.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.

[BibT_eX]

[DOI]

Greg Aloupis

Michael A. Soss

Comput. Geom., 2003

Optimization in Arrangements.

[BibT_eX]

[DOI]

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

Proximate planar point location.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

On the Complexity of Halfspace Volume Queries.

[BibT_eX]

[DOI]

Jeff Erickson

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

Computing the Similarity of two Melodies.

[BibT_eX]

[DOI]

Yurai Núñez Rodríguez

David Rappaport

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles.

[BibT_eX]

[DOI]

Pat Morin

Michael A. Soss

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

The Convex Hull for Random Lines in the Plane.

[BibT_eX]

[DOI]

Mordecai J. Golin

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Flat-State Connectivity of Linkages under Dihedral Motions.

[BibT_eX]

[DOI]

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

Interlocked open linkages with few joints.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001

Algorithms for Efficient Filtering in Content-Based Multicast.

[BibT_eX]

[DOI]

Sachin Lodha

Rahul Shah

Proceedings of the Algorithms, 2001

Short interlocked linkages.

[BibT_eX]

[DOI]

Joseph O'Rourke

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

An optimal algorithm for hyperplane depth in the plane.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Volume Queries in Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

On the Shooter Location Problem.

[BibT_eX]

[DOI]

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

Dynamic point location in fat hyperrectangles with integer coordinates.

[BibT_eX]

[DOI]

Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1996

Results of the First International Contest on Evolutionary Optimisation (1st ICEO).

[BibT_eX]

[DOI]

Luca Maria Gambardella

Proceedings of 1996 IEEE International Conference on Evolutionary Computation, 1996

1994

S.T.E.P.: The Easiest Way to Optimize a Function.

[BibT_eX]

[DOI]