The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sergio Cabello: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. Sergio Cabello
    Many distances in planar graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1213-1220 [Conf]
  13. 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]
  14. 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]
  15. Sergio Cabello
    Approximation Algorithms for Spreading Points. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:83-96 [Conf]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. Sergio Cabello
    Approximation algorithms for spreading points. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2007, v:62, n:2, pp:49-73 [Journal]
  21. 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]
  22. 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]
  23. Sergio Cabello, Günter Rote
    Obnoxious centers in graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:98-107 [Conf]
  24. 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]

  25. Adding one edge to planar graphs makes crossing number hard. [Citation Graph (, )][DBLP]


  26. Output-sensitive algorithm for the edge-width of an embedded graph. [Citation Graph (, )][DBLP]


  27. Finding shortest non-trivial cycles in directed graphs on surfaces. [Citation Graph (, )][DBLP]


  28. Matching point sets with respect to the Earth mover's distance. [Citation Graph (, )][DBLP]


  29. Homotopic spanners. [Citation Graph (, )][DBLP]


  30. Geometric Simultaneous Embeddings of a Graph and a Matching. [Citation Graph (, )][DBLP]


  31. Crossing and Weighted Crossing Number of Near-Planar Graphs. [Citation Graph (, )][DBLP]


  32. Finding one tight cycle. [Citation Graph (, )][DBLP]


  33. Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. [Citation Graph (, )][DBLP]


  34. Finding shortest contractible and shortest separating cycles in embedded graphs. [Citation Graph (, )][DBLP]


  35. Detecting Hotspots in Geographic Networks. [Citation Graph (, )][DBLP]


  36. Matching point sets with respect to the Earth Mover's Distance. [Citation Graph (, )][DBLP]


  37. Covering point sets with two disjoint disks or squares. [Citation Graph (, )][DBLP]


  38. Algorithms for graphs of bounded treewidth via orthogonal range searching. [Citation Graph (, )][DBLP]


  39. The Fibonacci dimension of a graph [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002