Dynamic algorithms for directed graphs under weak assumptions about the adversary.
2018/29/N/ST6/00757
Keywords
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
PRELUDIUM 15 – announced on 2018-03-15
- Amount awarded
- 103 200 PLN
- Project start date
- 2019-01-24
- Project end date
- 2021-01-23
- Project duration
- 24 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.
Equipment purchased [PL]
- Komputer typu laptop z wyposażeniem oraz 3 letnią rozszerzoną gwarancją. Cost: 8 000 PLN
Information in the final report
Articles in post-conference publications (5)
-
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
- Authors:
- Adam Karczmarz, Jakub Łącki
- Conference:
- 27th Annual European Symposium on Algorithms, ESA 2019 (year: 2019, pages: 65:1-65:15), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
- Date:
- conference 9-11 września 2019
- Status:
- Published
- DOI:
- link to the publication
-
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs
- Authors:
- Panagiotis Charalampopoulos, Adam Karczmarz
- Conference:
- 28th Annual European Symposium on Algorithms, ESA 2020 (year: 2020, pages: 31:1 -- 31:23), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
- Date:
- conference 7-9 września 2020
- Status:
- Published
- DOI:
- link to the publication
-
Min-Cost Flow in Unit-Capacity Planar Graphs
- Authors:
- Adam Karczmarz, Piotr Sankowski
- Conference:
- 27th Annual European Symposium on Algorithms, ESA 2019 (year: 2019, pages: 66:1-66:17), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
- Date:
- conference 9-11 września 2019
- Status:
- Published
- DOI:
- link to the publication
-
A Deterministic Parallel APSP Algorithm and its Applications
- Authors:
- Adam Karczmarz, Piotr Sankowski
- Conference:
- 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) (year: 2021, pages: 255-272), Publisher: SIAM
- Date:
- conference 10-13 stycznia 2021
- Status:
- Published
- DOI:
- link to the publication
-
Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs
- Authors:
- Adam Karczmarz, Jakub Łącki
- Conference:
- 3rd Symposium on Simplicity in Algorithms, SOSA@SODA 2020 (year: 2020, pages: 106-120), Publisher: SIAM
- Date:
- conference 6-7 stycznia 2020
- Status:
- Published
- DOI:
- link to the publication