Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakub Lacki
Person information
- unicode name: Jakub Łącki
- affiliation: Google Research, New York, NY, USA
- affiliation (PhD): University of Warsaw, Institute of Informatics, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c32]Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Václav Rozhon:
Fully Dynamic Consistent k-Center Clustering. SODA 2024: 3463-3484- [i33]Lars Gottesbüren, Laxman Dhulipala, Rajesh Jayaram, Jakub Lacki:
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search. CoRR abs/2403.01797 (2024) - 2023
- [j8]Laxman Dhulipala
, Jakub Lacki, Jason Lee, Vahab Mirrokni:
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs. Proc. ACM Manag. Data 1(3): 221:1-221:27 (2023) - [c31]Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup:
Optimal Decremental Connectivity in Non-Sparse Graphs. ICALP 2023: 6:1-6:17 - [c30]Rustam Latypov, Jakub Lacki, Yannic Maus, Jara Uitto:
Adaptive Massively Parallel Connectivity in Optimal Space. SPAA 2023: 431-441 - [i32]Jakub Lacki, Rustam Latypov, Yannic Maus, Jara Uitto:
Adaptive Massively Parallel Connectivity in Optimal Space. CoRR abs/2302.04033 (2023) - [i31]Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Václav Rozhon, Rajesh Jayaram:
Fully Dynamic Consistent k-Center Clustering. CoRR abs/2307.13747 (2023) - [i30]Laxman Dhulipala, Jason Lee, Jakub Lacki, Vahab Mirrokni:
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs. CoRR abs/2308.03578 (2023) - [i29]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 abs/2310.11812 (2023) - [i28]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): 1-45 (2023) - 2022
- [c29]Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab Mirrokni, Chen Wang:
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. COLT 2022: 4643-4702 - [c28]Jakub Lacki, Yasamin Nazari:
Near-Optimal Decremental Hopsets with Applications. ICALP 2022: 86:1-86:20 - [c27]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. NeurIPS 2022 - [i27]Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab S. Mirrokni, Chen Wang:
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. CoRR abs/2206.07554 (2022) - [i26]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. CoRR abs/2206.11654 (2022) - [i25]Jakub Lacki, Vahab Mirrokni, Christian Sohler:
Constant Approximation for Normalized Modularity and Associations Clustering. CoRR abs/2212.14334 (2022) - 2021
- [j7]Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni:
Scalable Community Detection via Parallel Correlation Clustering. Proc. VLDB Endow. 14(11): 2305-2313 (2021) - [j6]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): 13:1-13:25 (2021) - [c26]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. ICML 2021: 2676-2686 - [c25]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:
Clustering for Private Interest-based Advertising. KDD 2021: 2802-2810 - [i24]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. CoRR abs/2106.05610 (2021) - [i23]Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni:
Scalable Community Detection via Parallel Correlation Clustering. CoRR abs/2108.01731 (2021) - [i22]Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup:
Optimal Decremental Connectivity in Non-Sparse Graphs. CoRR abs/2111.09376 (2021) - 2020
- [j5]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): 3588-3602 (2020) - [j4]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round Compression for Parallel Matching Algorithms. SIAM J. Comput. 49(5) (2020) - [c24]Heinrich Jiang, Jennifer Jang, Jakub Lacki:
Faster DBSCAN via subsampled similarity queries. NeurIPS 2020 - [c23]Adam Karczmarz, Jakub Lacki:
Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs. SOSA 2020: 106-120 - [c22]Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni:
Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time. SODA 2020: 2492-2508 - [c21]Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Walking randomly, massively, and efficiently. STOC 2020: 364-377 - [i21]Heinrich Jiang, Jennifer Jang, Jakub Lacki:
Faster DBSCAN via subsampled similarity queries. CoRR abs/2006.06743 (2020) - [i20]Jakub Lacki, Yasamin Nazari:
Near-Optimal Decremental Approximate Multi-Source Shortest Paths. CoRR abs/2009.08416 (2020) - [i19]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. CoRR abs/2009.11552 (2020)
2010 – 2019
- 2019
- [c20]Adam Karczmarz, Jakub Lacki:
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. ESA 2019: 65:1-65:15 - [c19]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. FOCS 2019: 1615-1636 - [c18]Aris Anagnostopoulos, Ilan Reuven Cohen, Stefano Leonardi, Jakub Lacki:
Stochastic Graph Exploration. ICALP 2019: 136:1-136:14 - [c17]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. SPAA 2019: 59-68 - [i18]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Warren Schudy, Vahab S. Mirrokni:
Massively Parallel Computation via Remote Memory Access. CoRR abs/1905.07533 (2019) - [i17]Adam Karczmarz, Jakub Lacki:
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs. CoRR abs/1907.02266 (2019) - [i16]Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Walking Randomly, Massively, and Efficiently. CoRR abs/1907.05391 (2019) - [i15]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. CoRR abs/1910.05385 (2019) - [i14]Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni:
Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time. CoRR abs/1911.01839 (2019) - 2018
- [c16]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg:
Decremental SPQR-trees for Planar Graphs. ESA 2018: 46:1-46:16 - [c15]Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski:
Optimal Dynamic Strings. SODA 2018: 1509-1528 - [c14]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round compression for parallel matching algorithms. STOC 2018: 471-484 - [i13]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg:
Decremental SPQR-trees for Planar Graphs. CoRR abs/1806.10772 (2018) - [i12]Jakub Lacki, Vahab S. Mirrokni, Michal Wlodarczyk:
Connected Components at Scale via Local Contractions. CoRR abs/1807.10727 (2018) - 2017
- [j3]Jakub Lacki, Piotr Sankowski:
Optimal Decremental Connectivity in Planar Graphs. Theory Comput. Syst. 61(4): 1037-1053 (2017) - [c13]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski:
Contracting a Planar Graph Efficiently. ESA 2017: 50:1-50:15 - [c12]Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski:
Decremental single-source reachability in planar digraphs. STOC 2017: 1108-1121 - [i11]Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski:
Decremental Single-Source Reachability in Planar Digraphs. CoRR abs/1705.11163 (2017) - [i10]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski:
Contracting a Planar Graph Efficiently. CoRR abs/1706.10228 (2017) - [i9]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round Compression for Parallel Matching Algorithms. CoRR abs/1707.03478 (2017) - 2016
- [c11]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: 315-324 - [c10]Aris Anagnostopoulos, Jakub Lacki, Silvio Lattanzi, Stefano Leonardi, Mohammad Mahdian:
Community Detection on Evolving Graphs. NIPS 2016: 3522-3530 - [c9]Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski:
Algorithmic Complexity of Power Law Networks. SODA 2016: 1306-1325 - 2015
- [c8]Jakub Lacki, Piotr Sankowski:
Optimal Decremental Connectivity in Planar Graphs. STACS 2015: 608-621 - [c7]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: 11-20 - [c6]Adam Karczmarz, Jakub Lacki:
Fast and Simple Connectivity in Graph Timelines. WADS 2015: 458-469 - [i8]Adam Karczmarz, Jakub Lacki:
Fast and simple connectivity in graph timelines. CoRR abs/1506.02973 (2015) - [i7]Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski:
Algorithmic Complexity of Power Law Networks. CoRR abs/1507.02426 (2015) - [i6]Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski:
Optimal Dynamic Strings. CoRR abs/1511.02612 (2015) - 2014
- [i5]Jakub Lacki, Piotr Sankowski:
Optimal decremental connectivity in planar graphs. CoRR abs/1409.7240 (2014) - 2013
- [j2]Jakub Lacki:
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components. ACM Trans. Algorithms 9(3): 27:1-27:15 (2013) - [c5]Krishnendu Chatterjee, Jakub Lacki:
Faster Algorithms for Markov Decision Processes with Low Treewidth. CAV 2013: 543-558 - [c4]Jakub Lacki, Piotr Sankowski:
Reachability in graph timelines. ITCS 2013: 257-268 - [i4]Krishnendu Chatterjee, Jakub Lacki:
Faster Algorithms for Markov Decision Processes with Low Treewidth. CoRR abs/1304.0084 (2013) - [i3]Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych:
Dynamic Steiner Tree in Planar Graphs. CoRR abs/1308.3336 (2013) - 2012
- [c3]Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen:
Single Source - All Sinks Max Flows in Planar Digraphs. FOCS 2012: 599-608 - [i2]Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen:
Single Source - All Sinks Max Flows in Planar Digraphs. CoRR abs/1210.4811 (2012) - 2011
- [j1]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: 196 (2011) - [c2]Jakub Lacki, Piotr Sankowski:
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time. ESA 2011: 155-166 - [c1]Jakub Lacki:
Improved Deterministic Algorithms for Decremental Transitive Closure and Strongly Connected Components. SODA 2011: 1438-1445 - [i1]Jakub Lacki, Piotr Sankowski:
Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time. CoRR abs/1104.4890 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-07 22:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
