Talks

2021

  1. June 8, 2021: O-joung Kwon (권오정), Discrete Math Seminar, IBS Discrete Mathematics Group, Online, Korea.
    • Classes of intersection digraphs with good algorithmic properties
  2. June 4, 2021: Ben Lund, Moscow Conference on Combinatorics and Applications (MoCCA '20) (May 31 - June 4), Online, Russia.
    • Finite field Kakeya and Furstenberg sets
  3. May 25, 2021: Ben Lund, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Limit shape of lattice Zonotopes
  4. May 18, 2021: Pascal Gollin, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Enlarging vertex-flames in countable digraphs
  5. May 10, 2021: Jungho Ahn (안정호), 12th International Conference on Algorithms and Complexity (CIAC2021) (May 10-12), Online, Larnaka, Cyprus.
    • Three problems on well-partitioned chordal graphs
  6. May 5, 2021: Pascal Gollin, Forschungsseminar, University of Hamburg, Hamburg, Germany.
    • A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups II
  7. May 4, 2021: Pascal Gollin, Forschungsseminar, University of Hamburg, Hamburg, Germany.
    • A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups I
  8. April 30, 2021: Debsoumya Chakraborti, 2021 KMS Spring Meeting, Online, Korea.
    • Generalized graph saturation
  9. April 29, 2021: Minki Kim (김민기), 2021 KMS Spring Meeting (April 29-30), Online, Korea.
    • A system of disjoint representatives of line segments
  10. April 29, 2021: O-joung Kwon (권오정), 2021 KMS Spring Meeting (April 29-30), Online, Korea.
    • Measuring what matters: a hybrid approach to dynamic programming with tree-width
  11. April 29, 2021: Jungho Ahn (안정호), 2021 KMS Spring Meeting (April 29-30), Online, Korea.
    • Well-partitioned chordal graphs: obstruction set and applications
  12. April 28, 2021: Minki Kim (김민기), Build a network of young researchers in mathematics I (제1차 수학분야 신진연구자의 네트워크 구축 ), Online, Korea.
    • Domination numbers and non cover complexes of hypergraphs
  13. April 28, 2021: Jinha Kim (김진하), Build a network of young researchers in mathematics I (제1차 수학분야 신진연구자의 네트워크 구축 ), Online, Korea.
    • The homotopy type of the independence complex of graphs with no induced cycles of length divisible by 3
  14. April 28, 2021: Ben Lund, Build a network of young researchers in mathematics I (제1차 수학분야 신진연구자의 네트워크 구축 ), Online, Korea.
    • Kakeya and Furstenberg sets over finite fields
  15. April 28, 2021: Dabeen Lee (이다빈), ISysE seminar, KAIST, Daejeon, Korea.
    • Data-driven chance-constrained optimization under Wasserstein ambiguity
  16. April 27, 2021: Jungho Ahn (안정호), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Well-partitioned chordal graphs with the obstruction set and applications
  17. April 20, 2021: Dabeen Lee (이다빈), Rookies Pitch (서울대학교 수리과학부 신진연구자 연구발표회), Department of Mathematical Sciences, Seoul National University, Seoul, Korea.
    • Data-driven chance-constrained optimization under Wasserstein ambiguity
  18. April 20, 2021: Sang-il Oum (엄상일), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • What is an isotropic system?
  19. April 13, 2021: William Overman, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Some Ordered Ramsey Numbers of Graphs on Four Vertices
  20. April 9, 2021: Sang-il Oum (엄상일), Bordeaux Graph Seminar, LaBRI, Bordeaux, France.
    • A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
  21. April 6, 2021: Rutger Campbell, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Matroid orientability and representability
  22. March 30, 2021: Casey Tompkins, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • 3-uniform hypergraphs avoiding a cycle of length four
  23. March 9, 2021: Debsoumya Chakraborti, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Some classical problems in graph saturation
  24. March 2, 2021: Kevin Hendrey, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
  25. March 1, 2021: O-joung Kwon (권오정), Graphs and Matroids, Matroid Union, Online.
    • A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
  26. February 23, 2021: Minki Kim (김민기), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Rainbow paths and rainbow matchings
  27. January 26, 2021: Tuan Tran, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Minimum saturated families of sets
  28. January 20, 2021: Dabeen Lee (이다빈), Special Seminar, Department of Applied Mathematics & Statistics, Johns Hopkins University, Baltimore, USA.
    • Data-driven optimization: test score algorithms and distributionally robust approach
  29. January 19, 2021: Ben Lund, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Perfect matchings and derangements on graphs
  30. January 12, 2021: Yunbum Kook (국윤범), ACM-SIAM Symposium on Discrete Algorithms (SODA21) (January 10-13), Online, Alexandria, Virginia, USA.
    • Vertex Sparsification for Edge Connectivity
  31. January 5, 2021: O-joung Kwon (권오정), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Directed tangles and applications

2020

  1. December 22, 2020: Jinha Kim (김진하), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • On a conjecture by Kalai and Meshulam – the Betti number of the independence complex of ternary graphs
  2. December 15, 2020: O-joung Kwon (권오정), The 15th International Symposium on Parameterized and Exact Computation (IPEC'20) (December 14-18), Online, Hong Kong, China.
    • Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth
  3. December 14, 2020: Sang-il Oum (엄상일), The 31st International Symposium on Algorithms and Computation (ISAAC'20) (December 14-18), Online, Hong Kong, China.
    • How to decompose a graph into a tree-like structure
  4. December 10, 2020: Dabeen Lee (이다빈), Séminaire virtuel de théorie des graphes et combinatoire en Rhône-Alpes et Auvergne, Online, France.
    • The 𝜏=2 conjecture and multipartite clutters
  5. December 9, 2020: Tuan Tran, AMSS Lecture, Online, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China.
    • A glimpse of Littlewood-Offord theory
  6. December 1, 2020: Debsoumya Chakraborti, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Rainbow matchings in edge-colored simple graphs
  7. November 24, 2020: Kevin Hendrey, CMSA seminar, Online, Combinatorial Mathematics Society of Australasia.
    • Obstructions to bounded branch-depth in matroids
  8. November 24, 2020: Duksang Lee (이덕상), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Characterizing matroids whose bases form graphic delta-matroids
  9. November 5, 2020: Sang-il Oum (엄상일), Séminaire virtuel de théorie des graphes et combinatoire en Rhône-Alpes et Auvergne, Online, France.
    • Obstructions for bounded shrub-depth and rank-depth of graphs
  10. October 27, 2020: Jeong Ok Choi (최정옥), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Various game-theoretic models on graphs
  11. October 23, 2020: Ben Lund, CS Colloquium, SUNY Korea, Incheon, Korea.
    • The finite field Kakeya problem
  12. October 23, 2020: O-joung Kwon (권오정), 2020 KMS Annual Meeting (October 23-24), Online, Korea.
    • Half-integral Erdős–Pósa property of directed odd cycles
  13. October 23, 2020: Jungho Ahn (안정호), 2020 KMS Annual Meeting (October 23-24), Online, Korea.
    • A polynomial kernel for 3-leaf power deletion
  14. October 23, 2020: Pascal Gollin, 2020 KMS Annual Meeting (October 23-24), Online, Seoul.
    • Disjoint dijoins for classes of dicuts in finite and infinite digraphs
  15. October 23, 2020: Minki Kim (김민기), 2020 KMS Annual Meeting (October 23-24), Online, Korea.
    • Topological colorful Helly for rainbow independent sets
  16. October 23, 2020: Jinha Kim (김진하), 2020 KMS Annual Meeting (October 23-24), Online, Korea.
    • Rainbow paths and rainbow matchings in graphs
  17. October 23, 2020: Duksang Lee (이덕상), 2020 KMS Annual Meeting (October 23-24), Online, Korea.
    • Characterizing matroids whose bases form graphic delta-matroids
  18. October 16, 2020: Dabeen Lee (이다빈), CS Colloquium, SUNY Korea, Incheon, Korea.
    • Test score based algorithms for budgeted stochastic submodular maximization
  19. September 29, 2020: Minki Kim (김민기), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Complexes of graphs with bounded independence number
  20. September 22, 2020: Jinha Kim (김진하), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Collapsibility of Non-Cover Complexes of Graphs
  21. September 15, 2020: Debsoumya Chakraborti, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Maximum number of cliques in a graph with bounded maximum degree
  22. September 8, 2020: Rutger Campbell, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Disasters in abstracting combinatorial properties of linear dependence
  23. August 27, 2020: Kevin Hendrey, SCMS Combinatorics Seminar, Shanghai Center for Mathematical Sciences, Shanghai, China.
    • Counting cliques in 1-planar graphs
  24. August 26, 2020: Tuan Tran, CMSA seminar, Combinatorial Mathematics Society of Australasia, Australia.
    • Singularity of random combinatorial matrices
  25. August 25, 2020: Ben Lund, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Point-plane incidence bounds
  26. August 25, 2020: Yunbum Kook (국윤범), 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (SIGKDD) (August 23-27), Online, San Diego, USA.
    • Incremental Lossless Graph Summarization
  27. August 24, 2020: Tuan Tran, 2020 Combinatorics Workshop, Online, Korea.
    • The singularity of random combinatorial matrices
  28. August 18, 2020: Tuan Tran, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Anti-concentration phenomena
  29. August 11, 2020: Yunbum Kook (국윤범), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Vertex Sparsification for Edge Connectivity
  30. July 20, 2020: Pascal Gollin, Graphs and Matroids, Matroid Union, Online.
    • Obstructions for bounded branch-depth in matroids
  31. July 14, 2020: Casey Tompkins, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Inverse Turán Problems
  32. July 10, 2020: Dabeen Lee (이다빈), IME Special Seminar, POSTECH, Pohang, Korea.
    • Distributionally robust chance-constrained programs under Wasserstein ambiguity
  33. June 25, 2020: Jungho Ahn (안정호), 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2020) (June 24-26), University of Leeds, Leeds, UK.
    • Well-partitioned chordal graphs: obstruction set and disjoint paths
  34. June 9, 2020: Dabeen Lee (이다빈), 21st Conference on Integer Programming and Combinatorial Optimization (June 8-10), LSE, London, UK.
    • On a Generalization of the Chvátal-Gomory Closure
  35. May 19, 2020: O-joung Kwon (권오정), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Mim-width: a width parameter beyond rank-width
  36. May 14, 2020: Casey Tompkins, Extremal Sets seminar, Alfréd Rényi Institute of Mathematics, Budapest, Hungary.
    • Saturation problems in the Ramsey theory of graphs, posets and point sets
  37. April 21, 2020: Sang-il Oum (엄상일), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Survey on vertex-minors
  38. April 14, 2020: Casey Tompkins, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Saturation problems in the Ramsey theory of graphs, posets and point sets
  39. April 7, 2020: Pascal Gollin, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Disjoint dijoins for classes of dibonds in finite and infinite digraphs
  40. March 24, 2020: Kevin Hendrey, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Covering radius in the Hamming permutation space
  41. March 19, 2020: Sang-il Oum (엄상일), New Perspectives in Colouring and Structure (March 15-20), Banff International Research Station (BIRS), Banff, Canada.
    • 3-degenerate
 induced subgraph 
of a planar graph
  42. March 17, 2020: Dabeen Lee (이다빈), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • On a generalization of the Chvátal-Gomory closure
  43. February 18, 2020: Dong Yeap Kang (강동엽), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Fragile minor-monotone parameters under random edge perturbation
  44. January 4, 2020: Abhishek Methuku, 2020 One day Meeting on Extremal Combinatorics (January 4, 2020), Ewha Womans University, Seoul, Korea.
    • Bipartite Turán problems for ordered graphs

2019

  1. December 20, 2019: Dabeen Lee (이다빈), Frontiers in Industrial & Systems Engineering, 2019 Winter ISysE Symposium, KAIST, Daejeon, Korea.
    • Linear programs with probabilistic constraints and binary mixing sets
  2. December 19, 2019: Casey Tompkins, Seminar on Mathematical Foundations for Computer Science, Institute of Mathematics, Vietnam Academy of Science and Technology, Hanoi, Vietnam.
    • Generalized Turán problems
  3. December 14, 2019: Abhishek Methuku, 95th KPPY Combinatorics Workshop (December 14, 2019), Yeungnam University, Gyeongsan, Korea.
    • Bipartite Turán problems for ordered graphs
  4. December 13, 2019: Kevin Hendrey, 42nd Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (ACCMCC) (December 9-13), University of New South Wales, Sydney, Australia.
    • The minimum connectivity forcing forest minors in large graphs
  5. December 6, 2019: Kevin Hendrey, 63nd Annual Meeting of the Australian Mathematical Society (December 3-6), Monash University, Melbourne, Australia.
    • Covering radius in the Hamming permutation space
  6. 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
  7. 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
  8. 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
  9. 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
  10. 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
  11. October 29, 2019: Pascal Gollin, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
  12. 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
  13. 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
  14. 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
  15. 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
  16. 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
  17. 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
  18. 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
  19. October 1, 2019: Casey Tompkins, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Extremal problems for Berge hypergraphs
  20. 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
  21. September 10, 2019: Kevin Hendrey, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • The minimum connectivity forcing forest minors in large graphs
  22. August 14, 2019: Dong Yeap Kang (강동엽), 2019 Combinatorics Workshop (August 13-15), Songdo, Incheon, Korea.
    • Recent advances in degenerate Turán-type problems
  23. August 13, 2019: Dabeen Lee (이다빈), 2019 Combinatorics Workshop (August 13-15), Hotel Skypark, Incheon, Korea.
    • On the Chvatal rank for integer programming
  24. 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
  25. 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
  26. July 16, 2019: Dabeen Lee (이다빈), Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
    • Integrality of set covering polyhedra and clutter minors
  27. 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
  28. 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
  29. 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
  30. 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
  31. 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
  32. 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
  33. 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
  34. March 28, 2019: Sang-il Oum (엄상일), Colloquium, GIST College, GIST, Gwangju, Korea.
    • 4색정리 이야기
  35. 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
  36. 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
  37. February 11, 2019: Dong Yeap Kang (강동엽), 2019-1 IBS Workshop on Graph Theory (February 11-12, 2019), IBS, Daejeon, Korea.
    • On the rational Turán exponents conjecture

2018

  1. December 22, 2018: Dong Yeap Kang (강동엽), 22nd KIAS Combinatorics Workshop (December 19-22, 2018), Shilla Stay, Busan, Korea.
    • Some extremal results on highly connected tournament-like digraphs
  2. 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