The following pages link to Sergio Cabello (Q262252):
Displaying 50 items.
- The complexity of separating points in the plane (Q262254) (← links)
- Drawing a disconnected graph on the torus (extended abstract) (Q324371) (← links)
- The clique problem in ray intersection graphs (Q377488) (← links)
- Algorithms for the edge-width of an embedded graph (Q419374) (← links)
- The class cover problem with boxes (Q419500) (← links)
- The complexity of obtaining a distance-balanced graph (Q540027) (← links)
- The Fibonacci dimension of a graph (Q540035) (← links)
- Crossing number and weighted crossing number of near-planar graphs (Q548655) (← links)
- Minimum cuts in geometric intersection graphs (Q827339) (← links)
- Finding a largest-area triangle in a terrain in near-linear time (Q832865) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Area-preserving approximations of polygonal paths (Q866543) (← links)
- Finding shortest non-separating and non-contractible cycles for topologically embedded graphs (Q878074) (← links)
- Finding largest rectangles in convex polygons (Q902427) (← links)
- (Q987782) (redirect page) (← links)
- Higher-order Voronoi diagrams on triangulated surfaces (Q987784) (← links)
- Facility location problems in the plane based on reverse nearest neighbor queries (Q1038383) (← links)
- Testing homotopy for paths in the plane (Q1424318) (← links)
- Secret sharing schemes with detection of cheaters for a general access structure (Q1598871) (← links)
- Two optimization problems for unit disks (Q1615636) (← links)
- Interval selection in the streaming model (Q1676325) (← links)
- Schematization of networks (Q1776896) (← links)
- Approximation algorithms for aligning points (Q1879366) (← links)
- Covering a bichromatic point set with two disjoint monochromatic disks (Q1931262) (← links)
- Hardness of approximation for crossing number (Q1943651) (← links)
- Algorithmic aspects of proportional symbol maps (Q1957642) (← links)
- The inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
- The complexity of mixed-connectivity (Q2070706) (← links)
- The inverse Kakeya problem (Q2077897) (← links)
- Computing Shapley values in the plane (Q2118220) (← links)
- Hardness of minimum barrier shrinkage and minimum installation path (Q2192386) (← links)
- On the \(b\)-chromatic number of regular graphs (Q2275938) (← links)
- Shortest paths in intersection graphs of unit disks (Q2344058) (← links)
- Simple PTAS's for families of graphs excluding a minor (Q2352263) (← links)
- On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
- Matching point sets with respect to the earth mover's distance (Q2462736) (← links)
- The inverse Voronoi problem in graphs. II: Trees (Q2663704) (← links)
- The reverse Kakeya problem (Q2664125) (← links)
- Parameterized Complexity of 1-Planarity (Q2842148) (← links)
- Multiple-Source Shortest Paths in Embedded Graphs (Q2862202) (← links)
- Annotating Simplices with a Homology Basis and Its Applications (Q2904555) (← links)
- The Clique Problem in Ray Intersection Graphs (Q2912845) (← links)
- Finding shortest contractible and shortest separating cycles in embedded graphs (Q2930300) (← links)
- Finding one tight cycle (Q2930343) (← links)
- (Q2934586) (← links)
- (Q2934587) (← links)
- Computing the Stretch of an Embedded Graph (Q2935274) (← links)
- (Q2943937) (← links)
- Finding shortest non-trivial cycles in directed graphs on surfaces (Q2970447) (← links)
