Jakub Lacki

101 papers A* 25A 8B 4Journal 60Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Chamfer-Linkage for Hierarchical Agglomerative Clustering.
CoRR
Kishen N. Gowda, Willem Fletcher, MohammadHossein Bateni, Laxman Dhulipala, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki
2026 J jnl
JAG: Joint Attribute Graphs for Filtered Nearest Neighbor Search.
CoRR
Haike Xu, Guy E. Blelloch, Laxman Dhulipala, Lars Gottesbüren, Rajesh Jayaram, Jakub Lacki
2026 J jnl
PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing.
CoRR
Tobias Rubel, Richard Wen, Laxman Dhulipala, Lars Gottesbüren, Rajesh Jayaram, Jakub Lacki
2025 J jnl
Aggregating maximal cliques in real-world graphs.
CoRR
Noga Alon, Sabyasachi Basu, Shweta Jain, Haim Kaplan, Jakub Lacki, Blair D. Sullivan
2025 A conf
DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering.
SDM
Shangdi Yu, Laxman Dhulipala, Jakub Lacki, Nikos Parotsidis
2025 J jnl
DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering.
CoRR
Shangdi Yu, Laxman Dhulipala, Jakub Lacki, Nikos Parotsidis
2025 B conf
Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs.
SPAA
Jakub Lacki, Slobodan Mitrovic, Srikkanth Ramachandran, Wen-Horng Sheu
2025 J jnl
Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs.
CoRR
Jakub Lacki, Slobodan Mitrovic, Srikkanth Ramachandran, Wen-Horng Sheu
2025 A* conf
Massively Parallel Minimum Spanning Tree in General Metric Spaces.
SODA
Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Lacki, Vahab Mirrokni, Peilin Zhong
2025 J jnl
Parallel Hierarchical Agglomerative Clustering in Low Dimensions.
CoRR
MohammadHossein Bateni, Laxman Dhulipala, Willem Fletcher, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki
2025 — conf
Towards Scalable and Practical Batch-Dynamic Connectivity (Abstract).
HOPC@SPAA
Quinten De Man, Laxman Dhulipala, Adam Karczmarz, Jakub Lacki, Julian Shun, Zhongqi Wang
2025 J jnl
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search.
Proc. VLDB Endow.
Lars Gottesbüren, Laxman Dhulipala, Rajesh Jayaram, Jakub Lacki
2024 J jnl
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers.
CoRR
Brian Wheatman, Xiaojun Dong, Zheqi Shen, Laxman Dhulipala, Jakub Lacki, Prashant Pandey, Helen Xu
2024 J jnl
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers.
Proc. VLDB Endow.
Brian Wheatman, Xiaojun Dong, Zheqi Shen, Laxman Dhulipala, Jakub Lacki, Prashant Pandey, Helen Xu
2024 A* conf
Dynamic PageRank: Algorithms and Lower Bounds.
ICALP
Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2024 J jnl
Dynamic PageRank: Algorithms and Lower Bounds.
CoRR
Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2024 A* conf
Efficient Centroid-Linkage Clustering.
NeurIPS
Mohammad Hossein Bateni, Laxman Dhulipala, Willem Fletcher, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki
2024 J jnl
Efficient Centroid-Linkage Clustering.
CoRR
MohammadHossein Bateni, Laxman Dhulipala, Willem Fletcher, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki
2024 A* conf
Fully Dynamic Consistent
SODA
Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Václav Rozhon
2024 A* conf
It's Hard to HAC Average Linkage!
ICALP
MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki
2024 J jnl
It's Hard to HAC with Average Linkage!
CoRR
MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki
2024 J jnl
Massively Parallel Minimum Spanning Tree in General Metric Spaces.
CoRR
Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Lacki, Vahab Mirrokni, Peilin Zhong
2024 A conf
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling.
DISC
Laxman Dhulipala, Michael Dinitz, Jakub Lacki, Slobodan Mitrovic
2024 J jnl
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling.
CoRR
Laxman Dhulipala, Michael Dinitz, Jakub Lacki, Slobodan Mitrovic
2024 — conf
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs (Abstract).
HOPC@SPAA
Laxman Dhulipala, Jakub Lacki, Jason Lee, Vahab Mirrokni
2024 J jnl
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering.
CoRR
Shangdi Yu, Jessica Shi, Jamison Meindl, David Eisenstat, Xiaoen Ju, Sasan Tavakkol, Laxman Dhulipala, Jakub Lacki, Vahab Mirrokni, Julian Shun
2024 J jnl
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering.
Proc. VLDB Endow.
Shangdi Yu, Jessica Shi, Jamison Meindl, David Eisenstat, Xiaoen Ju, Sasan Tavakkol, Laxman Dhulipala, Jakub Lacki, Vahab Mirrokni, Julian Shun
2024 J jnl
Towards Scalable and Practical Batch-Dynamic Connectivity.
CoRR
Quinten De Man, Laxman Dhulipala, Adam Karczmarz, Jakub Lacki, Julian Shun, Zhongqi Wang
2024 J jnl
Towards Scalable and Practical Batch-Dynamic Connectivity.
Proc. VLDB Endow.
Quinten De Man, Laxman Dhulipala, Adam Karczmarz, Jakub Lacki, Julian Shun, Zhongqi Wang
2024 J jnl
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search.
CoRR
Lars Gottesbüren, Laxman Dhulipala, Rajesh Jayaram, Jakub Lacki
2023 B conf
Adaptive Massively Parallel Connectivity in Optimal Space.
SPAA
Rustam Latypov, Jakub Lacki, Yannic Maus, Jara Uitto
2023 J jnl
Adaptive Massively Parallel Connectivity in Optimal Space.
CoRR
Jakub Lacki, Rustam Latypov, Yannic Maus, Jara Uitto
2023 J jnl
Fully Dynamic Consistent k-Center Clustering.
CoRR
Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Václav Rozhon, Rajesh Jayaram
2023 J jnl
Open Problems in (Hyper)Graph Decomposition.
CoRR
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
2023 A* conf
Optimal Decremental Connectivity in Non-Sparse Graphs.
ICALP
Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
2023 J jnl
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).
Dagstuhl Reports
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
2023 J jnl
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs.
CoRR
Laxman Dhulipala, Jason Lee, Jakub Lacki, Vahab Mirrokni
2023 J jnl
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs.
Proc. ACM Manag. Data
Laxman Dhulipala, Jakub Lacki, Jason Lee, Vahab Mirrokni
2022 J jnl
Constant Approximation for Normalized Modularity and Associations Clustering.
CoRR
Jakub Lacki, Vahab Mirrokni, Christian Sohler
2022 A* conf
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth.
NeurIPS
Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi
2022 J jnl
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth.
CoRR
Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi
2022 A* conf
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds.
COLT
Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab Mirrokni, Chen Wang
2022 J jnl
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds.
CoRR
Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab S. Mirrokni, Chen Wang
2022 A* conf
Near-Optimal Decremental Hopsets with Applications.
ICALP
Jakub Lacki, Yasamin Nazari
2021 A* conf
Clustering for Private Interest-based Advertising.
KDD
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
2021 A* conf
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time.
ICML
Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi
2021 J jnl
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time.
CoRR
Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi
2021 J jnl
Massively Parallel Computation via Remote Memory Access.
ACM Trans. Parallel Comput.
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy
2021 J jnl
Optimal Decremental Connectivity in Non-Sparse Graphs.
CoRR
Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
2021 J jnl
Scalable Community Detection via Parallel Correlation Clustering.
CoRR
Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni
2021 J jnl
Scalable Community Detection via Parallel Correlation Clustering.
Proc. VLDB Endow.
Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni
2020 A* conf
Faster DBSCAN via subsampled similarity queries.
NeurIPS
Heinrich Jiang, Jennifer Jang, Jakub Lacki
2020 J jnl
Faster DBSCAN via subsampled similarity queries.
CoRR
Heinrich Jiang, Jennifer Jang, Jakub Lacki
2020 A* conf
Fully Dynamic Matching: Beating 2-Approximation in Δ
SODA
Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni
2020 J jnl
Near-Optimal Decremental Approximate Multi-Source Shortest Paths.
CoRR
Jakub Lacki, Yasamin Nazari
2020 J jnl
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice.
CoRR
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy
2020 J jnl
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice.
Proc. VLDB Endow.
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy
2020 J jnl
Round Compression for Parallel Matching Algorithms.
SIAM J. Comput.
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2020 — conf
Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs.
SOSA
Adam Karczmarz, Jakub Lacki
2020 A* conf
Walking randomly, massively, and efficiently.
STOC
Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2019 J jnl
Fully Dynamic Matching: Beating 2-Approximation in Δ
CoRR
Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni
2019 B conf
Massively Parallel Computation via Remote Memory Access.
SPAA
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy
2019 J jnl
Massively Parallel Computation via Remote Memory Access.
CoRR
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Warren Schudy, Vahab S. Mirrokni
2019 A* conf
Near-Optimal Massively Parallel Graph Connectivity.
FOCS
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni
2019 J jnl
Near-Optimal Massively Parallel Graph Connectivity.
CoRR
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni
2019 A conf
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs.
ESA
Adam Karczmarz, Jakub Lacki
2019 J jnl
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs.
CoRR
Adam Karczmarz, Jakub Lacki
2019 A* conf
Stochastic Graph Exploration.
ICALP
Aris Anagnostopoulos, Ilan Reuven Cohen, Stefano Leonardi, Jakub Lacki
2019 J jnl
Walking Randomly, Massively, and Efficiently.
CoRR
Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2018 J jnl
Connected Components at Scale via Local Contractions.
CoRR
Jakub Lacki, Vahab S. Mirrokni, Michal Wlodarczyk
2018 A conf
Decremental SPQR-trees for Planar Graphs.
ESA
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
2018 J jnl
Decremental SPQR-trees for Planar Graphs.
CoRR
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
2018 A* conf
Optimal Dynamic Strings.
SODA
Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski
2018 A* conf
Round compression for parallel matching algorithms.
STOC
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2017 A conf
Contracting a Planar Graph Efficiently.
ESA
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
2017 J jnl
Contracting a Planar Graph Efficiently.
CoRR
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
2017 J jnl
Decremental Single-Source Reachability in Planar Digraphs.
CoRR
Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
2017 A* conf
Decremental single-source reachability in planar digraphs.
STOC
Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
2017 J jnl
Optimal Decremental Connectivity in Planar Graphs.
Theory Comput. Syst.
Jakub Lacki, Piotr Sankowski
2017 J jnl
Round Compression for Parallel Matching Algorithms.
CoRR
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2016 A* conf
Algorithmic Complexity of Power Law Networks.
SODA
Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski
2016 — conf
Community Detection on Evolving Graphs.
NIPS
Aris Anagnostopoulos, Jakub Lacki, Silvio Lattanzi, Stefano Leonardi, Mohammad Mahdian
2016 A* conf
Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time.
FOCS
Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis
2015 J jnl
Algorithmic Complexity of Power Law Networks.
CoRR
Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski
2015 B conf
Fast and Simple Connectivity in Graph Timelines.
WADS
Adam Karczmarz, Jakub Lacki
2015 J jnl
Fast and simple connectivity in graph timelines.
CoRR
Adam Karczmarz, Jakub Lacki
2015 A conf
Optimal Decremental Connectivity in Planar Graphs.
STACS
Jakub Lacki, Piotr Sankowski
2015 J jnl
Optimal Dynamic Strings.
CoRR
Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski
2015 A* conf
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree.
STOC
Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych
2014 J jnl
Optimal decremental connectivity in planar graphs.
CoRR
Jakub Lacki, Piotr Sankowski
2013 J jnl
Dynamic Steiner Tree in Planar Graphs.
CoRR
Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych
2013 J jnl
Faster Algorithms for Markov Decision Processes with Low Treewidth
CoRR
Krishnendu Chatterjee, Jakub Lacki
2013 A* conf
Faster Algorithms for Markov Decision Processes with Low Treewidth.
CAV
Krishnendu Chatterjee, Jakub Lacki
2013 J jnl
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components.
ACM Trans. Algorithms
Jakub Lacki
2013 A conf
Reachability in graph timelines.
ITCS
Jakub Lacki, Piotr Sankowski
2012 J jnl
Single Source - All Sinks Max Flows in Planar Digraphs
CoRR
Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
2012 A* conf
Single Source - All Sinks Max Flows in Planar Digraphs.
FOCS
Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
2011 J jnl
Acorn: A grid computing system for constraint based modeling and visualization of the genome scale metabolic reaction networks via a web interface.
BMC Bioinform.
Jacek Sroka, Lukasz Bieniasz-Krzywiec, Szymon Gwozdz, Dariusz Leniowski, Jakub Lacki, Mateusz Markowski, Claudio Avignone-Rossa, Michael E. Bushell, Johnjoe McFadden, Andrzej M. Kierzek
2011 A* conf
Improved Deterministic Algorithms for Decremental Transitive Closure and Strongly Connected Components.
SODA
Jakub Lacki
2011 A conf
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time.
ESA
Jakub Lacki, Piotr Sankowski
2011 J jnl
Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time
CoRR
Jakub Lacki, Piotr Sankowski