Refereed Conference Papers

  1. Maximilian Gorsky, Sebastian Wiederrecht, Stephan Kreutzer, and Ken-ichi Kawarabayashi, Packing even directed circuits quarter-integrally, In the Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC2024, Vancouver, Canada, June 24-28, 2024), accepted, 2024.
    Last update: February 13, 2024
  2. Archontia C. Giannopoulou and Sebastian Wiederrecht, A Flat Wall Theorem for Matching Minors in Bipartite Graphs, In the Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC2024, Vancouver, Canada, June 24-28, 2024), accepted, 2024.
    Last update: February 13, 2024
  3. Michael G. DobbinsAndreas F. Holmsen, and Dohyeon Lee, Colorful intersections and Tverberg partitions, In the Proceedings of the 40th International Symposium on Computational Geometry (SoCG2024, Athens, Greece, June 11-14, 2024), accepted, 2024.
    Last update: February 13, 2024
  4. Jungho Ahn, Jinha Kim, and O-joung Kwon, Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes, In the Proceedings of the 34th International Symposium on Algorithms and Computation (ISAAC 2023, Kyoto, Japan, December 3-6, 2023), 283:Art. no. 5, December 2023.
    doi10.4230/LIPIcs.ISAAC.2023.5Last update: December 15, 2023
  5. Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou M. Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, and Erik Jan van Leeuwen, Space-efficient parameterized algorithms on graphs of low shrubdepth, In the Proceedings of the 31st Annual European Symposium on Algorithms (ESA 2023, Amsterdam, Netherlands, September 4-6, 2023), Article No. 18; pp. 18:1–18:18, 2023.
    doi10.4230/LIPIcs.ESA.2023.18Last update: August 30, 2023
  6. Hyunsu Kim, Hyungi Lee, Hongseok Yang, Juho Lee, Regularizing towards soft equivariance under mixed symmetries, In the Proceedings of the 40th International Conference on Machine Learning (July 23-29, 2023, Honolulu, Hawaii, USA), Proceedings of Machine Learning Research, 202:16712-16727, 2023
    arXiv2306.00356Last update: October 26, 2023
  7. Yeonsu Chang, O-joung Kwon, and Myounghwan Lee, A new width parameter of graphs based on edge cuts: $\alpha$-edge-crossing, In the Proceedings of the 49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2023, June 28-30, 2023, Fribourg, Switzerland), 14093:172-186, 2023.
    doi10.1007/978-3-031-43380-1_13Last update: October 28, 2023
  8. Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc van Kreveld, Isja Mannens, and Jordi L. Vermeulen, Reconstructing graphs from connected triples, In the Proceedings of the 49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2023, June 28-30, 2023, Fribourg, Switzerland), 14093:16-29, 2023.
    doi10.1007/978-3-031-43380-1_2Last update: October 28, 2023
  9. Dimitrios M. Thilikos and Sebastian WiederrechtKilling a vortex, In the Proceedings of the 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS 2022, October 31-November 3, 2022, Denver, Colorado, USA), pp. 1069-1080, December 2022.
    doi10.1109/FOCS54457.2022.00104Last update: April 13, 2023
  10. Wonyeol Lee, Xavier Rival, Hongseok Yang, Smoothness Analysis for Probabilistic Programs with Application to Optimised Variational Inference, In the Proceedings of the 50th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2023, January 15-21, 2023, Boston, MA, USA), Article No. 12, pp. 335-366, January 2023.
    doi10.1145/3571205 arXiv2208.10530Last update: April 13, 2023
  11. Ken-ichi Kawarabayashi, Stephan KreutzerO-joung Kwon, and Qiqin XieA half-integral Erdős-Pósa theorem for directed odd cycles, In the Proceedings of the Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA23, January 22-25, 2023, Florence, Italy), pp. 3043-3062, January 2023.
  12. Stéphane Bessy, Marin BougeretDimitrios M. Thilikos, and Sebastian WiederrechtKernelization for Graph Packing Problems via Rainbow Matching, In the Proceedings of the Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA23, January 22-25, 2023, Florence, Italy), pp. 3654-3663, January 2023.
  13. Archontia Giannopoulou, Dimitrios M. Thilikos, and Sebastian WiederrechtExcluding Single-Crossing Matching Minors in Bipartite Graphs, In the Proceedings of the Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA23, January 22-25, 2023, Florence, Italy), pp. 2111-2121, January 2023.
  14. Geon-Hyeong Kim, Jongmin Lee, Youngsoo Jang, Hongseok Yang, and Kee-Eung Kim, LobsDICE: Offline Imitation Learning from Observation via Stationary Distribution Correction Estimation, In the Proceedings of the Thirty-sixth Conference on Neural Information Processing Systems (NeurIPS 2022, November 28-December 9, 2022), 8252-8264, 2022.
    Last update: July 8, 2023
  15. Sangho Lim, Eun-Gyeol Oh, and Hongseok Yang, Learning Symmetric Rules with SATNet, In the Proceedings of the Thirty-sixth Conference on Neural Information Processing Systems (NeurIPS 2022, November 28-December 9, 2022), 13251-13262, 2022.
    arXiv2206.13998Last update: July 8, 2023
  16. Hyungi Lee, Eunggu Yun, Hongseok Yang, and Juho Lee, Scale Mixtures of Neural Network Gaussian Processes, In the Proceedings of the Tenth International Conference on Learning Representations (ICLR2022, Virtual, April 25-29, 2022), https://openreview.net/forum?id=YVPBh4k78iZ, 2022.
    Last update: September 25, 2022
  17. Geon-Hyeong Kim, Seokin Seo, Jongmin Lee, Wonseok Jeon, HyeongJoo Hwang, Hongseok Yang, and Kee-Eung Kim, DemoDICE: Offline Imitation Learning with Supplementary Imperfect Demonstrations, In the Proceedings of the Tenth International Conference on Learning Representations (ICLR2022, Virtual, April 25-29, 2022), accepted, 2022.
    Last update: March 30, 2022
  18. Lars JaffkeO-joung Kwon, and Jan Arne Telle, Classes of intersection digraphs with good algorithmic properties, In the Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022, Marseille, March 15-18, 2022), Article No. 38; pp. 38:1-38:18, 2022.
  19. Mamadou M. Kanté, Eun Jung Kim, O-joung Kwon, and Sang-il Oum, Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k, In the Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022, Marseille, March 15-18, 2022), Article No. 40; pp. 40:1-40:14, 2022.
  20. Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, and O-joung Kwon, A Unifying Framework for Characterizing and Computing Width Measures, In the Proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS 2022, January 31-February 3, 2022), Article No. 63; pp. 63:1-63:23, 2022.
  21. Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, and O-joung Kwon, Directed tangle-tree decomposition and its applications, In the Proceedings of the Thirty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA22, January 9-12, 2022, Alexandria, Virginia, USA), pp. 377-405, 2022.
    doi10.1137/1.9781611977073.19 arXiv2009.13184Last update: January 11, 2022
  22. Dabeen Lee and Milan Vojnovic, Scheduling jobs with stochastic holding costs, In the Proceedings of the Thirty-fifth Conference on Neural Information Processing Systems (NeurIPS 2021, December 6-14, 2021), 23:19375-19384, 2021
    Last update: June 24, 2022
  23. Donggyu Kim, Duksang Lee, and Sang-il Oum, Γ-graphic delta-matroids and their applications, In the Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC2021, December 6-8, 2021, Fukuoka, Japan), Article No. 70, pp. 70:1-70:13, 2021.
    doi10.4230/LIPIcs.ISAAC.2021.70Last update: December 27, 2021
  24. Marthe BonamyLinda Cook, Carla Groenland, and Alexandra WesolekA tight local algorithm for the minimum dominating set problem in outerplanar graphs, 35th International Symposium on Distributed Computing (DISC 2021, October 4-8, 2021, Freiburg, Germany), Article No. 13; pp. 13:1-13:8, 2021.
  25. 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), Lecture Notes in Comput. Sci., vol. 12701, pp. 23-36, 2021.
  26. 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 Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA21, January 10-13, 2021, Online), pp. 1206-1225, 2021. Society for Industrial and Applied Mathematics.
  27. 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
  28. 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.
  29. 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.
  30. 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.
  31. 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
  32. 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
  33. Archontia Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, and O-joung Kwon, The Directed Flat Wall Theorem, In the Proceedings of the Thirty-First 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: October 3, 2021
IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.