Guillermo Pineda-Villavicencio

Talks

INVITED TALKS
  1. Minimum number of edges of polytopes. The 2nd International Conference of Combinatorics, Graph Theory, and Network Topology, University of Jember, Indonesia, 24-25 November 2018.
  2. Three questions on graphs of polytopes. Einstein Workshop Discrete Geometry and Topology, Freie Universität Berlin, Germany, 13-16 Mar 2018.
Conferences, workshops and Seminars
  1. Minkowski decompositions of polytopes via geometric graphs.
    1. Discrete Mathematics Seminar, Technical University of Berlin, Germany, 29 May 2019.
  2. Reconstruction of polytopes. 61st Annual AustMS Meeting (Mathematical Optimisation Session), Macquarie University, Sydney, Australia, 12-15 Dec 2017.
  3. Connectivity of graphs of cubical polytopes. 5th International Combinatorics Conference, Monash University, 4-9 Dec 2017.
  4. Two questions on graphs of polytopes. Seminar session, Aalborg University, Aalborg, Denmark, Oct 2017.
  5. The excess degree of a polytope and some of its applications. 
    1. Monday Colloquium, Technical University of Berlin, Germany, 31 Oct 2016,
    2. Workshop on polytopes, RMIT University, Australia, 17 Nov 2015.
  6. On the maximum order of graphs embedded in surfaces.
    1. 7th International Workshop on Optimal Network Topologies (IWONT 2016), Tsinghua Sanya International Mathematics Forum, Sanya, 11-15 Jul 2016.
    2. 37th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (37ACCMCC), University of Western Australia, Australia, 9-13 Dec 2013.
  7. Results on graphs of polytopes. Seminar session, Northwestern Polytechnical University, Xian, China, 6 Jul 2016.
  8. Almost simplicial polytopes I. The lower and upper bound theorems.
    1. Discrete Structures and Algorithms Seminar, University of Melbourne, Australia, Nov 2015.
    2. 59th Annual AustMS Meeting (Geometry and Topology Session), Flinders University, Adelaide, Australia, 28 Sep -1 Oct 2015.
  9. On the number of edges of polytopes. Seminar on algebraic combinatorics, Ben-Gurion University of the Negev, Israel, Jan 2015.
  10. Bipartite graphs whose order misses the bipartite Moore bound by two. Seminar on algebraic combinatorics, Ben-Gurion University of the Negev, Israel, Mar 2013.
  11. On the degree/diameter problem for minor-closed graph classes. 36th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (36ACCMCC), University of New South Wales, Australia, 10-14 Dec 2012.
  12. Maximum degree & diameter subgraph problem: Few results and a wealth of open problems. 56th Annual AustMS Meeting (Combinatorics Session), Federation University Australia, Australia, 24-27 Sep 2012.
  13. Characterisations of graphs of small defects and some of its applications. 35th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (35ACCMCC), Monash University, Australia, 5-9 Dec 2011.
  14. Hamiltonicity of Cayley, vertex-transitive and certain graph covers. 
    1. Noon lectures, Charles University, Czech Republic, 20 Jan 2011.
    2. Seminar session, University of West Bohemia, Czech Republic, Feb 2011.
  15. Graphs with small defects. 34th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (34ACCMCC), Australian National University, Australia, 6-10 Dec 2010.
  16. On graphs with cyclic defect or excess. 54th Annual AustMS Meeting (Combinatorics Session), The University of Queensland, Australia, 27-30 September, 2010.
  17. Constructions of Large Graphs: Techniques, New Results and Open Problems.
    1. Seminar session, The University of Western Australia, Australia, Jan 2010
    2. 33rd Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (33ACCMCC), University of Newcastle, Australia, 11-12 December, 2009.
  18. Bipartite graphs of defect 2. GTA’08 Workshop, University of Newcastle, Australia, 7-11 December, 2009.
  19. Advances in the degree/diameter problem. Seminar session, The University of Newcastle, Australia, Mar 2008.
  20. On the nonexistence of even degree graphs of diameter 2 and defect 2. The 14th Computing: The Australian Theory Symposium (CATS 2008), University of Wollongong, Australia, 22-25 January, 2008.
  21. On the nonexistence of odd degree graphs of diameter 2 and defect 2. 18th International Workshop on Combinatorial Algorithms (IWOCA 2007), Newcastle, Australia, 5-7 November, 2007.
  22. New results on the degree/diameter problem.
    1. Seminar session, University of West Bohemia, Czech Republic, Oct 2007.
    2. 2nd International Workshop on Optimal Network Topologies (IWONT  2007), Pilsen, Czech Republic, 17-21 Sep 2007.
  23. On graphs of maximum degree 5, diameter D and defect 2.  2nd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006), Mikulov, Czech Republic, 27-29 Nov 2006.
  24. On the degree/diameter problem for both bipartite and non-bipartite graphs.
    1. Seminar session, University of West Bohemia, Czech Republic, Oct 2006.
    2. Seminar session, University of Lleida, Spain, Oct 2006.
  25. New largest graphs of diameter 6. 5th Cracow Conference on Graph Theory, Ustron, Poland, 11-15 Sep 2006.
  26. On (Delta,2,2)-graphs. 15th Workshop Cycles and Colorings, Tatranska Strba, Slovakia, 3-8 Sep 2006.
  27. On Large Graphs with Given Degree and Diameter. 16th Australasian Workshop on Combinatorial Algorithms, University of Ballarat, Australia, 18-21 Sep 2005.