Talks

2019

  1. November 9, 2019: Sang-il Oum, Combinatorial and Discrete Optimization, 2019 KSIAM Annual Meeting (November 8-10), Yeosu, Korea.
    • Rank-width: Algorithmic and structural results
  2. November 9, 2019: Dong Yeap Kang, Combinatorial and Discrete Optimization, 2019 KSIAM Annual Meeting (November 8-10), Yeosu, Korea.
    • On minimal highly connected spanning subgraphs in dense digraphs
  3. November 8, 2019: Dabeen Lee, Combinatorial and Discrete Optimization, 2019 KSIAM Annual Meeting (November 8-10), Yeosu, Korea.
    • Joint Chance-constrained programs and the intersection of mixing sets through a submodularity lens
  4. November 2, 2019: O-joung Kwon, The 2nd East Asia Workshop on Extremal and Structural Graph Theory (October 31-November 4), IBS Discrete Mathematics Group, Jeju, Korea.
    • A survey of recent progress on Erdős-Pósa type problems
  5. November 2, 2019: Abhishek Methuku, The 2nd East Asia Workshop on Extremal and Structural Graph Theory (October 31-November 4), IBS Discrete Mathematics Group, Jeju, Korea.
    • On a hypergraph bipartite Turán problem
  6. October 27, 2019: Sang-il Oum, 2019 KMS Annual Meeting (October 25-27), Hongik University, Seoul, Korea.
    • The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
  7. October 27, 2019: Pascal Gollin, Extremal and Structural Graph Theory, 2019 KMS Annual Meeting (October 25-27), Hongik University, Seoul, Korea.
    • Progress on the Ubiquity Conjecture
  8. October 27, 2019: O-joung Kwon, Extremal and Structural Graph Theory, 2019 KMS Annual Meeting (October 25-27), Hongik University, Seoul, Korea.
    • Erdős-Pósa property of H-induced subdivisions
  9. October 26, 2019: Kevin Hendrey, Extremal and Structural Graph Theory, 2019 KMS Annual Meeting (October 25-27), Hongik University, Seoul, Korea.
    • Defective and clustered choosability of sparse graphs
  10. October 26, 2019: Casey Tompkins, Extremal and Structural Graph Theory, 2019 KMS Annual Meeting (October 25-27), Hongik University, Seoul, Korea.
    • Generalizations of the Erdős-Gallai theorem
  11. October 20, 2019: Dabeen Lee, 2019 INFORMS Annual Meeting (October 20-23), Seattle, USA.
    • On some polytopes contained in the 0,1 hypercube that have a small Chvatal rank
  12. October 20, 2019: Dabeen Lee, 2019 INFORMS Annual Meeting (October 20-23), Seattle, USA.
    • Joint chance-constrained programs and intersection of mixing sets through a submodularity lens
  13. September 24, 2019: Sang-il Oum, The 9th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2019), TU Wien (September 23-26), TU Wien, Vienna, Austria.
    • Branch-depth: Generalizing tree-depth of graphs
  14. August 14, 2019: Dong Yeap Kang, 2019 Combinatorics Workshop (August 13-15), Songdo, Incheon, Korea.
    • Recent advances in degenerate Turán-type problems
  15. August 13, 2019: Dabeen Lee, 2019 Combinatorics Workshop (August 13-15), Hotel Skypark, Incheon, Korea.
    • On the Chvatal rank for integer programming
  16. August 12, 2019: Abhishek Methuku, 2019-2 IBS One-Day Conference on Extremal Graph Theory, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Bipartite Turán problems for ordered graphs
  17. August 1, 2019: Sang-il Oum, 2019 IBS Summer Research Program on Algorithms and Complexity in Discrete Structures (July 21-August 10), IBS Discrete Mathematics Group, Daejeon, Korea.
    • Branch-depth: Generalizing tree-depth of graphs
  18. July 4, 2019: Sang-il Oum, Graph Colouring: from Structure to Algorithms (June 30-July 5), Dagstuhl Workshop, Dagstuhl, Germany.
    • The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
  19. June 6, 2019: Sang-il Oum, International Conference on Network Games, Tropical Geometry, and Quantum Communication (June 3-7), Berlin Mathematics Research Center MATH+, Zuse Institute of Berlin, Berlin, Germany.
    • Survey on vertex-minors
  20. May 28, 2019: Sang-il Oum, Mini-symposium “structural graph theory”, CanaDAM 2019 (May 28-31), Simon Fraser University, Vancouver, Canada.
    • The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
  21. May 1, 2019: Sang-il Oum, Structural Graph Theory and Graph Coloring (April 29-May 3), Tsinghua Sanya International Mathematics Forum, Sanya, China.
    • Branch-depth: Generalizing tree-depth of graphs
  22. April 20, 2019: Sang-il Oum, Plenary Lecture, 2019 KMS Spring Meeting (April 19-20), Kangwon National University, Chuncheon, Korea.
    • How to decompose a graph into a tree-like structure
  23. April 16, 2019: Sang-il Oum, PCS Seminar, Center for Theoretical Physics of Complex Systems, Institute for Basic Science, Daejeon, Korea.
    • How to decompose a graph into a tree-like structure
  24. March 31, 2019: Sang-il Oum, 2019 Spring Jinhua Workshop on Graph Theory, Zhejiang Normal University, Jinhua, China.
    • Branch-depth: Generalizing tree-depth of graphs
  25. March 28, 2019: Sang-il Oum, Colloquium, GIST College, GIST, Gwangju, Korea.
    • 4색정리 이야기
  26. March 22, 2019: Sang-il Oum, Special Session on Structural Graph Theory, AMS Spring Central and Western Joint Sectional Meeting (March 22-24), University of Hawaiʻi at Mānoa, Hawaii, USA.
    • Classes of graphs with no long cycle as a vertex-minor are polynomially 𝜒-bounded
  27. February 21, 2019: Sang-il Oum, Taipei International Workshop on Combinatorics and Graph Theory, Institute of Mathematics, Academia Sinica, Taipei, China.
    • Classes of graphs with no long cycle as a vertex-minor are polynomially 𝜒-bounded

2018

  1. December 1, 2018: Sang-il Oum, 2018 SCMS Workshop on Extremal and Structural Graph Theory (November 30-December 2), Shanghai Center for Mathematical Sciences, Fudan University, Shanghai, China.
    • Classes of graphs with no long cycle as a vertex-minor are polynomially 𝜒-bounded