Projects funded by the NCN
Algorithmic Structure Theory for Sparse Graphs
2015/19/P/ST6/03998
Keywords:
Graph Theory Sparse Graphs Parameterised Complexity Approximation Algorithms Distributed Computing
Descriptors:
- ST6_4:
- ST1_14:
- ST6_6:
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):
Dipl. Inform. Sebastian Siebertz
Number of co-investigators in the project: 2
Call: POLONEZ 1 - announced on 2015-09-15
Amount awarded: 619 536 PLN
Project start date (Y-m-d): 2016-10-01
Project end date (Y-m-d): 2018-09-30
Project duration:: 24 months (the same as in the proposal)
Project status: Project completed
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
Publications will be made available after the final report has been accepted.