New Largest Graphs of Diameter 6: (Extended Abstract). - Guillermo Pineda-Villavicencio; José Gómez; Mirka Miller; Hebert Pérez-Rosés (Electron. Notes Discret. Math., 2006)

On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2. - Mirka Miller; Minh Hoang Nguyen; Guillermo Pineda-Villavicencio (CATS, 2008)

Complete catalogue of graphs of maximum degree 3 and defect at most 4. - Mirka Miller; Guillermo Pineda-Villavicencio (Discret. Appl. Math., 2009)

On bipartite graphs of defect 2. - Charles Delorme; Leif K. Jørgensen; Mirka Miller; Guillermo Pineda-Villavicencio (Eur. J. Comb., 2009)

On bipartite graphs of diameter 3 and defect 2. - Charles Delorme; Leif K. Jørgensen; Mirka Miller; Guillermo Pineda-Villavicencio (J. Graph Theory, 2009)

New largest known graphs of diameter 6. - Guillermo Pineda-Villavicencio; José Gómez; Mirka Miller; Hebert Pérez-Rosés (Networks, 2009)

New Benchmarks for Large-Scale Networks with Given Maximum Degree and Diameter. - Eyal Loz; Guillermo Pineda-Villavicencio (Comput. J., 2010)

On Graphs with Cyclic Defect or Excess. - Charles Delorme; Guillermo Pineda-Villavicencio (Electron. J. Comb., 2010)

On graphs of defect at most 2. - Ramiro Feria-Purón; Mirka Miller; Guillermo Pineda-Villavicencio (Discret. Appl. Math., 2011)

On bipartite graphs of defect at most 4. - Ramiro Feria-Purón; Guillermo Pineda-Villavicencio (Discret. Appl. Math., 2012)

The Maximum Degree & Diameter-Bounded Subgraph and its Applications. - Anthony Dekker; Hebert Pérez-Rosés; Guillermo Pineda-Villavicencio; Paul A. Watters (J. Math. Model. Algorithms, 2012)

Fitting Voronoi Diagrams to Planar Tesselations. - Greg Aloupis; Hebert Pérez-Rosés; Guillermo Pineda-Villavicencio; Perouz Taslakian; Dannier Trinchet-Almaguer (IWOCA, 2013)

On large bipartite graphs of diameter 3. - Ramiro Feria-Purón; Mirka Miller; Guillermo Pineda-Villavicencio (Discret. Math., 2013)

Constructions of Large Graphs on Surfaces. - Ramiro Feria-Purón; Guillermo Pineda-Villavicencio (Graphs Comb., 2014)

The Degree-Diameter Problem for Sparse Graph Classes. - Guillermo Pineda-Villavicencio; David R. Wood (Electron. J. Comb., 2015)

Continuants and Some Decompositions Into Squares. - Charles Delorme; Guillermo Pineda-Villavicencio (Integers, 2015)

Quadratic Form Representations via Generalized Continuants. - Charles Delorme; Guillermo Pineda-Villavicencio (J. Integer Seq., 2015)

On the maximum order of graphs embedded in surfaces. - Eran Nevo; Guillermo Pineda-Villavicencio; David R. Wood (J. Comb. Theory B, 2016)

The Excess Degree of a Polytope. - Guillermo Pineda-Villavicencio; Julien Ugon; David T. Yost (SIAM J. Discret. Math., 2018)

On the Reconstruction of Polytopes. - Joseph Doolittle; Eran Nevo; Guillermo Pineda-Villavicencio; Julien Ugon; David T. Yost (Discret. Comput. Geom., 2019)

Lower bound theorems for general polytopes. - Guillermo Pineda-Villavicencio; Julien Ugon; David T. Yost (Eur. J. Comb., 2019)

Polytopes Close to Being Simple. - Guillermo Pineda-Villavicencio; Julien Ugon; David T. Yost (Discret. Comput. Geom., 2020)

Using radar plots for performance benchmarking at patient and hospital levels using an Australian orthopaedics dataset. - Daniel M. Morales-Silva; Cameron S. McPherson; Guillermo Pineda-Villavicencio; Rory Atchison (Health Informatics J., 2020)

Connectivity of cubical polytopes. - Hoa T. Bui; Guillermo Pineda-Villavicencio; Julien Ugon (J. Comb. Theory A, 2020)

The Linkedness of Cubical Polytopes: The Cube. - Hoa T. Bui; Guillermo Pineda-Villavicencio; Julien Ugon (Electron. J. Comb., 2021)

A new proof of Balinski's theorem on the connectivity of polytopes. - Guillermo Pineda-Villavicencio (Discret. Math., 2021)

Linkedness of Cartesian products of complete graphs. - Leif K. Jørgensen; Guillermo Pineda-Villavicencio; Julien Ugon (Ars Math. Contemp., 2022)

Minimum Number of Edges of Polytopes with $2d+2$ Vertices. - Guillermo Pineda-Villavicencio; Julien Ugon; David T. Yost (Electron. J. Comb., 2022)

Reconstructibility of Matroid Polytopes. - Guillermo Pineda-Villavicencio; Benjamin Schröter (SIAM J. Discret. Math., 2022)

The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices. - Guillermo Pineda-Villavicencio; David T. Yost (SIAM J. Discret. Math., 2022)

Edge connectivity of simplicial polytopes. - Vincent Pilaud; Guillermo Pineda-Villavicencio; Julien Ugon (Eur. J. Comb., 2023)

The linkedness of cubical polytopes: Beyond the cube. - Hoa T. Bui; Guillermo Pineda-Villavicencio; Julien Ugon (Discret. Math., 2024)