( en | de | ru )

 

Disambiguation of "Ramos, Pedro"

Author of the publication

copydeleteadd this publication to your clipboard
New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn.

, , , and . Discret. Comput. Geom., 38 (1): 1-14 (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Carlos Ramos Cuevas

On convex subcomplexes of spherical buildings and Tits' center conjecture. Uni München, (2009)

Benno Pedrotti

José Miguel Ramos Pittol

Christian Ramiro Melo Ramos

Conrado Ricardo Ramos Laraburu

 

Other publications of authors with the same name

On the Crossing Number of 2-Page Book Drawings of Kn with Prescribed Number of Edges in Each Page., , , and . Graphs Comb., 36 (2): 303-318 (2020)Novel Clique enumeration heuristic for detecting overlapping clusters., , , and . CEC, page 1390-1397. IEEE, (2017)New results on lower bounds for the number of (k)-facets: (extended abstract)., , , and . Electron. Notes Discret. Math., (2007)Extending UML Templates towards Computability., and . MODELSWARD, page 122-133. SciTePress, (2015)Empty Triangles in Good Drawings of the Complete Graph., , , , , and . Graphs Comb., 31 (2): 335-345 (2015)Back to the Past to Charter the Vinyl Electronic Market: A Data Mining Approach., , and . IntelliSys (2), volume 1251 of Advances in Intelligent Systems and Computing, page 685-692. Springer, (2020)Effects of a home care community-dwelling intervention on cognition, mental health, loneliness and quality of life in elder people: The VERA study., , , , and . Int. J. Medical Informatics, (2024)Automatic annotation of tasks in structured code., , , , and . PACT, page 31:1-31:13. ACM, (2018)Non-Shellable Drawings of Kn with Few Crossings., , , , and . CCCG, Carleton University, Ottawa, Canada, (2014)New results on lower bounds for the number of (<=k)-facets., , , and . Eur. J. Comb., 30 (7): 1568-1574 (2009)