| 2025 | AAAI | Accurate Estimation of Feature Importance Faithfulness for Tree Models. | Mateusz Gajewski, Adam Karczmarz, Mateusz Rapicki, Piotr Sankowski |
| 2025 | ACL | Wait, that's not an option: LLMs Robustness with Incorrect Multiple-Choice Options. | Gracjan Gral, Emilia Wisnios, Piotr Sankowski, Pawel Budzianowski |
| 2025 | ECAI | Knowledge-Driven Bayesian Uncertainty Quantification for Reliable Fake News Detection. | Julia Puczynska, Youcef Djenouri, Michal Bizon, Tomasz P. Michalak, Piotr Sankowski |
| 2025 | ICALP | Faster Semi-Streaming Matchings via Alternating Trees. | Slobodan Mitrovic, Anish Mukherjee, Piotr Sankowski, Wen-Horng Sheu |
| 2025 | ICML | Joint MoE Scaling Laws: Mixture of Experts Can Be Memory Efficient. | Jan Ludziejewski, Maciej Piro, Jakub Krajewski, Maciej Stefaniak, Michal Krutul, Jan Malasnicki, Marek Cygan, Piotr Sankowski, Kamil Adamczewski, Piotr Milos, Sebastian Jaszczur |
| 2025 | ICML | Since Faithfulness Fails: The Performance Limits of Neural Causal Discovery. | Mateusz Olko, Mateusz Gajewski, Joanna Wojciechowska, Mikolaj Morzy, Piotr Sankowski, Piotr Milos |
| 2024 | EMNLP | LLM generated responses to mitigate the impact of hate speech. | Jakub Podolak, Szymon Lukasik, Pawel Balawender, Jan Ossowski, Jan Piotrowski, Katarzyna Bakowicz, Piotr Sankowski |
| 2024 | ICALP | Dynamic PageRank: Algorithms and Lower Bounds. | Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski |
| 2024 | ICML | Scaling Laws for Fine-Grained Mixture of Experts. | Jan Ludziejewski, Jakub Krajewski, Kamil Adamczewski, Maciej Piro, Michal Krutul, Szymon Antoniak, Kamil Ciebiera, Krystian Krl, Tomasz Odrzygzdz, Piotr Sankowski, Marek Cygan, Sebastian Jaszczur |
| 2024 | ISAAC | Online Multi-Level Aggregation with Delays and Stochastic Arrivals. | Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski |
| 2024 | SODA | Shortest Disjoint Paths on a Grid. | Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski |
| 2023 | FOCS | Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. | Adam Karczmarz, Piotr Sankowski |
| 2023 | ICALP | Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs. | Adam Karczmarz, Piotr Sankowski |
| 2022 | AusDM | Improving Ads-Profitability Using Traffic-Fingerprints. | Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski, Marcin Mucha, Pawel Brach |
| 2022 | STOC | Subquadratic dynamic path reporting in directed graphs against an adaptive adversary. | Adam Karczmarz, Anish Mukherjee, Piotr Sankowski |
| 2022 | UAI | Improved feature importance computation for tree models based on the Banzhaf value. | Adam Karczmarz, Tomasz P. Michalak, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki |
| 2021 | ICML | Decomposable Submodular Function Minimization via Maximum Flow. | Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu |
| 2021 | SODA | A Deterministic Parallel APSP Algorithm and its Applications. | Adam Karczmarz, Piotr Sankowski |
| 2020 | STOC | Walking randomly, massively, and efficiently. | Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski |
| 2019 | ESA | Min-Cost Flow in Unit-Capacity Planar Graphs. | Adam Karczmarz, Piotr Sankowski |
| 2019 | SODA | (1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. | Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon |
| 2018 | ESA | Online Facility Location with Deletions. | Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski |
| 2018 | ICALP | NC Algorithms for Weighted Planar Perfect Matching and Related Problems. | Piotr Sankowski |
| 2018 | LATIN | A Tight Bound for Shortest Augmenting Paths on Trees. | Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz |
| 2018 | SODA | Optimal Dynamic Strings. | Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski |
| 2018 | STOC | Round compression for parallel matching algorithms. | Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski |
| 2017 | ESA | Contracting a Planar Graph Efficiently. | Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski |
| 2017 | IPCO | Budget Feasible Mechanisms on Matroids. | Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang |
| 2017 | ISAAC | Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}. | Piotr Sankowski, Piotr Wygocki |
| 2017 | WWW | Why Do Cascade Sizes Follow a Power-Law? | Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki |
| 2017 | SODA | Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in ( | Michael B. Cohen, Aleksander Madry, Piotr Sankowski, Adrian Vladu |
| 2017 | STOC | Decremental single-source reachability in planar digraphs. | Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski |
| 2017 | STACS | Improved Distance Queries and Cycle Counting by Frobenius Normal Form. | Piotr Sankowski, Karol Wegrzycki |
| 2016 | COCOON | Locality-Sensitive Hashing Without False Negatives for l_p. | Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki |
| 2016 | RecSys | RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. | Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki |
| 2016 | SODA | Algorithmic Complexity of Power Law Networks. | Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski |
| 2016 | SODA | Online Pricing with Impatient Bidders. | Marek Cygan, Marcin Mucha, Piotr Sankowski, Qiang Zhang |
| 2015 | IJCAI | Revenue Maximization Envy-Free Pricing for Homogeneous Resources. | Gianpiero Monaco, Piotr Sankowski, Qiang Zhang |
| 2015 | STOC | The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree. | Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych |
| 2015 | STACS | Optimal Decremental Connectivity in Planar Graphs. | Jakub Lacki, Piotr Sankowski |
| 2015 | SOFSEM | Online Bipartite Matching in Offline Time (Abstract). | Piotr Sankowski |
| 2015 | WAOA | Shortest Augmenting Paths for Online Matchings on Trees. | Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych |
| 2014 | FOCS | Online Bipartite Matching in Offline Time. | Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych |
| 2014 | FOCS | Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. | Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen |
| 2014 | SAGT | Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching. | Marek Adamczyk, Piotr Sankowski, Qiang Zhang |
| 2013 | FOCS | Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors. | Harold N. Gabow, Piotr Sankowski |
| 2013 | STACS | Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. | Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen |
| 2012 | ESA | A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. | Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski |
| 2012 | FOCS | Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. | Marek Cygan, Harold N. Gabow, Piotr Sankowski |
| 2012 | FOCS | Single Source - All Sinks Max Flows in Planar Digraphs. | Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen |
| 2011 | ESA | Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time. | Jakub Lacki, Piotr Sankowski |
| 2011 | STOC | Improved algorithms for min cut and max flow in undirected planar graphs. | Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen |
| 2011 | WSDM | Stochastic query covering. | Aris Anagnostopoulos, Luca Becchetti, Stefano Leonardi, Ida Mele, Piotr Sankowski |
| 2010 | ESA | Fast Approximation in Subspaces by Doubling Metric Decomposition. | Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski |
| 2010 | FOCS | Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. | Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen |
| 2010 | ICALP | Online Network Design with Outliers. | Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski |
| 2008 | FOCS | Set Covering with our Eyes Closed. | Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh |
| 2008 | ICALP | Dynamic Normal Forms and Dynamic Characteristic Polynomial. | Gudmund Skovbjerg Frandsen, Piotr Sankowski |
| 2008 | MFCS | Algebraic Graph Algorithms. | Piotr Sankowski |
| 2008 | SODA | Stochastic analyses for online combinatorial optimization problems. | Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski |
| 2007 | ESA | Dynamic Plane Transitive Closure. | Krzysztof Diks, Piotr Sankowski |
| 2007 | PODC | Network formation games with local coalitions. | Stefano Leonardi, Piotr Sankowski |
| 2007 | SODA | Faster dynamic matchings and vertex connectivity. | Piotr Sankowski |
| 2006 | ICALP | Weighted Bipartite Matching in Matrix Multiplication Time. | Piotr Sankowski |
| 2005 | COCOON | Subquadratic Algorithm for Dynamic Shortest Distances. | Piotr Sankowski |
| 2005 | ESA | Shortest Paths in Matrix Multiplication Time. | Piotr Sankowski |
| 2005 | SPAA | Processor efficient parallel matching. | Piotr Sankowski |
| 2004 | ESA | Maximum Matchings in Planar Graphs via Gaussian Elimination. | Marcin Mucha, Piotr Sankowski |
| 2004 | FOCS | Maximum Matchings via Gaussian Elimination. | Marcin Mucha, Piotr Sankowski |
| 2004 | FOCS | Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract). | Piotr Sankowski |
| 2004 | ICWE | Improving Web Sites by Automatic Source Code Analysis and Modifications. | Krzysztof Ciebiera, Piotr Sankowski |
| 2003 | ESA | Multisampling: A New Approach to Uniform Sampling and Approximate Counting. | Piotr Sankowski |
| 2003 | STACS | Alternative Algorithms for Counting All Matchings in Graphs. | Piotr Sankowski |