@inproceedings{https://doi.org/10.4230/lipics.icalp.2021.35,
    doi = {10.4230/LIPICS.ICALP.2021.35},
    url = {https://drops.dagstuhl.de/opus/volltexte/2021/14104/},
    author = {Bonnet, Édouard and Geniet, Colin and Kim, Eun Jung and Thomassé, Stéphan and Watrigant, Rémi},
    keywords = {Twin-width, Max Independent Set, Min Dominating Set, Coloring, Parameterized Algorithms, Approximation Algorithms, Exact Algorithms, Theory of computation → Graph algorithms analysis, Theory of computation → Fixed parameter tractability},
    language = {en},
    title = {Twin-width III: Max Independent Set, Min Dominating Set, and Coloring},
    publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
    year = {2021},
    copyright = {Creative Commons Attribution 4.0 International license}
}

@inproceedings{https://doi.org/10.4230/lipics.icalp.2021.35, doi = {10.4230/LIPICS.ICALP.2021.35}, url = {https://drops.dagstuhl.de/opus/volltexte/2021/14104/}, author = {Bonnet, Édouard and Geniet, Colin and Kim, Eun Jung and Thomassé, Stéphan and Watrigant, Rémi}, keywords = {Twin-width, Max Independent Set, Min Dominating Set, Coloring, Parameterized Algorithms, Approximation Algorithms, Exact Algorithms, Theory of computation → Graph algorithms analysis, Theory of computation → Fixed parameter tractability}, language = {en}, title = {Twin-width III: Max Independent Set, Min Dominating Set, and Coloring}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, year = {2021}, copyright = {Creative Commons Attribution 4.0 International license} }