Projects funded by the NCN
Efficient algorithms for NP-hard problems on planar graphs
2023/51/D/ST6/00155
Keywords:
graph theory planar graphs parameterized complexity approximation algorithms kernelization treewidth clustering
Descriptors:
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
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: SONATA 19 - announced on 2023-09-18
Amount awarded: 993 690 PLN
Project start date (Y-m-d): 2024-07-24
Project end date (Y-m-d): 2027-07-23
Project duration:: 36 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.