Pedro Ramos

Orcid: 0000-0001-6904-5803

Affiliations:
  • Universidad de Alcalá, Spain


According to our database1, Pedro Ramos authored at least 42 papers between 1994 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
On the Crossing Number of 2-Page Book Drawings of K<sub>n</sub> with Prescribed Number of Edges in Each Page.
Graphs Comb., 2020

2018
Bishellable drawings of K<sub>n</sub>.
SIAM J. Discret. Math., 2018

Editorial: Special issue in memory of Dr. Ferran Hurtado.
Comput. Geom., 2018

Holes in 2-convex point sets.
Comput. Geom., 2018

2015
Empty Triangles in Good Drawings of the Complete Graph.
Graphs Comb., 2015

2014
Shellable Drawings and the Cylindrical Crossing Number of K<sub>n</sub>.
Discret. Comput. Geom., 2014

On k-convex point sets.
Comput. Geom., 2014

Non-Shellable Drawings of K<sub>n</sub> with Few Crossings.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
More on the crossing number of K<sub>n</sub>: Monotone drawings.
Electron. Notes Discret. Math., 2013

The 2-Page Crossing Number of K<sub>n</sub>.
Discret. Comput. Geom., 2013

Shellable drawings and the cylindrical crossing number of $K_n$.
CoRR, 2013

Blocking Delaunay triangulations.
Comput. Geom., 2013

2012
On k-convex polygons.
Comput. Geom., 2012

2010
The Number of Generalized Balanced Lines.
Discret. Comput. Geom., 2010

Decomposition of Multiple Coverings into More Parts.
Discret. Comput. Geom., 2010

2009
On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs.
Int. J. Comput. Geom. Appl., 2009

Flip Graphs of Bounded-Degree Triangulations.
Electron. Notes Discret. Math., 2009

New results on lower bounds for the number of (<=k)-facets.
Eur. J. Comb., 2009

Depth of segments and circles through points enclosing many points: a note.
Comput. Geom., 2009

2008
On local transformations in plane geometric graphs embedded on small grids.
Comput. Geom., 2008

2007
New results on lower bounds for the number of (k)-facets: (extended abstract).
Electron. Notes Discret. Math., 2007

New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of K<sub>n</sub>.
Discret. Comput. Geom., 2007

2006
<i>Multi-VMap</i>: A Multi-Scale Model for Vector Maps.
GeoInformatica, 2006

2005
On properties of higher-order Delaunay graphs with applications.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004
Separability by two lines and by nearly straight polygonal chains.
Discret. Appl. Math., 2004

2003
Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction.
Int. J. Comput. Geom. Appl., 2003

2002
Computing Roundness is Easy if the Set is Almost Round.
Int. J. Comput. Geom. Appl., 2002

2001
Separating objects in the plane by wedges and strips.
Discret. Appl. Math., 2001

2000
A Unified Approach to Conic Visibility.
Algorithmica, 2000

1999
Drawing Nice Projections of Objects in Space.
J. Vis. Commun. Image Represent., 1999

Structural Tolerance and Delaunay Triangulation.
Inf. Process. Lett., 1999

Bipartite Embeddings of Trees in the Plane.
Discret. Appl. Math., 1999

Computing Roundness is Easy if the Set is Almost Round.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
A computational tool that supports formal diagnosis of process design.
Inf. Softw. Technol., 1998

Fitting a Set of Points by a Circle.
Discret. Comput. Geom., 1998

Converting triangulations to quadrangulations.
Comput. Geom., 1998

Separating objects in the plane with wedges and strips.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Shortest paths and visibility inside triangulated curved polygons with applications to conic visibility.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
The Role of Diagnosis and Decision Theory in Normative Reasoning.
Proceedings of the Formal Models of Agents, 1997

Fitting a Set of Points by a Circle.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1994
Redrawing a Graph within a Geometric Tolerance.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Tolerance of Geometric Structures.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994


  Loading...