Projects funded by the NCN
Graph separation problems from the perspective of parameterized complexity.
2015/19/N/ST6/03015
Keywords:
algorithms graph cut problems parameterized complexity
Descriptors:
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
- ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms
- ST1_14: Discrete mathematics and combinatorics
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):
Number of co-investigators in the project: 2
Call: PRELUDIUM 10 - announced on 2015-09-15
Amount awarded: 76 800 PLN
Project start date (Y-m-d): 2016-07-08
Project end date (Y-m-d): 2019-07-07
Project duration:: 36 months (the same as in the proposal)
Project status: Project settled
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
- Publication in academic press/journals (1)
- Randomized Contractions Meet Lean DecompositionsAuthors:Cygan, M., Komosa, P., Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S., & Wahlström, M.Academic press:ACM Transactions on Algorithms (TALG) (rok: 2020, tom: 17 (1), strony: 45321), Wydawca: Association for Computing MachineryStatus:PublishedDOI:10.1145/3426738 - link to the publication