Round compression for parallel matching algorithms A Czumaj, J Łacki, A Madry, S Mitrovic, K Onak, P Sankowski SIAM Journal on Computing, STOC18-1-STOC18-44, 2019 | 54 | 2019 |

Improved deterministic algorithms for decremental reachability and strongly connected components J Łącki ACM Transactions on Algorithms (TALG) 9 (3), 1-15, 2013 | 41 | 2013 |

Min-Cuts and Shortest Cycles in Planar Graphs in *O*(*n* loglog*n*) TimeJ Łącki, P Sankowski European Symposium on Algorithms, 155-166, 2011 | 35 | 2011 |

Single source--All sinks max flows in planar digraphs J Lacki, Y Nussbaum, P Sankowski, C Wulff-Nilsen 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 599-608, 2012 | 30 | 2012 |

Faster algorithms for Markov decision processes with low treewidth K Chatterjee, J Łącki International Conference on Computer Aided Verification, 543-558, 2013 | 27 | 2013 |

The power of dynamic distance oracles: Efficient dynamic algorithms for the steiner tree J Łącki, J Oćwieja, M Pilipczuk, P Sankowski, A Zych Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 26 | 2015 |

Optimal dynamic strings P Gawrychowski, A Karczmarz, T Kociumaka, J Łącki, P Sankowski Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 25 | 2018 |

Algorithmic complexity of power law networks P Brach, M Cygan, J Łącki, P Sankowski Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 23 | 2016 |

Decremental single-source reachability and strongly connected components in O (m√ n) total update time S Chechik, TD Hansen, GF Italiano, J Łącki, N Parotsidis 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 22 | 2016 |

Community detection on evolving graphs A Anagnostopoulos, J Łącki, S Lattanzi, S Leonardi, M Mahdian Advances in Neural Information Processing Systems, 3522-3530, 2016 | 18 | 2016 |

Acorn: a grid computing system for constraint based modeling and visualization of the genome scale metabolic reaction networks via a web interface J Sroka, Ł Bieniasz-Krzywiec, S Gwóźdź, D Leniowski, J Łącki, ... BMC bioinformatics 12 (1), 196, 2011 | 17 | 2011 |

Decremental single-source reachability in planar digraphs GF Italiano, A Karczmarz, J Łącki, P Sankowski Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 16 | 2017 |

Improved deterministic algorithms for decremental transitive closure and strongly connected components J Łącki Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 16 | 2011 |

Near-optimal massively parallel graph connectivity S Behnezhad, L Dhulipala, H Esfandiari, J Lacki, V Mirrokni 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 13 | 2019 |

Massively parallel computation via remote memory access S Behnezhad, L Dhulipala, H Esfandiari, J Łącki, V Mirrokni, W Schudy The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 59-68, 2019 | 11 | 2019 |

Optimal decremental connectivity in planar graphs J Łącki, P Sankowski STACS 2015, 2014 | 9 | 2014 |

Reachability in graph timelines J Lacki, P Sankowski Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013 | 9 | 2013 |

Walking randomly, massively, and efficiently J Łącki, S Mitrović, K Onak, P Sankowski Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 6 | 2020 |

Connected components at scale via local contractions J Łącki, V Mirrokni, M Włodarczyk arXiv preprint arXiv:1807.10727, 2018 | 6 | 2018 |

Contracting a planar graph efficiently J Holm, GF Italiano, A Karczmarz, J Łącki, E Rotenberg, P Sankowski arXiv preprint arXiv:1706.10228, 2017 | 6 | 2017 |