|
Search the dblp DataBase
Sergio Cabello:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura
Reverse facility location problems. [Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:68-71 [Conf]
- Sergio Cabello, Mark de Berg, Steven van Dijk, Marc J. van Kreveld, Tycho Strijk
Schematization of road networks. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2001, pp:33-39 [Conf]
- Sergio Cabello, Marc J. van Kreveld
Approximation algorithms for aligning points. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2003, pp:20-28 [Conf]
- Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink
Testing Homotopy for paths in the plane. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2002, pp:160-169 [Conf]
- Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
Matching Point Sets with Respect to the Earth Mover's Distance. [Citation Graph (0, 0)][DBLP] ESA, 2005, pp:520-531 [Conf]
- Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann
Algorithmic Aspects of Proportional Symbol Maps. [Citation Graph (0, 0)][DBLP] ESA, 2006, pp:720-731 [Conf]
- Sergio Cabello, Bojan Mohar
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. [Citation Graph (0, 0)][DBLP] ESA, 2005, pp:131-142 [Conf]
- Sergio Cabello, Carles Padró, Germán Sáez
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. [Citation Graph (0, 0)][DBLP] FCT, 1999, pp:185-194 [Conf]
- Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir
Computing a Center-Transversal Line. [Citation Graph (0, 0)][DBLP] FSTTCS, 2006, pp:93-104 [Conf]
- Sergio Cabello, Erik D. Demaine, Günter Rote
Planar Embeddings of Graphs with Specified Edge Lengths. [Citation Graph (0, 0)][DBLP] Graph Drawing, 2003, pp:283-294 [Conf]
- Sergio Cabello, Panos Giannopoulos, Christian Knauer
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching. [Citation Graph (0, 0)][DBLP] IWPEC, 2006, pp:175-183 [Conf]
- Sergio Cabello
Many distances in planar graphs. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:1213-1220 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] SWAT, 2004, pp:138-149 [Conf]
- Mark de Berg, Sergio Cabello, Sariel Har-Peled
Covering Many or Few Points with Unit Disks. [Citation Graph (0, 0)][DBLP] WAOA, 2006, pp:55-68 [Conf]
- Sergio Cabello
Approximation Algorithms for Spreading Points. [Citation Graph (0, 0)][DBLP] WAOA, 2004, pp:83-96 [Conf]
- Sergio Cabello, Marc J. van Kreveld
Approximation Algorithms for Aligning Points. [Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:37, n:3, pp:211-232 [Journal]
- Sergio Cabello, Mark de Berg, Marc J. van Kreveld
Schematization of networks. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2005, v:30, n:3, pp:223-228 [Journal]
- Sergio Cabello, Carles Padró, Germán Sáez
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2002, v:25, n:2, pp:175-188 [Journal]
- Sergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink
Testing Homotopy for Paths in the Plane. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2004, v:31, n:1, pp:61-81 [Journal]
- Sergio Cabello
Approximation algorithms for spreading points. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2007, v:62, n:2, pp:49-73 [Journal]
- Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc J. van Kreveld, Bettina Speckmann
Area-preserving approximations of polygonal paths. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2006, v:4, n:4, pp:554-566 [Journal]
- Sergio Cabello, Erin W. Chambers
Multiple source shortest paths in a genus g graph. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:89-97 [Conf]
- Sergio Cabello, Günter Rote
Obnoxious centers in graphs. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:98-107 [Conf]
- Sergio Cabello, Bojan Mohar
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2007, v:37, n:2, pp:213-235 [Journal]
Adding one edge to planar graphs makes crossing number hard. [Citation Graph (, )][DBLP]
Output-sensitive algorithm for the edge-width of an embedded graph. [Citation Graph (, )][DBLP]
Finding shortest non-trivial cycles in directed graphs on surfaces. [Citation Graph (, )][DBLP]
Matching point sets with respect to the Earth mover's distance. [Citation Graph (, )][DBLP]
Homotopic spanners. [Citation Graph (, )][DBLP]
Geometric Simultaneous Embeddings of a Graph and a Matching. [Citation Graph (, )][DBLP]
Crossing and Weighted Crossing Number of Near-Planar Graphs. [Citation Graph (, )][DBLP]
Finding one tight cycle. [Citation Graph (, )][DBLP]
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. [Citation Graph (, )][DBLP]
Finding shortest contractible and shortest separating cycles in embedded graphs. [Citation Graph (, )][DBLP]
Detecting Hotspots in Geographic Networks. [Citation Graph (, )][DBLP]
Matching point sets with respect to the Earth Mover's Distance. [Citation Graph (, )][DBLP]
Covering point sets with two disjoint disks or squares. [Citation Graph (, )][DBLP]
Algorithms for graphs of bounded treewidth via orthogonal range searching. [Citation Graph (, )][DBLP]
The Fibonacci dimension of a graph [Citation Graph (, )][DBLP]
Search in 0.017secs, Finished in 0.019secs
|