Loading...
Loading...

Go to the content (press return)

PROBLEMAS DE COMBINATORIA Y DE COMPUTACION

Total activity: 5
Type of activity
Competitive project
Acronym
MTM2009-07242
Funding entity
Ministerio de Ciencia e Innovación (MICINN)
Funding entity code
MTM2009-07242
Amount
70.906,01 €
Start date
2010-01-01
End date
2012-12-31

Participants

Scientific and technological production

1 to 5 of 5 results
 
  • Empty triangles in good drawings of the complete graph  Open access

     Aichholzer, O.; Hackl, T.; Pilz, A.; Ramos, P.; Sacristán, V.; Vogtenhuber, B.
    Graphs and combinatorics
    Vol. 31, num. 2, p. 335-345
    DOI: 10.1007/s00373-015-1550-5
    Date of publication: 2015
    Journal article
    Loading...
    Access to the full text
  • Witness rectangle graphs

     Aronov, B.; Dulieu, M.; Hurtado, F.
    Graphs and combinatorics
    Vol. 30, num. 4, p. 827-846
    DOI: 10.1007/s00373-013-1316-x
    Date of publication: 2014-07
    Journal article
    Loading...
  • Necklaces, convolutions, and X plus Y

     Bremner, D.; Chan, T.; Demaine, E.; Erickson, J.; Hurtado, F.; Iacono, J.; Langerman, S.; Patrascu, M.; Taslakian, P.
    Algorithmica
    Vol. 69, num. 2, p. 294-314
    DOI: 10.1007/s00453-012-9734-3
    Date of publication: 2014-06-01
    Journal article
    Loading...
  • Empty monochromatic simplices  Open access

     Aichholzer, O.; Fabila, R.; Hackl, T.; Huemer, C.; URRUTIA, J.
    Discrete and computational geometry
    Vol. 51, num. 2, p. 362-393
    DOI: 10.1007/s00454-013-9565-2
    Date of publication: 2014-03-01
    Journal article
    Loading...
    Access to the full text
  • On crossing numbers of geometric proximity graphs

     Ábrego, B.; Fabila, R.; Fernández, S.; Flores-Peñaloza, D.; Hurtado, F.; Sacristán, V.; Saumell, M.
    Computational geometry: theory and applications
    Vol. 44, num. 4, p. 216-233
    DOI: 10.1016/j.comgeo.2010.11.003
    Date of publication: 2011-05
    Journal article
    Loading...