Tomohiro Koana and Christian Komusiewicz and Frank Sommer

Recent Publications

Essentially Tight Kernels For (Weakly) Closed Graphs
32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan (Hee-Kap Ahn and Kunihiko Sadakane), volume 212 of LIPIcs, pages 35:1-35:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference) (Yixin Cao and Siu-Wing Cheng and Minming Li), volume 181 of LIPIcs, pages 20:1-20:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Exploiting c-Closure in Kernelization Algorithms for Graph Problems
28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference) (Fabrizio Grandoni and Grzegorz Herman and Peter Sanders), volume 173 of LIPIcs, pages 65:1-65:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.