Projects funded by the NCN
Struktury danych i algorytmy dynamiczne dla grafów planarnych.
2017/24/T/ST6/00036
Keywords:
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: ETIUDA 5 - announced on 2016-12-15
Amount awarded: 85 809 PLN
Project start date (Y-m-d): 2017-10-02
Project end date (Y-m-d): 2018-10-01
Project duration:: 12 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
- Articles in post-conference publications (2)
- Improved Bounds for Shortest Paths in Dense Distance GraphsAuthors:Paweł Gawrychowski, Adam KarczmarzConference:45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 (rok: 2018, ), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2018Data:konferencja 9-13 lipca 2018Status:Published
- Decremental SPQR-trees for Planar GraphsAuthors:Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Łącki, Eva RotenbergConference:26th Annual European Symposium on Algorithms, ESA 2018 (rok: 2018, ), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum fuer InformatikData:konferencja 20-22 sierpnia 2018Status:Published