Sergio Cabello

According to our database1, Sergio Cabello authored at least 98 papers between 1999 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs.
ACM Trans. Algorithms, 2019

Computing Shapley Values in the Plane.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Parameterized Complexity of 1-Planarity.
J. Graph Algorithms Appl., 2018

Two optimization problems for unit disks.
Comput. Geom., 2018

Editorial: EuroCG2015.
Comput. Geom., 2018

The Reverse Kakeya Problem.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
Interval selection in the streaming model.
Theor. Comput. Sci., 2017

Peeling Potatoes Near-Optimally in Near-Linear Time.
SIAM J. Comput., 2017

Minimum Cell Connection in Line Segment Arrangements.
Int. J. Comput. Geometry Appl., 2017

Refining the Hierarchies of Classes of Geometric Intersection Graphs.
Electr. J. Comb., 2017

The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Maximum Volume Subset Selection for Anchored Boxes.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

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

Refining the Hierarchies of Classes of Geometric Intersection Graphs.
Electronic Notes in Discrete Mathematics, 2016

Finding largest rectangles in convex polygons.
Comput. Geom., 2016

The Complexity of Separating Points in the Plane.
Algorithmica, 2016

2015
Drawing a disconnected graph on the torus (Extended abstract).
Electronic Notes in Discrete Mathematics, 2015

A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon.
Discrete Mathematics & Theoretical Computer Science, 2015

Simple PTAS's for families of graphs excluding a minor.
Discrete Applied Mathematics, 2015

Shortest paths in intersection graphs of unit disks.
Comput. Geom., 2015

Interval Selection in the Streaming Model.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Semi-dynamic Connectivity in the Plane.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Finding All Maximal Subsequences with Hereditary Properties.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Computing the Stretch of an Embedded Graph.
SIAM J. Discrete Math., 2014

Peeling Potatoes Near-Optimally in Near-Linear Time.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard.
SIAM J. Comput., 2013

Multiple-Source Shortest Paths in Embedded Graphs.
SIAM J. Comput., 2013

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

Hardness of Approximation for Crossing Number.
Discrete & Computational Geometry, 2013

Covering a bichromatic point set with two disjoint monochromatic disks.
Comput. Geom., 2013

Parameterized Complexity of 1-Planarity.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

The complexity of separating points in the plane.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

2012
A point calculus for interlevel set homology.
Pattern Recognition Letters, 2012

Algorithms for the edge-width of an embedded graph.
Comput. Geom., 2012

The class cover problem with boxes.
Comput. Geom., 2012

Many Distances in Planar Graphs.
Algorithmica, 2012

Annotating Simplices with a Homology Basis and Its Applications.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

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

2011
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension.
ACM Trans. Algorithms, 2011

Finding Cycles with Topological Properties in Embedded Graphs.
SIAM J. Discrete Math., 2011

Geometric Simultaneous Embeddings of a Graph and a Matching.
J. Graph Algorithms Appl., 2011

On the b-chromatic number of regular graphs.
Discrete Applied Mathematics, 2011

The Complexity of Obtaining a Distance-Balanced Graph.
Electr. J. Comb., 2011

The Fibonacci Dimension of a Graph.
Electr. J. Comb., 2011

Crossing Number and Weighted Crossing Number of Near-Planar Graphs.
Algorithmica, 2011

2010
Finding one tight cycle.
ACM Trans. Algorithms, 2010

Finding shortest contractible and shortest separating cycles in embedded graphs.
ACM Trans. Algorithms, 2010

Obnoxious Centers in Graphs.
SIAM J. Discrete Math., 2010

Finding the Most Relevant Fragments in Networks.
J. Graph Algorithms Appl., 2010

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

Edge-Removal and Non-Crossing Configurations in Geometric Graphs.
Discrete Mathematics & Theoretical Computer Science, 2010

Algorithmic Aspects of Proportional Symbol Maps.
Algorithmica, 2010

Finding shortest non-trivial cycles in directed graphs on surfaces.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Output-sensitive algorithm for the edge-width of an embedded graph.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Adding one edge to planar graphs makes crossing number hard.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Covering Many or Few Points with Unit Disks.
Theory Comput. Syst., 2009

Higher-order Voronoi diagrams on triangulated surfaces.
Inf. Process. Lett., 2009

Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion.
Int. J. Comput. Geometry Appl., 2009

Algorithms for graphs of bounded treewidth via orthogonal range searching.
Comput. Geom., 2009

Finding shortest contractible and shortest separating cycles in embedded graphs.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Geometric Simultaneous Embeddings of a Graph and a Matching.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

Detecting Hotspots in Geographic Networks.
Proceedings of the Advances in GIScience, 2009

2008
On the parameterized complexity of d-dimensional point set pattern matching.
Inf. Process. Lett., 2008

Matching point sets with respect to the Earth Mover's Distance.
Comput. Geom., 2008

Covering point sets with two disjoint disks or squares.
Comput. Geom., 2008

Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Finding one tight cycle.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Crossing and Weighted Crossing Number of Near-Planar Graphs.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

2007
Planar Embeddings of Graphs with Specified Edge Lengths.
J. Graph Algorithms Appl., 2007

Approximation algorithms for spreading points.
J. Algorithms, 2007

Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs.
Discrete & Computational Geometry, 2007

Obnoxious centers in graphs.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Multiple source shortest paths in a genus g graph.
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.
J. Graph Algorithms Appl., 2006

Area-preserving approximations of polygonal paths.
J. Discrete Algorithms, 2006

Expected Case for Projecting Points.
Informatica (Slovenia), 2006

Covering Many or Few Points with Unit Disks.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Many distances in planar graphs.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

Computing a Center-Transversal Line.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Algorithmic Aspects of Proportional Symbol Maps.
Proceedings of the Algorithms, 2006

2005
Schematization of networks.
Comput. Geom., 2005

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

Matching point sets with respect to the Earth mover's distance.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs.
Proceedings of the Algorithms, 2005

Matching Point Sets with Respect to the Earth Mover's Distance.
Proceedings of the Algorithms, 2005

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

2004
Testing Homotopy for Paths in the Plane.
Discrete & Computational Geometry, 2004

Approximation Algorithms for Spreading Points.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion.
Proceedings of the Algorithm Theory, 2004

2003
Approximation Algorithms for Aligning Points.
Algorithmica, 2003

Planar Embeddings of Graphs with Specified Edge Lengths.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

Approximation algorithms for aligning points.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure.
Des. Codes Cryptography, 2002

Testing Homotopy for paths in the plane.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

2001
Schematization of road networks.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

1999
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999


  Loading...