![]() | ![]() |
| 2012 | ||
|---|---|---|
| 69 | Sergio Cabello: Many Distances in Planar Graphs. Algorithmica 62(1-2): 361-381 (2012) | |
| 68 | Sergio Cabello, Erin W. Chambers, Jeff Erickson: Multiple-Source Shortest Paths in Embedded Graphs CoRR abs/1202.0314: (2012) | |
| 67 | Sergio Cabello, Bojan Mohar: Adding one edge to planar graphs makes crossing number and 1-planarity hard CoRR abs/1203.5944: (2012) | |
| 66 | Sergio Cabello: Hardness of approximation for crossing number CoRR abs/1204.0660: (2012) | |
| 65 | Sergio Cabello, Éric Colin de Verdière, Francis Lazarus: Algorithms for the edge-width of an embedded graph. Comput. Geom. 45(5-6): 215-224 (2012) | |
| 64 | Sergey Bereg, Sergio Cabello, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura: The class cover problem with boxes. Comput. Geom. 45(7): 294-304 (2012) | |
| 2011 | ||
| 63 | Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote: Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. ACM Transactions on Algorithms 7(4): 43 (2011) | |
| 62 | Sergio Cabello, Bojan Mohar: Crossing Number and Weighted Crossing Number of Near-Planar Graphs. Algorithmica 60(3): 484-504 (2011) | |
| 61 | Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer: Minimum cell connection and separation in line segment arrangements CoRR abs/1104.4618: (2011) | |
| 60 | Oleksiy Busaryev, Sergio Cabello, Chao Chen, Tamal K. Dey, Yusu Wang: Annotating Simplices with a Homology Basis and Its Applications CoRR abs/1107.3793: (2011) | |
| 59 | Sergio Cabello, Jean Cardinal, Stefan Langerman: The Clique Problem in Ray Intersection Graphs CoRR abs/1111.5986: (2011) | |
| 58 | Sergio Cabello, Marko Jakovac: On the b-chromatic number of regular graphs. Discrete Applied Mathematics 159(13): 1303-1310 (2011) | |
| 57 | Sergio Cabello, Primoz Luksic: The Complexity of Obtaining a Distance-Balanced Graph. Electr. J. Comb. 18(1): (2011) | |
| 56 | Sergio Cabello, David Eppstein, Sandi Klavzar: The Fibonacci Dimension of a Graph. Electr. J. Comb. 18(1): (2011) | |
| 55 | Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek: Geometric Simultaneous Embeddings of a Graph and a Matching. J. Graph Algorithms Appl. 15(1): 79-96 (2011) | |
| 54 | Sergio Cabello, Éric Colin de Verdière, Francis Lazarus: Finding Cycles with Topological Properties in Embedded Graphs. SIAM J. Discrete Math. 25(4): 1600-1614 (2011) | |
| 2010 | ||
| 53 | Sergio Cabello, Éric Colin de Verdière, Francis Lazarus: Output-sensitive algorithm for the edge-width of an embedded graph. Symposium on Computational Geometry 2010: 147-155 | |
| 52 | Sergio Cabello, Éric Colin de Verdière, Francis Lazarus: Finding shortest non-trivial cycles in directed graphs on surfaces. Symposium on Computational Geometry 2010: 156-165 | |
| 51 | Sergio Cabello, Bojan Mohar: Adding one edge to planar graphs makes crossing number hard. Symposium on Computational Geometry 2010: 68-76 | |
| 50 | Sergio Cabello: Finding shortest contractible and shortest separating cycles in embedded graphs. ACM Transactions on Algorithms 6(2): (2010) | |
| 49 | Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar: Finding one tight cycle. ACM Transactions on Algorithms 6(4): (2010) | |
| 48 | Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann: Algorithmic Aspects of Proportional Symbol Maps. Algorithmica 58(3): 543-565 (2010) | |
| 47 | Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood: Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Discrete Mathematics & Theoretical Computer Science 12(1): 75-86 (2010) | |
| 46 | Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura: Facility location problems in the plane based on reverse nearest neighbor queries. European Journal of Operational Research 202(1): 99-106 (2010) | |
| 45 | Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle: Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. 14(2): 307-336 (2010) | |
| 44 | Sergio Cabello, Günter Rote: Obnoxious Centers in Graphs. SIAM J. Discrete Math. 24(4): 1713-1730 (2010) | |
| 2009 | ||
| 43 | Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle: Detecting Hotspots in Geographic Networks. AGILE Conf. 2009: 217-231 | |
| 42 | Sergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek: Geometric Simultaneous Embeddings of a Graph and a Matching. Graph Drawing 2009: 183-194 | |
| 41 | Sergio Cabello: Finding shortest contractible and shortest separating cycles in embedded graphs. SODA 2009: 616-624 | |
| 40 | Sergio Cabello, David Eppstein, Sandi Klavzar: The Fibonacci dimension of a graph CoRR abs/0903.2507: (2009) | |
| 39 | Sergio Cabello, Christian Knauer: Algorithms for graphs of bounded treewidth via orthogonal range searching. Comput. Geom. 42(9): 815-824 (2009) | |
| 38 | Sergio Cabello, Marta Fort, Joan Antoni Sellarès: Higher-order Voronoi diagrams on triangulated surfaces. Inf. Process. Lett. 109(9): 440-445 (2009) | |
| 37 | Sergio Cabello, Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp: Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. Int. J. Comput. Geometry Appl. 19(6): 533-556 (2009) | |
| 36 | Mark de Berg, Sergio Cabello, Sariel Har-Peled: Covering Many or Few Points with Unit Disks. Theory Comput. Syst. 45(3): 446-469 (2009) | |
| 2008 | ||
| 35 | Sergio Cabello, Bojan Mohar: Crossing and Weighted Crossing Number of Near-Planar Graphs. Graph Drawing 2008: 38-49 | |
| 34 | Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar: Finding one tight cycle. SODA 2008: 527-531 | |
| 33 | 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 | |
| 32 | 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) | |
| 31 | 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) | |
| 30 | 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 | ||
| 29 | Sergio Cabello, Erin W. Chambers: Multiple source shortest paths in a genus g graph. SODA 2007: 89-97 | |
| 28 | Sergio Cabello, Günter Rote: Obnoxious centers in graphs. SODA 2007: 98-107 | |
| 27 | Sergio Cabello, Bojan Mohar: Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs. Discrete & Computational Geometry 37(2): 213-235 (2007) | |
| 26 | Sergio Cabello: Approximation algorithms for spreading points. J. Algorithms 62(2): 49-73 (2007) | |
| 25 | 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 | ||
| 24 | Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann: Algorithmic Aspects of Proportional Symbol Maps. ESA 2006: 720-731 | |
| 23 | Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir: Computing a Center-Transversal Line. FSTTCS 2006: 93-104 | |
| 22 | Sergio Cabello, Panos Giannopoulos, Christian Knauer: On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching. IWPEC 2006: 175-183 | |
| 21 | Sergio Cabello: Many distances in planar graphs. SODA 2006: 1213-1220 | |
| 20 | Mark de Berg, Sergio Cabello, Sariel Har-Peled: Covering Many or Few Points with Unit Disks. WAOA 2006: 55-68 | |
| 19 | Sergio Cabello, Matt DeVos, Bojan Mohar: Expected Case for Projecting Points. Informatica (Slovenia) 30(3): 289-293 (2006) | |
| 18 | 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) | |
| 17 | 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 | ||
| 16 | Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura: Reverse facility location problems. CCCG 2005: 68-71 | |
| 15 | Sergio Cabello, Bojan Mohar: Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs. ESA 2005: 131-142 | |
| 14 | Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote: Matching Point Sets with Respect to the Earth Mover's Distance. ESA 2005: 520-531 | |
| 13 | Sergio Cabello, Bojan Mohar, Arjana Zitnik: Homotopic spanners. EuroCG 2005: 25-28 | |
| 12 | Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote: Matching point sets with respect to the Earth mover's distance. EuroCG 2005: 57-60 | |
| 11 | Sergio Cabello, Mark de Berg, Marc J. van Kreveld: Schematization of networks. Comput. Geom. 30(3): 223-228 (2005) | |
| 2004 | ||
| 10 | 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 | Sergio Cabello: Approximation Algorithms for Spreading Points. WAOA 2004: 83-96 | |
| 8 | 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 | Sergio Cabello, Erik D. Demaine, Günter Rote: Planar Embeddings of Graphs with Specified Edge Lengths. Graph Drawing 2003: 283-294 | |
| 6 | Sergio Cabello, Marc J. van Kreveld: Approximation algorithms for aligning points. Symposium on Computational Geometry 2003: 20-28 | |
| 5 | Sergio Cabello, Marc J. van Kreveld: Approximation Algorithms for Aligning Points. Algorithmica 37(3): 211-232 (2003) | |
| 2002 | ||
| 4 | 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 | 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 | Sergio Cabello, Carles Padró, Germán Sáez: Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. FCT 1999: 185-194 | |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page