The following pages link to Pedro Ramos (Q170491):
Displaying 36 items.
- (Q427048) (redirect page) (← links)
- On \(k\)-convex polygons (Q427049) (← links)
- Decomposition of multiple coverings into more parts (Q603854) (← links)
- The number of generalized balanced lines (Q603873) (← links)
- Blocking Delaunay triangulations (Q691770) (← links)
- (Q872232) (redirect page) (← links)
- The maximin line problem with regional demand (Q872234) (← links)
- Depth of segments and circles through points enclosing many points: A note (Q1005330) (← links)
- New results on lower bounds for the number of \((\leq k)\)-facets (Q1039428) (← links)
- Fitting a set of points by a circle (Q1272963) (← links)
- (Q1296567) (redirect page) (← links)
- Bipartite embeddings of trees in the plane (Q1296568) (← links)
- A unified approach to conic visibility (Q1587782) (← links)
- Structural tolerance and Delaunay triangulation (Q1606996) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- On \(k\)-convex point sets (Q2248736) (← links)
- On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page (Q2308500) (← links)
- Empty triangles in good drawings of the complete graph (Q2345507) (← links)
- New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\) (Q2385147) (← links)
- The 2-page crossing number of \(K_{n}\) (Q2391708) (← links)
- On local transformations in plane geometric graphs embedded on small grids (Q2462732) (← links)
- Shellable drawings and the cylindrical crossing number of \(K_n\) (Q2514231) (← links)
- Flip graphs of bounded degree triangulations (Q2637710) (← links)
- Flip graphs of bounded-degree triangulations (Q2851510) (← links)
- The \(2\)-page crossing number of \(K_n\) (Q2874601) (← links)
- ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS (Q3405973) (← links)
- New results on lower bounds for the number of (⩽ k)-facets (Q3503472) (← links)
- (Q3625834) (← links)
- Bishellable drawings of $K_n$ (Q4555043) (← links)
- (Q4633837) (← links)
- COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND (Q4818558) (← links)
- MINIMAL SET OF CONSTRAINTS FOR 2D CONSTRAINED DELAUNAY RECONSTRUCTION (Q4818601) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901263) (← links)
- Holes in 2-convex point sets (Q5915543) (← links)
- Holes in 2-convex point sets (Q5915646) (← links)
- Separating objects in the plane by wedges and strips (Q5929324) (← links)
