Publications (24)
Refining the Hierarchies of Classes of Geometric Intersection Graphs
Sergio Cabello, Miha JejÄiÄ
Minimum Shared-Power Edge Cut
Sergio Cabello, Kshitij Jain, Anna Lubiw +1
Finding Largest Rectangles in Convex Polygons
Sergio Cabello, Otfried Cheong, Christian Knauer +1
Shortest Paths in Intersection Graphs of Unit Disks
Sergio Cabello, Miha JejÄiÄ
Annotating Simplices with a Homology Basis and Its Applications
Oleksiy Busaryev, Sergio Cabello, Chao Chen +2
Parameterized Complexity of 1-Planarity
Michael J. Bannister, Sergio Cabello, David Eppstein
Multiple-Source Shortest Paths in Embedded Graphs
Sergio Cabello, Erin Wolf Chambers, Jeff Erickson
Two Optimization Problems for Unit Disks
Sergio Cabello, Lazar MilinkoviÄ
Covering many points with a small-area box
Mark de Berg, Sergio Cabello, Otfried Cheong +2
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
Sergio Cabello
Encoding 3SUM
Sergio Cabello, Jean Cardinal, John Iacono +3
On the Minimum Consistent Subset Problem
Ahmad Biniaz, Sergio Cabello, Paz Carmi +4
Minimum cell connection and separation in line segment arrangements
Helmut Alt, Sergio Cabello, Panos Giannopoulos +1
The Fibonacci dimension of a graph
Sergio Cabello, David Eppstein, Sandi Klavzar
Adding one edge to planar graphs makes crossing number and 1-planarity hard
Sergio Cabello, Bojan Mohar
Maximum Volume Subset Selection for Anchored Boxes
Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich
Simple PTAS's for families of graphs excluding a minor
Sergio Cabello, David Gajser
Peeling potatoes near-optimally in near-linear time
Sergio Cabello, Josef Cibulka, Jan KynÄl +2
Interval Selection in the Streaming Model
Sergio Cabello, Pablo Pérez-Lantero
Computing Shapley values in the plane
Sergio Cabello, Timothy M. Chan
Stackelberg Shortest Path Tree Game, Revisited
Sergio Cabello
Semi-dynamic connectivity in the plane
Sergio Cabello, Michael Kerber
The Clique Problem in Ray Intersection Graphs
Sergio Cabello, Jean Cardinal, Stefan Langerman
Hardness of approximation for crossing number
Sergio Cabello