Jakub Lacki
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
33
Venues
13
Active years
2011–2025
Best venue rank
A*
Where they publish
Papers
33 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | SODA | Massively Parallel Minimum Spanning Tree in General Metric Spaces. | Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Lacki, Vahab Mirrokni, Peilin Zhong |
| 2025 | SDM | DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering. | Shangdi Yu, Laxman Dhulipala, Jakub Lacki, Nikos Parotsidis |
| 2025 | SPAA | Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs. | Jakub Lacki, Slobodan Mitrovic, Srikkanth Ramachandran, Wen-Horng Sheu |
| 2024 | ICALP | It's Hard to HAC Average Linkage! | MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki |
| 2024 | ICALP | Dynamic PageRank: Algorithms and Lower Bounds. | Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski |
| 2024 | SODA | Fully Dynamic Consistent | Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Vclav Rozhon |
| 2023 | ICALP | Optimal Decremental Connectivity in Non-Sparse Graphs. | Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup |
| 2023 | SPAA | Adaptive Massively Parallel Connectivity in Optimal Space. | Rustam Latypov, Jakub Lacki, Yannic Maus, Jara Uitto |
| 2022 | COLT | Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. | Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab Mirrokni, Chen Wang |
| 2022 | ICALP | Near-Optimal Decremental Hopsets with Applications. | Jakub Lacki, Yasamin Nazari |
| 2021 | ICML | Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. | Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi |
| 2021 | KDD | Clustering for Private Interest-based Advertising. | Alessandro Epasto, Andrs Muoz Medina, Steven Avery, Yijian Bai, Rbert Busa-Fekete, CJ Carey, Ya Gao, David Guthrie, Subham Ghosh, James Ioannidis, Junyi Jiao, Jakub Lacki, Jason Lee, Arne Mauser, Brian Milch, Vahab S. Mirrokni, Deepak Ravichandran, Wei Shi, Max Spero, Yunting Sun, Umar Syed, Sergei Vassilvitskii, Shuo Wang |
| 2020 | SODA | Fully Dynamic Matching: Beating 2-Approximation in Δ | Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni |
| 2020 | SODA | Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. | Adam Karczmarz, Jakub Lacki |
| 2020 | STOC | Walking randomly, massively, and efficiently. | Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski |
| 2019 | ESA | Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. | Adam Karczmarz, Jakub Lacki |
| 2019 | FOCS | Near-Optimal Massively Parallel Graph Connectivity. | Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni |
| 2019 | ICALP | Stochastic Graph Exploration. | Aris Anagnostopoulos, Ilan Reuven Cohen, Stefano Leonardi, Jakub Lacki |
| 2019 | SPAA | Massively Parallel Computation via Remote Memory Access. | Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy |
| 2018 | ESA | Decremental SPQR-trees for Planar Graphs. | Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg |
| 2018 | SODA | Optimal Dynamic Strings. | Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski |
| 2018 | STOC | Round compression for parallel matching algorithms. | Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski |
| 2017 | ESA | Contracting a Planar Graph Efficiently. | Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski |
| 2017 | STOC | Decremental single-source reachability in planar digraphs. | Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski |
| 2016 | FOCS | Decremental Single-Source Reachability and Strongly Connected Components in (m√n) Total Update Time. | Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis |
| 2016 | SODA | Algorithmic Complexity of Power Law Networks. | Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski |
| 2015 | STOC | The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree. | Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych |
| 2015 | STACS | Optimal Decremental Connectivity in Planar Graphs. | Jakub Lacki, Piotr Sankowski |
| 2015 | WADS | Fast and Simple Connectivity in Graph Timelines. | Adam Karczmarz, Jakub Lacki |
| 2013 | CAV | Faster Algorithms for Markov Decision Processes with Low Treewidth. | Krishnendu Chatterjee, Jakub Lacki |
| 2012 | FOCS | Single Source - All Sinks Max Flows in Planar Digraphs. | Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen |
| 2011 | ESA | Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time. | Jakub Lacki, Piotr Sankowski |
| 2011 | SODA | Improved Deterministic Algorithms for Decremental Transitive Closure and Strongly Connected Components. | Jakub Lacki |