Biography
Education
Guillermo Pineda-Villavicencio completed a Graduate Certificate in Education (Tertiary Teaching) in 2015 and PhD in Mathematics in 2009, both at Federation University Australia. In 2002 he receieved a Bachelor degree in Computer Science with first class honours from the University of Oriente (Cuba).
Work experience
Guillermo joined Deakin University as a senior lecturer in computer science and mathematics in June 2019. Before that, between July 2013 and June 2019 he was a lecturer and then senior lecturer in mathematics at Federation University.
Between February and July 2013, Guillermo Pineda-Villavicencio was a postdoctoral fellow at Ben Gurion University of the Negev, under Prof Eran Nevo and Prof Mikhail Klinand. And between January 2009 and February 2013 he was a postdoctoral fellow under Prof John Yearwood and a lecturer (assistant professor equivalent) in mathematics at Federation University.
Between 2002 and 2003 Guillermo worked as a mathematics lecturer at the University of Information Sciences (Cuba). And from September 2003 to July 2008 I was a lecturer (assistant professor equivalent) in mathematics at the University of Oriente (Cuba).
Read more on Guillermo's profileResearch interests
Interplay between discrete geometry and graph theory, and applications of mathematics to health informatics
Affiliations
- Ordinary member of the Council of the Australian Mathematical Society since 2018
- Accredited member of Australian Mathematical Society since 2009.
- Associate Fellow of the International Institute of Combinatorics and Its Applications
- Life Member of the Combinatorial Mathematics Society of Australasia Inc
Teaching interests
Units from discrete mathematics and statistics to analysis and optimisation.
Units taught
- SIT106 Fundamental concepts of mathematics
- SIT292 Linear algebra for data analysis
Federation University (2009-2019)
- MATH3001 Modelling and change (Advanced level), a calculus III unit
- MATHS2012 Graphs, digraphs and networks
- MATHS1001 Modelling and change (Introductory level), a calculus I unit
- ENCOR1140 Calculus and physics
- MATHS2003 Profit, loss and gambling, an introductory unit on probability
- MATHS1000 Upon the shoulders of giants, a precalculus unit
- MATHS1005 Secrets of the matrix
- STATS1000 Statistical methods
University of Oriente (2003-2008)
- Discrete mathematics
- Real analysis and calculus
- Mathematical logic
- Algorithms
- Programming
- Linear algebra
University of Information Sciences (2002-2003)
- Discrete mathematics
- Programming
Knowledge areas
Mathematics and computer science
Awards
- Aalborg University Fellowship (2017), Denmark
- Postdoctoral Fellowship (2013), Skirball Foundation via the Centre for Advanced Studies in Mathematics at Ben Gurion University of the Negev
- Fellowship from the Sao Paulo Research Foundation (2012), University of Sao Paulo, declined
- IBM Faculty Innovation Award. IBM Smarter Planet Industry Skills Innovation Awards 2010. (With Dr Julien Ugon, Deakin University, and Dr Nadezda Sukhorukova, Swinburne University of Technology)
Publications
Linkedness of Cartesian products of complete graphs
L Jørgensen, G Pineda-Villavicencio, J Ugon
(2022), Vol. 22, pp. 1-10, Ars Mathematica Contemporanea, Ljubljana, Slovenia, C1
RECONSTRUCTIBILITY of MATROID POLYTOPES
G Pineda-Villavicencio, B Schroter
(2022), Vol. 36, pp. 490-508, SIAM Journal on Discrete Mathematics, C1
Minimum Number of Edges of Polytopes with 2d + 2 Vertices
G Pineda-Villavicencio, J Ugon, D Yost
(2022), Vol. 29, Electronic Journal of Combinatorics, C1
Assessing mathematics during COVID-19 times
Simon James, Kerri Morgan, Guillermo Pineda Villavicencio, Laura Tubino Larizbeascoa
(2021), pp. 425-442, COVID-19 and education: Learning and teaching in a pandemic-constrained environment, Santa Rosa, Calif., B1
A new proof of Balinski's theorem on the connectivity of polytopes
G Pineda-Villavicencio
(2021), Vol. 344, Discrete Mathematics, C1
The linkedness of cubical polytopes: The cube
H Bui, G Pineda-Villavicencio, J Ugon
(2021), Vol. 28, Electronic Journal of Combinatorics, C1
Polytopes Close to Being Simple
G Pineda-Villavicencio, J Ugon, D Yost
(2020), Vol. 64, pp. 200-215, Discrete and Computational Geometry, C1
Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
E Nevo, G Pineda-Villavicencio, J Ugon, D Yost
(2020), Vol. 72, pp. 537-556, Canadian Journal of Mathematics, C1
D Morales-Silva, C McPherson, G Pineda-Villavicencio, R Atchison
(2020), Vol. 26, pp. 2119-2137, Health Informatics Journal, England, C1
On the reconstruction of polytopes
J Doolittle, E Nevo, G Pineda-Villavicencio, J Ugon, D Yost
(2019), Vol. 61, pp. 285-302, Discrete and computational geometry, New York, N.Y., C1
Lower bound theorems for general polytopes
G Pineda-Villavicencio, J Ugon, D Yost
(2019), Vol. 79, pp. 27-45, European journal of combinatorics, Amsterdam, The Netherlands, C1
Connectivity of cubical polytopes
Hoa Bui, Guillermo Pineda-Villavicencio, Julien Ugon
(2019), Vol. 169, JOURNAL OF COMBINATORIAL THEORY SERIES A, C1
The excess degree of a polytope
G Pineda-Villavicencio, J Ugon, D Yost
(2018), Vol. 32, pp. 2011-2046, SIAM journal on discrete mathematics, Philadelphia, Pa., C1
On the maximum order of graphs embedded in surfaces
E Nevo, G Pineda Villavicencio, D Wood
(2016), Vol. 119, pp. 28-41, Journal of combinatorial theory, series B, Amsterdam, The Netherlands, C1-1
The degree-diameter problem for sparse graph classes
G Pineda Villavicencio, D Woodf David
(2015), Vol. 22, pp. 1-20, Electronic journal of combinatorics, [Atlanta, Ga.], C1-1
Quadratic form representations via generalized continuants
C Delorme, G Pineda Villavicencio
(2015), Vol. 18, pp. 1-22, Journal of integer sequences, Basking Ridge, N.J., C1-1
Continuants and some decompositions into squares
C Delorme, Guillermo Pineda Villavicencio
(2015), Vol. 15, pp. 1-21, Integers: electronic journal of combinatorial number theory, Carrollton, Ga., C1-1
Constructions of large graphs on surfaces
R Feria-Puron, G Pineda Villavicencio
(2014), Vol. 30, pp. 895-908, Graphs and combinatorics, Tokyo, Japan, C1-1
On large bipartite graphs of diameter 3
R Feria-Purón, M Miller, G Pineda Villavicencio
(2013), Vol. 313, pp. 381-390, Discrete mathematics, Amsterdam, The Netherlands, C1-1
Measuring surveillance in online advertising: a big data approach
A Herps, P Watters, G Pineda Villavicencio
(2013), pp. 30-35, CTC 2013 : Proceedings of the 2013 Fourth Cybercrime and Trustworthy Computing Workshop, Sydney, N.S.W., E1-1
Fitting Voronoi diagrams to planar tesselations
G Aloupis, H Pérez-Rosés, G Pineda Villavicencio, P Taslakian, D Trinchet-Almaguer
(2013), Vol. 8288, pp. 349-361, IWOCA 2013 : Proceedings of the 24th International Workshop on Combinatorial Algorithms 2013, Rouen, France, E1-1
The maximum degree & diameter-bounded subgraph and its applications
A Dekker, H Pérez-Rosés, G Pineda Villavicencio, P Watters
(2012), Vol. 11, pp. 249-268, Journal of mathematical modelling and algorithms, Cham, Switzerland, C1-1
On bipartite graphs of defect at most 4
R Feria-Purón, G Pineda Villavicencio
(2012), Vol. 160, pp. 140-154, Discrete applied mathematics, Amsterdam, The Netherlands, C1-1
R Feria-Purón, M Miller, G Pineda Villavicencio
(2011), Vol. 159, pp. 1331-1344, Discrete applied mathematics, Amsterdam, The Netherlands, C1-1
Non-existence of bipartite graphs of diameter at least 4 and defect 2
G Pineda Villavicencio
(2011), Vol. 34, pp. 163-182, Journal of algebraic combinatorics, New York, N.Y., C1-1
On graphs with cyclic defect or excess
C Delorme, G Pineda Villavicencio
(2010), Vol. 17, pp. 1-25, Electronic journal of combinatorics, [Atlanta, Ga.], C1-1
New benchmarks for large-scale networks with given maximum degree and diameter
E Loz, G Pineda Villavicencio
(2010), Vol. 53, pp. 1092-1105, Computer journal, Oxford, Eng., C1-1
Topology of interconnection networks with given degree and diameter
G Pineda Villavicencio
(2010), Vol. 81, pp. 350-352, Bulletin of the Australian Mathematical Society, Cambridge, Eng., C1-1
On bipartite graphs of defect 2
C Delorme, L Jørgensen, M Miller, G Pineda Villavicencio
(2009), Vol. 30, pp. 798-808, European journal of combinatorics, Amsterdam, The Netherlands, C1-1
New largest known graphs of diameter 6
G Pineda Villavicencio, J Gómez, M Miller, H Pérez-Rosés
(2009), Vol. 53, pp. 315-328, Networks, Chichester, Eng., C1-1
On bipartite graphs of diameter 3 and defect 2
C Delorme, L Jørgensen, M Miller, G Pineda Villavicencio
(2009), Vol. 61, pp. 271-288, Journal of graph theory, Chichester, Eng., C1-1
Complete catalogue of graphs of maximum degree 3 and defect at most 4
M Miller, G Pineda-Villavicencio
(2009), Vol. 157, pp. 2983-2996, Discrete applied mathematics, Amsterdam, The Netherlands, C1-1
On the nonexistence of graphs of diameter 2 and defect 2
M Miller, M Nguyen, G Pineda-Villavicencio
(2009), Vol. 71, pp. 5-20, Journal of combinatorial mathematics and combinatorial computing, Winnipeg, Man., C1-1
On graphs of maximum degree 3 and defect 4
G Pineda-Villavicencio, M Miller
(2008), Vol. 65, pp. 25-31, Journal of combinatorial mathematics and combinatorial computing, Winnipeg, Man., C1-1
On the non-existence of odd degree graphs of diameter 2 and defect 2
Brendan McKay, Mirka Miller, Minh Nguyen, Guillermo Pineda-Villavicencio
(2008), Vol. 10, pp. 1-11, IWOCA 2007 : Proceedings of the 18th International Workshop of Combinatorial Algorithms 2007, Lake Macquarie, N.S.W., E1-1
Funded Projects at Deakin
No Funded Projects at Deakin found
Supervisions
No completed student supervisions to report