Sergio Cabello

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 67

Top Venues

Publications

Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
Eliminating Crossings in Ordered Graphs. SWAT (2024)
Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer
Geometric Matching and Bottleneck Problems. SoCG (2024)
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
Eliminating Crossings in Ordered Graphs. CoRR (2024)
Sergio Cabello, David Gajser
Connectivity with Uncertainty Regions Given as Line Segments. Algorithmica 86 (5) (2024)
Oswin Aichholzer, Sergio Cabello, Viola Mészáros, Patrick Schnider, Jan Soukup
Connected Matchings. CoRR (2024)
Sergio Cabello, Panos Giannopoulos
On k-Means for Segments and Polylines. ESA (2023)
Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer
Maximum Matchings in Geometric Intersection Graphs. Discret. Comput. Geom. 70 (3) (2023)
Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer
Geometric Assignment and Geometric Bottleneck. CoRR (2023)
Sergio Cabello, David Gajser
Connectivity with uncertainty regions given as line segments. CoRR (2023)
Sergio Cabello
Faster distance-based representative skyline and k-center along pareto front in the plane. J. Glob. Optim. 86 (2) (2023)
Sergio Cabello, Panos Giannopoulos
On k-means for segments and polylines. CoRR (2023)
Sergio Cabello, Éva Czabarka, Ruy Fabila Monroy, Yuya Higashikawa, Raimund Seidel, László Székely, Josef Tkadlec, Alexandra Wesolek
A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square. CoRR (2023)
Sergio Cabello
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth. ACM Trans. Algorithms 18 (2) (2022)
Sergio Cabello, Otfried Cheong, Michael Gene Dobbins
The inverse Kakeya problem. Period. Math. Hung. 84 (1) (2022)
Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec
Long Plane Trees. SoCG (2022)
Sergio Cabello, Danny Z. Chen
Guest Editors' Foreword. Discret. Comput. Geom. 68 (4) (2022)
Sergio Cabello, Timothy M. Chan
Computing Shapley Values in the Plane. Discret. Comput. Geom. 67 (3) (2022)
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel Smid
On the Minimum Consistent Subset Problem. Algorithmica 83 (7) (2021)
Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec
Long plane trees. CoRR (2021)
Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés
The Inverse Voronoi Problem in Graphs II: Trees. Algorithmica 83 (5) (2021)
Jongmin Choi, Sergio Cabello, Hee-Kap Ahn
Maximizing Dominance in the Plane and its Applications. Algorithmica 83 (11) (2021)
Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. CoRR (2021)
Sergio Cabello, Wolfgang Mulzer
Minimum cuts in geometric intersection graphs. Comput. Geom. 94 (2021)
Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. WADS (2021)
Édouard Bonnet, Sergio Cabello
The complexity of mixed-connectivity. Ann. Oper. Res. 307 (1) (2021)
Sergio Cabello
Faster Distance-Based Representative Skyline and $k$-Center Along Pareto Front in the Plane. CoRR (2020)
Sergio Cabello, Wolfgang Mulzer
Minimum Cuts in Geometric Intersection Graphs. CoRR (2020)
Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés
The Inverse Voronoi Problem in Graphs I: Hardness. Algorithmica 82 (10) (2020)
Édouard Bonnet, Sergio Cabello
The Complexity of Mixed-Connectivity. CoRR (2020)
Sergio Cabello
Some Open Problems in Computational Geometry (Invited Talk). MFCS (2020)
Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal
Minimum shared-power edge cut. Networks 75 (3) (2020)
Sergio Cabello, Éric Colin de Verdière
Hardness of Minimum Barrier Shrinkage and Minimum Installation Path. Theor. Comput. Sci. 835 (2020)
Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer
Maximum Matchings in Geometric Intersection Graphs. STACS (2020)
Sergio Cabello, Timothy M. Chan
Computing Shapley Values in the Plane. SoCG (2019)
Sergio Cabello, Éric Colin de Verdière
Hardness of Minimum Barrier Shrinkage and Minimum Activation Path. CoRR (2019)
Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer
Maximum Matchings in Geometric Intersection Graphs. CoRR (2019)
Sergio Cabello
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. ACM Trans. Algorithms 15 (2) (2019)
Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. SIAM J. Discret. Math. 33 (4) (2019)
Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms
Encoding 3SUM. CoRR (2019)
Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid
On the Minimum Consistent Subset Problem. WADS (2019)
Jong Min Choi, Sergio Cabello, Hee-Kap Ahn
Maximizing Dominance in the Plane and Its Applications. WADS (2019)
Sergio Cabello
Computing the inverse geodesic length in planar graphs and graphs of bounded treewidth. CoRR (2019)
Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer
Covering many points with a small-area box. J. Comput. Geom. 10 (1) (2019)
Sergio Cabello, Lazar Milinkovic
Two optimization problems for unit disks. Comput. Geom. (2018)
Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés
The inverse Voronoi problem in graphs. CoRR (2018)
Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson
The parameterized complexity of finding a 2-sphere in a simplicial complex. CoRR (2018)
Andrej Brodnik, Sergio Cabello
Editorial: EuroCG2015. Comput. Geom. 73 (2018)
Michael J. Bannister, Sergio Cabello, David Eppstein
Parameterized Complexity of 1-Planarity. J. Graph Algorithms Appl. 22 (1) (2018)
Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal
Minimum Shared-Power Edge Cut. CoRR (2018)
Sergio Cabello
Computing Shapley values in the plane. CoRR (2018)
Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid
On the Minimum Consistent Subset Problem. CoRR (2018)
Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich
Maximum Volume Subset Selection for Anchored Boxes. CoRR (2018)
Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, Sang Duk Yoon
The Reverse Kakeya Problem. SoCG (2018)
Sergio Cabello, Lazar Milinkovic
Two Optimization Problems for Unit Disks. CoRR (2017)
Sergio Cabello
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. SODA (2017)
Sergio Cabello, Pablo Pérez-Lantero
Interval selection in the streaming model. Theor. Comput. Sci. 702 (2017)
Sergio Cabello, Miha Jejcic
Refining the Hierarchies of Classes of Geometric Intersection Graphs. Electron. J. Comb. 24 (1) (2017)
Sergio Cabello
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. CoRR (2017)
Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer
Minimum Cell Connection in Line Segment Arrangements. Int. J. Comput. Geom. Appl. 27 (3) (2017)
Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich
Maximum Volume Subset Selection for Anchored Boxes. SoCG (2017)
Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. STACS (2017)
Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
Peeling Potatoes Near-Optimally in Near-Linear Time. SIAM J. Comput. 46 (5) (2017)
Sergio Cabello, Otfried Cheong, Christian Knauer, Lena Schlipf
Finding largest rectangles in convex polygons. Comput. Geom. 51 (2016)
Sergio Cabello, Éric Colin de Verdière, Francis Lazarus
Finding shortest non-trivial cycles in directed graphs on surfaces. J. Comput. Geom. 7 (1) (2016)
Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer
Covering many points with a small-area box. CoRR (2016)
Sergio Cabello, Miha Jejcic
Refining the Hierarchies of Classes of Geometric Intersection Graphs. Electron. Notes Discret. Math. 54 (2016)
Sergio Cabello, Panos Giannopoulos
The Complexity of Separating Points in the Plane. Algorithmica 74 (2) (2016)
Sergio Cabello, Miha Jejcic
Shortest paths in intersection graphs of unit disks. Comput. Geom. 48 (4) (2015)
Sergio Cabello, Pablo Pérez-Lantero
Interval Selection in the Streaming Model. CoRR (2015)
Sergio Cabello, Pablo Pérez-Lantero
Interval Selection in the Streaming Model. WADS (2015)
Sergio Cabello, Michael Kerber
Semi-dynamic Connectivity in the Plane. WADS (2015)
Sergio Cabello, Maria Saumell
A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon. Discret. Math. Theor. Comput. Sci. 17 (1) (2015)
Sergio Cabello, Bojan Mohar, Robert Sámal
Drawing a disconnected graph on the torus (Extended abstract). Electron. Notes Discret. Math. 49 (2015)
Sergio Cabello, David Gajser
Simple PTAS's for families of graphs excluding a minor. Discret. Appl. Math. 189 (2015)
Drago Bokal, Sergio Cabello, David Eppstein
Finding All Maximal Subsequences with Hereditary Properties. SoCG (2015)
Sergio Cabello, Michael Kerber
Semi-dynamic connectivity in the plane. CoRR (2015)
Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
Peeling potatoes near-optimally in near-linear time. CoRR (2014)
Sergio Cabello, Markus Chimani, Petr Hlinený
Computing the Stretch of an Embedded Graph. SIAM J. Discret. Math. 28 (3) (2014)
Sergio Cabello, David Gajser
Simple PTAS's for families of graphs excluding a minor. CoRR (2014)
Sergio Cabello, Miha Jejcic
Shortest Paths in Intersection Graphs of Unit Disks. CoRR (2014)
Sergio Cabello, Otfried Cheong, Lena Schlipf
Finding Largest Rectangles in Convex Polygons. CoRR (2014)
Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
Peeling Potatoes Near-Optimally in Near-Linear Time. SoCG (2014)
Sergio Cabello, José Miguel Díaz-Báñez, Pablo Pérez-Lantero
Covering a bichromatic point set with two disjoint monochromatic disks. Comput. Geom. 46 (3) (2013)
Michael J. Bannister, Sergio Cabello, David Eppstein
Parameterized Complexity of 1-Planarity. WADS (2013)
Sergio Cabello, Bojan Mohar
Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard. SIAM J. Comput. 42 (5) (2013)
Michael J. Bannister, Sergio Cabello, David Eppstein
Parameterized Complexity of 1-Planarity CoRR (2013)
Sergio Cabello, Panos Giannopoulos
The complexity of separating points in the plane. SoCG (2013)
Sergio Cabello, Jean Cardinal, Stefan Langerman
The Clique Problem in Ray Intersection Graphs. Discret. Comput. Geom. 50 (3) (2013)
Sergio Cabello
Hardness of Approximation for Crossing Number. Discret. Comput. Geom. 49 (2) (2013)
Sergio Cabello, Erin W. Chambers, Jeff Erickson
Multiple-Source Shortest Paths in Embedded Graphs. SIAM J. Comput. 42 (4) (2013)
Oleksiy Busaryev, Sergio Cabello, Chao Chen, Tamal K. Dey, Yusu Wang
Annotating Simplices with a Homology Basis and Its Applications. SWAT (2012)
Sergey Bereg, Sergio Cabello, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura
The class cover problem with boxes. Comput. Geom. 45 (7) (2012)
Sergio Cabello, Erin W. Chambers, Jeff Erickson
Multiple-Source Shortest Paths in Embedded Graphs CoRR (2012)
Sergio Cabello
Hardness of approximation for crossing number CoRR (2012)
Paul Bendich, Sergio Cabello, Herbert Edelsbrunner
A point calculus for interlevel set homology. Pattern Recognit. Lett. 33 (11) (2012)
Sergio Cabello
Stackelberg Shortest Path Tree Game, Revisited CoRR (2012)
Sergio Cabello, Jean Cardinal, Stefan Langerman
The Clique Problem in Ray Intersection Graphs. ESA (2012)
Sergio Cabello
Many Distances in Planar Graphs. Algorithmica 62 (1-2) (2012)
Sergio Cabello, Éric Colin de Verdière, Francis Lazarus
Algorithms for the edge-width of an embedded graph. Comput. Geom. 45 (5-6) (2012)
Sergio Cabello, Bojan Mohar
Adding one edge to planar graphs makes crossing number and 1-planarity hard CoRR (2012)

Sergio Cabello.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sergio Cabello