Number of items: 1.
Behera, Balaram, Husić, Edin 
ORCID: 0000-0002-6708-5112, Jain, Shweta, Roughgarden, Tim and Seshadhri, C.
(2022)
FPT algorithms for finding near-cliques in c-closed graphs.
In: Braverman, Mark, (ed.)
13th Innovations in Theoretical Computer Science Conference, ITCS 2022.
Leibniz International Proceedings in Informatics, LIPIcs.
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 17:1 - 17:24.
ISBN 9783959772174
This list was generated on Sat Nov 23 11:46:24 2024 GMT.
