Preprinti IMFM

Avtor: Sergio Cabello

1180: Sergio Cabello: Stackelberg Shortest Path Tree Game, Revisited, 50 (2012)

1172: Sergio Cabello, Bojan Mohar: Adding one edge to planar graphs makes crossing number and 1-planarity hard, 50 (2012)

1170: Sergio Cabello, Erin Wolf Chambers, Jeff Erickson: Multiple-Source Shortest Paths in Embedded Graphs, 50 (2012)

1152: Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer: Minimum cell connection and separation in line segment arrangements, 49 (2011)

1138: Sergio Cabello, J. Miguel Díaz-Báñez, P. Pérez-Lantero: Covering a bichromatic point set with two disjoint monochromatic disks, 49 (2011)

1137: Paul Bendich, Sergio Cabello, Herbert Edelsbrunner: A point calculus for interlevel set homology, 49 (2011)

1132: Francis Lazarus, Éric Colin de Verdière, Sergio Cabello: Finding cycles with topological properties in embedded graphs, 48 (2010)

1131: Marko Jakovac, Sergio Cabello: On the b-chromatic number of regular graphs, 48 (2010)

1127: Inma Ventura, Carlos Seara, P. Pérez-Lantero, J. Miguel Díaz-Báñez, Sergio Cabello, Sergey Bereg: The class cover problem with boxes, 48 (2010)

1125: Francis Lazarus, Éric Colin de Verdière, Sergio Cabello: Algorithms for the edge-width of an embedded graph, 48 (2010)

1122: Sergio Cabello, Primož Lukšič: The complexity of obtaining a distance-balanced graph, 48 (2010)

1106: Sergio Cabello, Marc van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek: Geometric simultaneous embeddings of a graph and a matching, 47 (2009)

1101: 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, 47 (2009)

1089: Sergio Cabello: Many distances in planar graphs, 47 (2009)

1084: Sergio Cabello, David Eppstein, Sandi Klavžar: The Fibonacci dimension of a graph, 47 (2009)

1068: Sergio Cabello, Bojan Mohar: Crossing and weighted crossing number of near-planar graphs, 47 (2009)

1063: Sergio Cabello: Finding shortest contractible and shortest separating cycles in embedded graphs, 46 (2008)

1057: 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, 46 (2008)

1056: Sergio Cabello, Marta Fort, J. Antoni Sellarès: Higher-order Voronoi diagrams on triangulated surfaces, 46 (2008)

1052: Oswin Aichholzer, Sergio Cabello, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David Richard Wood: Edge-removal and non-crossing configurations in geometric graphs, 46 (2008)

1048: Sergio Cabello, Günter Rote: Obnoxious Centers in Graphs, 46 (2008)

1047: Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar: Finding one tight cycle, 46 (2008)

1042: Sergio Cabello, Herman Haverkort, Marc van Kreveld, Bettina Speckmann: Algorithmic aspects of proportional symbol maps, 46 (2008)

1039: Sergio Cabello, Christian Knauer: Algorithms for graphs of bounded treewidth via orthogonal range searching, 46 (2008)

1027: Sergio Cabello, J. Miguel Díaz-Báñez, Carlos Seara, J. Antoni Sellarès, Jorge Urrutia, Inma Ventura: Covering point sets with two disjoint disks or squares, 45 (2007)

1026: Mark de Berg, Sergio Cabello, Sariel Har-Peled: Covering many or few points with unit disks, 44 (2006)

1019: 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, 44 (2006)

1018: Sergio Cabello, Panos Giannopoulos, Christian Knauer: On the parameterized complexity of d-dimensional point set pattern matching, 44 (2006)

1015: Pankaj K. Agarwal , Sergio Cabello, J. Antoni Sellarès, Micha Sharir: Computing a center-transversal line, 44 (2006)

1003: Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote: Matching point sets with respect to the Earth Mover's distance, 44 (2006)

1002: Sergio Cabello, J. Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inma Ventura: Reverse facility location problems, 44 (2006)

993: Sergio Cabello, Bojan Mohar: Finding shortest non-separating and non-contractible cycles for topologically embedded graphs, 43 (2005)

986: Sergio Cabello, Erik D. Demaine, Günter Rote: Planar embeddings of graphs with specified edge lengths, 43 (2005)

966: Sergio Cabello, Matt DeVos, Bojan Mohar: Expected case for projecting points, 43 (2005)

942: Prosenjit Bose, Sergio Cabello, Otfried Cheong, Joachim Gudmundsson, Marc van Kreveld, Bettina Speckmann: Area-preserving approximations of polygonal paths, 42 (2004)