Cabello, Sergio - Department of Mathematics, University of Ljubljana

• Expected case for projecting points Sergio Cabello
• Testing Homotopy for Paths in the Plane Sergio Cabello
• Schematization of Road Networks Sergio Cabello
• Introduction Visualization of data is a basic and important topic; it helps to analyze or
• Algorithms for the Edge-Width of an Embedded Graph Sergio Cabello Eric Colin de Verdi`ere
• Higher-Order Voronoi Diagrams on Triangulated Surfaces Sergio Cabello
• Approximation Algorithms for Spreading Points
• A Point Calculus for Interlevel Set Homology Paul Bendich
• Crossing and weighted crossing number of near-planar graphs Sergio Cabello
• Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension
• On the parameterized complexity of d-dimensional point set pattern matching
• Geometric Simultaneous Embeddings of a Graph and a Matching Sergio Cabello Marc van Kreveld Giuseppe Liotta Henk Meijer
• Computing a Center-Transversal Line Pankaj K. Agarwal 1
• Covering a Bichromatic Point Set with Two Disjoint Monochromatic Disks
• On the b-chromatic number of regular graphs Sergio Cabello
• The Class Cover Problem with Boxes S. Cabello
• The Fibonacci dimension of a graph Sergio Cabello
• Finding the Most Relevant Fragments in Networks Kevin Buchin
• Finding shortest contractible and shortest separating cycles in embedded graphs
• Algorithmic Aspects of Proportional Symbol Maps Sergio Cabello1,
• Many distances in planar graphs Sergio Cabello
• Geometric Problems in Cartographic Networks
• Maximizing the Area of Overlap of two Unions of Disks under Rigid Motion
• The Fibonacci dimension of a graph Sergio Cabello
• Algorithms for graphs of bounded treewidth via orthogonal range searching
• Planar Embeddings of Graphs with Specified Edge Lengths
• The complexity of obtaining a distance-balanced graph Sergio Cabello
• Matching Point Sets with respect to the Earth Mover's Distance Sergio Cabello
• Finding cycles with topological properties in embedded graphs Sergio Cabello Eric Colin de Verdi`ere
• Finding one tight cycle Sergio Cabello 1
• Homotopic Spanners Sergio Cabello
• Approximation Algorithms for Aligning Sergio Cabello
• The complexity of obtaining a distance-balanced graph Sergio Cabello
• Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
• Schematization of Networks Sergio Cabello
• Area-Preserving Approximations of Polygonal Paths Prosenjit Bose1 Sergio Cabello2 Otfried Cheong3 Joachim Gudmundsson4
• The Class Cover Problem with Boxes J. M. Diaz-Ba~nez