Struktury danych i algorytmy dynamiczne dla grafów planarnych.
2017/24/T/ST6/00036
Descriptors
- ST6_6: Algorytmika, algorytmy równoległe, rozproszone i sieciowe, algorytmiczna teoria gier
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
Voivodeship: 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
- 2017-10-02
- Project end date
- 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 Graphs
- Authors:
- Paweł Gawrychowski, Adam Karczmarz
- Conference:
- 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 (year: 2018, pages: 61:1-61:15), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2018
- Date:
- conference 9-13 lipca 2018
- Status:
- Published
- DOI:
- link to the publication
-
Decremental SPQR-trees for Planar Graphs
- Authors:
- Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Łącki, Eva Rotenberg
- Conference:
- 26th Annual European Symposium on Algorithms, ESA 2018 (year: 2018, pages: 46:1-46:16), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
- Date:
- conference 20-22 sierpnia 2018
- Status:
- Published
- DOI:
- link to the publication