Sergio Cabello

183 papers A* 16A 13B 14C 2Journal 125Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Delaunay Triangulations with Predictions. ITCS Sergio Cabello, Timothy M. Chan, Panos Giannopoulos
2026	J	`jnl`	Delaunay Triangulations with Predictions. CoRR Sergio Cabello, Timothy M. Chan, Panos Giannopoulos
2026	J	`jnl`	Long Plane Trees. ACM Trans. Algorithms Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec
2026	J	`jnl`	Packing d-dimensional balls into a d + 1-dimensional container. Comput. Geom. Helmut Alt, Sergio Cabello, Otfried Cheong, Ji-won Park, Nadja Seiferth
2025	B	`conf`	A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth. ISAAC Sergio Cabello, Alexander Dobler, Gasper Fijavz, Thekla Hamm, Mirko H. Wagner
2025	J	`jnl`	A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth. CoRR Sergio Cabello, Alexander Dobler, Gasper Fijavz, Thekla Hamm, Mirko H. Wagner
2025	B	`conf`	Algorithms for Distance Problems in Continuous Graphs. WADS Sergio Cabello, Delia Garijo, Antonia Kalb, Fabian Klute, Irene Parada, Rodrigo I. Silveira
2025	J	`jnl`	Algorithms for Distance Problems in Continuous Graphs. CoRR Sergio Cabello, Delia Garijo, Antonia Kalb, Fabian Klute, Irene Parada, Rodrigo I. Silveira
2025	J	`jnl`	An O(n log n) Algorithm for Single-Source Shortest Paths in Disk Graphs. CoRR Mark de Berg, Sergio Cabello
2025	A	`conf`	An O(nlog n) Algorithm for Single-Source Shortest Paths in Disk Graphs. ESA Mark de Berg, Sergio Cabello
2025	J	`jnl`	Better Late than Never: the Complexity of Arrangements of Polyhedra. CoRR Boris Aronov, Sang Won Bae, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer, Raimund Seidel
2025	J	`jnl`	Connected matchings. Comput. Geom. Oswin Aichholzer, Sergio Cabello, Viola Mészáros, Patrick Schnider, Jan Soukup
2025	J	`jnl`	Finding a largest-area triangle in a terrain in near-linear time. Comput. Geom. Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee
2025	A	`conf`	Heterogeneous Facility Location Game with Discrete Utility. ECAI Sergio Cabello, Arun Kumar Das, Jan Matyás Kristan, Tomás Valla
2025	B	`conf`	Testing Whether a Subgraph Is Convex or Isometric. WADS Sergio Cabello
2025	J	`jnl`	Testing whether a subgraph is convex or isometric. CoRR Sergio Cabello
2025	J	`jnl`	The General Expiration Streaming Model: Diameter, CoRR Lotte Blank, Sergio Cabello, MohammadTaghi Hajiaghayi, Robert Krauthgamer, Sepideh Mahabadi, André Nusser, Jeff M. Phillips, Jonas Sauer
2024	J	`jnl`	Connected Matchings. CoRR Oswin Aichholzer, Sergio Cabello, Viola Mészáros, Patrick Schnider, Jan Soukup
2024	J	`jnl`	Connectivity with Uncertainty Regions Given as Line Segments. Algorithmica Sergio Cabello, David Gajser
2024	—	`conf`	Eliminating Crossings in Ordered Graphs. SWAT Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
2024	J	`jnl`	Eliminating Crossings in Ordered Graphs. CoRR Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
2024	A*	`conf`	Geometric Matching and Bottleneck Problems. SoCG Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer
2024	B	`conf`	Searching in Euclidean Spaces with Predictions. WAOA Sergio Cabello, Panos Giannopoulos
2024	J	`jnl`	Searching in Euclidean Spaces with Predictions. CoRR Sergio Cabello, Panos Giannopoulos
2023	J	`jnl`	A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square. CoRR Sergio Cabello, Éva Czabarka, Ruy Fabila-Monroy, Yuya Higashikawa, Raimund Seidel, László Székely, Josef Tkadlec, Alexandra Wesolek
2023	J	`jnl`	Connectivity with uncertainty regions given as line segments. CoRR Sergio Cabello, David Gajser
2023	J	`jnl`	Faster distance-based representative skyline and k-center along pareto front in the plane. J. Glob. Optim. Sergio Cabello
2023	J	`jnl`	Geometric Assignment and Geometric Bottleneck. CoRR Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer
2023	J	`jnl`	Maximum Matchings in Geometric Intersection Graphs. Discret. Comput. Geom. Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer
2023	A	`conf`	On k-Means for Segments and Polylines. ESA Sergio Cabello, Panos Giannopoulos
2023	J	`jnl`	On k-means for segments and polylines. CoRR Sergio Cabello, Panos Giannopoulos
2022	J	`jnl`	Computing Shapley Values in the Plane. Discret. Comput. Geom. Sergio Cabello, Timothy M. Chan
2022	J	`jnl`	Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth. ACM Trans. Algorithms Sergio Cabello
2022	J	`jnl`	Guest Editors' Foreword. Discret. Comput. Geom. Sergio Cabello, Danny Z. Chen
2022	A*	`conf`	Long Plane Trees. SoCG Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec
2022	J	`jnl`	The inverse Kakeya problem. Period. Math. Hung. Sergio Cabello, Otfried Cheong, Michael Gene Dobbins
2021	B	`conf`	Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. WADS Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee
2021	J	`jnl`	Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. CoRR Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee
2021	J	`jnl`	Long plane trees. CoRR Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec
2021	J	`jnl`	Maximizing Dominance in the Plane and its Applications. Algorithmica Jongmin Choi, Sergio Cabello, Hee-Kap Ahn
2021	J	`jnl`	Minimum cuts in geometric intersection graphs. Comput. Geom. Sergio Cabello, Wolfgang Mulzer
2021	J	`jnl`	On the Minimum Consistent Subset Problem. Algorithmica Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel Smid
2021	J	`jnl`	The Inverse Voronoi Problem in Graphs II: Trees. Algorithmica Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés
2021	J	`jnl`	The complexity of mixed-connectivity. Ann. Oper. Res. Édouard Bonnet, Sergio Cabello
2020	A*	`ed.`	36th International Symposium on Computational Geometry, SoCG 2020, Zürich, Switzerland, June 23-26, 2020 SoCG Sergio Cabello, Danny Z. Chen
2020	J	`jnl`	Faster Distance-Based Representative Skyline and $k$-Center Along Pareto Front in the Plane. CoRR Sergio Cabello
2020	J	`jnl`	Hardness of Minimum Barrier Shrinkage and Minimum Installation Path. Theor. Comput. Sci. Sergio Cabello, Éric Colin de Verdière
2020	A	`conf`	Maximum Matchings in Geometric Intersection Graphs. STACS Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer
2020	J	`jnl`	Minimum Cuts in Geometric Intersection Graphs. CoRR Sergio Cabello, Wolfgang Mulzer
2020	J	`jnl`	Minimum shared-power edge cut. Networks Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal
2020	B	`conf`	Some Open Problems in Computational Geometry (Invited Talk). MFCS Sergio Cabello
2020	J	`jnl`	The Complexity of Mixed-Connectivity. CoRR Édouard Bonnet, Sergio Cabello
2020	J	`jnl`	The Inverse Voronoi Problem in Graphs I: Hardness. Algorithmica Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés
2019	A*	`conf`	Computing Shapley Values in the Plane. SoCG Sergio Cabello, Timothy M. Chan
2019	J	`jnl`	Computing the inverse geodesic length in planar graphs and graphs of bounded treewidth. CoRR Sergio Cabello
2019	J	`jnl`	Covering many points with a small-area box. J. Comput. Geom. Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer
2019	J	`jnl`	Encoding 3SUM. CoRR Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms
2019	J	`jnl`	Hardness of Minimum Barrier Shrinkage and Minimum Activation Path. CoRR Sergio Cabello, Éric Colin de Verdière
2019	B	`conf`	Maximizing Dominance in the Plane and Its Applications. WADS Jong Min Choi, Sergio Cabello, Hee-Kap Ahn
2019	J	`jnl`	Maximum Matchings in Geometric Intersection Graphs. CoRR Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer
2019	B	`conf`	On the Minimum Consistent Subset Problem. WADS Ahmad Biniaz, Sergio Cabello, Paz Carmi, Jean-Lou De Carufel, Anil Maheshwari, Saeed Mehrabi, Michiel H. M. Smid
2019	J	`jnl`	Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. ACM Trans. Algorithms Sergio Cabello
2019	J	`jnl`	The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. SIAM J. Discret. Math. Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson
2018	J	`jnl`	Computing Shapley values in the plane. CoRR Sergio Cabello
2018	J	`jnl`	Editorial: EuroCG2015. Comput. Geom. Andrej Brodnik, Sergio Cabello
2018	J	`jnl`	Maximum Volume Subset Selection for Anchored Boxes. CoRR Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich
2018	J	`jnl`	Minimum Shared-Power Edge Cut. CoRR Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal
2018	J	`jnl`	On the Minimum Consistent Subset Problem. CoRR Ahmad Biniaz, Sergio Cabello, Anil Maheshwari, Paz Carmi, Saeed Mehrabi, Jean-Lou De Carufel, Michiel H. M. Smid
2018	J	`jnl`	Parameterized Complexity of 1-Planarity. J. Graph Algorithms Appl. Michael J. Bannister, Sergio Cabello, David Eppstein
2018	A*	`conf`	The Reverse Kakeya Problem. SoCG Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, Sang Duk Yoon
2018	J	`jnl`	The inverse Voronoi problem in graphs. CoRR Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés
2018	J	`jnl`	The parameterized complexity of finding a 2-sphere in a simplicial complex. CoRR Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson
2018	J	`jnl`	Two optimization problems for unit disks. Comput. Geom. Sergio Cabello, Lazar Milinkovic
2017	J	`jnl`	Interval selection in the streaming model. Theor. Comput. Sci. Sergio Cabello, Pablo Pérez-Lantero
2017	A*	`conf`	Maximum Volume Subset Selection for Anchored Boxes. SoCG Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich
2017	J	`jnl`	Minimum Cell Connection in Line Segment Arrangements. Int. J. Comput. Geom. Appl. Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer
2017	J	`jnl`	Peeling Potatoes Near-Optimally in Near-Linear Time. SIAM J. Comput. Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
2017	J	`jnl`	Refining the Hierarchies of Classes of Geometric Intersection Graphs. Electron. J. Comb. Sergio Cabello, Miha Jejcic
2017	A*	`conf`	Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. SODA Sergio Cabello
2017	J	`jnl`	Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. CoRR Sergio Cabello
2017	A	`conf`	The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. STACS Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson
2017	J	`jnl`	Two Optimization Problems for Unit Disks. CoRR Sergio Cabello, Lazar Milinkovic
2016	J	`jnl`	Covering many points with a small-area box. CoRR Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer
2016	J	`jnl`	Finding largest rectangles in convex polygons. Comput. Geom. Sergio Cabello, Otfried Cheong, Christian Knauer, Lena Schlipf
2016	J	`jnl`	Finding shortest non-trivial cycles in directed graphs on surfaces. J. Comput. Geom. Sergio Cabello, Éric Colin de Verdière, Francis Lazarus
2016	J	`jnl`	Refining the Hierarchies of Classes of Geometric Intersection Graphs. Electron. Notes Discret. Math. Sergio Cabello, Miha Jejcic
2016	J	`jnl`	The Complexity of Separating Points in the Plane. Algorithmica Sergio Cabello, Panos Giannopoulos
2015	J	`jnl`	A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon. Discret. Math. Theor. Comput. Sci. Sergio Cabello, Maria Saumell
2015	J	`jnl`	Drawing a disconnected graph on the torus (Extended abstract). Electron. Notes Discret. Math. Sergio Cabello, Bojan Mohar, Robert Sámal
2015	A*	`conf`	Finding All Maximal Subsequences with Hereditary Properties. SoCG Drago Bokal, Sergio Cabello, David Eppstein
2015	B	`conf`	Interval Selection in the Streaming Model. WADS Sergio Cabello, Pablo Pérez-Lantero
2015	J	`jnl`	Interval Selection in the Streaming Model. CoRR Sergio Cabello, Pablo Pérez-Lantero
2015	B	`conf`	Semi-dynamic Connectivity in the Plane. WADS Sergio Cabello, Michael Kerber
2015	J	`jnl`	Semi-dynamic connectivity in the plane. CoRR Sergio Cabello, Michael Kerber
2015	J	`jnl`	Shortest paths in intersection graphs of unit disks. Comput. Geom. Sergio Cabello, Miha Jejcic
2015	J	`jnl`	Simple PTAS's for families of graphs excluding a minor. Discret. Appl. Math. Sergio Cabello, David Gajser
2014	J	`jnl`	Computing the Stretch of an Embedded Graph. SIAM J. Discret. Math. Sergio Cabello, Markus Chimani, Petr Hlinený
2014	J	`jnl`	Finding Largest Rectangles in Convex Polygons. CoRR Sergio Cabello, Otfried Cheong, Lena Schlipf
2014	A*	`conf`	Peeling Potatoes Near-Optimally in Near-Linear Time. SoCG Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
2014	J	`jnl`	Peeling potatoes near-optimally in near-linear time. CoRR Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr
2014	J	`jnl`	Shortest Paths in Intersection Graphs of Unit Disks. CoRR Sergio Cabello, Miha Jejcic
2014	J	`jnl`	Simple PTAS's for families of graphs excluding a minor. CoRR Sergio Cabello, David Gajser
2013	J	`jnl`	Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard. SIAM J. Comput. Sergio Cabello, Bojan Mohar
2013	J	`jnl`	Covering a bichromatic point set with two disjoint monochromatic disks. Comput. Geom. Sergio Cabello, José Miguel Díaz-Báñez, Pablo Pérez-Lantero
2013	J	`jnl`	Hardness of Approximation for Crossing Number. Discret. Comput. Geom. Sergio Cabello
2013	J	`jnl`	Multiple-Source Shortest Paths in Embedded Graphs. SIAM J. Comput. Sergio Cabello, Erin W. Chambers, Jeff Erickson
2013	J	`jnl`	Parameterized Complexity of 1-Planarity CoRR Michael J. Bannister, Sergio Cabello, David Eppstein
2013	B	`conf`	Parameterized Complexity of 1-Planarity. WADS Michael J. Bannister, Sergio Cabello, David Eppstein
2013	J	`jnl`	The Clique Problem in Ray Intersection Graphs. Discret. Comput. Geom. Sergio Cabello, Jean Cardinal, Stefan Langerman
2013	A*	`conf`	The complexity of separating points in the plane. SoCG Sergio Cabello, Panos Giannopoulos
2012	J	`jnl`	A point calculus for interlevel set homology. Pattern Recognit. Lett. Paul Bendich, Sergio Cabello, Herbert Edelsbrunner
2012	J	`jnl`	Adding one edge to planar graphs makes crossing number and 1-planarity hard CoRR Sergio Cabello, Bojan Mohar
2012	J	`jnl`	Algorithms for the edge-width of an embedded graph. Comput. Geom. Sergio Cabello, Éric Colin de Verdière, Francis Lazarus
2012	—	`conf`	Annotating Simplices with a Homology Basis and Its Applications. SWAT Oleksiy Busaryev, Sergio Cabello, Chao Chen, Tamal K. Dey, Yusu Wang
2012	J	`jnl`	Hardness of approximation for crossing number CoRR Sergio Cabello
2012	J	`jnl`	Many Distances in Planar Graphs. Algorithmica Sergio Cabello
2012	J	`jnl`	Multiple-Source Shortest Paths in Embedded Graphs CoRR Sergio Cabello, Erin W. Chambers, Jeff Erickson
2012	J	`jnl`	Stackelberg Shortest Path Tree Game, Revisited CoRR Sergio Cabello
2012	A	`conf`	The Clique Problem in Ray Intersection Graphs. ESA Sergio Cabello, Jean Cardinal, Stefan Langerman
2012	J	`jnl`	The class cover problem with boxes. Comput. Geom. Sergey Bereg, Sergio Cabello, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura
2011	J	`jnl`	Annotating Simplices with a Homology Basis and Its Applications CoRR Oleksiy Busaryev, Sergio Cabello, Chao Chen, Tamal K. Dey, Yusu Wang
2011	J	`jnl`	Crossing Number and Weighted Crossing Number of Near-Planar Graphs. Algorithmica Sergio Cabello, Bojan Mohar
2011	J	`jnl`	Finding Cycles with Topological Properties in Embedded Graphs. SIAM J. Discret. Math. Sergio Cabello, Éric Colin de Verdière, Francis Lazarus
2011	J	`jnl`	Geometric Simultaneous Embeddings of a Graph and a Matching. J. Graph Algorithms Appl. Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek
2011	J	`jnl`	Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. ACM Trans. Algorithms Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote
2011	J	`jnl`	Minimum cell connection and separation in line segment arrangements CoRR Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer
2011	J	`jnl`	On the b-chromatic number of regular graphs. Discret. Appl. Math. Sergio Cabello, Marko Jakovac
2011	J	`jnl`	The Clique Problem in Ray Intersection Graphs CoRR Sergio Cabello, Jean Cardinal, Stefan Langerman
2011	J	`jnl`	The Complexity of Obtaining a Distance-Balanced Graph. Electron. J. Comb. Sergio Cabello, Primoz Luksic
2011	J	`jnl`	The Fibonacci Dimension of a Graph. Electron. J. Comb. Sergio Cabello, David Eppstein, Sandi Klavzar
2010	—	`conf`	Adding one edge to planar graphs makes crossing number hard. SCG Sergio Cabello, Bojan Mohar
2010	J	`jnl`	Algorithmic Aspects of Proportional Symbol Maps. Algorithmica Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann
2010	J	`jnl`	Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Discret. Math. Theor. Comput. Sci. Oswin Aichholzer, Sergio Cabello, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood
2010	J	`jnl`	Facility location problems in the plane based on reverse nearest neighbor queries. Eur. J. Oper. Res. Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura
2010	J	`jnl`	Finding one tight cycle. ACM Trans. Algorithms Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar
2010	J	`jnl`	Finding shortest contractible and shortest separating cycles in embedded graphs. ACM Trans. Algorithms Sergio Cabello
2010	—	`conf`	Finding shortest non-trivial cycles in directed graphs on surfaces. SCG Sergio Cabello, Éric Colin de Verdière, Francis Lazarus
2010	J	`jnl`	Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle
2010	J	`jnl`	Obnoxious Centers in Graphs. SIAM J. Discret. Math. Sergio Cabello, Günter Rote
2010	—	`conf`	Output-sensitive algorithm for the edge-width of an embedded graph. SCG Sergio Cabello, Éric Colin de Verdière, Francis Lazarus
2009	J	`jnl`	Algorithms for graphs of bounded treewidth via orthogonal range searching. Comput. Geom. Sergio Cabello, Christian Knauer
2009	J	`jnl`	Covering Many or Few Points with Unit Disks. Theory Comput. Syst. Mark de Berg, Sergio Cabello, Sariel Har-Peled
2009	—	`conf`	Detecting Hotspots in Geographic Networks. AGILE Conf. Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle
2009	A*	`conf`	Finding shortest contractible and shortest separating cycles in embedded graphs. SODA Sergio Cabello
2009	A	`conf`	Geometric Simultaneous Embeddings of a Graph and a Matching. GD Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek
2009	J	`jnl`	Higher-order Voronoi diagrams on triangulated surfaces. Inf. Process. Lett. Sergio Cabello, Marta Fort, Joan Antoni Sellarès
2009	J	`jnl`	Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. Int. J. Comput. Geom. Appl. Sergio Cabello, Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp
2009	J	`jnl`	The Fibonacci dimension of a graph CoRR Sergio Cabello, David Eppstein, Sandi Klavzar
2008	J	`jnl`	Covering point sets with two disjoint disks or squares. Comput. Geom. Sergio Cabello, José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura
2008	A	`conf`	Crossing and Weighted Crossing Number of Near-Planar Graphs. GD Sergio Cabello, Bojan Mohar
2008	A*	`conf`	Finding one tight cycle. SODA Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar
2008	A*	`conf`	Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. SODA Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
2008	J	`jnl`	Matching point sets with respect to the Earth Mover's Distance. Comput. Geom. Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
2008	J	`jnl`	On the parameterized complexity of d-dimensional point set pattern matching. Inf. Process. Lett. Sergio Cabello, Panos Giannopoulos, Christian Knauer
2007	J	`jnl`	Approximation algorithms for spreading points. J. Algorithms Sergio Cabello
2007	J	`jnl`	Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. Discret. Comput. Geom. Sergio Cabello, Bojan Mohar
2007	A*	`conf`	Multiple source shortest paths in a genus g graph. SODA Sergio Cabello, Erin W. Chambers
2007	A*	`conf`	Obnoxious centers in graphs. SODA Sergio Cabello, Günter Rote
2007	J	`jnl`	Planar Embeddings of Graphs with Specified Edge Lengths. J. Graph Algorithms Appl. Sergio Cabello, Erik D. Demaine, Günter Rote
2006	A	`conf`	Algorithmic Aspects of Proportional Symbol Maps. ESA Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann
2006	J	`jnl`	Area-preserving approximations of polygonal paths. J. Discrete Algorithms Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann
2006	—	`conf`	Computing a Center-Transversal Line. FSTTCS Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir
2006	B	`conf`	Covering Many or Few Points with Unit Disks. WAOA Mark de Berg, Sergio Cabello, Sariel Har-Peled
2006	J	`jnl`	Expected Case for Projecting Points. Informatica (Slovenia) Sergio Cabello, Matt DeVos, Bojan Mohar
2006	A*	`conf`	Many distances in planar graphs. SODA Sergio Cabello
2006	—	`conf`	On the Parameterized Complexity of IWPEC Sergio Cabello, Panos Giannopoulos, Christian Knauer
2006	J	`jnl`	Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. J. Graph Algorithms Appl. Sergio Cabello
2005	A	`conf`	Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. ESA Sergio Cabello, Bojan Mohar
2005	C	`conf`	Homotopic spanners. EuroCG Sergio Cabello, Bojan Mohar, Arjana Zitnik
2005	A	`conf`	Matching Point Sets with Respect to the Earth Mover's Distance. ESA Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
2005	C	`conf`	Matching point sets with respect to the Earth mover's distance. EuroCG Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
2005	—	`conf`	Reverse facility location problems. CCCG Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura
2005	J	`jnl`	Schematization of networks. Comput. Geom. Sergio Cabello, Mark de Berg, Marc J. van Kreveld
2004	B	`conf`	Approximation Algorithms for Spreading Points. WAOA Sergio Cabello
2004	—	`conf`	Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion. SWAT Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp
2004	J	`jnl`	Testing Homotopy for Paths in the Plane. Discret. Comput. Geom. Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink
2003	J	`jnl`	Approximation Algorithms for Aligning Points. Algorithmica Sergio Cabello, Marc J. van Kreveld
2003	—	`conf`	Approximation algorithms for aligning points. SCG Sergio Cabello, Marc J. van Kreveld
2003	A	`conf`	Planar Embeddings of Graphs with Specified Edge Lengths. GD Sergio Cabello, Erik D. Demaine, Günter Rote
2002	J	`jnl`	Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. Des. Codes Cryptogr. Sergio Cabello, Carles Padró, Germán Sáez
2002	—	`conf`	Testing Homotopy for paths in the plane. SCG Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink
2001	—	`conf`	Schematization of road networks. SCG Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk
1999	B	`conf`	Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. FCT Sergio Cabello, Carles Padró, Germán Sáez