Publikacje

Adam Karczmarz

Paweł Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Łącki i Piotr Sankowski, Optimal Dynamic Strings, w: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, SIAM, 2018, s. 1509–1528.zobacz w PBN
Adam Karol Karczmarz, Decremental Transitive Closure and Shortest Paths for Planar Digraphs and Beyond, w: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, SIAM, 2018, s. 73–92.zobacz w PBN
Paweł Gawrychowski i Adam Karol Karczmarz, Improved Bounds for Shortest Paths in Dense Distance Graphs, w: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018, r. 61, s. 61:1–61:15.zobacz w PBN
Jacob Holm, Giuseppe F. Italiano, Adam Karol Karczmarz, Jakub Włodzimierz Łącki i Eva Rotenberg, Decremental SPQR-trees for Planar Graphs, w: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, 2018, r. 46, s. 46:1–46:16.zobacz w PBN

Jacob Holm, Giuseppe F. Italiano, Adam Karol Karczmarz, Jakub Włodzimierz Łącki, Eva Rotenberg i Piotr Sankowski, Contracting a Planar Graph Efficiently, w: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, s. 50:1–50:15.zobacz w PBN
Giuseppe F. Italiano, Adam Karol Karczmarz, Jakub Włodzimierz Łącki i Piotr Sankowski, Decremental Single-source Reachability in Planar Digraphs, w: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, s. 1108–1121.zobacz w PBN

Adam Karol Karczmarz, A Simple Mergeable Dictionary, w: 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2016, s. 7:1–7:13.zobacz w PBN
Adam Karol Karczmarz, Jakub Włodzimierz Łącki, Adam Polak, Jakub Jan Radoszewski i Jakub Wojtaszczyk, Distributed Tasks: Introducing Distributed Computing to Programming Competitions, Olympiads In Informatics 10 2016, s. 177–194.zobacz w PBN

Adam Karol Karczmarz i Jakub Włodzimierz Łącki, Fast and Simple Connectivity in Graph Timelines, w: Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, Springer, 2015, s. 458–469.zobacz w PBN