|
Pedro
Ramos Alonso |
|
I am an Associate Professor at the Department of Physics and
Mathematics, in University of Alcalá, near Madrid (Spain).
My main area of research is Discrete and Computational Geometry, and
lately I'm mainly focused on problems in Geometric Graph
Theory, mainly the crossing number of the complete graph and its
relation to j-edges.
Here is a list of most of my publications, roughly in reverse
chronological order, according to its final (or last available)
version.
Publications
- On the crossing number of 2-page book drawings of $K_n$
with
prescribed number of each edges in each page. Bernardo M.
Ábrego, Silvia Fernández-Merchant, Evgeniya Lagoda and Pedro
Ramos. Graphs and Combinatorics (2019). DOI.
- Adaptación de la prueba TIMSS para la evaluación de la
competencia matemática en alumnos de Magisterio. Blaca Arteaga, Enrique
Navarro, Arántzazu Fraile, Pedro Ramos. Bordón 70(3), 95-113,
2018. DOI.
- Bishellable drawings of Kn.
Bernardo
M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Dan McQuillan,
Bojan Mohar, Petra Mutzel, Pedro Ramos, Bruce Richter and Birgit
Vogtenhuber. SIAM Journal on Discrete Mathematics 32, 2482-2492
(2018).
- Holes in
2-convex point sets. Oswin Aichholzer, Martin Balko, Thomas Hackl,
Alexander Pilz, Pedro Ramos, Pavel Valtr and Birgit Vogtenhuber.
Computational Geometry 74,
38-49 (2018). DOI.
- Non-Shellable Drawings of Kn with
Few Crossings. Bernardo M. Ábrego, Oswin Aichholzer, Silvia
Fernández-Merchant, Pedro Ramos and Birgit Vogtenhuber. Proc. CCCG 2014,
p. 46-51.
- Empty
triangles in good drawings of the complete graph. Oswin
Aichholzer, Thomas Hackl, Alexander Pilz, Pedro
Ramos, Vera
Sacristán, Birgit Vogtenhuber. Graphs and
Combinatorics 31
(2), 335-345, March 2015.
DOI.
- On k-convex point sets. Oswin Aichholzer,
Franz Aurenhammer, Thomas Hackl, Ferran Hurtado, Alexander
Pilz, Pedro Ramos, Jorge
Urrutia, Pavel Valtr, Birgit Vogtenhuber. Computational
Geometry: Theory and Applications, 47,
809-832 (2014) . DOI.
(Open access)
- Shellable drawings and the cylindrical crossing number of
Kn.
Bernardo Ábrego, Oswin
Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar.
Discrete & Computational Geometry, 52 (4), 743-753
(2014). DOI.
arXiv
version.
- The
2-page crossing number of Kn.
Bernardo Ábrego, Oswin
Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, Gelasio Salazar.
Discrete
&
Computational
Geometry 49 (4), 747-777,
June 2013. DOI.
Also in 28th ACM Symposium on Computational Geometry, 397-404
(2012).
-
Blocking Delaunay
triangulations. Oswin
Aichholzer, Ruy Fabila-Monroy, Thomas Hackl, Marc van Kreveld,
Alexander Pilz, Pedro Ramos, Birgit Vogtenhuber. Computational
Geometry: Theory and Applications, 46
(2), pp. 154–159, Feb 2013. DOI
- Flip
graphs of degree-bounded (pseudo-)triangulations. Oswin
Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote,
André Schulz, Bettina Speckmann. Graphs and Combinatorics 29 (6), pp.
1577--1593, Nov 2013. DOI.
Extended abstract in Electronic
Notes in Discrete Mathematics 34 (2009), 509-513.
- Recent
developments on the crossing number of Kn.
Invited
talk at the XV Spanish Meeting on Computational Geometry. Seville, June
26-28 2013.
- Equipartitioning
triangles.Pedro Ramos, William Steiger. XV Spanish
Meeting on Computational Geometry. Seville, June 26-28, 2013.
- Computational
Geometry. Selected papers of the XIV Spanish Meeting on Computational
Geometry. Alberto Márquez, Pedro Ramos, Jorge Urrutia (Eds). LNCS 7579,
2012. DOI.
-
On k-convex polygons. Oswin Aichholzer,
Franz Aurenhammer, Erik Demaine, Ferran Hurtado, Pedro Ramos, Jorge
Urrutia. Computational
Geometry: Theory and Applications 45,
pp. 73-87, 2012. DOI.
Also in Abstracts Eurocg 2009, pp. 117-120, 2009.
-
Puntos, aristas y cruces
(in Spanish). Pedro
Ramos. La
Gaceta de la Real Sociedad Matemática Española 14 (2), pp. 263-282,
Mayo 2011.
- The number of
generalized balanced lines. David Orden,
Pedro Ramos, Gelasio Salazar. Discrete
& Computational Geometry
44 (4), pp. 805-811,
December 2010. DOI. Also
in Abstracts XIII Encuentros de Geometría Computacional,
Zaragoza, 29 junio - 01 julio 2009.
- Decomposition
of multiple coverings into more parts. Greg Aloupis, Jean
Cardinal,
Sébastien Colette, Stefan Langerman, David Orden, Pedro Ramos.
Discrete
&
Computational
Geometry 44 (3),
pp. 706-723,
October 2010. DOI. Also
in ACM-SIAM Symposium on Discrete Algorithms, 302-310, 2009.
- On
structural and graph theoretic properties of higher order Delaunay
graphs. Manuel Abelllanas, Prosenjit Bose, Jesús García,
Ferran Hurtado, Carlos M. Nicolás, Pedro Ramos. International Journal
of Computational Geometry and Applications 19 (6), 595-615,
2009. DOI.
-
Depth
of segments and
circles through points enclosing many points: a note. Pedro
Ramos, Raquel Viaña. Computational Geometry: Theory and Applications 42 (4), 338-341,
2009. DOI.
- New
results on lower bounds for the number of <=-facets. Oswin
Aichholzer, Jesús García, David Orden, Pedro Ramos.
European Journal of Combinatorics
30 (7), 1568-1574, 2009. DOI.
Extended abstract in Electronic Notes in Discrete Mathematics 29, 189-193, 2007. DOI.
- New lower
bounds for the number of <=-edges and the
rectilinear crossing number of Kn.
Oswin Aichholzer, Jesús García, David Orden, Pedro
Ramos. Discrete & Computational Geometry 38 (1), 1-14, 2007. DOI.
- On
local transformations in plane geometric graphs embedded on small grids.
Manuel Abellanas, Prosenjit Bose, Alfredo Garcia, Ferran Hurtado, Pedro
Ramos, Eduardo Rivera-Campo, Javier Tejel. Computational
Geometry: Theory and Applications 39
(2), pp. 65-77, 2007. DOI.
- The
maximin line problem with regional demand. José Miguel
Díaz-Bañez, Pedro Ramos, Pilar Sabariego. European Journal of
Operation Research 181 (1), 20-29, 2007.
DOI.
- Multi-VMap:
a multi-scale model for vector maps. Raquel Viaña, Paola
Magillo, Enrico Puppo, Pedro Ramos. Geoinformatica 10, 359-394, 2006.
DOI.
- Separability
by two lines and by flat polygonals. Ferran
Hurtado, Mercè Mora, Pedro Ramos, Carlos Seara, Discrete
Applied Mathematics 144
(1-2), 110-122, 2004. DOI.
- Minimal set of constraints for 2D constrained Delaunay
triangulation. Olivier Devillers, Regina Estkowski, Pierre-Marie
Gandoin, Ferran Hurtado, Pedro Ramos, Vera
Sacristán. International Journal of Computational Geometry and
Applications 13
(5), 391-398, 2003 .
- Computing
roundness is easy if the set is almost round. Olivier
Devillers, Pedro Ramos. International Journal of Computational
Geometry and Applications 12
(3), 229-248, 2002.
- Separating
objects in the plane with wedges and strips. Ferran Hurtado,
Marc Noy, Pedro Ramos, Carlos Seara. Discrete Applied Mathematics 109 (1-2),
109-138, 2001.
- A
unified approach to conic visibility. Jesús
García-López, Pedro Ramos. Algorithmica 28
(3), 307-322, 2000. DOI.
- Structural
tolerance and Delaunay triangulation. Manuel Abellanas, Ferran Hurtado,
Pedro Ramos. Information Processing Letters 71, 221-227,
1999.
- Drawing nice projections of objects in space. Prosenjit
Bose, Francisco Gómez, Pedro Ramos, Godfried Toussaint. Journal
of Visual Communication and Image Representation 10
(2), 155-172, 1999.
- Bipartite embeddings of trees in the plane. Manuel
Abellanas, Jesús García-López, Gregorio Hernández, Marc Noy, Pedro
Ramos, Discrete Applied Mathematics 93,
(2-3), 141-148, 1999.
- Fitting
a set of points by a circle. Jesús García-López,
Pedro Ramos, Jack Snoeyink. Discrete &
Computational Geometry 20, 389-402, 1998.
- Converting triangulations to quadrangulations.
Suneeta Ramaswami, Pedro Ramos, Godfried Toussaint. Computational
Geometry: Theory and Applications 9, 257-276, 1998.