Loading...
Loading...

Go to the content (press return)

Morfología geométrica computacional.

Total activity: 10
Type of activity
Competitive project
Funding entity
MIN DE ECONOMIA Y COMPETITIVIDAD
Funding entity code
MTM2012-30951
Amount
90.675,00 €
Start date
2013-01-01
End date
2015-12-31
Scope
Adm. Estat
Plan
Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica 2008-2011
Call year
2012
Funcding program
Matemáticas
Funding subprogram
Matemáticas
Funding call
Proyectos de investigación y acciones complementarias-MTM
Grant institution
Gobierno De España. Ministerio De Economía Y Competitividad, Mineco

Participants

Scientific and technological production

1 to 10 of 10 results
 
  • On perfect and quasiperfect dominations in graphs  Open access

     Hernando, M.; Mora, M.; Pelayo, I. M.; Cáceres, José; Puertas, M. Luz
    Filomat
    Vol. 31, num. 2, p. 413-423
    DOI: 10.2298 / FIL1702413C
    Date of publication: 2017-02-27
    Journal article
    Loading...
    Access to the full text
  • Blocking the k-holes of point sets in the plane  Open access

     Cano, J.; Garcia, A.; Hurtado, F.; Shakai, T.; Tejel, F.; URRUTIA, J.
    Graphs and combinatorics
    Vol. 31, num. 5, p. 1271-1287
    DOI: 10.1007/s00373-014-1488-z
    Date of publication: 2015-09
    Journal article
    Loading...
    Access to the full text
  • On k-gons and k-holes in point sets  Open access

     Aichholzer, O.; Fabila, R.; Gonzalez, H.; Hackl, T.; Heredia, M.; Huemer, C.; URRUTIA, J.; Valtr, P.; Vogtenhuber, B.
    Computational geometry: theory and applications
    Vol. 48, num. 7, p. 528-537
    DOI: 10.1016/j.comgeo.2014.12.007
    Date of publication: 2015-08-01
    Journal article
    Loading...
    Access to the full text
  • Lower bounds on the maximum number of non-crossing acyclic graphs  Open access

     Huemer, C.; De Mier, A.
    European journal of combinatorics
    Vol. 48, num. C, p. 48-62
    DOI: 10.1016/j.ejc.2015.02.008
    Date of publication: 2015-08-01
    Journal article
    Loading...
    Access to the full text
  • Empty non-convex and convex four-gons in random point sets  Open access

     Fabila, R.; Huemer, C.; Mitsche, D.
    Studia scientiarum mathematicarum hungarica
    Vol. 52, num. 1, p. 52-64
    DOI: 10.1556/SScMath.52.2015.1.1301
    Date of publication: 2015-03-01
    Journal article
    Loading...
    Access to the full text
  • New results on stabbing segments with a polygon  Open access

     Díaz, J.; Korman, M.; Pérez, P.; Pilz, A.; Seara, C.; Silveira, R.
    Computational geometry: theory and applications
    Vol. 48, num. 1, p. 14-29
    DOI: 10.1016/j.comgeo.2014.06.002
    Date of publication: 2015-01-01
    Journal article
    Loading...
    Access to the full text
  • 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
  • Mutual witness proximity graphs

     Aronov, B.; Dulieu, M.; Hurtado, F.
    Information processing letters
    Vol. 114, num. 10, p. 519-523
    DOI: 10.1016/j.ipl.2014.04.001
    Date of publication: 2014-10-01
    Journal article
    Loading...
  • Computing a visibility polygon using few variables

     Barba, L.; Korman, M.; Langerman, S.; Silveira, R.
    Computational geometry: theory and applications
    Vol. 47, num. 9, p. 918-926
    DOI: 10.1016/j.comgeo.2014.04.001
    Date of publication: 2014-10-01
    Journal article
    Loading...
  • Lower bounds for the number of small convex k-holes

     Aichholzer, O.; Fabila, R.; Hackl, T.; Huemer, C.; Pilz, A.; Vogtenhuber, B.
    Computational geometry: theory and applications
    Vol. 47, num. 5, p. 605-613
    DOI: 10.1016/j.comgeo.2013.12.002
    Date of publication: 2014-07-01
    Journal article
    Loading...