Search results
From Combinatorics Wiki
Create the page "Guillermo" on this wiki! See also the search results found.
Page title matches
- [[Image:Guillermo_Pineda.jpg|thumb|350px|[http://www.guillermo.com.au/ Home page].]]1 KB (153 words) - 14:39, 3 January 2019
Page text matches
- ==Guillermo Pineda-Villavicencio has completed his PhD== [[Image:Guillermo_Pineda.jpg|thumb|100px|Dr. Guillermo Pineda-Villavicencio]]16 KB (2,191 words) - 14:39, 3 January 2019
- * [mailto:g.pinedav@gmail.com Guillermo Pineda-Villavicencio]1 KB (154 words) - 14:39, 3 January 2019
- # Dekker, Anthony; Perez-Roses, Hebert; Pineda-Villavicencio, Guillermo; Watters, Paul (2011), "The Maximum Degree&Diameter-Bounded Subgraph and it7 KB (748 words) - 11:31, 31 January 2019
- ...and moderated by '''[[Eyal Loz]]''', '''[[Hebert Pérez-Rosés]]''', '''[[Guillermo Pineda-Villavicencio]]''', and '''[[Nacho López]]''' as part of the projec13 KB (2,150 words) - 03:58, 18 February 2022
- ...have been carried out by Charles Delorme, Leif Jorgensen, Mirka Miller and Guillermo Pineda-Villavicencio. They proved several necessary conditions for the exis25 KB (2,731 words) - 05:55, 18 February 2022
- ...d-color: #ffff66; text-align: center;" | * || Graphs found by Eyal Loz and Guillermo Pineda-Villavicencio. More details are available in a paper by the authors.38 KB (4,066 words) - 05:52, 18 February 2022
- ...ce of ''(d,2,-2)''-graphs with ''d≥3'' by Mirka Miller, Minh Nguyen and Guillermo Pineda-Villavicencio, and the non-existence of ''(d,2,-2)''-graphs for ''5< ...orgensen; the complete catalogue of ''(3,k,-4)''-graphs with ''k≥2'' by Guillermo Pineda-Villavicencio and Mirka Miller by proving the non-existence of ''(3,35 KB (3,771 words) - 05:43, 18 February 2022
- # Dekker, Anthony; Perez-Roses, Hebert; Pineda-Villavicencio, Guillermo; Watters, Paul (2011), "The Maximum Degree&Diameter-Bounded Subgraph and it1 KB (181 words) - 14:39, 3 January 2019
- ...ing Voronoi Diagrams to Planar Tesselations” (jointly with Greg Aloupis, Guillermo Pineda-Villavicencio, Perouz Taslakian, and Dannier Trinchet). Proceedings ...The Maximum Degree&Diameter Subgraph Problem” (jointly with Tony Dekker, Guillermo Pineda-Villavicencio, and Paul Watters). Journal of Mathematical Modelling12 KB (1,602 words) - 15:04, 6 June 2020