Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time. - Jakub Lacki; Piotr Sankowski (ESA, 2011)

Improved Deterministic Algorithms for Decremental Transitive Closure and Strongly Connected Components. - Jakub Lacki (SODA, 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)

Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time - Jakub Lacki; Piotr Sankowski (CoRR, 2011)

Single Source - All Sinks Max Flows in Planar Digraphs. - Jakub Lacki; Yahav Nussbaum; Piotr Sankowski; Christian Wulff-Nilsen (FOCS, 2012)

Faster Algorithms for Markov Decision Processes with Low Treewidth. - Krishnendu Chatterjee; Jakub Lacki (CAV, 2013)

Reachability in graph timelines. - Jakub Lacki; Piotr Sankowski (ITCS, 2013)

Dynamic Steiner Tree in Planar Graphs. - Jakub Lacki; Jakub Ocwieja; Marcin Pilipczuk; Piotr Sankowski; Anna Zych (CoRR, 2013)

Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components. - Jakub Lacki (ACM Trans. Algorithms, 2013)

The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree. - Jakub Lacki; Jakub Ocwieja; Marcin Pilipczuk; Piotr Sankowski; Anna Zych (STOC, 2015)

Fast and Simple Connectivity in Graph Timelines. - Adam Karczmarz; Jakub Lacki (WADS, 2015)

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 (FOCS, 2016)

Community Detection on Evolving Graphs. - Aris Anagnostopoulos; Jakub Lacki; Silvio Lattanzi; Stefano Leonardi 001; Mohammad Mahdian (NIPS, 2016)

Algorithmic Complexity of Power Law Networks. - Pawel Brach; Marek Cygan; Jakub Lacki; Piotr Sankowski (SODA, 2016)

Contracting a Planar Graph Efficiently. - Jacob Holm; Giuseppe F. Italiano; Adam Karczmarz; Jakub Lacki; Eva Rotenberg; Piotr Sankowski (ESA, 2017)

Decremental single-source reachability in planar digraphs. - Giuseppe F. Italiano; Adam Karczmarz; Jakub Lacki; Piotr Sankowski (STOC, 2017)

Optimal Decremental Connectivity in Planar Graphs. - Jakub Lacki; Piotr Sankowski (Theory Comput. Syst., 2017)

Decremental SPQR-trees for Planar Graphs. - Jacob Holm; Giuseppe F. Italiano; Adam Karczmarz; Jakub Lacki; Eva Rotenberg (ESA, 2018)

Optimal Dynamic Strings. - Pawel Gawrychowski; Adam Karczmarz; Tomasz Kociumaka; Jakub Lacki; Piotr Sankowski (SODA, 2018)

Connected Components at Scale via Local Contractions. - Jakub Lacki; Vahab S. Mirrokni; Michal Wlodarczyk 001 (CoRR, 2018)

Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. - Adam Karczmarz; Jakub Lacki (ESA, 2019)

Near-Optimal Massively Parallel Graph Connectivity. - Soheil Behnezhad; Laxman Dhulipala; Hossein Esfandiari; Jakub Lacki; Vahab S. Mirrokni (FOCS, 2019)

Stochastic Graph Exploration. - Aris Anagnostopoulos; Ilan Reuven Cohen; Stefano Leonardi 001; Jakub Lacki (ICALP, 2019)

Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time. - Soheil Behnezhad; Jakub Lacki; Vahab S. Mirrokni (CoRR, 2019)

Faster DBSCAN via subsampled similarity queries. - Heinrich Jiang; Jennifer Jang; Jakub Lacki (NeurIPS, 2020)

Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time. - Soheil Behnezhad; Jakub Lacki; Vahab S. Mirrokni (SODA, 2020)

Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. - Adam Karczmarz; Jakub Lacki (SOSA, 2020)

Walking randomly, massively, and efficiently. - Jakub Lacki; Slobodan Mitrovic; Krzysztof Onak; Piotr Sankowski (STOC, 2020)

Near-Optimal Decremental Approximate Multi-Source Shortest Paths. - Jakub Lacki; Yasamin Nazari (CoRR, 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)

Round Compression for Parallel Matching Algorithms. - Artur Czumaj; Jakub Lacki; Aleksander Madry; Slobodan Mitrovic; Krzysztof Onak; Piotr Sankowski (SIAM J. Comput., 2020)

Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. - Laxman Dhulipala; David Eisenstat; Jakub Lacki; Vahab S. Mirrokni; Jessica Shi 001 (ICML, 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; et al. (KDD, 2021)

Scalable Community Detection via Parallel Correlation Clustering. - Jessica Shi 001; Laxman Dhulipala; David Eisenstat; Jakub Lacki; Vahab S. Mirrokni (Proc. VLDB Endow., 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)

Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. - Sepehr Assadi; Vaggos Chatziafratis; Jakub Lacki; Vahab Mirrokni; Chen Wang 027 (COLT, 2022)

Near-Optimal Decremental Hopsets with Applications. - Jakub Lacki; Yasamin Nazari (ICALP, 2022)

Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. - Laxman Dhulipala; David Eisenstat; Jakub Lacki; Vahab Mirrokni; Jessica Shi 001 (NeurIPS, 2022)

Constant Approximation for Normalized Modularity and Associations Clustering. - Jakub Lacki; Vahab Mirrokni; Christian Sohler (CoRR, 2022)

Optimal Decremental Connectivity in Non-Sparse Graphs. - Anders Aamand; Adam Karczmarz; Jakub Lacki; Nikos Parotsidis; Peter M. R. Rasmussen; Mikkel Thorup (ICALP, 2023)

Adaptive Massively Parallel Connectivity in Optimal Space. - Rustam Latypov; Jakub Lacki; Yannic Maus; Jara Uitto (SPAA, 2023)

Fully Dynamic Consistent k-Center Clustering. - Jakub Lacki; Bernhard Haeupler; Christoph Grunau; Václav Rozhon; Rajesh Jayaram (CoRR, 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; et al. (CoRR, 2023)

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). - George Karypis; Christian Schulz 003; 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; et al. (Dagstuhl Reports, 2023)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs. - Laxman Dhulipala; Jakub Lacki; Jason Lee; Vahab Mirrokni (Proc. ACM Manag. Data, 2023)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs (Abstract). - Laxman Dhulipala; Jakub Lacki; Jason Lee; Vahab Mirrokni (HOPC@SPAA, 2024)

It's Hard to HAC Average Linkage! - MohammadHossein Bateni; Laxman Dhulipala; Kishen N. Gowda; D. Ellis Hershkowitz; Rajesh Jayaram; Jakub Lacki (ICALP, 2024)

Dynamic PageRank: Algorithms and Lower Bounds. - Rajesh Jayaram; Jakub Lacki; Slobodan Mitrovic; Krzysztof Onak; Piotr Sankowski (ICALP, 2024)

Efficient Centroid-Linkage Clustering. - Mohammad Hossein Bateni 001; Laxman Dhulipala; Willem Fletcher; Kishen N. Gowda; D. Ellis Hershkowitz; Rajesh Jayaram; Jakub Lacki (NeurIPS, 2024)

Fully Dynamic Consistent k-Center Clustering. - Jakub Lacki; Bernhard Haeupler; Christoph Grunau; Rajesh Jayaram; Václav Rozhon (SODA, 2024)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling. - Laxman Dhulipala; Michael Dinitz; Jakub Lacki; Slobodan Mitrovic (DISC, 2024)

BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers. - Brian Wheatman; Xiaojun Dong 001; Zheqi Shen; Laxman Dhulipala; Jakub Lacki; Prashant Pandey 001; Helen Xu 001 (Proc. VLDB Endow., 2024)

Towards Scalable and Practical Batch-Dynamic Connectivity. - Quinten De Man; Laxman Dhulipala; Adam Karczmarz; Jakub Lacki; Julian Shun; Zhongqi Wang (Proc. VLDB Endow., 2024)

The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering. - Shangdi Yu; Jessica Shi 001; Jamison Meindl; David Eisenstat; Xiaoen Ju; Sasan Tavakkol; Laxman Dhulipala; Jakub Lacki; Vahab Mirrokni; Julian Shun (Proc. VLDB Endow., 2024)

Towards Scalable and Practical Batch-Dynamic Connectivity (Abstract). - Quinten De Man; Laxman Dhulipala; Adam Karczmarz; Jakub Lacki; Julian Shun; Zhongqi Wang (HOPC@SPAA, 2025)

DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering. - Shangdi Yu; Laxman Dhulipala; Jakub Lacki; Nikos Parotsidis (SDM, 2025)

Massively Parallel Minimum Spanning Tree in General Metric Spaces. - Amir Azarmehr; Soheil Behnezhad; Rajesh Jayaram; Jakub Lacki; Vahab Mirrokni; Peilin Zhong (SODA, 2025)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs. - Jakub Lacki; Slobodan Mitrovic; Srikkanth Ramachandran; Wen-Horng Sheu (SPAA, 2025)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search. - Lars Gottesbüren; Laxman Dhulipala; Rajesh Jayaram; Jakub Lacki (Proc. VLDB Endow., 2025)

Parallel Hierarchical Agglomerative Clustering in Low Dimensions. - MohammadHossein Bateni; Laxman Dhulipala; Willem Fletcher; Kishen N. Gowda; D. Ellis Hershkowitz; Rajesh Jayaram; Jakub Lacki (CoRR, 2025)