According to our database1, Jakub Lacki authored at least 29 papers between 2011 and 2020.
Legend:Book In proceedings Article PhD thesis Other
Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs.
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020
Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time.
Walking Randomly, Massively, and Efficiently.
Massively Parallel Computation via Remote Memory Access.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019
Stochastic Graph Exploration.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Near-Optimal Massively Parallel Graph Connectivity.
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.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
Connected Components at Scale via Local Contractions.
Round compression for parallel matching algorithms.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Optimal Dynamic Strings.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Decremental SPQR-trees for Planar Graphs.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
Optimal Decremental Connectivity in Planar Graphs.
Theory Comput. Syst., 2017
Decremental single-source reachability in planar digraphs.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Contracting a Planar Graph Efficiently.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
Algorithmic Complexity of Power Law Networks.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Community Detection on Evolving Graphs.
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.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
Fast and Simple Connectivity in Graph Timelines.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components.
ACM Trans. Algorithms, 2013
Dynamic Steiner Tree in Planar Graphs.
Reachability in graph timelines.
Proceedings of the Innovations in Theoretical Computer Science, 2013
Faster Algorithms for Markov Decision Processes with Low Treewidth.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013
Single Source - All Sinks Max Flows in Planar Digraphs.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time
Acorn: A grid computing system for constraint based modeling and visualization of the genome scale metabolic reaction networks via a web interface.
BMC Bioinformatics, 2011
Improved Deterministic Algorithms for Decremental Transitive Closure and Strongly Connected Components.
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.
Proceedings of the Algorithms - ESA 2011, 2011