2020

October 23, 2020: Ben Lund, CS Colloquium, SUNY Korea, Incheon, Korea.
 The finite field Kakeya problem

October 23, 2020: Ojoung Kwon, 2020 KMS Annual Meeting (October 2324), Online, Korea.
 Halfintegral Erdős–Pósa property of directed odd cycles

October 23, 2020: Jungho Ahn, 2020 KMS Annual Meeting (October 2324), Online, Korea.
 A polynomial kernel for 3leaf power deletion

October 23, 2020: Pascal Gollin, 2020 KMS Annual Meeting (October 2324), Online, Seoul.
 Disjoint dijoins for classes of dicuts in finite and infinite digraphs

October 23, 2020: Minki Kim, 2020 KMS Annual Meeting (October 2324), Online, Korea.
 Topological colorful Helly for rainbow independent sets

October 23, 2020: Jinha Kim, 2020 KMS Annual Meeting (October 2324), Online, Korea.
 Rainbow paths and rainbow matchings in graphs

October 23, 2020: Duksang Lee, 2020 KMS Annual Meeting (October 2324), Online, Korea.
 Characterizing matroids whose bases form graphic deltamatroids

October 16, 2020: Dabeen Lee, CS Colloquium, SUNY Korea, Incheon, Korea.
 Test score based algorithms for budgeted stochastic submodular maximization

September 29, 2020: Minki Kim, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 Complexes of graphs with bounded independence number

September 22, 2020: Jinha Kim, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 Collapsibility of NonCover Complexes of Graphs

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

September 8, 2020: Rutger Campbell, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 Disasters in abstracting combinatorial properties of linear dependence

August 27, 2020: Kevin Hendrey, SCMS Combinatorics Seminar, Shanghai Center for Mathematical Sciences, Shanghai, China.
 Counting cliques in 1planar graphs

August 26, 2020: Tuan Tran, CMSA seminar, Combinatorial Mathematics Society of Australasia, Australia.
 Singularity of random combinatorial matrices

August 25, 2020: Ben Lund, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 Pointplane incidence bounds

August 24, 2020: Tuan Tran, 2020 Combinatorics Workshop, Online, Korea.
 The singularity of random combinatorial matrices

August 18, 2020: Tuan Tran, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 Anticoncentration phenomena

August 11, 2020: Yunbum Kook, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 Vertex Sparsification for Edge Connectivity

July 20, 2020: Pascal Gollin, Graphs and Matroids, Matroid Union, Online.
 Obstructions for bounded branchdepth in matroids

July 14, 2020: Casey Tompkins, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.

July 10, 2020: Dabeen Lee, IME Special Seminar, POSTECH, Pohang, Korea.
 Distributionally robust chanceconstrained programs under Wasserstein ambiguity

June 25, 2020: Jungho Ahn, 46th International Workshop on GraphTheoretic Concepts in Computer Science (WG2020) (June 2426), University of Leeds, Leeds, UK.
 Wellpartitioned chordal graphs: obstruction set and disjoint paths

June 9, 2020: Dabeen Lee, 21st Conference on Integer Programming and Combinatorial Optimization (June 810), LSE, London, UK.
 On a Generalization of the ChvátalGomory Closure

May 19, 2020: Ojoung Kwon, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 Mimwidth: a width parameter beyond rankwidth

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

April 21, 2020: Sangil Oum, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.

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

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

March 24, 2020: Kevin Hendrey, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 Covering radius in the Hamming permutation space

March 19, 2020: Sangil Oum, New Perspectives in Colouring and Structure (March 1520), Banff International Research Station (BIRS), Banff, Canada.
 3degenerate
induced subgraph
of a planar graph

March 17, 2020: Dabeen Lee, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 On a generalization of the ChvátalGomory closure

February 18, 2020: Dong Yeap Kang, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 Fragile minormonotone parameters under random edge perturbation

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

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

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

December 14, 2019: Abhishek Methuku, 95th KPPY Combinatorics Workshop (December 14, 2019), Yeungnam University, Gyeongsan, Korea.
 Bipartite Turán problems for ordered graphs

December 13, 2019: Kevin Hendrey, 42nd Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (ACCMCC) (December 913), University of New South Wales, Sydney, Australia.
 The minimum connectivity forcing forest minors in large graphs

December 6, 2019: Kevin Hendrey, 63nd Annual Meeting of the Australian Mathematical Society (December 36), Monash University, Melbourne, Australia.
 Covering radius in the Hamming permutation space

November 9, 2019: Sangil Oum, Combinatorial and Discrete Optimization, 2019 KSIAM Annual Meeting (November 810), Yeosu, Korea.
 Rankwidth: Algorithmic and structural results

November 9, 2019: Dong Yeap Kang, Combinatorial and Discrete Optimization, 2019 KSIAM Annual Meeting (November 810), Yeosu, Korea.
 On minimal highly connected spanning subgraphs in dense digraphs

November 8, 2019: Dabeen Lee, Combinatorial and Discrete Optimization, 2019 KSIAM Annual Meeting (November 810), Yeosu, Korea.
 Joint Chanceconstrained programs and the intersection of mixing sets through a submodularity lens

November 2, 2019: Ojoung Kwon, The 2nd East Asia Workshop on Extremal and Structural Graph Theory (October 31November 4), IBS Discrete Mathematics Group, Jeju, Korea.
 A survey of recent progress on ErdősPósa type problems

November 2, 2019: Abhishek Methuku, The 2nd East Asia Workshop on Extremal and Structural Graph Theory (October 31November 4), IBS Discrete Mathematics Group, Jeju, Korea.
 On a hypergraph bipartite Turán problem

October 29, 2019: Pascal Gollin, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 A CantorBernsteintype theorem for spanning trees in infinite graphs

October 27, 2019: Sangil Oum, 2019 KMS Annual Meeting (October 2527), Hongik University, Seoul, Korea.
 The ErdősHajnal property for graphs with no fixed cycle as a pivotminor

October 27, 2019: Pascal Gollin, Extremal and Structural Graph Theory, 2019 KMS Annual Meeting (October 2527), Hongik University, Seoul, Korea.
 Progress on the Ubiquity Conjecture

October 27, 2019: Ojoung Kwon, Extremal and Structural Graph Theory, 2019 KMS Annual Meeting (October 2527), Hongik University, Seoul, Korea.
 ErdősPósa property of Hinduced subdivisions

October 26, 2019: Kevin Hendrey, Extremal and Structural Graph Theory, 2019 KMS Annual Meeting (October 2527), Hongik University, Seoul, Korea.
 Defective and clustered choosability of sparse graphs

October 26, 2019: Casey Tompkins, Extremal and Structural Graph Theory, 2019 KMS Annual Meeting (October 2527), Hongik University, Seoul, Korea.
 Generalizations of the ErdősGallai theorem

October 20, 2019: Dabeen Lee, 2019 INFORMS Annual Meeting (October 2023), Seattle, USA.
 On some polytopes contained in the 0,1 hypercube that have a small Chvatal rank

October 20, 2019: Dabeen Lee, 2019 INFORMS Annual Meeting (October 2023), Seattle, USA.
 Joint chanceconstrained programs and intersection of mixing sets through a submodularity lens

October 1, 2019: Casey Tompkins, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 Extremal problems for Berge hypergraphs

September 24, 2019: Sangil Oum, The 9th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2019), TU Wien (September 2326), TU Wien, Vienna, Austria.
 Branchdepth: Generalizing treedepth of graphs

September 10, 2019: Kevin Hendrey, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 The minimum connectivity forcing forest minors in large graphs

August 14, 2019: Dong Yeap Kang, 2019 Combinatorics Workshop (August 1315), Songdo, Incheon, Korea.
 Recent advances in degenerate Turántype problems

August 13, 2019: Dabeen Lee, 2019 Combinatorics Workshop (August 1315), Hotel Skypark, Incheon, Korea.
 On the Chvatal rank for integer programming

August 12, 2019: Abhishek Methuku, 20192 IBS OneDay Conference on Extremal Graph Theory, IBS Discrete Mathematics Group, Daejeon, Korea.
 Bipartite Turán problems for ordered graphs

August 1, 2019: Sangil Oum, 2019 IBS Summer Research Program on Algorithms and Complexity in Discrete Structures (July 21August 10), IBS Discrete Mathematics Group, Daejeon, Korea.
 Branchdepth: Generalizing treedepth of graphs

July 16, 2019: Dabeen Lee, Discrete Math Seminar, IBS Discrete Mathematics Group, Daejeon, Korea.
 Integrality of set covering polyhedra and clutter minors

July 4, 2019: Sangil Oum, Graph Colouring: from Structure to Algorithms (June 30July 5), Dagstuhl Workshop, Dagstuhl, Germany.
 The ErdősHajnal property for graphs with no fixed cycle as a pivotminor

June 6, 2019: Sangil Oum, International Conference on Network Games, Tropical Geometry, and Quantum Communication (June 37), Berlin Mathematics Research Center MATH+, Zuse Institute of Berlin, Berlin, Germany.

May 28, 2019: Sangil Oum, Minisymposium “structural graph theory”, CanaDAM 2019 (May 2831), Simon Fraser University, Vancouver, Canada.
 The ErdősHajnal property for graphs with no fixed cycle as a pivotminor

May 1, 2019: Sangil Oum, Structural Graph Theory and Graph Coloring (April 29May 3), Tsinghua Sanya International Mathematics Forum, Sanya, China.
 Branchdepth: Generalizing treedepth of graphs

April 20, 2019: Sangil Oum, Plenary Lecture, 2019 KMS Spring Meeting (April 1920), Kangwon National University, Chuncheon, Korea.
 How to decompose a graph into a treelike structure

April 16, 2019: Sangil Oum, PCS Seminar, Center for Theoretical Physics of Complex Systems, Institute for Basic Science, Daejeon, Korea.
 How to decompose a graph into a treelike structure

March 31, 2019: Sangil Oum, 2019 Spring Jinhua Workshop on Graph Theory, Zhejiang Normal University, Jinhua, China.
 Branchdepth: Generalizing treedepth of graphs

March 28, 2019: Sangil Oum, Colloquium, GIST College, GIST, Gwangju, Korea.

March 22, 2019: Sangil Oum, Special Session on Structural Graph Theory, AMS Spring Central and Western Joint Sectional Meeting (March 2224), University of Hawaiʻi at Mānoa, Hawaii, USA.
 Classes of graphs with no long cycle as a vertexminor are polynomially 𝜒bounded

February 21, 2019: Sangil 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 vertexminor are polynomially 𝜒bounded

February 11, 2019: Dong Yeap Kang, 20191 IBS Workshop on Graph Theory (February 1112, 2019), IBS, Daejeon, Korea.
 On the rational Turán exponents conjecture
2018

December 22, 2018: Dong Yeap Kang, 22nd KIAS Combinatorics Workshop (December 1922, 2018), Shilla Stay, Busan, Korea.
 Some extremal results on highly connected tournamentlike digraphs

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