Sergio Cabello

David Gajser

Algorithmica, May, 2024

Searching in Euclidean Spaces with Predictions.

[BibT_eX]

[DOI]

CoRR, 2024

Connected Matchings.

[BibT_eX]

[DOI]

CoRR, 2024

Eliminating Crossings in Ordered Graphs.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Geometric Matching and Bottleneck Problems.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Maximum Matchings in Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Édouard Bonnet

Wolfgang Mulzer

Discret. Comput. Geom., October, 2023

Faster distance-based representative skyline and k-center along pareto front in the plane.

[BibT_eX]

[DOI]

J. Glob. Optim., June, 2023

A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square.

[BibT_eX]

[DOI]

CoRR, 2023

Geometric Assignment and Geometric Bottleneck.

[BibT_eX]

[DOI]

CoRR, 2023

On k-Means for Segments and Polylines.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

The inverse Kakeya problem.

[BibT_eX]

[DOI]

Otfried Cheong

Michael Gene Dobbins

Period. Math. Hung., 2022

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Danny Z. Chen

Discret. Comput. Geom., 2022

Computing Shapley Values in the Plane.

[BibT_eX]

[DOI]

Timothy M. Chan

Discret. Comput. Geom., 2022

Long Plane Trees.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Minimum cuts in geometric intersection graphs.

[BibT_eX]

[DOI]

Wolfgang Mulzer

Comput. Geom., 2021

The complexity of mixed-connectivity.

[BibT_eX]

[DOI]

Édouard Bonnet

Ann. Oper. Res., 2021

Maximizing Dominance in the Plane and its Applications.

[BibT_eX]

[DOI]

Jongmin Choi

Hee-Kap Ahn

Algorithmica, 2021

The Inverse Voronoi Problem in Graphs II: Trees.

[BibT_eX]

[DOI]

Algorithmica, 2021

On the Minimum Consistent Subset Problem.

[BibT_eX]

[DOI]

Algorithmica, 2021

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2020

Hardness of Minimum Barrier Shrinkage and Minimum Installation Path.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Minimum shared-power edge cut.

[BibT_eX]

[DOI]

Networks, 2020

The Inverse Voronoi Problem in Graphs I: Hardness.

[BibT_eX]

[DOI]

Algorithmica, 2020

Some Open Problems in Computational Geometry (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Covering many points with a small-area box.

[BibT_eX]

[DOI]

J. Comput. Geom., 2019

Hardness of Minimum Barrier Shrinkage and Minimum Activation Path.

[BibT_eX]

[DOI]

CoRR, 2019

Encoding 3SUM.

[BibT_eX]

[DOI]

CoRR, 2019

Maximizing Dominance in the Plane and Its Applications.

[BibT_eX]

[DOI]

Jong Min Choi

Hee-Kap Ahn

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018

Parameterized Complexity of 1-Planarity.

[BibT_eX]

[DOI]

Michael J. Bannister

David Eppstein

J. Graph Algorithms Appl., 2018

The inverse Voronoi problem in graphs.

[BibT_eX]

[DOI]

CoRR, 2018

Computing Shapley values in the plane.

[BibT_eX]

[DOI]

CoRR, 2018

Two optimization problems for unit disks.

[BibT_eX]

[DOI]

Lazar Milinkovic

Comput. Geom., 2018

Editorial: EuroCG2015.

[BibT_eX]

[DOI]

Andrej Brodnik

Comput. Geom., 2018

The Reverse Kakeya Problem.

[BibT_eX]

[DOI]

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

2017

Interval selection in the streaming model.

[BibT_eX]

[DOI]

Pablo Pérez-Lantero

Theor. Comput. Sci., 2017

Peeling Potatoes Near-Optimally in Near-Linear Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Minimum Cell Connection in Line Segment Arrangements.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

Maximum Volume Subset Selection for Anchored Boxes.

[BibT_eX]

[DOI]

Karl Bringmann

Michael T. M. Emmerich

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

2016

Finding shortest non-trivial cycles in directed graphs on surfaces.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Refining the Hierarchies of Classes of Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Miha Jejcic

Electron. Notes Discret. Math., 2016

Finding largest rectangles in convex polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2016

The Complexity of Separating Points in the Plane.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

Drawing a disconnected graph on the torus (Extended abstract).

[BibT_eX]

[DOI]

Robert Sámal

Electron. Notes Discret. Math., 2015

A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon.

[BibT_eX]

[DOI]

Maria Saumell

Discret. Math. Theor. Comput. Sci., 2015

Simple PTAS's for families of graphs excluding a minor.

[BibT_eX]

[DOI]

David Gajser

Discret. Appl. Math., 2015

Shortest paths in intersection graphs of unit disks.

[BibT_eX]

[DOI]

Miha Jejcic

Comput. Geom., 2015

Semi-dynamic Connectivity in the Plane.

[BibT_eX]

[DOI]

Michael Kerber

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Finding All Maximal Subsequences with Hereditary Properties.

[BibT_eX]

[DOI]

Drago Bokal

David Eppstein

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Computing the Stretch of an Embedded Graph.

[BibT_eX]

[DOI]

Markus Chimani

Petr Hlinený

SIAM J. Discret. Math., 2014

Finding Largest Rectangles in Convex Polygons.

[BibT_eX]

[DOI]

Otfried Cheong

Lena Schlipf

CoRR, 2014

2013

Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Multiple-Source Shortest Paths in Embedded Graphs.

[BibT_eX]

[DOI]

Erin W. Chambers

Jeff Erickson

SIAM J. Comput., 2013

The Clique Problem in Ray Intersection Graphs.

[BibT_eX]

[DOI]

Jean Cardinal

Stefan Langerman

Discret. Comput. Geom., 2013

Hardness of Approximation for Crossing Number.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Covering a bichromatic point set with two disjoint monochromatic disks.

[BibT_eX]

[DOI]

Pablo Pérez-Lantero

Comput. Geom., 2013

2012

A point calculus for interlevel set homology.

[BibT_eX]

[DOI]

Paul Bendich

Herbert Edelsbrunner

Pattern Recognit. Lett., 2012

Stackelberg Shortest Path Tree Game, Revisited

[BibT_eX]

[DOI]

CoRR, 2012

Algorithms for the edge-width of an embedded graph.

[BibT_eX]

[DOI]

Comput. Geom., 2012

The class cover problem with boxes.

[BibT_eX]

[DOI]

Sergey Bereg

Pablo Pérez-Lantero

Carlos Seara

Inmaculada Ventura

Comput. Geom., 2012

Many Distances in Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2012

Annotating Simplices with a Homology Basis and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2012, 2012

2011

Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Finding Cycles with Topological Properties in Embedded Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Geometric Simultaneous Embeddings of a Graph and a Matching.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

On the b-chromatic number of regular graphs.

[BibT_eX]

[DOI]

Marko Jakovac

Discret. Appl. Math., 2011

Minimum cell connection and separation in line segment arrangements

[BibT_eX]

[DOI]

CoRR, 2011

The Complexity of Obtaining a Distance-Balanced Graph.

[BibT_eX]

[DOI]

Primoz Luksic

Electron. J. Comb., 2011

The Fibonacci Dimension of a Graph.

[BibT_eX]

[DOI]

David Eppstein

Sandi Klavzar

Electron. J. Comb., 2011

Crossing Number and Weighted Crossing Number of Near-Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

Finding one tight cycle.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Finding shortest contractible and shortest separating cycles in embedded graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Obnoxious Centers in Graphs.

[BibT_eX]

[DOI]

Günter Rote

SIAM J. Discret. Math., 2010

Finding the Most Relevant Fragments in Networks.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2010

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

[BibT_eX]

[DOI]

Stefan Langerman

Carlos Seara

Inmaculada Ventura

Eur. J. Oper. Res., 2010

Edge-Removal and Non-Crossing Configurations in Geometric Graphs.

[BibT_eX]

[DOI]

Oswin Aichholzer

Ruy Fabila Monroy

David Flores-Peñaloza

Discret. Math. Theor. Comput. Sci., 2010

Algorithmic Aspects of Proportional Symbol Maps.

[BibT_eX]

[DOI]

Algorithmica, 2010

Output-sensitive algorithm for the edge-width of an embedded graph.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Adding one edge to planar graphs makes crossing number hard.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Covering Many or Few Points with Unit Disks.

[BibT_eX]

[DOI]

Mark de Berg

Sariel Har-Peled

Theory Comput. Syst., 2009

Higher-order Voronoi diagrams on triangulated surfaces.

[BibT_eX]

[DOI]

Marta Fort

Joan Antoni Sellarès

Inf. Process. Lett., 2009

Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion.

[BibT_eX]

[DOI]

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

Algorithms for graphs of bounded treewidth via orthogonal range searching.

[BibT_eX]

[DOI]

Christian Knauer

Comput. Geom., 2009

Detecting Hotspots in Geographic Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in GIScience, 2009

2008

On the parameterized complexity of d-dimensional point set pattern matching.

[BibT_eX]

[DOI]

Christian Knauer

Inf. Process. Lett., 2008

Matching point sets with respect to the Earth Mover's Distance.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Covering point sets with two disjoint disks or squares.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension.

[BibT_eX]

[DOI]

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

Crossing and Weighted Crossing Number of Near-Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007

Planar Embeddings of Graphs with Specified Edge Lengths.

[BibT_eX]

[DOI]

Erik D. Demaine

Günter Rote

J. Graph Algorithms Appl., 2007

Approximation algorithms for spreading points.

[BibT_eX]

[DOI]

J. Algorithms, 2007

Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

Multiple source shortest paths in a genus g graph.

[BibT_eX]

[DOI]

Erin W. Chambers

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Planar embeddability of the vertices of a graph using a fixed point set is NP-hard.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2006

Area-preserving approximations of polygonal paths.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Expected Case for Projecting Points.

[BibT_eX]

[DOI]

Matt DeVos

Informatica (Slovenia), 2006

On the Parameterized Complexity of <i>d</i>-Dimensional Point Set Pattern Matching.

[BibT_eX]

[DOI]

Christian Knauer

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Computing a Center-Transversal Line.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005

Schematization of networks.

[BibT_eX]

[DOI]

Mark de Berg

Marc J. van Kreveld

Comput. Geom., 2005

Homotopic spanners.

[BibT_eX]

[DOI]

Arjana Zitnik

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

Reverse facility location problems.

[BibT_eX]

[DOI]

Stefan Langerman

Carlos Seara

Inmaculada Ventura

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

2004

Testing Homotopy for Paths in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2004

2003

Approximation Algorithms for Aligning Points.

[BibT_eX]

[DOI]

Marc J. van Kreveld

Algorithmica, 2003

2002

Secret Sharing Schemes with Detection of Cheaters for a General Access Structure.

[BibT_eX]