Projects funded by the NCN
Structural and algorithmic properties of hereditary graph classes
2022/46/E/ST6/00143
Keywords:
Maximum Independent Set problem hereditary graph classes Erdos-Hajnal conjecture chi-boundedness
Descriptors:
- ST6_006:
- ST1_014:
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet Warszawski, Wydział Matematyki, Informatyki i Mechaniki
woj. mazowieckie
Principal investigator (from the host institution):
dr hab. Marcin Łukasz Pilipczuk
Number of co-investigators in the project: 4
Call: SONATA BIS 12 - announced on 2022-05-15
Amount awarded: 1 845 300 PLN
Project start date (Y-m-d): 2023-07-03
Project end date (Y-m-d): 2028-07-02
Project duration:: 60 months (the same as in the proposal)
Project status: Pending project
Project description
Download the project description in a pdf file
Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.
Information in the final report
- Articles in post-conference publications (3)
- Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial TimeAuthors:Peter Gartland, Daniel Lokshtanov, Tomas Masarik, Marcin Pilipczuk, Michal Pilipczuk, Pawel RzazewskiConference:Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024 (rok: 2024, tom: 56th Annual ACM Symposium on Theory of Computing, STOC 2024, strony: 683-691), Wydawca: ACMData:konferencja 2024-06-24 do 2024-06-28Status:PublishedDOI:10.1145/3618260.3649791 - link to the publication
- Sparse induced subgraphs in P6-free graphsAuthors:Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michał Pilipczuk, Paweł RzążewskiConference:Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024 (rok: 2024, tom: 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, strony: 5291-5299), Wydawca: SIAMData:konferencja 2024-01-07 do 2024-01-10Status:PublishedDOI:10.1137/1.9781611977912.190 - link to the publication
- Max Weight Independent Set in Sparse Graphs with No Long ClawsAuthors:Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Paweł RzążewskiConference:41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024 (rok: 2024, tom: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, strony: 4:1-4:15), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fuer InformatikData:konferencja 2024-03-12 do 2024-03-14Status:PublishedDOI:10.4230/LIPIcs.STACS.2024.4 - link to the publication