Essentially Tight Kernels For (Weakly) Closed Graphs

Koana, Tomohiro; Komusiewicz, Christian; Sommer, Frank

doi:10.4230/LIPICS.ISAAC.2021.35

by Tomohiro Koana, Christian Komusiewicz, Frank Sommer

Reference:

Essentially Tight Kernels For (Weakly) Closed GraphsTomohiro Koana, Christian Komusiewicz, Frank Sommer32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan (Hee-Kap Ahn, Kunihiko Sadakane, eds.), volume 212 of LIPIcs, pages 35:1–35:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Bibtex Entry:

@string{lipics="LIPIcs"}
@inproceedings{KoanaKS21,
  author       = {Tomohiro Koana and
                  Christian Komusiewicz and
                  Frank Sommer},
  editor       = {Hee{-}Kap Ahn and
                  Kunihiko Sadakane},
  title        = {Essentially Tight Kernels For (Weakly) Closed Graphs},
  booktitle    = {32nd International Symposium on Algorithms and Computation, {ISAAC}
                  2021, December 6-8, 2021, Fukuoka, Japan},
  series       = {LIPIcs},
  volume       = {212},
  pages        = {35:1--35:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.35},
  doi          = {10.4230/LIPICS.ISAAC.2021.35}
}