All
Jungho Ahn (안정호)
Alexander Clifton
Rutger Campbell
Debsoumya Chakraborti
Jeong Ok Choi (최정옥)
Linda Cook
Tuan Anh Do
J. Pascal Gollin
Kevin Hendrey
Andreas F. Holmsen
Dong Yeap Kang (강동엽)
Donggyu Kim (김동규)
Jinha Kim (김진하)
Minki Kim (김민기)
Yunbum Kook (국윤범)
O-joung Kwon (권오정)
Dabeen Lee (이다빈)
Dohyeon Lee (이도현)
Duksang Lee (이덕상)
Ben Lund
Abhishek Methuku
Sang-il Oum (엄상일)
William Overman
Amadeus Reinald
Casey Tompkins
Tuan Tran
Sebastian Wiederrecht
Hongseok Yang (양홍석)
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
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
Michael G. Dobbins , Andreas 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
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.
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.
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
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.
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.
Dimitrios M. Thilikos and Sebastian Wiederrecht , Killing 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.
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.
Ken-ichi Kawarabayashi , Stephan Kreutzer , O-joung Kwon , and Qiqin Xie , A 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.
Stéphane Bessy , Marin Bougeret , Dimitrios M. Thilikos , and Sebastian Wiederrecht , Kernelization 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.
Archontia Giannopoulou , Dimitrios M. Thilikos , and Sebastian Wiederrecht , Excluding 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.
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
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.
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
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
Lars Jaffke , O-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.
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.
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.
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.
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
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.
Marthe Bonamy , Linda Cook , Carla Groenland , and Alexandra Wesolek , A 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.
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.
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.
Benjamin Bergougnoux , Edouard Bonnet , Nick 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.
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.
Jungho Ahn , Eduard Eiben , O-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.
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.
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.
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.
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.