Jakub Lacki

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 63

Top Topics

Connected Components

Hierarchical Agglomerative

Top Venues

Publications

Lars Gottesbüren, Laxman Dhulipala, Rajesh Jayaram, Jakub Lacki
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search. CoRR (2024)
Brian Wheatman, Xiaojun Dong, Zheqi Shen, Laxman Dhulipala, Jakub Lacki, Prashant Pandey, Helen Xu
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers. Proc. VLDB Endow. 17 (9) (2024)
Brian Wheatman, Xiaojun Dong, Zheqi Shen, Laxman Dhulipala, Jakub Lacki, Prashant Pandey, Helen Xu
BYO: A Unified Framework for Benchmarking Large-Scale Graph Containers. CoRR (2024)
Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Dynamic PageRank: Algorithms and Lower Bounds. CoRR (2024)
Laxman Dhulipala, Jakub Lacki, Jason Lee, Vahab Mirrokni
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs (Abstract). HOPC@SPAA (2024)
Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Václav Rozhon
-Center Clustering. SODA (2024)
Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Dynamic PageRank: Algorithms and Lower Bounds. ICALP (2024)
MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki
It's Hard to HAC Average Linkage! ICALP (2024)
MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki
It's Hard to HAC with Average Linkage! CoRR (2024)
MohammadHossein Bateni, Laxman Dhulipala, Willem Fletcher, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki
Efficient Centroid-Linkage Clustering. CoRR (2024)
Laxman Dhulipala, Jason Lee, Jakub Lacki, Vahab Mirrokni
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs. CoRR (2023)
Rustam Latypov, Jakub Lacki, Yannic Maus, Jara Uitto
Adaptive Massively Parallel Connectivity in Optimal Space. SPAA (2023)
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
Open Problems in (Hyper)Graph Decomposition. CoRR (2023)
Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
Optimal Decremental Connectivity in Non-Sparse Graphs. ICALP (2023)
Jakub Lacki, Rustam Latypov, Yannic Maus, Jara Uitto
Adaptive Massively Parallel Connectivity in Optimal Space. CoRR (2023)
Laxman Dhulipala, Jakub Lacki, Jason Lee, Vahab Mirrokni
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs. Proc. ACM Manag. Data 1 (3) (2023)
Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Václav Rozhon, Rajesh Jayaram
Fully Dynamic Consistent k-Center Clustering. CoRR (2023)
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
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13 (8) (2023)
Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab Mirrokni, Chen Wang
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. COLT (2022)
Jakub Lacki, Yasamin Nazari
Near-Optimal Decremental Hopsets with Applications. ICALP (2022)
Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab S. Mirrokni, Chen Wang
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. CoRR (2022)
Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. CoRR (2022)
Jakub Lacki, Vahab Mirrokni, Christian Sohler
Constant Approximation for Normalized Modularity and Associations Clustering. CoRR (2022)
Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. NeurIPS (2022)
Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni
Scalable Community Detection via Parallel Correlation Clustering. Proc. VLDB Endow. 14 (11) (2021)
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy
Massively Parallel Computation via Remote Memory Access. ACM Trans. Parallel Comput. 8 (3) (2021)
Alessandro Epasto, Andrés Muñoz Medina, Steven Avery, Yijian Bai, Róbert Busa-Fekete, C. J. 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
Clustering for Private Interest-based Advertising. KDD (2021)
Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. ICML (2021)
Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. CoRR (2021)
Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup
Optimal Decremental Connectivity in Non-Sparse Graphs. CoRR (2021)
Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni
Scalable Community Detection via Parallel Correlation Clustering. CoRR (2021)
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. CoRR (2020)
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. Proc. VLDB Endow. 13 (13) (2020)
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Round Compression for Parallel Matching Algorithms. SIAM J. Comput. 49 (5) (2020)
Jakub Lacki, Yasamin Nazari
Near-Optimal Decremental Approximate Multi-Source Shortest Paths. CoRR (2020)
Adam Karczmarz, Jakub Lacki
Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. SOSA (2020)
Heinrich Jiang, Jennifer Jang, Jakub Lacki
Faster DBSCAN via subsampled similarity queries. NeurIPS (2020)
Heinrich Jiang, Jennifer Jang, Jakub Lacki
Faster DBSCAN via subsampled similarity queries. CoRR (2020)
Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni
Update Time. SODA (2020)
Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Walking randomly, massively, and efficiently. STOC (2020)
Adam Karczmarz, Jakub Lacki
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. CoRR (2019)
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Warren Schudy, Vahab S. Mirrokni
Massively Parallel Computation via Remote Memory Access. CoRR (2019)
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni
Near-Optimal Massively Parallel Graph Connectivity. FOCS (2019)
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni
Near-Optimal Massively Parallel Graph Connectivity. CoRR (2019)
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy
Massively Parallel Computation via Remote Memory Access. SPAA (2019)
Adam Karczmarz, Jakub Lacki
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. ESA (2019)
Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni
Update Time. CoRR (2019)
Aris Anagnostopoulos, Ilan Reuven Cohen, Stefano Leonardi, Jakub Lacki
Stochastic Graph Exploration. ICALP (2019)
Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Walking Randomly, Massively, and Efficiently. CoRR (2019)
Jakub Lacki, Vahab S. Mirrokni, Michal Wlodarczyk
Connected Components at Scale via Local Contractions. CoRR (2018)
Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski
Optimal Dynamic Strings. SODA (2018)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
Decremental SPQR-trees for Planar Graphs. CoRR (2018)
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Round compression for parallel matching algorithms. STOC (2018)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg
Decremental SPQR-trees for Planar Graphs. ESA (2018)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
Contracting a Planar Graph Efficiently. CoRR (2017)
Jakub Lacki, Piotr Sankowski
Optimal Decremental Connectivity in Planar Graphs. Theory Comput. Syst. 61 (4) (2017)
Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
Decremental Single-Source Reachability in Planar Digraphs. CoRR (2017)
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Round Compression for Parallel Matching Algorithms. CoRR (2017)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
Contracting a Planar Graph Efficiently. ESA (2017)
Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
Decremental single-source reachability in planar digraphs. STOC (2017)
Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski
Algorithmic Complexity of Power Law Networks. SODA (2016)
Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis
Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. FOCS (2016)
Aris Anagnostopoulos, Jakub Lacki, Silvio Lattanzi, Stefano Leonardi, Mohammad Mahdian
Community Detection on Evolving Graphs. NIPS (2016)
Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski
Optimal Dynamic Strings. CoRR (2015)
Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski
Algorithmic Complexity of Power Law Networks. CoRR (2015)
Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree. STOC (2015)
Adam Karczmarz, Jakub Lacki
Fast and Simple Connectivity in Graph Timelines. WADS (2015)
Jakub Lacki, Piotr Sankowski
Optimal Decremental Connectivity in Planar Graphs. STACS (2015)
Adam Karczmarz, Jakub Lacki
Fast and simple connectivity in graph timelines. CoRR (2015)
Jakub Lacki, Piotr Sankowski
Optimal decremental connectivity in planar graphs. CoRR (2014)
Krishnendu Chatterjee, Jakub Lacki
Faster Algorithms for Markov Decision Processes with Low Treewidth. CAV (2013)
Jakub Lacki, Piotr Sankowski
Reachability in graph timelines. ITCS (2013)
Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych
Dynamic Steiner Tree in Planar Graphs. CoRR (2013)
Krishnendu Chatterjee, Jakub Lacki
Faster Algorithms for Markov Decision Processes with Low Treewidth CoRR (2013)
Jakub Lacki
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components. ACM Trans. Algorithms 9 (3) (2013)
Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
Single Source - All Sinks Max Flows in Planar Digraphs CoRR (2012)
Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
Single Source - All Sinks Max Flows in Planar Digraphs. FOCS (2012)
Jakub Lacki
Improved Deterministic Algorithms for Decremental Transitive Closure and Strongly Connected Components. SODA (2011)
Jakub Lacki, Piotr Sankowski
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time. ESA (2011)
Jakub Lacki, Piotr Sankowski
Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time CoRR (2011)
Jacek Sroka, Lukasz Bieniasz-Krzywiec, Szymon Gwozdz, Dariusz Leniowski, Jakub Lacki, Mateusz Markowski, Claudio Avignone-Rossa, Michael E. Bushell, Johnjoe McFadden, Andrzej M. Kierzek
Acorn: A grid computing system for constraint based modeling and visualization of the genome scale metabolic reaction networks via a web interface. BMC Bioinform. 12 (2011)