| The maximum degree & diameter-bounded subgraph and its applications A Dekker, H Pérez-Rosés, G Pineda-Villavicencio, P Watters Journal of Mathematical Modelling and Algorithms 11, 249-268, 2012 | 34 | 2012 |
| Fitting voronoi diagrams to planar tesselations G Aloupis, H Pérez-Rosés, G Pineda-Villavicencio, P Taslakian, ... Combinatorial Algorithms: 24th International Workshop, IWOCA 2013, Rouen …, 2013 | 21 | 2013 |
| The excess degree of a polytope G Pineda-Villavicencio, J Ugon, D Yost SIAM Journal on Discrete Mathematics 32 (3), 2011-2046, 2018 | 14 | 2018 |
| New benchmarks for large-scale networks with given maximum degree and diameter E Loz, G Pineda-Villavicencio The Computer Journal 53 (7), 1092-1105, 2010 | 14 | 2010 |
| Lower bound theorems for general polytopes G Pineda-Villavicencio, J Ugon, D Yost European Journal of Combinatorics 79, 27-45, 2019 | 13 | 2019 |
| On bipartite graphs of diameter 3 and defect 2 C Delorme, LK Jørgensen, M Miller, G Pineda‐Villavicencio Journal of Graph Theory 61 (4), 271-288, 2009 | 13 | 2009 |
| On bipartite graphs of defect 2 C Delorme, LK Jørgensen, M Miller, G Pineda-Villavicencio European Journal of Combinatorics 30 (4), 798-808, 2009 | 12 | 2009 |
| On the nonexistence of graphs of diameter 2 and defect 2 M Miller, MH Nguyen, G Pineda-Villavicencio Journal of combinatorial mathematics and combinatorial computing 71, 5, 2009 | 10 | 2009 |
| Complete catalogue of graphs of maximum degree 3 and defect at most 4 M Miller, G Pineda-Villavicencio Discrete Applied Mathematics 157 (13), 2983-2996, 2009 | 10 | 2009 |
| On bipartite graphs of defect at most 4 R Feria-Purón, G Pineda-Villavicencio Discrete applied mathematics 160 (1-2), 140-154, 2012 | 9 | 2012 |
| Non-existence of bipartite graphs of diameter at least 4 and defect 2 G Pineda-Villavicencio Journal of Algebraic Combinatorics 34, 163-182, 2011 | 9 | 2011 |
| New largest known graphs of diameter 6 G Pineda‐Villavicencio, J Gómez, M Miller, H Pérez‐Rosés Networks: An International Journal 53 (4), 315-328, 2009 | 9 | 2009 |
| On large bipartite graphs of diameter 3 R Feria-Purón, M Miller, G Pineda-Villavicencio Discrete Mathematics 313 (4), 381-390, 2013 | 8 | 2013 |
| On graphs of defect at most 2 R Feria-Purón, M Miller, G Pineda-Villavicencio Discrete applied mathematics 159 (13), 1331-1344, 2011 | 8 | 2011 |
| On graphs with cyclic defect or excess C Delorme, G Pineda-Villavicencio arXiv preprint arXiv:1010.5841, 2010 | 8 | 2010 |
| On graphs of maximum degree 3 and defect 4 G Pineda-Villavincencio, M Miller Journal of Combinatorial Mathematics and Combinatorial Computing 65, 25, 2008 | 8 | 2008 |
| On the reconstruction of polytopes J Doolittle, E Nevo, G Pineda-Villavicencio, J Ugon, D Yost Discrete & Computational Geometry 61, 285-302, 2019 | 7 | 2019 |
| Measuring the prevalence of behavioral advertising using tracking cookies A Herps, PA Watters, G Pineda-Villavicencio Proceedings of the 4th Cybercrime and Trustworthy Computing Workshop, 2014 | 7 | 2014 |
| Measuring surveillance in online advertising: a big data approach A Herps, PA Watters, G Pineda-Villavicencio 2013 Fourth Cybercrime and Trustworthy Computing Workshop, 30-35, 2013 | 7 | 2013 |
| The degree-diameter problem for sparse graph classes G Pineda-Villavicencio, DR Wood arXiv preprint arXiv:1307.4456, 2013 | 7 | 2013 |
Mirka MillerUniversity of Newcastle, Australia & University of West Bohemia, Czech RepublicVerified email at newcastle.edu.au
