Sergio Cabello
Título
Citado por
Citado por
Año
Schematization of networks
S Cabello, M de Berg, M van Kreveld
Computational Geometry 30 (3), 223-238, 2005
108*2005
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
S Cabello
Utrecht University: Information and Computing Sciences, 2003
962003
Facility location problems in the plane based on reverse nearest neighbor queries
S Cabello, JM Díaz-Báñez, S Langerman, C Seara, I Ventura
European Journal of Operational Research 202 (1), 99-106, 2010
94*2010
Multiple-source shortest paths in embedded graphs
S Cabello, EW Chambers, J Erickson
SIAM Journal on Computing 42 (4), 1542-1571, 2013
90*2013
Adding one edge to planar graphs makes crossing number and 1-planarity hard
S Cabello, B Mohar
SIAM Journal on Computing 42 (5), 1803-1829, 2013
79*2013
Testing homotopy for paths in the plane
S Cabello, Y Liu, A Mantler, J Snoeyink
Discrete & Computational Geometry 31 (1), 61-81, 2004
792004
Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
S Cabello, B Mohar
Discrete & Computational Geometry 37 (2), 213-235, 2007
732007
Secret sharing schemes with detection of cheaters for a general access structure
S Cabello, C Padró, G Sáez
Designs, Codes and Cryptography 25 (2), 175-188, 2002
692002
Many distances in planar graphs
S Cabello
Algorithmica 62 (1-2), 361-381, 2012
572012
On the b-chromatic number of regular graphs
S Cabello, M Jakovac
Discrete Applied Mathematics 159 (13), 1303-1310, 2011
492011
Matching point sets with respect to the Earth Mover's Distance
S Cabello, P Giannopoulos, C Knauer, G Rote
Computational Geometry 39 (2), 118-133, 2008
452008
Planar embeddings of graphs with specified edge lengths
S Cabello, ED Demaine, G Rote
Journal of Graph Algorithms and Applications 11, 259--276, 2007
45*2007
Area-preserving approximations of polygonal paths
P Bose, S Cabello, O Cheong, J Gudmundsson, M Van Kreveld, ...
Journal of Discrete Algorithms 4 (4), 554-566, 2006
442006
Crossing number and weighted crossing number of near-planar graphs
S Cabello, B Mohar
Algorithmica 60 (3), 484-504, 2011
42*2011
Algorithmic aspects of proportional symbol maps
S Cabello, H Haverkort, M van Kreveld, B Speckmann
Algorithmica 58 (3), 543-565, 2010
42*2010
Annotating simplices with a homology basis and its applications
O Busaryev, S Cabello, C Chen, TK Dey, Y Wang
Scandinavian workshop on algorithm theory, 189-200, 2012
402012
Edge-removal and non-crossing configurations in geometric graphs
O Aichholzer, S Cabello, R Fabila Monroy, D Flores Peñaloza, T Hackl, ...
Discrete mathematics and theoretical computer science 12 (1), 75-86, 2010
382010
Finding shortest non-trivial cycles in directed graphs on surfaces
S Cabello, ÉC de Verdière, F Lazarus
Journal of Computational Geometry 7 (1), 123-148, 2016
35*2016
Parameterized complexity of 1-planarity
MJ Bannister, S Cabello, D Eppstein
Workshop on Algorithms and Data Structures, 97-108, 2013
352013
Covering many or few points with unit disks
M de Berg, S Cabello, S Har-Peled
Theory of Computing Systems 45 (3), 446-469, 2009
322009
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20