The following pages link to Maria Saumell (Q390115):
Displaying 38 items.
- Making triangulations 4-connected using flips (Q390117) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- On the number of higher order Delaunay triangulations (Q551184) (← links)
- On crossing numbers of geometric proximity graphs (Q632725) (← links)
- Minimal obstructions for partial representations of interval graphs (Q668026) (← links)
- Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs (Q691765) (← links)
- Non-crossing matchings of points with geometric objects (Q714905) (← links)
- Optimally bracing grid frameworks with holes (Q896115) (← links)
- The dual diameter of triangulations (Q1699295) (← links)
- Colored ray configurations (Q1699300) (← links)
- Stabbing circles for sets of segments in the plane (Q1742369) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- Bichromatic 2-center of pairs of points (Q2261579) (← links)
- Geometric biplane graphs. I: Maximal graphs (Q2345511) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
- 10-Gabriel graphs are Hamiltonian (Q2353639) (← links)
- On Voronoi visibility maps of 1.5D terrains with multiple viewpoints (Q2681407) (← links)
- Minimum color spanning circle in imprecise setup (Q2695293) (← links)
- Stabbing Circles for Sets of Segments in the Plane (Q2802948) (← links)
- Terrain Visibility with Multiple Viewpoints (Q2872096) (← links)
- Bichromatic 2-Center of Pairs of Points (Q2894450) (← links)
- Column Planarity and Partial Simultaneous Geometric Embedding (Q2936932) (← links)
- Optimally Bracing Grid Frameworks with Holes (Q2942420) (← links)
- Minimal Obstructions for Partial Representations of Interval Graphs (Q2942647) (← links)
- Matching Points with Things (Q3557040) (← links)
- On the Number of Higher Order Delaunay Triangulations (Q3563004) (← links)
- Peeling Potatoes Near-Optimally in Near-Linear Time (Q4635546) (← links)
- (Q5173165) (← links)
- FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR (Q5247062) (← links)
- TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS (Q5261016) (← links)
- PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (Q5300005) (← links)
- IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION (Q5300011) (← links)
- Proximity graphs inside large weighted graphs (Q5326777) (← links)
- Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) (← links)
- A median-type condition for graph tiling (Q5915833) (← links)
- Hamiltonicity for convex shape Delaunay and Gabriel graphs (Q5918982) (← links)
- Hamiltonicity for convex shape Delaunay and Gabriel graphs (Q5919309) (← links)
- Computing largest minimum color-spanning intervals of imprecise points (Q6547918) (← links)
