A/Prof. Guillermo Pineda Villavicencio

Edge connectivity of simplicial polytopes

V Pilaud, G Pineda-Villavicencio, J Ugon

(2023), Vol. 113, pp. 1-9, European Journal of Combinatorics, Amsterdam, The Netherlands, C1

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

THE LOWER BOUND THEOREM FOR d -POLYTOPES WITH 2d + 1 VERTICES

G Pineda-Villavicencio, D Yost

(2022), Vol. 36, pp. 2920-2941, SIAM Journal on Discrete Mathematics, Philadelphia, Pa., C1-1

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

Using radar plots for performance benchmarking at patient and hospital levels using an Australian orthopaedics dataset

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

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

On graphs of defect at most 2

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