default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillermo Pineda-Villavicencio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Hoa T. Bui
, Guillermo Pineda-Villavicencio, Julien Ugon:
The linkedness of cubical polytopes: Beyond the cube. Discret. Math. 347(3): 113801 (2024)- 2023
- [j29]Vincent Pilaud, Guillermo Pineda-Villavicencio, Julien Ugon:
Edge connectivity of simplicial polytopes. Eur. J. Comb. 113: 103752 (2023) - 2022
- [j28]Leif K. Jørgensen, Guillermo Pineda-Villavicencio, Julien Ugon:
Linkedness of Cartesian products of complete graphs. Ars Math. Contemp. 22(2): 2 (2022) - [j27]Guillermo Pineda-Villavicencio, Julien Ugon, David T. Yost:
Minimum Number of Edges of Polytopes with $2d+2$ Vertices. Electron. J. Comb. 29(3) (2022) - [j26]Guillermo Pineda-Villavicencio, Benjamin Schröter:
Reconstructibility of Matroid Polytopes. SIAM J. Discret. Math. 36(1): 490-508 (2022) - [j25]Guillermo Pineda-Villavicencio, David T. Yost:
The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices. SIAM J. Discret. Math. 36(4): 2920-2941 (2022) - 2021
- [j24]Hoa T. Bui, Guillermo Pineda-Villavicencio, Julien Ugon:
The Linkedness of Cubical Polytopes: The Cube. Electron. J. Comb. 28(3) (2021) - [j23]Guillermo Pineda-Villavicencio:
A new proof of Balinski's theorem on the connectivity of polytopes. Discret. Math. 344(7): 112408 (2021) - 2020
- [j22]Guillermo Pineda-Villavicencio, Julien Ugon, David T. Yost:
Polytopes Close to Being Simple. Discret. Comput. Geom. 64(1): 200-215 (2020) - [j21]Daniel M. Morales-Silva, Cameron S. McPherson, Guillermo Pineda-Villavicencio, Rory Atchison:
Using radar plots for performance benchmarking at patient and hospital levels using an Australian orthopaedics dataset. Health Informatics J. 26(3): 2119-2137 (2020) - [j20]Hoa T. Bui, Guillermo Pineda-Villavicencio, Julien Ugon:
Connectivity of cubical polytopes. J. Comb. Theory A 169 (2020)
2010 – 2019
- 2019
- [j19]Joseph Doolittle, Eran Nevo, Guillermo Pineda-Villavicencio, Julien Ugon, David T. Yost:
On the Reconstruction of Polytopes. Discret. Comput. Geom. 61(2): 285-302 (2019) - [j18]Guillermo Pineda-Villavicencio, Julien Ugon, David T. Yost:
Lower bound theorems for general polytopes. Eur. J. Comb. 79: 27-45 (2019) - 2018
- [j17]Guillermo Pineda-Villavicencio, Julien Ugon, David T. Yost:
The Excess Degree of a Polytope. SIAM J. Discret. Math. 32(3): 2011-2046 (2018) - 2016
- [j16]Eran Nevo, Guillermo Pineda-Villavicencio, David R. Wood:
On the maximum order of graphs embedded in surfaces. J. Comb. Theory B 119: 28-41 (2016) - 2015
- [j15]Guillermo Pineda-Villavicencio, David R. Wood:
The Degree-Diameter Problem for Sparse Graph Classes. Electron. J. Comb. 22(2): 2 (2015) - [j14]Charles Delorme, Guillermo Pineda-Villavicencio:
Continuants and Some Decompositions Into Squares. Integers 15: A3 (2015) - [j13]Charles Delorme, Guillermo Pineda-Villavicencio:
Quadratic Form Representations via Generalized Continuants. J. Integer Seq. 18(6): 15.6.4 (2015) - 2014
- [j12]Ramiro Feria-Purón, Guillermo Pineda-Villavicencio:
Constructions of Large Graphs on Surfaces. Graphs Comb. 30(4): 895-908 (2014) - 2013
- [j11]Ramiro Feria-Purón, Mirka Miller, Guillermo Pineda-Villavicencio:
On large bipartite graphs of diameter 3. Discret. Math. 313(4): 381-390 (2013) - [c2]Greg Aloupis, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Perouz Taslakian, Dannier Trinchet-Almaguer:
Fitting Voronoi Diagrams to Planar Tesselations. IWOCA 2013: 349-361 - [i1]Greg Aloupis, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Perouz Taslakian, Dannier Trinchet:
Fitting Voronoi Diagrams to Planar Tesselations. CoRR abs/1308.5550 (2013) - 2012
- [j10]Ramiro Feria-Purón, Guillermo Pineda-Villavicencio:
On bipartite graphs of defect at most 4. Discret. Appl. Math. 160(1-2): 140-154 (2012) - [j9]Anthony Dekker, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Paul A. Watters:
The Maximum Degree & Diameter-Bounded Subgraph and its Applications. J. Math. Model. Algorithms 11(3): 249-268 (2012) - 2011
- [j8]Ramiro Feria-Purón, Mirka Miller, Guillermo Pineda-Villavicencio:
On graphs of defect at most 2. Discret. Appl. Math. 159(13): 1331-1344 (2011) - 2010
- [j7]Eyal Loz, Guillermo Pineda-Villavicencio:
New Benchmarks for Large-Scale Networks with Given Maximum Degree and Diameter. Comput. J. 53(7): 1092-1105 (2010) - [j6]Charles Delorme, Guillermo Pineda-Villavicencio:
On Graphs with Cyclic Defect or Excess. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j5]Mirka Miller, Guillermo Pineda-Villavicencio:
Complete catalogue of graphs of maximum degree 3 and defect at most 4. Discret. Appl. Math. 157(13): 2983-2996 (2009) - [j4]Charles Delorme, Leif K. Jørgensen, Mirka Miller, Guillermo Pineda-Villavicencio:
On bipartite graphs of defect 2. Eur. J. Comb. 30(4): 798-808 (2009) - [j3]Charles Delorme, Leif K. Jørgensen, Mirka Miller, Guillermo Pineda-Villavicencio:
On bipartite graphs of diameter 3 and defect 2. J. Graph Theory 61(4): 271-288 (2009) - [j2]Guillermo Pineda-Villavicencio, José Gómez, Mirka Miller, Hebert Pérez-Rosés:
New largest known graphs of diameter 6. Networks 53(4): 315-328 (2009) - 2008
- [c1]Mirka Miller, Minh Hoang Nguyen, Guillermo Pineda-Villavicencio:
On the Non-existence of Even Degree Graphs with Diameter 2 and Defect 2. CATS 2008: 93-95 - 2006
- [j1]Guillermo Pineda-Villavicencio, José Gómez, Mirka Miller, Hebert Pérez-Rosés:
New Largest Graphs of Diameter 6: (Extended Abstract). Electron. Notes Discret. Math. 24: 153-160 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
