dblp.uni-trier.dewww.uni-trier.de

Sergio Cabello

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
34EESergio Cabello: Finding shortest contractible and shortest separating cycles in embedded graphs. SODA 2009: 616-624
33EESergio Cabello, David Eppstein, Sandi Klavzar: The Fibonacci dimension of a graph CoRR abs/0903.2507: (2009)
2008
32EESergio Cabello, Bojan Mohar: Crossing and Weighted Crossing Number of Near-Planar Graphs. Graph Drawing 2008: 38-49
31EESergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar: Finding one tight cycle. SODA 2008: 527-531
30EESergio 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
29EESergio 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)
28EESergio 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)
27EESergio 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
26EESergio Cabello, Erin W. Chambers: Multiple source shortest paths in a genus g graph. SODA 2007: 89-97
25EESergio Cabello, Günter Rote: Obnoxious centers in graphs. SODA 2007: 98-107
24EESergio Cabello, Bojan Mohar: Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. Discrete & Computational Geometry 37(2): 213-235 (2007)
23EESergio Cabello: Approximation algorithms for spreading points. J. Algorithms 62(2): 49-73 (2007)
22EESergio 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
21EESergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann: Algorithmic Aspects of Proportional Symbol Maps. ESA 2006: 720-731
20EEPankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir: Computing a Center-Transversal Line. FSTTCS 2006: 93-104
19EESergio Cabello, Panos Giannopoulos, Christian Knauer: On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching. IWPEC 2006: 175-183
18EESergio Cabello: Many distances in planar graphs. SODA 2006: 1213-1220
17EEMark de Berg, Sergio Cabello, Sariel Har-Peled: Covering Many or Few Points with Unit Disks. WAOA 2006: 55-68
16EEProsenjit 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)
15EESergio 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
14EESergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura: Reverse facility location problems. CCCG 2005: 68-71
13EESergio Cabello, Bojan Mohar: Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. ESA 2005: 131-142
12EESergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote: Matching Point Sets with Respect to the Earth Mover's Distance. ESA 2005: 520-531
11EESergio Cabello, Mark de Berg, Marc J. van Kreveld: Schematization of networks. Comput. Geom. 30(3): 223-228 (2005)
2004
10EEMark 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
9EESergio Cabello: Approximation Algorithms for Spreading Points. WAOA 2004: 83-96
8EESergio Cabello, Yuanxin Liu, Andrea Mantler, Jack Snoeyink: Testing Homotopy for Paths in the Plane. Discrete & Computational Geometry 31(1): 61-81 (2004)
2003
7EESergio Cabello, Erik D. Demaine, Günter Rote: Planar Embeddings of Graphs with Specified Edge Lengths. Graph Drawing 2003: 283-294
6EESergio Cabello, Marc J. van Kreveld: Approximation algorithms for aligning points. Symposium on Computational Geometry 2003: 20-28
5EESergio Cabello, Marc J. van Kreveld: Approximation Algorithms for Aligning Points. Algorithmica 37(3): 211-232 (2003)
2002
4EESergio 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
2EESergio 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
1EESergio 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

1Pankaj K. Agarwal [20]
2Mark de Berg [2] [10] [11] [17]
3Prosenjit Bose [16]
4Erin W. Chambers [26]
5Otfried Cheong (Otfried Schwarzkopf) [16]
6Matt DeVos [31]
7Erik D. Demaine [7] [22]
8José Miguel Díaz-Báñez [14] [28]
9Steven van Dijk [2]
10David Eppstein [33]
11Jeff Erickson [31]
12Panos Giannopoulos [10] [12] [19] [27] [29] [30]
13Joachim Gudmundsson [16]
14Sariel Har-Peled [17]
15Herman J. Haverkort [21]
16Sandi Klavzar [33]
17Christian Knauer [10] [12] [19] [27] [29] [30]
18Marc J. van Kreveld [2] [5] [6] [11] [16] [21]
19Stefan Langerman [14]
20Yuanxin Liu [4] [8]
21Andrea Mantler [4] [8]
22Bojan Mohar [13] [24] [31] [32]
23René van Oostrum [10]
24Carles Padró [1] [3]
25Günter Rote [7] [12] [22] [25] [29] [30]
26Germán Sáez [1] [3]
27Carlos Seara [14] [28]
28Joan Antoni Sellarès [20] [28]
29Micha Sharir [20]
30Jack Snoeyink [4] [8]
31Bettina Speckmann [16] [21]
32Tycho Strijk [2]
33Jorge Urrutia [28]
34Remco C. Veltkamp [10]
35Inmaculada Ventura [14] [28]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)