Adam Karczmarz
Adam Karczmarz
Zweryfikowany adres z mimuw.edu.pl
Tytuł
Cytowane przez
Cytowane przez
Rok
Optimal dynamic strings
P Gawrychowski, A Karczmarz, T Kociumaka, J Łącki, P Sankowski
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
252018
Decremental single-source reachability in planar digraphs
GF Italiano, A Karczmarz, J Łącki, P Sankowski
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
162017
Improved bounds for shortest paths in dense distance graphs
P Gawrychowski, A Karczmarz
arXiv preprint arXiv:1602.07013, 2016
162016
Decrementai transitive closure and shortest paths for planar digraphs and beyond
A Karczmarz
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
82018
Contracting a Planar Graph Efficiently
A Karczmarz, E Rotenberg, GF Italiano, J Holm, J Łącki, P Sankowski
6*2017
Decremental SPQR-trees for Planar Graphs
J Holm, GF Italiano, A Karczmarz, J Łącki, E Rotenberg
arXiv preprint arXiv:1806.10772, 2018
42018
A simple mergeable dictionary
A Karczmarz
15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), 2016
42016
Fast and simple connectivity in graph timelines
A Karczmarz, J Łącki
Workshop on Algorithms and Data Structures, 458-469, 2015
42015
Min-cost flow in unit-capacity planar graphs
A Karczmarz, P Sankowski
arXiv preprint arXiv:1907.02274, 2019
32019
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
A Karczmarz, J Łącki
arXiv preprint arXiv:1907.02266, 2019
22019
Data structures and dynamic algorithms for planar graphs
A Karczmarz
12019
Distributed Tasks: Introducing Distributed Computing to Programming Competitions
A Karczmarz, J Łącki, A Polak, J Radoszewski, JO Wojtaszczyk
Olympiads in Informatics 10, 2016
2016
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–12