default search action
Sergio Cabello
Person information
- affiliation: University of Ljubljana, Department of Mathematics, Slovenia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j74]Sergio Cabello, David Gajser:
Connectivity with Uncertainty Regions Given as Line Segments. Algorithmica 86(5): 1512-1544 (2024) - [c48]Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer:
Geometric Matching and Bottleneck Problems. SoCG 2024: 31:1-31:15 - [c47]Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. SWAT 2024: 1:1-1:19 - [i42]Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. CoRR abs/2404.09771 (2024) - [i41]Oswin Aichholzer, Sergio Cabello, Viola Mészáros, Patrick Schnider, Jan Soukup:
Connected Matchings. CoRR abs/2407.06131 (2024) - [i40]Sergio Cabello, Panos Giannopoulos:
Searching in Euclidean Spaces with Predictions. CoRR abs/2408.04964 (2024) - 2023
- [j73]Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer
:
Maximum Matchings in Geometric Intersection Graphs. Discret. Comput. Geom. 70(3): 550-579 (2023) - [j72]Sergio Cabello
Faster distance-based representative skyline and k-center along pareto front in the plane. J. Glob. Optim. 86(2): 441-466 (2023) - [c46]Sergio Cabello, Panos Giannopoulos:
On k-Means for Segments and Polylines. ESA 2023: 28:1-28:14 - [i39]Sergio Cabello, David Gajser:
Connectivity with uncertainty regions given as line segments. CoRR abs/2303.10028 (2023) - [i38]Sergio Cabello, Panos Giannopoulos:
On k-means for segments and polylines. CoRR abs/2305.10922 (2023) - [i37]Sergio Cabello, Siu-Wing Cheng, Otfried Cheong, Christian Knauer:
Geometric Assignment and Geometric Bottleneck. CoRR abs/2310.02637 (2023) - [i36]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 abs/2312.01935 (2023) - 2022
- [j71]Sergio Cabello
Computing Shapley Values in the Plane. Discret. Comput. Geom. 67(3): 843-881 (2022) - [j70]Sergio Cabello, Danny Z. Chen:
Guest Editors' Foreword. Discret. Comput. Geom. 68(4): 945-948 (2022) - [j69]Sergio Cabello, Otfried Cheong, Michael Gene Dobbins:
The inverse Kakeya problem. Period. Math. Hung. 84(1): 70-75 (2022) - [j68]Sergio Cabello:
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth. ACM Trans. Algorithms 18(2): 14:1-14:26 (2022) - [c45]Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec:
Long Plane Trees. SoCG 2022: 23:1-23:17 - 2021
- [j67]Édouard Bonnet, Sergio Cabello
The Inverse Voronoi Problem in Graphs II: Trees. Algorithmica 83(5): 1165-1200 (2021) - [j66]Ahmad Biniaz
On the Minimum Consistent Subset Problem. Algorithmica 83(7): 2273-2302 (2021) - [j65]Jongmin Choi
Maximizing Dominance in the Plane and its Applications. Algorithmica 83(11): 3491-3513 (2021) - [j64]Édouard Bonnet, Sergio Cabello
The complexity of mixed-connectivity. Ann. Oper. Res. 307(1): 25-35 (2021) - [j63]Sergio Cabello
Minimum cuts in geometric intersection graphs. Comput. Geom. 94: 101720 (2021) - [c44]Sergio Cabello
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. WADS 2021: 258-270 - [i35]Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec:
Long plane trees. CoRR abs/2101.00445 (2021) - [i34]Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. CoRR abs/2104.11420 (2021) - 2020
- [j62]Édouard Bonnet, Sergio Cabello
The Inverse Voronoi Problem in Graphs I: Hardness. Algorithmica 82(10): 3018-3040 (2020) - [j61]Sergio Cabello
Minimum shared-power edge cut. Networks 75(3): 321-333 (2020) - [j60]Sergio Cabello, Éric Colin de Verdière:
Hardness of Minimum Barrier Shrinkage and Minimum Installation Path. Theor. Comput. Sci. 835: 120-133 (2020) - [c43]Sergio Cabello
Some Open Problems in Computational Geometry (Invited Talk). MFCS 2020: 2:1-2:6 - [c42]Édouard Bonnet
Maximum Matchings in Geometric Intersection Graphs. STACS 2020: 31:1-31:17 - [e1]Sergio Cabello
36th International Symposium on Computational Geometry, SoCG 2020, June 23-26, 2020, Zürich, Switzerland. LIPIcs 164, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-143-6 [contents] - [i33]Sergio Cabello, Wolfgang Mulzer:
Minimum Cuts in Geometric Intersection Graphs. CoRR abs/2005.00858 (2020) - [i32]Édouard Bonnet, Sergio Cabello:
The Complexity of Mixed-Connectivity. CoRR abs/2010.04799 (2020) - [i31]Sergio Cabello:
Faster Distance-Based Representative Skyline and $k$-Center Along Pareto Front in the Plane. CoRR abs/2012.15381 (2020)
2010 – 2019
- 2019
- [j59]Mark de Berg
Covering many points with a small-area box. J. Comput. Geom. 10(1): 207-222 (2019) - [j58]Benjamin A. Burton
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. SIAM J. Discret. Math. 33(4): 2092-2110 (2019) - [j57]Sergio Cabello
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. ACM Trans. Algorithms 15(2): 21:1-21:38 (2019) - [c41]Sergio Cabello
Computing Shapley Values in the Plane. SoCG 2019: 20:1-20:19 - [c40]Ahmad Biniaz, Sergio Cabello
On the Minimum Consistent Subset Problem. WADS 2019: 155-167 - [c39]Jong Min Choi
Maximizing Dominance in the Plane and Its Applications. WADS 2019: 325-338 - [i30]Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms:
Encoding 3SUM. CoRR abs/1903.02645 (2019) - [i29]Sergio Cabello:
Computing the inverse geodesic length in planar graphs and graphs of bounded treewidth. CoRR abs/1908.01317 (2019) - [i28]Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer:
Maximum Matchings in Geometric Intersection Graphs. CoRR abs/1910.02123 (2019) - [i27]Sergio Cabello, Éric Colin de Verdière:
Hardness of Minimum Barrier Shrinkage and Minimum Activation Path. CoRR abs/1910.04228 (2019) - 2018
- [j56]Sergio Cabello, Lazar Milinkovic:
Two optimization problems for unit disks. Comput. Geom. 70-71: 1-12 (2018) - [j55]Andrej Brodnik, Sergio Cabello:
Editorial: EuroCG2015. Comput. Geom. 73: 1 (2018) - [j54]Michael J. Bannister, Sergio Cabello, David Eppstein:
Parameterized Complexity of 1-Planarity. J. Graph Algorithms Appl. 22(1): 23-49 (2018) - [c38]Sang Won Bae
The Reverse Kakeya Problem. SoCG 2018: 6:1-6:13 - [i26]Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson:
The parameterized complexity of finding a 2-sphere in a simplicial complex. CoRR abs/1802.07175 (2018) - [i25]Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich:
Maximum Volume Subset Selection for Anchored Boxes. CoRR abs/1803.00849 (2018) - [i24]Sergio Cabello:
Computing Shapley values in the plane. CoRR abs/1804.03894 (2018) - [i23]Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal:
Minimum Shared-Power Edge Cut. CoRR abs/1806.04742 (2018) - [i22]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 abs/1810.09232 (2018) - [i21]Édouard Bonnet, Sergio Cabello, Bojan Mohar, Hebert Pérez-Rosés:
The inverse Voronoi problem in graphs. CoRR abs/1811.12547 (2018) - 2017
- [j53]Sergio Cabello, Miha Jejcic:
Refining the Hierarchies of Classes of Geometric Intersection Graphs. Electron. J. Comb. 24(1): 1 (2017) - [j52]Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer:
Minimum Cell Connection in Line Segment Arrangements. Int. J. Comput. Geom. Appl. 27(3): 159-176 (2017) - [j51]Sergio Cabello
Peeling Potatoes Near-Optimally in Near-Linear Time. SIAM J. Comput. 46(5): 1574-1602 (2017) - [j50]Sergio Cabello, Pablo Pérez-Lantero:
Interval selection in the streaming model. Theor. Comput. Sci. 702: 77-96 (2017) - [c37]Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich
Maximum Volume Subset Selection for Anchored Boxes. SoCG 2017: 22:1-22:15 - [c36]Sergio Cabello:
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. SODA 2017: 2143-2152 - [c35]Benjamin A. Burton
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. STACS 2017: 18:1-18:14 - [i20]Sergio Cabello, Lazar Milinkovic:
Two Optimization Problems for Unit Disks. CoRR abs/1702.03266 (2017) - [i19]Sergio Cabello:
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. CoRR abs/1702.07815 (2017) - 2016
- [j49]Sergio Cabello
The Complexity of Separating Points in the Plane. Algorithmica 74(2): 643-663 (2016) - [j48]Sergio Cabello
Finding largest rectangles in convex polygons. Comput. Geom. 51: 67-74 (2016) - [j47]Sergio Cabello
Refining the Hierarchies of Classes of Geometric Intersection Graphs. Electron. Notes Discret. Math. 54: 223-228 (2016) - [j46]Sergio Cabello, Éric Colin de Verdière, Francis Lazarus:
Finding shortest non-trivial cycles in directed graphs on surfaces. J. Comput. Geom. 7(1): 123-148 (2016) - [i18]Mark de Berg, Sergio Cabello, Otfried Cheong, David Eppstein, Christian Knauer:
Covering many points with a small-area box. CoRR abs/1612.02149 (2016) - 2015
- [j45]Sergio Cabello
Shortest paths in intersection graphs of unit disks. Comput. Geom. 48(4): 360-367 (2015) - [j44]Sergio Cabello
Simple PTAS's for families of graphs excluding a minor. Discret. Appl. Math. 189: 41-48 (2015) - [j43]Sergio Cabello
A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon. Discret. Math. Theor. Comput. Sci. 17(1): 1-12 (2015) - [j42]Sergio Cabello
Drawing a disconnected graph on the torus (Extended abstract). Electron. Notes Discret. Math. 49: 779-786 (2015) - [c34]Drago Bokal, Sergio Cabello
Finding All Maximal Subsequences with Hereditary Properties. SoCG 2015: 240-254 - [c33]Sergio Cabello
Semi-dynamic Connectivity in the Plane. WADS 2015: 115-126 - [c32]Sergio Cabello
Interval Selection in the Streaming Model. WADS 2015: 127-139 - [i17]Sergio Cabello, Pablo Pérez-Lantero:
Interval Selection in the Streaming Model. CoRR abs/1501.02285 (2015) - [i16]Sergio Cabello, Michael Kerber:
Semi-dynamic connectivity in the plane. CoRR abs/1502.03690 (2015) - 2014
- [j41]Sergio Cabello
Computing the Stretch of an Embedded Graph. SIAM J. Discret. Math. 28(3): 1391-1401 (2014) - [c31]Sergio Cabello
Peeling Potatoes Near-Optimally in Near-Linear Time. SoCG 2014: 224 - [i15]Sergio Cabello, Miha Jejcic:
Shortest Paths in Intersection Graphs of Unit Disks. CoRR abs/1402.4855 (2014) - [i14]Sergio Cabello, Otfried Cheong, Lena Schlipf:
Finding Largest Rectangles in Convex Polygons. CoRR abs/1405.1223 (2014) - [i13]Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell, Pavel Valtr:
Peeling potatoes near-optimally in near-linear time. CoRR abs/1406.1368 (2014) - [i12]Sergio Cabello, David Gajser:
Simple PTAS's for families of graphs excluding a minor. CoRR abs/1410.5778 (2014) - 2013
- [j40]Sergio Cabello
Covering a bichromatic point set with two disjoint monochromatic disks. Comput. Geom. 46(3): 203-212 (2013) - [j39]Sergio Cabello
Hardness of Approximation for Crossing Number. Discret. Comput. Geom. 49(2): 348-358 (2013) - [j38]Sergio Cabello
The Clique Problem in Ray Intersection Graphs. Discret. Comput. Geom. 50(3): 771-783 (2013) - [j37]Sergio Cabello, Erin W. Chambers
Multiple-Source Shortest Paths in Embedded Graphs. SIAM J. Comput. 42(4): 1542-1571 (2013) - [j36]Sergio Cabello
Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard. SIAM J. Comput. 42(5): 1803-1829 (2013) - [c30]Sergio Cabello, Panos Giannopoulos:
The complexity of separating points in the plane. SoCG 2013: 379-386 - [c29]Michael J. Bannister, Sergio Cabello
Parameterized Complexity of 1-Planarity. WADS 2013: 97-108 - [i11]Michael J. Bannister, Sergio Cabello, David Eppstein:
Parameterized Complexity of 1-Planarity. CoRR abs/1304.5591 (2013) - 2012
- [j35]Sergio Cabello
Many Distances in Planar Graphs. Algorithmica 62(1-2): 361-381 (2012) - [j34]Sergio Cabello
Algorithms for the edge-width of an embedded graph. Comput. Geom. 45(5-6): 215-224 (2012) - [j33]Sergey Bereg
The class cover problem with boxes. Comput. Geom. 45(7): 294-304 (2012) - [j32]Paul Bendich, Sergio Cabello
A point calculus for interlevel set homology. Pattern Recognit. Lett. 33(11): 1436-1444 (2012) - [c28]Sergio Cabello
The Clique Problem in Ray Intersection Graphs. ESA 2012: 241-252 - [c27]Oleksiy Busaryev, Sergio Cabello
Annotating Simplices with a Homology Basis and Its Applications. SWAT 2012: 189-200 - [i10]Sergio Cabello, Erin W. Chambers, Jeff Erickson:
Multiple-Source Shortest Paths in Embedded Graphs. CoRR abs/1202.0314 (2012) - [i9]Sergio Cabello, Bojan Mohar:
Adding one edge to planar graphs makes crossing number and 1-planarity hard. CoRR abs/1203.5944 (2012) - [i8]Sergio Cabello:
Hardness of approximation for crossing number. CoRR abs/1204.0660 (2012) - [i7]Sergio Cabello:
Stackelberg Shortest Path Tree Game, Revisited. CoRR abs/1207.2317 (2012) - 2011
- [j31]Sergio Cabello
Crossing Number and Weighted Crossing Number of Near-Planar Graphs. Algorithmica 60(3): 484-504 (2011) - [j30]Sergio Cabello, David Eppstein, Sandi Klavzar:
The Fibonacci Dimension of a Graph. Electron. J. Comb. 18(1) (2011) - [j29]Sergio Cabello, Primoz Luksic:
The Complexity of Obtaining a Distance-Balanced Graph. Electron. J. Comb. 18(1) (2011) - [j28]Sergio Cabello
On the b-chromatic number of regular graphs. Discret. Appl. Math. 159(13): 1303-1310 (2011) - [j27]Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann
Geometric Simultaneous Embeddings of a Graph and a Matching. J. Graph Algorithms Appl. 15(1): 79-96 (2011) - [j26]Sergio Cabello
Finding Cycles with Topological Properties in Embedded Graphs. SIAM J. Discret. Math. 25(4): 1600-1614 (2011) - [j25]Sergio Cabello
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. ACM Trans. Algorithms 7(4): 43:1-43:27 (2011) - [i6]Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer:
Minimum cell connection and separation in line segment arrangements. CoRR abs/1104.4618 (2011) - [i5]Oleksiy Busaryev, Sergio Cabello, Chao Chen, Tamal K. Dey, Yusu Wang:
Annotating Simplices with a Homology Basis and Its Applications. CoRR abs/1107.3793 (2011) - [i4]Sergio Cabello, Jean Cardinal, Stefan Langerman:
The Clique Problem in Ray Intersection Graphs. CoRR abs/1111.5986 (2011) - 2010
- [j24]Sergio Cabello
Algorithmic Aspects of Proportional Symbol Maps. Algorithmica 58(3): 543-565 (2010) - [j23]Oswin Aichholzer, Sergio Cabello
Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Discret. Math. Theor. Comput. Sci. 12(1): 75-86 (2010) - [j22]Sergio Cabello
Facility location problems in the plane based on reverse nearest neighbor queries. Eur. J. Oper. Res. 202(1): 99-106 (2010) - [j21]Kevin Buchin
Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. 14(2): 307-336 (2010) - [j20]Sergio Cabello
Obnoxious Centers in Graphs. SIAM J. Discret. Math. 24(4): 1713-1730 (2010) - [j19]Sergio Cabello
Finding shortest contractible and shortest separating cycles in embedded graphs. ACM Trans. Algorithms 6(2): 24:1-24:18 (2010) - [j18]Sergio Cabello
Finding one tight cycle. ACM Trans. Algorithms 6(4): 61:1-61:13 (2010) - [c26]Sergio Cabello
Adding one edge to planar graphs makes crossing number hard. SCG 2010: 68-76 - [c25]Sergio Cabello
Output-sensitive algorithm for the edge-width of an embedded graph. SCG 2010: 147-155 - [c24]Sergio Cabello
Finding shortest non-trivial cycles in directed graphs on surfaces. SCG 2010: 156-165
2000 – 2009
- 2009
- [j17]Sergio Cabello
Algorithms for graphs of bounded treewidth via orthogonal range searching. Comput. Geom. 42(9): 815-824 (2009) - [j16]Sergio Cabello
Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. Int. J. Comput. Geom. Appl. 19(6): 533-556 (2009) - [j15]Sergio Cabello
Higher-order Voronoi diagrams on triangulated surfaces. Inf. Process. Lett. 109(9): 440-445 (2009) - [j14]Mark de Berg, Sergio Cabello
Covering Many or Few Points with Unit Disks. Theory Comput. Syst. 45(3): 446-469 (2009) - [c23]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann
Detecting Hotspots in Geographic Networks. AGILE Conf. 2009: 217-231 - [c22]Sergio Cabello
Geometric Simultaneous Embeddings of a Graph and a Matching. GD 2009: 183-194 - [c21]Sergio Cabello:
Finding shortest contractible and shortest separating cycles in embedded graphs. SODA 2009: 616-624 - [i3]Sergio Cabello, David Eppstein, Sandi Klavzar:
The Fibonacci dimension of a graph. CoRR abs/0903.2507 (2009) - 2008
- [j13]Sergio Cabello
Matching point sets with respect to the Earth Mover's Distance. Comput. Geom. 39(2): 118-133 (2008) - [j12]Sergio Cabello
Covering point sets with two disjoint disks or squares. Comput. Geom. 40(3): 195-206 (2008) - [j11]Sergio Cabello
On the parameterized complexity of d-dimensional point set pattern matching. Inf. Process. Lett. 105(2): 73-77 (2008) - [c20]Sergio Cabello, Bojan Mohar:
Crossing and Weighted Crossing Number of Near-Planar Graphs. GD 2008: 38-49 - [c19]Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar:
Finding one tight cycle. SODA 2008: 527-531 - [c18]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. SODA 2008: 836-843 - 2007
- [j10]Sergio Cabello
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. Discret. Comput. Geom. 37(2): 213-235 (2007) - [j9]Sergio Cabello
Approximation algorithms for spreading points. J. Algorithms 62(2): 49-73 (2007) - [j8]Sergio Cabello
Planar Embeddings of Graphs with Specified Edge Lengths. J. Graph Algorithms Appl. 11(1): 259-276 (2007) - [c17]Sergio Cabello, Erin W. Chambers:
Multiple source shortest paths in a genus g graph. SODA 2007: 89-97 - [c16]Sergio Cabello, Günter Rote:
Obnoxious centers in graphs. SODA 2007: 98-107 - 2006
- [j7]Sergio Cabello, Matt DeVos, Bojan Mohar:
Expected Case for Projecting Points. Informatica (Slovenia) 30(3): 289-293 (2006) - [j6]Prosenjit Bose
Area-preserving approximations of polygonal paths. J. Discrete Algorithms 4(4): 554-566 (2006) - [j5]Sergio Cabello:
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. J. Graph Algorithms Appl. 10(2): 353-363 (2006) - [c15]Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann
Algorithmic Aspects of Proportional Symbol Maps. ESA 2006: 720-731 - [c14]Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir:
Computing a Center-Transversal Line. FSTTCS 2006: 93-104 - [c13]Sergio Cabello, Panos Giannopoulos, Christian Knauer:
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching. IWPEC 2006: 175-183 - [c12]Sergio Cabello:
Many distances in planar graphs. SODA 2006: 1213-1220 - [c11]Mark de Berg, Sergio Cabello, Sariel Har-Peled:
Covering Many or Few Points with Unit Disks. WAOA 2006: 55-68 - 2005
- [j4]Sergio Cabello
Schematization of networks. Comput. Geom. 30(3): 223-228 (2005) - [c10]Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura:
Reverse facility location problems. CCCG 2005: 68-71 - [c9]Sergio Cabello, Bojan Mohar:
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. ESA 2005: 131-142 - [c8]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching Point Sets with Respect to the Earth Mover's Distance. ESA 2005: 520-531 - [i2]Sergio Cabello, Bojan Mohar, Arjana Zitnik:
Homotopic spanners. EuroCG 2005: 25-28 - [i1]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching point sets with respect to the Earth mover's distance. EuroCG 2005: 57-60 - 2004
- [j3]Sergio Cabello
Testing Homotopy for Paths in the Plane. Discret. Comput. Geom. 31(1): 61-81 (2004) - [c7]Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp:
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion. SWAT 2004: 138-149 - [c6]Sergio Cabello:
Approximation Algorithms for Spreading Points. WAOA 2004: 83-96 - 2003
- [j2]Sergio Cabello
Approximation Algorithms for Aligning Points. Algorithmica 37(3): 211-232 (2003) - [c5]Sergio Cabello, Marc J. van Kreveld:
Approximation algorithms for aligning points. SCG 2003: 20-28 - [c4]Sergio Cabello, Erik D. Demaine, Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths. GD 2003: 283-294 - 2002
- [j1]Sergio Cabello, Carles Padró, Germán Sáez:
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. Des. Codes Cryptogr. 25(2): 175-188 (2002) - [c3]Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink:
Testing Homotopy for paths in the plane. SCG 2002: 160-169 - 2001
- [c2]Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk:
Schematization of road networks. SCG 2001: 33-39
1990 – 1999
- 1999
- [c1]Sergio Cabello, Carles Padró, Germán Sáez:
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. FCT 1999: 185-194
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 23:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: