Jakub Lacki

According to our database, Jakub Lacki authored at least 54 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers.

Brian Wheatman, Xiaojun Dong, Zheqi Shen, Laxman Dhulipala, Jakub Lacki, Prashant Pandey, Helen Xu

Proc. VLDB Endow., May, 2024

Massively Parallel Minimum Spanning Tree in General Metric Spaces.

Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Lacki, Vahab Mirrokni, Peilin Zhong

CoRR, 2024

Efficient Centroid-Linkage Clustering.

MohammadHossein Bateni, Laxman Dhulipala, Willem Fletcher, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki

CoRR, 2024

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search.

Lars Gottesbüren, Laxman Dhulipala, Rajesh Jayaram, Jakub Lacki

CoRR, 2024

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling.

Laxman Dhulipala, Michael Dinitz, Jakub Lacki, Slobodan Mitrovic

Proceedings of the 38th International Symposium on Distributed Computing, 2024

Fully Dynamic Consistent <i>k</i>-Center Clustering.

Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Václav Rozhon

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Dynamic PageRank: Algorithms and Lower Bounds.

Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

It's Hard to HAC Average Linkage!

MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs (Abstract).

Laxman Dhulipala, Jakub Lacki, Jason Lee, Vahab Mirrokni

Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024

2023

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs.

Laxman Dhulipala, Jakub Lacki, Jason Lee, Vahab Mirrokni

Proc. ACM Manag. Data, September, 2023

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).

George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman

Dagstuhl Reports, 2023

Open Problems in (Hyper)Graph Decomposition.

Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, George Karypis, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman

CoRR, 2023

Fully Dynamic Consistent k-Center Clustering.

Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Václav Rozhon, Rajesh Jayaram

CoRR, 2023

Adaptive Massively Parallel Connectivity in Optimal Space.

Rustam Latypov, Jakub Lacki, Yannic Maus, Jara Uitto

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Optimal Decremental Connectivity in Non-Sparse Graphs.

Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Constant Approximation for Normalized Modularity and Associations Clustering.

Jakub Lacki, Vahab Mirrokni, Christian Sohler

CoRR, 2022

Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth.

Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Near-Optimal Decremental Hopsets with Applications.

Jakub Lacki, Yasamin Nazari

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds.

Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab Mirrokni, Chen Wang

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Massively Parallel Computation via Remote Memory Access.

Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy

ACM Trans. Parallel Comput., 2021

Scalable Community Detection via Parallel Correlation Clustering.

Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni

Proc. VLDB Endow., 2021

Clustering for Private Interest-based Advertising.

Alessandro Epasto, Andrés Muñoz Medina, Steven Avery, Yijian Bai, Róbert 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

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time.

Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Round Compression for Parallel Matching Algorithms.

Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski

SIAM J. Comput., 2020

Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice.

Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy

Proc. VLDB Endow., 2020

Near-Optimal Decremental Approximate Multi-Source Shortest Paths.

Jakub Lacki, Yasamin Nazari

CoRR, 2020

Walking randomly, massively, and efficiently.

Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs.

Adam Karczmarz, Jakub Lacki

Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Fully Dynamic Matching: Beating 2-Approximation in Δ^<i>ϵ</i> Update Time.

Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Faster DBSCAN via subsampled similarity queries.

Heinrich Jiang, Jennifer Jang, Jakub Lacki

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Fully Dynamic Matching: Beating 2-Approximation in Δ^ε Update Time.

Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni

CoRR, 2019

Stochastic Graph Exploration.

Aris Anagnostopoulos, Ilan Reuven Cohen, Stefano Leonardi, Jakub Lacki

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Near-Optimal Massively Parallel Graph Connectivity.

Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs.

Adam Karczmarz, Jakub Lacki

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Connected Components at Scale via Local Contractions.

Jakub Lacki, Vahab S. Mirrokni, Michal Wlodarczyk

CoRR, 2018

Optimal Dynamic Strings.

Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Decremental SPQR-trees for Planar Graphs.

Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Optimal Decremental Connectivity in Planar Graphs.

Jakub Lacki, Piotr Sankowski

Theory Comput. Syst., 2017

Decremental single-source reachability in planar digraphs.

Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Contracting a Planar Graph Efficiently.

Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Algorithmic Complexity of Power Law Networks.

Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Community Detection on Evolving Graphs.

Aris Anagnostopoulos, Jakub Lacki, Silvio Lattanzi, Stefano Leonardi, Mohammad Mahdian

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

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

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Fast and Simple Connectivity in Graph Timelines.

Adam Karczmarz, Jakub Lacki

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree.

Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2013

Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components.

Jakub Lacki

ACM Trans. Algorithms, 2013

Dynamic Steiner Tree in Planar Graphs.

Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych

CoRR, 2013

Reachability in graph timelines.

Jakub Lacki, Piotr Sankowski

Proceedings of the Innovations in Theoretical Computer Science, 2013

Faster Algorithms for Markov Decision Processes with Low Treewidth.

Krishnendu Chatterjee, Jakub Lacki

Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012

Single Source - All Sinks Max Flows in Planar Digraphs.

Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time

Jakub Lacki, Piotr Sankowski

CoRR, 2011

Acorn: A grid computing system for constraint based modeling and visualization of the genome scale metabolic reaction networks via a web interface.

Jacek Sroka, Lukasz Bieniasz-Krzywiec, Szymon Gwozdz, Dariusz Leniowski, Jakub Lacki, Mateusz Markowski, Claudio Avignone-Rossa, Michael E. Bushell, Johnjoe McFadden, Andrzej M. Kierzek

BMC Bioinform., 2011

Improved Deterministic Algorithms for Decremental Transitive Closure and Strongly Connected Components.

Jakub Lacki

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time.

Jakub Lacki, Piotr Sankowski

Proceedings of the Algorithms - ESA 2011, 2011