2009 |
34 | EE | Sergio Cabello:
Finding shortest contractible and shortest separating cycles in embedded graphs.
SODA 2009: 616-624 |
33 | EE | Sergio Cabello,
David Eppstein,
Sandi Klavzar:
The Fibonacci dimension of a graph
CoRR abs/0903.2507: (2009) |
2008 |
32 | EE | Sergio Cabello,
Bojan Mohar:
Crossing and Weighted Crossing Number of Near-Planar Graphs.
Graph Drawing 2008: 38-49 |
31 | EE | Sergio Cabello,
Matt DeVos,
Jeff Erickson,
Bojan Mohar:
Finding one tight cycle.
SODA 2008: 527-531 |
30 | EE | 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 |
29 | EE | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer,
Günter Rote:
Matching point sets with respect to the Earth Mover's Distance.
Comput. Geom. 39(2): 118-133 (2008) |
28 | EE | Sergio Cabello,
José Miguel Díaz-Báñez,
Carlos Seara,
Joan Antoni Sellarès,
Jorge Urrutia,
Inmaculada Ventura:
Covering point sets with two disjoint disks or squares.
Comput. Geom. 40(3): 195-206 (2008) |
27 | EE | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer:
On the parameterized complexity of d-dimensional point set pattern matching.
Inf. Process. Lett. 105(2): 73-77 (2008) |
2007 |
26 | EE | Sergio Cabello,
Erin W. Chambers:
Multiple source shortest paths in a genus g graph.
SODA 2007: 89-97 |
25 | EE | Sergio Cabello,
Günter Rote:
Obnoxious centers in graphs.
SODA 2007: 98-107 |
24 | EE | Sergio Cabello,
Bojan Mohar:
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs.
Discrete & Computational Geometry 37(2): 213-235 (2007) |
23 | EE | Sergio Cabello:
Approximation algorithms for spreading points.
J. Algorithms 62(2): 49-73 (2007) |
22 | EE | Sergio Cabello,
Erik D. Demaine,
Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths.
J. Graph Algorithms Appl. 11(1): 259-276 (2007) |
2006 |
21 | EE | Sergio Cabello,
Herman J. Haverkort,
Marc J. van Kreveld,
Bettina Speckmann:
Algorithmic Aspects of Proportional Symbol Maps.
ESA 2006: 720-731 |
20 | EE | Pankaj K. Agarwal,
Sergio Cabello,
Joan Antoni Sellarès,
Micha Sharir:
Computing a Center-Transversal Line.
FSTTCS 2006: 93-104 |
19 | EE | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer:
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching.
IWPEC 2006: 175-183 |
18 | EE | Sergio Cabello:
Many distances in planar graphs.
SODA 2006: 1213-1220 |
17 | EE | Mark de Berg,
Sergio Cabello,
Sariel Har-Peled:
Covering Many or Few Points with Unit Disks.
WAOA 2006: 55-68 |
16 | EE | Prosenjit Bose,
Sergio Cabello,
Otfried Cheong,
Joachim Gudmundsson,
Marc J. van Kreveld,
Bettina Speckmann:
Area-preserving approximations of polygonal paths.
J. Discrete Algorithms 4(4): 554-566 (2006) |
15 | EE | 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) |
2005 |
14 | EE | Sergio Cabello,
José Miguel Díaz-Báñez,
Stefan Langerman,
Carlos Seara,
Inmaculada Ventura:
Reverse facility location problems.
CCCG 2005: 68-71 |
13 | EE | Sergio Cabello,
Bojan Mohar:
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs.
ESA 2005: 131-142 |
12 | EE | Sergio Cabello,
Panos Giannopoulos,
Christian Knauer,
Günter Rote:
Matching Point Sets with Respect to the Earth Mover's Distance.
ESA 2005: 520-531 |
11 | EE | Sergio Cabello,
Mark de Berg,
Marc J. van Kreveld:
Schematization of networks.
Comput. Geom. 30(3): 223-228 (2005) |
2004 |
10 | EE | 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 |
9 | EE | Sergio Cabello:
Approximation Algorithms for Spreading Points.
WAOA 2004: 83-96 |
8 | EE | Sergio Cabello,
Yuanxin Liu,
Andrea Mantler,
Jack Snoeyink:
Testing Homotopy for Paths in the Plane.
Discrete & Computational Geometry 31(1): 61-81 (2004) |
2003 |
7 | EE | Sergio Cabello,
Erik D. Demaine,
Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths.
Graph Drawing 2003: 283-294 |
6 | EE | Sergio Cabello,
Marc J. van Kreveld:
Approximation algorithms for aligning points.
Symposium on Computational Geometry 2003: 20-28 |
5 | EE | Sergio Cabello,
Marc J. van Kreveld:
Approximation Algorithms for Aligning Points.
Algorithmica 37(3): 211-232 (2003) |
2002 |
4 | EE | Sergio Cabello,
Yuanxin Liu,
Andrea Mantler,
Jack Snoeyink:
Testing Homotopy for paths in the plane.
Symposium on Computational Geometry 2002: 160-169 |
3 | | Sergio Cabello,
Carles Padró,
Germán Sáez:
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure.
Des. Codes Cryptography 25(2): 175-188 (2002) |
2001 |
2 | EE | Sergio Cabello,
Mark de Berg,
Steven van Dijk,
Marc J. van Kreveld,
Tycho Strijk:
Schematization of road networks.
Symposium on Computational Geometry 2001: 33-39 |
1999 |
1 | EE | Sergio Cabello,
Carles Padró,
Germán Sáez:
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure.
FCT 1999: 185-194 |