Projects funded by the NCN
Fair Problems and Diverse Solutions in Parameterized Complexity
2021/43/D/ST6/03312
Keywords:
Graph Algorithms Parameterized Complexity Fair Problems Diverse Solutions
Descriptors:
- ST6_006:
- ST6_004:
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: 3
Call: SONATA 17 - announced on 2021-09-15
Amount awarded: 491 040 PLN
Project start date (Y-m-d): 2022-08-10
Project end date (Y-m-d): 2025-08-09
Project duration:: 36 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
- Articles in post-conference publications (1)
- Minimizing an Uncrossed Collection of DrawingsAuthors:Petr Hliněný, Tomáš MasaříkConference:Graph Drawing and Network Visualization (rok: 2024, tom: The 31st International Symposium on Graph Drawing and Network Visualization, strony: 110-123), Wydawca: SpringerData:konferencja 20-22 September 2023Status:PublishedDOI:10.1007/978-3-031-49272-3_8 - link to the publication