Schematization of road networks. - Sergio Cabello; Mark de Berg; Steven van Dijk; Marc J. van Kreveld; Tycho Strijk (SCG, 2001)

Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. - Sergio Cabello; Carles Padró; Germán Sáez (Des. Codes Cryptogr., 2002)

Approximation Algorithms for Aligning Points. - Sergio Cabello; Marc J. van Kreveld (Algorithmica, 2003)

Testing Homotopy for Paths in the Plane. - Sergio Cabello; Yuanxin Liu; Andrea Mantler; Jack Snoeyink (Discret. Comput. Geom., 2004)

Reverse facility location problems. - Sergio Cabello; José Miguel Díaz-Báñez; Stefan Langerman; Carlos Seara; Inmaculada Ventura (CCCG, 2005)

Homotopic spanners. - Sergio Cabello; Bojan Mohar; Arjana Zitnik (EuroCG, 2005)

Schematization of networks. - Sergio Cabello; Mark de Berg; Marc J. van Kreveld (Comput. Geom., 2005)

Computing a Center-Transversal Line. - Pankaj K. Agarwal; Sergio Cabello; Joan Antoni Sellarès; Micha Sharir (FSTTCS, 2006)

On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching. - Sergio Cabello; Panos Giannopoulos; Christian Knauer (IWPEC, 2006)

Expected Case for Projecting Points. - Sergio Cabello; Matt DeVos; Bojan Mohar (Informatica (Slovenia), 2006)

Area-preserving approximations of polygonal paths. - Prosenjit Bose; Sergio Cabello; Otfried Cheong; Joachim Gudmundsson; Marc J. van Kreveld; Bettina Speckmann (J. Discrete Algorithms, 2006)

Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. - Sergio Cabello (J. Graph Algorithms Appl., 2006)

Multiple source shortest paths in a genus g graph. - Sergio Cabello; Erin W. Chambers (SODA, 2007)

Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. - Sergio Cabello; Bojan Mohar (Discret. Comput. Geom., 2007)

Approximation algorithms for spreading points. - Sergio Cabello (J. Algorithms, 2007)

Planar Embeddings of Graphs with Specified Edge Lengths. - Sergio Cabello; Erik D. Demaine; Günter Rote (J. Graph Algorithms Appl., 2007)

Crossing and Weighted Crossing Number of Near-Planar Graphs. - Sergio Cabello; Bojan Mohar (GD, 2008)

Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. - Sergio Cabello; Panos Giannopoulos; Christian Knauer; Günter Rote (SODA, 2008)

Covering point sets with two disjoint disks or squares. - Sergio Cabello; José Miguel Díaz-Báñez; Carlos Seara; Joan Antoni Sellarès; Jorge Urrutia; Inmaculada Ventura (Comput. Geom., 2008)

Matching point sets with respect to the Earth Mover's Distance. - Sergio Cabello; Panos Giannopoulos; Christian Knauer; Günter Rote (Comput. Geom., 2008)

On the parameterized complexity of d-dimensional point set pattern matching. - Sergio Cabello; Panos Giannopoulos; Christian Knauer (Inf. Process. Lett., 2008)

Detecting Hotspots in Geographic Networks. - Kevin Buchin; Sergio Cabello; Joachim Gudmundsson; Maarten Löffler; Jun Luo 008; Günter Rote; Rodrigo I. Silveira; Bettina Speckmann; Thomas Wolle (AGILE Conf., 2009)

Algorithms for graphs of bounded treewidth via orthogonal range searching. - Sergio Cabello; Christian Knauer (Comput. Geom., 2009)

Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. - Sergio Cabello; Mark de Berg; Panos Giannopoulos; Christian Knauer; René van Oostrum; Remco C. Veltkamp (Int. J. Comput. Geom. Appl., 2009)

Higher-order Voronoi diagrams on triangulated surfaces. - Sergio Cabello; Marta Fort; Joan Antoni Sellarès (Inf. Process. Lett., 2009)

Covering Many or Few Points with Unit Disks. - Mark de Berg; Sergio Cabello; Sariel Har-Peled (Theory Comput. Syst., 2009)

Adding one edge to planar graphs makes crossing number hard. - Sergio Cabello; Bojan Mohar (SCG, 2010)

Output-sensitive algorithm for the edge-width of an embedded graph. - Sergio Cabello; Éric Colin de Verdière; Francis Lazarus (SCG, 2010)

Algorithmic Aspects of Proportional Symbol Maps. - Sergio Cabello; Herman J. Haverkort; Marc J. van Kreveld; Bettina Speckmann (Algorithmica, 2010)

Edge-Removal and Non-Crossing Configurations in Geometric Graphs. - Oswin Aichholzer; Sergio Cabello; Ruy Fabila Monroy; David Flores-Peñaloza; Thomas Hackl; Clemens Huemer; Ferran Hurtado; David R. Wood (Discret. Math. Theor. Comput. Sci., 2010)

Facility location problems in the plane based on reverse nearest neighbor queries. - Sergio Cabello; José Miguel Díaz-Báñez; Stefan Langerman; Carlos Seara; Inmaculada Ventura (Eur. J. Oper. Res., 2010)

Finding the Most Relevant Fragments in Networks. - Kevin Buchin; Sergio Cabello; Joachim Gudmundsson; Maarten Löffler; Jun Luo 008; Günter Rote; Rodrigo I. Silveira; Bettina Speckmann; Thomas Wolle (J. Graph Algorithms Appl., 2010)

Obnoxious Centers in Graphs. - Sergio Cabello; Günter Rote (SIAM J. Discret. Math., 2010)

Finding shortest contractible and shortest separating cycles in embedded graphs. - Sergio Cabello (ACM Trans. Algorithms, 2010)

Finding one tight cycle. - Sergio Cabello; Matt DeVos; Jeff Erickson 001; Bojan Mohar (ACM Trans. Algorithms, 2010)

Crossing Number and Weighted Crossing Number of Near-Planar Graphs. - Sergio Cabello; Bojan Mohar (Algorithmica, 2011)

The Fibonacci Dimension of a Graph. - Sergio Cabello; David Eppstein; Sandi Klavzar (Electron. J. Comb., 2011)

The Complexity of Obtaining a Distance-Balanced Graph. - Sergio Cabello; Primoz Luksic (Electron. J. Comb., 2011)

Minimum cell connection and separation in line segment arrangements - Helmut Alt; Sergio Cabello; Panos Giannopoulos; Christian Knauer (CoRR, 2011)

On the b-chromatic number of regular graphs. - Sergio Cabello; Marko Jakovac (Discret. Appl. Math., 2011)

Geometric Simultaneous Embeddings of a Graph and a Matching. - Sergio Cabello; Marc J. van Kreveld; Giuseppe Liotta; Henk Meijer; Bettina Speckmann; Kevin Verbeek (J. Graph Algorithms Appl., 2011)

Finding Cycles with Topological Properties in Embedded Graphs. - Sergio Cabello; Éric Colin de Verdière; Francis Lazarus (SIAM J. Discret. Math., 2011)

Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. - Sergio Cabello; Panos Giannopoulos; Christian Knauer; Dániel Marx; Günter Rote (ACM Trans. Algorithms, 2011)

Annotating Simplices with a Homology Basis and Its Applications. - Oleksiy Busaryev; Sergio Cabello; Chao Chen 012; Tamal K. Dey; Yusu Wang 001 (SWAT, 2012)

Many Distances in Planar Graphs. - Sergio Cabello (Algorithmica, 2012)

The class cover problem with boxes. - Sergey Bereg; Sergio Cabello; José Miguel Díaz-Báñez; Pablo Pérez-Lantero; Carlos Seara; Inmaculada Ventura (Comput. Geom., 2012)

Algorithms for the edge-width of an embedded graph. - Sergio Cabello; Éric Colin de Verdière; Francis Lazarus (Comput. Geom., 2012)

Stackelberg Shortest Path Tree Game, Revisited - Sergio Cabello (CoRR, 2012)

A point calculus for interlevel set homology. - Paul Bendich; Sergio Cabello; Herbert Edelsbrunner (Pattern Recognit. Lett., 2012)

Covering a bichromatic point set with two disjoint monochromatic disks. - Sergio Cabello; José Miguel Díaz-Báñez; Pablo Pérez-Lantero (Comput. Geom., 2013)

Hardness of Approximation for Crossing Number. - Sergio Cabello (Discret. Comput. Geom., 2013)

The Clique Problem in Ray Intersection Graphs. - Sergio Cabello; Jean Cardinal; Stefan Langerman (Discret. Comput. Geom., 2013)

Multiple-Source Shortest Paths in Embedded Graphs. - Sergio Cabello; Erin W. Chambers; Jeff Erickson 001 (SIAM J. Comput., 2013)

Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard. - Sergio Cabello; Bojan Mohar (SIAM J. Comput., 2013)

Finding Largest Rectangles in Convex Polygons. - Sergio Cabello; Otfried Cheong; Lena Schlipf (CoRR, 2014)

Computing the Stretch of an Embedded Graph. - Sergio Cabello; Markus Chimani; Petr Hlinený (SIAM J. Discret. Math., 2014)

Finding All Maximal Subsequences with Hereditary Properties. - Drago Bokal; Sergio Cabello; David Eppstein (SoCG, 2015)

Semi-dynamic Connectivity in the Plane. - Sergio Cabello; Michael Kerber (WADS, 2015)

Shortest paths in intersection graphs of unit disks. - Sergio Cabello; Miha Jejcic (Comput. Geom., 2015)

Simple PTAS's for families of graphs excluding a minor. - Sergio Cabello; David Gajser (Discret. Appl. Math., 2015)

A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon. - Sergio Cabello; Maria Saumell (Discret. Math. Theor. Comput. Sci., 2015)

Drawing a disconnected graph on the torus (Extended abstract). - Sergio Cabello; Bojan Mohar; Robert Sámal (Electron. Notes Discret. Math., 2015)

The Complexity of Separating Points in the Plane. - Sergio Cabello; Panos Giannopoulos (Algorithmica, 2016)

Finding largest rectangles in convex polygons. - Sergio Cabello; Otfried Cheong; Christian Knauer; Lena Schlipf (Comput. Geom., 2016)

Refining the Hierarchies of Classes of Geometric Intersection Graphs. - Sergio Cabello; Miha Jejcic (Electron. Notes Discret. Math., 2016)

Finding shortest non-trivial cycles in directed graphs on surfaces. - Sergio Cabello; Éric Colin de Verdière; Francis Lazarus (J. Comput. Geom., 2016)

Maximum Volume Subset Selection for Anchored Boxes. - Karl Bringmann; Sergio Cabello; Michael T. M. Emmerich (SoCG, 2017)

Minimum Cell Connection in Line Segment Arrangements. - Helmut Alt; Sergio Cabello; Panos Giannopoulos; Christian Knauer (Int. J. Comput. Geom. Appl., 2017)

Peeling Potatoes Near-Optimally in Near-Linear Time. - Sergio Cabello; Josef Cibulka; Jan Kyncl; Maria Saumell; Pavel Valtr 001 (SIAM J. Comput., 2017)

Interval selection in the streaming model. - Sergio Cabello; Pablo Pérez-Lantero (Theor. Comput. Sci., 2017)

The Reverse Kakeya Problem. - Sang Won Bae 001; Sergio Cabello; Otfried Cheong; Yoonsung Choi; Fabian Stehn; Sang Duk Yoon (SoCG, 2018)

Editorial: EuroCG2015. - Andrej Brodnik; Sergio Cabello (Comput. Geom., 2018)

Two optimization problems for unit disks. - Sergio Cabello; Lazar Milinkovic (Comput. Geom., 2018)

Computing Shapley values in the plane. - Sergio Cabello (CoRR, 2018)

The inverse Voronoi problem in graphs. - Édouard Bonnet; Sergio Cabello; Bojan Mohar; Hebert Pérez-Rosés (CoRR, 2018)

Parameterized Complexity of 1-Planarity. - Michael J. Bannister; Sergio Cabello; David Eppstein (J. Graph Algorithms Appl., 2018)

Maximizing Dominance in the Plane and Its Applications. - Jong Min Choi; Sergio Cabello; Hee-Kap Ahn (WADS, 2019)

Encoding 3SUM. - Sergio Cabello; Jean Cardinal; John Iacono; Stefan Langerman; Pat Morin; Aurélien Ooms (CoRR, 2019)

Hardness of Minimum Barrier Shrinkage and Minimum Activation Path. - Sergio Cabello; Éric Colin de Verdière (CoRR, 2019)

Covering many points with a small-area box. - Mark de Berg; Sergio Cabello; Otfried Cheong; David Eppstein; Christian Knauer (J. Comput. Geom., 2019)

The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. - Benjamin A. Burton; Sergio Cabello; Stefan Kratsch; William Pettersson (SIAM J. Discret. Math., 2019)

Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. - Sergio Cabello (ACM Trans. Algorithms, 2019)

Some Open Problems in Computational Geometry (Invited Talk). - Sergio Cabello (MFCS, 2020)

The Inverse Voronoi Problem in Graphs I: Hardness. - Édouard Bonnet; Sergio Cabello; Bojan Mohar; Hebert Pérez-Rosés (Algorithmica, 2020)

Minimum shared-power edge cut. - Sergio Cabello; Kshitij Jain 001; Anna Lubiw; Debajyoti Mondal (Networks, 2020)

Hardness of Minimum Barrier Shrinkage and Minimum Installation Path. - Sergio Cabello; Éric Colin de Verdière (Theor. Comput. Sci., 2020)

On the Minimum Consistent Subset Problem. - Ahmad Biniaz; Sergio Cabello; Paz Carmi; Jean-Lou De Carufel; Anil Maheshwari; Saeed Mehrabi 001; Michiel Smid (Algorithmica, 2021)

The Inverse Voronoi Problem in Graphs II: Trees. - Édouard Bonnet; Sergio Cabello; Bojan Mohar; Hebert Pérez-Rosés (Algorithmica, 2021)

Maximizing Dominance in the Plane and its Applications. - Jongmin Choi; Sergio Cabello; Hee-Kap Ahn (Algorithmica, 2021)

The complexity of mixed-connectivity. - Édouard Bonnet; Sergio Cabello (Ann. Oper. Res., 2021)

Minimum cuts in geometric intersection graphs. - Sergio Cabello; Wolfgang Mulzer (Comput. Geom., 2021)

Long Plane Trees. - Sergio Cabello; Michael Hoffmann 001; Katharina Klost; Wolfgang Mulzer; Josef Tkadlec (SoCG, 2022)

Computing Shapley Values in the Plane. - Sergio Cabello; Timothy M. Chan (Discret. Comput. Geom., 2022)

Guest Editors' Foreword. - Sergio Cabello; Danny Z. Chen (Discret. Comput. Geom., 2022)

The inverse Kakeya problem. - Sergio Cabello; Otfried Cheong; Michael Gene Dobbins (Period. Math. Hung., 2022)

Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth. - Sergio Cabello (ACM Trans. Algorithms, 2022)

On k-Means for Segments and Polylines. - Sergio Cabello; Panos Giannopoulos (ESA, 2023)

Geometric Assignment and Geometric Bottleneck. - Sergio Cabello; Siu-Wing Cheng; Otfried Cheong; Christian Knauer (CoRR, 2023)

A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square. - Sergio Cabello; Éva Czabarka; Ruy Fabila Monroy; Yuya Higashikawa; Raimund Seidel; László Székely; Josef Tkadlec; Alexandra Wesolek (CoRR, 2023)

Faster distance-based representative skyline and k-center along pareto front in the plane. - Sergio Cabello (J. Glob. Optim., 2023)

Maximum Matchings in Geometric Intersection Graphs. - Édouard Bonnet; Sergio Cabello; Wolfgang Mulzer (Discret. Comput. Geom., 2023)

Geometric Matching and Bottleneck Problems. - Sergio Cabello; Siu-Wing Cheng; Otfried Cheong; Christian Knauer (SoCG, 2024)

Eliminating Crossings in Ordered Graphs. - Akanksha Agrawal 001; Sergio Cabello; Michael Kaufmann 001; Saket Saurabh 001; Roohani Sharma; Yushi Uno; Alexander Wolff 001 (SWAT, 2024)

Searching in Euclidean Spaces with Predictions. - Sergio Cabello; Panos Giannopoulos (WAOA, 2024)

Connectivity with Uncertainty Regions Given as Line Segments. - Sergio Cabello; David Gajser (Algorithmica, 2024)

Testing Whether a Subgraph Is Convex or Isometric. - Sergio Cabello (WADS, 2025)

Algorithms for Distance Problems in Continuous Graphs. - Sergio Cabello; Delia Garijo; Antonia Kalb; Fabian Klute; Irene Parada; Rodrigo I. Silveira (WADS, 2025)

Connected matchings. - Oswin Aichholzer; Sergio Cabello; Viola Mészáros; Patrick Schnider; Jan Soukup (Comput. Geom., 2025)

Finding a largest-area triangle in a terrain in near-linear time. - Sergio Cabello; Arun Kumar Das 001; Sandip Das 001; Joydeep Mukherjee (Comput. Geom., 2025)

Better Late than Never: the Complexity of Arrangements of Polyhedra. - Boris Aronov; Sang Won Bae 001; Sergio Cabello; Otfried Cheong; David Eppstein; Christian Knauer; Raimund Seidel (CoRR, 2025)

An O(n log n) Algorithm for Single-Source Shortest Paths in Disk Graphs. - Mark de Berg; Sergio Cabello (CoRR, 2025)