Papers

Submitted / Preprint

  1. Dániel Grósz, Abhishek Methuku, and Casey Tompkins, Ramsey numbers of Boolean lattices, 2021.
    arXiv2104.02002Last update: April 8, 2021
  2. Debsoumya Chakraborti and Da Qi Chen, Many cliques with few edges and bounded maximum degree, 2021.
    arXiv2003.07943Last update: March 30, 2021
  3. Debsoumya Chakraborti, Alan Frieze, and Mihir Hasabnis, Colorful Hamilton cycles in random graphs, 2021.
    arXiv2103.03916Last update: March 9, 2021
  4. J. Pascal Gollin, Kevin Hendrey, Ken-ichi Kawarabayashi, O-joung Kwon, and Sang-il Oum, A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups, 2021.
    arXiv2102.01986Last update: February 4, 2021
  5. Jinha Kim, The homotopy type of the independence complex of graphs with no induced cycle of length divisible by 3, 2021.
    arXiv2101.07131Last update: February 3, 2021
  6. Jinha Kim, Minki Kim, and O-joung Kwon, A system of disjoint representatives of line segments with given k directions, 2021.
    arXiv2101.02887Last update: January 29, 2021
  7. Dabeen LeeMilan Vojnovic, and Se-Young Yun, Test score algorithms for budgeted stochastic utility maximization, 2020.
    arXiv2012.15194Last update: January 1, 2021
  8. Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen Lee, Conic mixed-binary sets: convex hull characterizations and applications, 2020.
    arXiv2012.14698Last update: January 1, 2021
  9. Nathan Bowler, Christian Elbrach, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen, Ubiquity in graphs II: Ubiquity of graphs with nowhere-linear end structure, 2020.
    arXiv1809.00602Last update: December 29, 2020
  10. Nathan Bowler, Christian Elbrach, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen, Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions, 2020.
    arXiv2012.13070Last update: December 25, 2020
  11. Matija Bucić, Nemanja Draganić, Benny Sudakov, and Tuan TranUnavoidable hypergraphs, 2020.
    arXiv2011.12944Last update: November 27, 2020
  12. Debsoumya Chakraborti and Po-Shen LohRainbow matchings in edge-colored simple graphs, 2020.
    arXiv2011.04650Last update: November 11, 2020
  13. Sang-il OumRank connectivity and pivot-minors of graphs, 2020.
    arXiv2011.03205Last update: November 9, 2020
  14. Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, and Daniel Vaz, Vertex sparsification for edge connectivity, 2020.
    arXiv2007.07862Last update: October 6, 2020
  15. Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, and O-joung Kwon, The canonical directed tree decomposition and its applications to the directed disjoint paths problem, 2020.
    arXiv2009.13184Last update: September 29, 2020
  16. J. Pascal Gollin and Karl Heuer, Characterising k-connected sets in infinite graphs, 2020.
    arXiv1811.06411Last update: December 25, 2020
  17. Jungho Ahn, Eun Jung Kim, and Euiwoong Lee, Towards constant-factor approximation for chordal / distance-hereditary vertex deletion, 2020.
    arXiv2009.00809Last update: September 3, 2020
  18. Beka Ergemlidze, Ervin Győri, Abhishek Methuku, Nike Salia, and Casey Tompkins, On 3-uniform hypergraphs avoiding a cycle of length four, 2020.
    arXiv2008.11372Last update: August 27, 2020
  19. Tuan Tran, Two problems in graph Ramsey theory, 2020.
    arXiv2008.07367Last update: August 19, 2020
  20. Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, and Daniël Paulusma, Tree pivot-minors and linear rank-width, 2020.
    arXiv2008.00561Last update: August 4, 2020
  21. Tuan Tran, The smallest singular value of random combinatorial matrices, 2020.
    arXiv2007.06318Last update: August 2, 2020
  22. Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, and O-joung Kwon, Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth, 2020.
    arXiv2007.14179Last update: July 29, 2020
  23. Duksang Lee and Sang-il Oum, Characterizing matroids whose bases form graphic delta-matroids, 2020.
    arXiv2007.13298Last update: July 28, 2020
  24. Ken-ichi Kawarabayashi, Stephan KreutzerO-joung Kwon, and Qiqin XieHalf-integral Erdős-Pósa property of directed odd cycles, 2020.
    arXiv2007.12257Last update: July 27, 2020
  25. Ervin Győri, Nika Salia, Casey Tompkins, and Oscar Zamora,  Inverse Turán numbers, 2020.
    arXiv2007.07042Last update: July 15, 2020
  26. Sanjeeb Dash, Oktay Günlük, and Dabeen LeeOn a generalization of the Chvátal-Gomory closure, 2020
    arXiv2007.04880Last update: July 15, 2020
  27. Nam Ho-Nguyen, Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen LeeStrong formulations for distributionally robust chance-constrained programs with left-hand side uncertainty under Wasserstein ambiguity, 2020.
    arXiv2007.06750Last update: July 15, 2020
  28. Dong Yeap Kang, Mihyun Kang, Jaehoon Kim, and Sang-il OumFragile minor-monotone parameters under random edge perturbation, 2020.
    arXiv2005.09897Last update: May 21, 2020
  29. Joshua Erde, J. Pascal Gollin, and Attila JoóEnlarging vertex-flames in countable digraphs, 2020.
    arXiv2003.06178Last update: March 16, 2020
  30. Jungho Ahn, Lars Jaffke, O-joung Kwon, and Paloma T. Lima, Well-partitioned chordal graphs: obstruction set and disjoint paths, 2020.
    arXiv2002.10859Last update: February 26, 2020
  31. Yangyan Gu, H. A. Kierstead, Sang-il Oum, Hao Qi, and Xuding Zhu, 3-degenerate induced subgraph of a planar graph, 2020.
    arXiv2002.07984Last update: July 28, 2020
  32. Ervin Győri, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora, Generalized planar Turán numbers, 2020.
    arXiv2002.04579Last update: February 12, 2020
  33. Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, and Máté Vizer, Turán problems for edge-ordered graphs, 2020.
    arXiv2001.00849Last update: April 1, 2020
  34. Nika Salia, Christoph SpigelCasey Tompkins, and Oscar Zamora, Independent chains in acyclic posets, 2019.
    arXiv1912.03288Last update: December 11, 2019
  35. Dániel Gerbner, Tamás MészárosAbhishek Methuku, and Cory Palmer, Generalized rainbow Turán problems, 2019.
    arXiv1911.06642Last update: November 18, 2019
  36. Jungho Ahn, Eduard EibenO-joung Kwon, and Sang-il Oum, A polynomial kernel for 3-leaf power deletion, 2019.
    arXiv1911.04249Last update: January 30, 2020
  37. Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen Lee, Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens, 2019
    arXiv1910.01353Last update: October 20, 2019
  38. Ervin Győri, Addis Paulos, Nike Salia, Casey Tompkins, and Oscar Zamora, The maximum number of pentagons in a planar graph, 2019.
    arXiv1909.13532Last update: October 20, 2019
  39. Ervin Győri, Addis Paulos, Nike Salia, Casey Tompkins, and Oscar Zamora, The maximum number of paths of length three in a planar graph, 2019.
    arXiv1909.13539Last update: October 20, 2019
  40. Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee, and Matt Superdock, Projective geometries, simplices and clutters, 2019.
    arXiv1908.10629Last update: October 21, 2019
  41. Abhishek Methuku and István Tomon, Bipartite Turán problems for ordered graphs, 2019.
    arXiv1908.03189Last update: October 20, 2019
  42. Martin Balko, Dániel Gerbner, Dong Yeap Kang, Younjin Kim, and Cory Palmer, Hypergraph based Berge hypergraphs, 2019.
    arXiv1908.00092Last update: November 14, 2019

Published

Accepted

  1. Jinha Kim, Minki Kim, and O-joung Kwon, Rainbow independent sets on dense graph classes, Discrete Appl. Math., accepted, 2021.
    arXiv2001.10566Last update: April 9, 2021
  2. Jan Corsten and Tuan Tran, Balanced supersaturation for some degenerate hypergraphs, J. Graph Theory, accepted, 2021.
    doi10.1002/jgt.22674Last update: April 5, 2021
  3. Debsoumya Chakraborti, Da Qi Chen, and Mihir Hasabnis, Minimizing the number of edges in $K_{s,t}$-saturated bipartite graphs, SIAM J. Discrete Math., accepted, 2021.
    arXiv2009.07651Last update: March 30, 2021
  4. J. Pascal Gollin, Kevin Hendrey, Dillon Mayhew, and Sang-il Oum, Obstructions for bounded branch-depth in matroids, Adv. Comb., accepted, 2021.
    arXiv2003.13975Last update: March 22, 2021
  5. Eun Jung Kim and O-joung Kwon, A polynomial kernel for distance-hereditary vertex deletion, Algorithmica, accepted, 2021.
    arXiv1610.07229Last update: March 8, 2021
  6. Minki Kim and Alan Lew, Complexes of graphs with bounded independence number, Israel J. Math., accepted, 2021.
    arXiv1912.12605Last update: February 5, 2021
  7. O-joung Kwon and Jean-Florent Raymond, Packing and covering induced subdivisions, SIAM J. Discrete Math., accepted, 2021.
    arXiv1803.07581Last update: January 19, 2021
  8. Nam Ho-Nguyen, Fatma Kılınç-Karzan, Simge Küçükyavuz, and Dabeen Lee, Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity, Math. Program., accepted, 2020.
    doi10.1007/s10107-020-01605-y arXiv2003.12685Last update: February 15, 2021
  9. Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, and Dabeen Lee, Idealness of k-wise intersecting families, Math. Program., accepted, 2020.
    doi10.1007/s10107-020-01587-x arXiv1912.00614Last update: November 20, 2020
  10. Ringi Kim, Sergey Norin, and Sang-il Oum, Obstructions for partitioning into forests and outerplanar graphs, Discrete Appl. Math., 2020.
    doi10.1016/j.dam.2020.09.006 arXiv1903.08425Last update: September 26, 2020
  11. Jim Geelen, O-joung Kwon, Rose McCarty, and Paul Wollan, The grid theorem for vertex-minors, J. Combin. Theory Ser. B, accepted, 2020.
    doi10.1016/j.jctb.2020.08.004 arXiv1909.08113Last update: September 30, 2020
  12. Sanjeeb Dash, Oktay Günlük, and Dabeen Lee, Generalized Chvátal-Gomory closures for integer programs with bounds on variables, Math. Program., accepted, 2020.
    doi10.1007/s10107-020-01539-5Last update: July 14, 2020
  13. J. Pascal Gollin and Jakob Kneip, Representations of infinite tree sets, Order, accepted, 2020.
  14. J. Pascal Gollin and Karl Heuer, On the Infinite Lucchesi-Younger Conjecture I, J. Graph Theory, accepted, 2021.
    arXiv1909.08373Last update: March 29, 2021

2021

  1. Matija Bucic, Pat Devlin, Mo Hendon, Dru Horne, and Ben Lund, Perfect matchings and derangements on graphs, J. Graph Theory, 97(2):340-354, June 2021.
    doi10.1002/jgt.22658 arXiv1906.05908Last update: April 17, 2021
  2. Maria AxenovichCasey Tompkins, and Lea Weber, Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs, J. Graph Theory, 97(1):34-46, May 2021.
    doi10.1002/jgt.22639Last update: April 17, 2021
  3. Jaehoon Kim and Sang-il Oum, The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor, Electron. J. Combin., 28(2), P2.9, April 2021.
    doi10.37236/9536 arXiv2003.12960Last update: April 9, 2021
  4. Maria Axenovich, David Offner, and Casey Tompkins, Long path and cycle decompositions of even hypercubes, European J. Combin., 95:103320, June 2021.
  5. Gábor Damásdi, Balázs Keszegh, David Malec, Casey Tompkins, Zhiyu Wang, and Oscar Zamora,  Saturation problems in the Ramsey theory of graphs, posets and point sets, European J. Combin., 95:103321, June 2021.
  6. Ringi Kim, Sang-il Oum, and Xin Zhang, Equitable partition of planar graphs, Discrete Math., 344(6):112351, June 2021.
  7. Ron Aharoni, Joseph Briggs, Jinha Kim, and Minki Kim, Badges and rainbow matchings, Discrete Math., 344(6):112363, June 2021.
  8. Ahmad Abdi, Gérard Cornuéjols, and Dabeen Lee, Resistant sets in the unit hypercube, Math. Oper. Res., 46(1):82-114, February 2021.
    doi10.1287/moor.2019.1048Last update: February 9, 2021
  9. O-joung Kwon, Rose McCarty, Sang-il Oum, and Paul Wollan, Obstructions for bounded shrub-depth and rank-depth, J. Combin. Theory Ser. B, 149:76-91, July 2021.
    doi10.1016/j.jctb.2021.01.005 arXiv1911.00230Last update: January 26, 2021
  10. Dong Yeap Kang, Jaehoon Kim, and Hong Liu, On the rational Turán exponents conjecture, J. Combin. Theory Ser. B, 148:149-172, May 2021.
    doi10.1016/j.jctb.2020.12.003 arXiv1811.06916Last update: February 9, 2021
  11. Joshua Erde, J. Pascal Gollin, Atilla Joó, Paul Knappe, and Max Pitz, A Cantor-Bernstein-type theorem for spanning trees in infinite graphs, J. Combin. Theory Ser. B, 149:16-22, July 2021.
    doi10.1016/j.jctb.2021.01.004 arXiv1907.09338Last update: January 20, 2021
  12. Jinha Kim and Minki Kim, Domination numbers and noncover complexes of hypergraphs, J. Combin. Theory Ser. A, 180(Article 105408), May 2021.
    doi10.1016/j.jcta.2021.105408 arXiv2101.01850Last update: January 29, 2021
  13. O-joung Kwon and Sang-il Oum, Graphs of bounded depth-2 rank-brittleness, J. Graph Theory, 96:361-378, March 2021.
    doi10.1002/jgt.22619 arXiv1906.05753Last update: January 16, 2021
  14. Debsoumya Chakraborti and Mihir Hasabnis, The threshold for the full perfect matching color profile in a random coloring of random graphs, Electron. J. Combin., 28(1), #P1.21, January 2021.
    doi10.37236/9066 arXiv1910.07674Last update: February 5, 2021
  15. Archontia Giannopoulou, O-joung KwonJean-Florent Raymond, and Dimitrios M. Thilikos, A Menger-like property of tree-cut width, J. Combin. Theory Ser. B, 148:1-22, May 2021.
    doi10.1016/j.jctb.2020.12.005 arXiv1808.00863Last update: December 23, 2020
  16. Reinhard Diestel and Sang-il Oum, Tangle-tree duality in abstract separation systems, Adv. Math., 377(Article 107470), January 2021.
    doi10.1016/j.aim.2020.107470 arXiv1701.02509Last update: December 11, 2020
  17. J. Pascal Gollin and Karl Heuer, An analogue of Edmonds’ Branching Theorem for infinite digraphs, European J. Combin., 92(Article 103182), February 2021.
    doi10.1016/j.ejc.2020.103182 arXiv1805.02933Last update: August 25, 2020
  18. Joshua Erde, J. Pascal Gollin, Atilla Joó, Paul Knappe, and Max Pitz, Base partition for mixed families of finitary and cofinitary matroids, Combinatorica, 41:31-52, February 2021.

2020

  1. Matt DeVosO-joung Kwon, and Sang-il Oum, Branch-depth: Generalizing tree-depth of graphs, European J. Combin., 90(Article 103186), December 2020.
  2. Huy-Tung Nguyen and Sang-il Oum, The average cut-rank of graphs, European J. Combin., 90(Article 103183), December 2020.
  3. Minjeong Kang, O-joung Kwon, and Myounghwan Lee, Graphs without two vertex-disjoint S-cycles, Discrete Math., 343(10):111997, October 2020.
  4. Dániel Gerbner, Ervin GyőriAbhishek Methuku, and Máté Vize,  Generalized Turán problems for even cycles, J. Combin.  Theory Ser. B, 145:169-213, November 2020.
  5. Jürgen KritschgauAbhishek Methuku, Michael Tait, and Craig TimmonsFew H copies in F-saturated graphs, J. Graph Theory, 94:320-348, July 2020.
    doi10.1002/jgt.22525 arXiv1810.00939Last update: May 27, 2020
  6. Dániel Grósz, Abhishek Methuku, and Casey Tompkins, On subgraphs of C2k-free graphs and a problem of Kühn and Osthus, Combin. Probab. Comput., 29(3):436-454, May 2020.
    doi10.1017/S0963548319000452Last update: May 27, 2020
  7. Eun Jung Kim and O-joung KwonErdős-Pósa property of chordless cycles and its applications, J. Combin. Theory Ser. B., 145:65-112, November 2020.
  8. Beka Ergemlidze, Ervin Győri, and Abhishek Methuku, 3-Uniform hypergraphs without a cycle of length five, Electron. J. Combin. 27(2), #P2.16, May 2020.*
    doi10.37236/8806Last update: May 1, 2020
  9. Dániel Grósz, Abhishek Methuku, and Casey Tompkins, Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs, European J. Combin., 88(Article 103109), August 2020.
    doi10.1016/j.ejc.2020.103109Last update: July 16, 2020
  10. Dániel Gerbner, Abhishek Methuku, Gholamreza Omidi, and Máté Vizer,  Ramsey problems for Berge hypergraphs, SIAM J. Discrete Math., 34(1):351-369, 2020.
    doi10.1137/18M1225227Last update: March 31, 2020
  11. Dániel Gerbner, Abhishek Methuku, and Cory Palmer, General lemmas for Berge-Turán hypergraph problems, European J. Combin., 86(Article 103082), May 2020.
    doi10.1016/j.ejc.2020.103082Last update: July 16, 2020
  12. O-joung Kwon and Sang-il Oum, Scattered classes of graphs, SIAM J. Discrete Math., 34(1):972-999, 2020.
    doi10.1137/19M1293776 arXiv1801.06004Last update: April 13, 2020
  13. Benjamin Bergougnoux, Mamadou Kanté, and O-joung Kwon, An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width, Algorithimca, 82(6):1654-1674, June 2020.
  14. Kevin Hendrey and Ian M. Wanless, Covering radius in the Hamming permutation space, European J. Combin., 84(Article 103025), February 2020.
  15. Dániel Gerbner, Balázs Keszegh, Abhishek Methuku, Dániel T. Nagy, Balázs Patkós, Casey Tompkins, and Chuanqi Xiao, Set systems related to a house allocation problem, Discrete Math., 343(7)(Article 111886), July 2020.
  16. Jimeng Xiao and Casey Tompkins, On forbidden poset problems in the linear lattice, Electron. J. Combin., 27(1), #P1.18, January 2020.
    doi10.37236/8831 arXiv1905.09246Last update: April 1, 2020
  17. Dong Yeap Kang and Jaehoon Kim, On 1-factors with prescribed lengths in tournaments, J. Combin. Theory Ser. B, 141:31-71, March 2020.
    doi10.1016/j.jctb.2019.06.003Last update: December 31, 2019
  18. Ringi KimO-joung Kwon, Sang-il Oum, and Vaidy Sivaraman, Classes of graphs with no long cycle as a vertex-minor are polynomially 𝜒-bounded, J. Combin. Theory Ser. B, 140:372-386, January 2020.
    doi10.1016/j.jctb.2019.06.001Last update: April 13, 2020

2019

  1. Nika Salia, Casey Tompkins, Zhiyu Wang, and Oscar Zamora, Ramsey numbers of Berge-hypergraphs and related structures, Electron. J. Combin., 26(4), #P4.40, December 2019.
    doi10.37236/8892 arXiv1808.09863Last update: September 9, 2020
  2. Sean English, Dániel Gerbner, Abhishek Methuku, and Cory Palmer, On the weight of Berge-F-free hypergraphs, Electron. J. Combin. 26(4), #P4.7, October 2019.
    doi10.37236/8504Last update: January 25, 2020
  3. Lars Jaffke, O-joung Kwon, Torstein Strømme, and Jan Arne Telle, Mim-Width III: Graph powers and generalized distance domination problems, Theoret. Comput. Sci., 796:216-236, December 2019.
    doi10.1016/j.tcs.2019.09.012Last update: October 30, 2019
  4. Reinhard Diestel and Sang-il Oum, Tangle-tree duality: in graphs, matroids and beyond, Combinatorica, 39(4):879-910, August 2019.
    doi10.1007/s00493-019-3798-5Last update: October 20, 2019
  5. Dong Yeap Kang and Sang-il Oum, Improper colouring of graphs with no odd clique minor,  Combin. Probab. Comput., 28(5):740-754, September 2019.
    doi10.1017/S0963548318000548Last update: October 20, 2019
  6. Hojin ChoiIlkyoo ChoiJisu Jeong, and Sang-il Oum, Online Ramsey theory for a triangle on F-free graphs, J. Graph Theory, 92(2):152-171, October 2019.
    doi10.1002/jgt.22445Last update: October 20, 2019

Refereed Conference Papers

  1. Jungho Ahn, Lars Jaffke, O-joung Kwon, and Paloma T. Lima, Three problems on well-partitioned chordal graphs, In the Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC2021, May 10-12, 2021), accepted, 2020.
    arXiv2002.10859Last update: February 22, 2021
  2. Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, and Daniel Vaz, Vertex sparsification for edge connectivity, In the Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA21, January 10-13, 2021, Online), pp. 1206-1225, 2021. Society for Industrial and Applied Mathematics.
    doi10.1137/1.9781611976465.74 arXiv2007.07862Last update: February 5, 2021
  3. Benjamin BergougnouxEdouard BonnetNick Brettell, and O-joung Kwon, Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth, in the Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC2020, Hong Kong, December 14-18, 2020), Article No. 3; pp. 3:1-3:17, 2020.
    doi10.4230/LIPIcs.IPEC.2020.3 arXiv2007.14179Last update: December 5, 2020
  4. Jungho Ahn, Eun Jung Kim, and Euiwoong Lee, Towards constant-factor approximation for chordal / distance-hereditary vertex deletion, In the Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC2020, December 14-18, 2020, Hong Kong), Article No. 62; pp. 62:1-62:16, 2020.
  5. Jungho Ahn, Eduard EibenO-joung Kwon, and Sang-il Oum, A polynomial kernel for 3-leaf power deletion, In the Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS2020, August 24-28, 2020, Prague, Czech Republic), Article No. 5; pp. 5:1-5:14, 2020.
  6. Jungho Ahn, Lars Jaffke, O-joung Kwon, and Paloma T. Lima, Well-partitioned chordal graphs: obstruction set and disjoint paths, In the Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2020, June 24-26, 2020, Leeds, UK), Lecture Notes in Comput. Sci., vol. 12301, pp. 148-160, 2020.
  7. Sanjeeb Dash, Oktay Günlük, and Dabeen Lee, On a generalization of the Chvátal-Gomory closure, In the Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020, June 8-10, 2020, London, UK), Lecture Notes in Comput. Sci., Vol. 12125, pp. 117-129, 2020.
    doi10.1007/978-3-030-45771-6_10Last update: April 25, 2020
  8. Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, and Dabeen Lee, Idealness of k-wise intersecting families,  In the Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020, June 8-10, 2020, London, UK), Lecture Notes in Comput. Sci., vol. 12125, pp. 1-12, 2020.
    doi10.1007/978-3-030-45771-6_1Last update: April 25, 2020
  9. Archontia Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, and O-joung Kwon, The Directed Flat Wall Theorem, In the Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA20, January 5-8, 2020, Salt Lake City, Utah, USA), pages 239-258, 2020. Society for Industrial and Applied Mathematics.
    doi10.1137/1.9781611975994.15Last update: December 30, 2019