Multisampling: A New Approach to Uniform Sampling and Approximate Counting. - Piotr Sankowski (ESA, 2003)

Alternative Algorithms for Counting All Matchings in Graphs. - Piotr Sankowski (STACS, 2003)

Maximum Matchings via Gaussian Elimination. - Marcin Mucha; Piotr Sankowski (FOCS, 2004)

Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract). - Piotr Sankowski (FOCS, 2004)

Improving Web Sites by Automatic Source Code Analysis and Modifications. - Krzysztof Ciebiera; Piotr Sankowski (ICWE, 2004)

Subquadratic Algorithm for Dynamic Shortest Distances. - Piotr Sankowski (COCOON, 2005)

Shortest Paths in Matrix Multiplication Time. - Piotr Sankowski (ESA, 2005)

Weighted Bipartite Matching in Matrix Multiplication Time. - Piotr Sankowski (ICALP (1), 2006)

Maximum Matchings in Planar Graphs via Gaussian Elimination. - Marcin Mucha; Piotr Sankowski (Algorithmica, 2006)

Dynamic Plane Transitive Closure. - Krzysztof Diks; Piotr Sankowski (ESA, 2007)

Network formation games with local coalitions. - Stefano Leonardi 001; Piotr Sankowski (PODC, 2007)

Faster dynamic matchings and vertex connectivity. - Piotr Sankowski (SODA, 2007)

Algebraic Graph Algorithms. - Piotr Sankowski (MFCS, 2008)

Stochastic analyses for online combinatorial optimization problems. - Naveen Garg 001; Anupam Gupta 001; Stefano Leonardi 001; Piotr Sankowski (SODA, 2008)

Processor Efficient Parallel Matching. - Piotr Sankowski (Theory Comput. Syst., 2008)

Maximum weight bipartite matching in matrix multiplication time. - Piotr Sankowski (Theor. Comput. Sci., 2009)

Fast Approximation in Subspaces by Doubling Metric Decomposition. - Marek Cygan; Lukasz Kowalik; Marcin Mucha; Marcin Pilipczuk; Piotr Sankowski (ESA (1), 2010)

Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. - Glencora Borradaile; Piotr Sankowski; Christian Wulff-Nilsen (FOCS, 2010)

Fast Dynamic Transitive Closure with Lookahead. - Piotr Sankowski; Marcin Mucha (Algorithmica, 2010)

Combinatorial Auctions with Budgets - Amos Fiat; Stefano Leonardi 001; Jared Saia; Piotr Sankowski (CoRR, 2010)

Improved Minimum Cuts and Maximum Flows in Undirected Planar Graphs - Giuseppe F. Italiano; Piotr Sankowski (CoRR, 2010)

Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time. - Jakub Lacki; Piotr Sankowski (ESA, 2011)

Approximation Algorithms for Union and Intersection Covering Problems. - Marek Cygan; Fabrizio Grandoni 001; Stefano Leonardi 001; Marcin Mucha; Marcin Pilipczuk; Piotr Sankowski (FSTTCS, 2011)

Single valued combinatorial auctions with budgets. - Amos Fiat; Stefano Leonardi 001; Jared Saia; Piotr Sankowski (EC, 2011)

Improved algorithms for min cut and max flow in undirected planar graphs. - Giuseppe F. Italiano; Yahav Nussbaum; Piotr Sankowski; Christian Wulff-Nilsen (STOC, 2011)

Stochastic query covering. - Aris Anagnostopoulos; Luca Becchetti; Stefano Leonardi 001; Ida Mele; Piotr Sankowski (WSDM, 2011)

Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time - Jakub Lacki; Piotr Sankowski (CoRR, 2011)

Dynamic normal forms and dynamic characteristic polynomial. - Gudmund Skovbjerg Frandsen; Piotr Sankowski (Theor. Comput. Sci., 2011)

A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. - Marek Cygan; Fabrizio Grandoni 001; Stefano Leonardi 001; Marcin Pilipczuk; Piotr Sankowski (ESA, 2012)

Single Source - All Sinks Max Flows in Planar Digraphs. - Jakub Lacki; Yahav Nussbaum; Piotr Sankowski; Christian Wulff-Nilsen (FOCS, 2012)

Revenue maximizing envy-free multi-unit auctions with budgets. - Michal Feldman; Amos Fiat; Stefano Leonardi 001; Piotr Sankowski (EC, 2012)

The Ring Design Game with Fair Cost Allocation - [Extended Abstract]. - Angelo Fanelli 001; Dariusz Leniowski; Gianpiero Monaco; Piotr Sankowski (WINE, 2012)

Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors. - Harold N. Gabow; Piotr Sankowski (FOCS, 2013)

Catch them if you can: how to serve impatient users. - Marek Cygan; Matthias Englert; Anupam Gupta 001; Marcin Mucha; Piotr Sankowski (ITCS, 2013)

Reachability in graph timelines. - Jakub Lacki; Piotr Sankowski (ITCS, 2013)

Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. - Marcin Pilipczuk; Michal Pilipczuk; Piotr Sankowski; Erik Jan van Leeuwen (STACS, 2013)

Dynamic Steiner Tree in Planar Graphs. - Jakub Lacki; Jakub Ocwieja; Marcin Pilipczuk; Piotr Sankowski; Anna Zych (CoRR, 2013)

Set Covering with Our Eyes Closed. - Fabrizio Grandoni 001; Anupam Gupta 001; Stefano Leonardi 001; Pauli Miettinen; Piotr Sankowski; Mohit Singh (SIAM J. Comput., 2013)

Spreading rumours without the network. - Pawel Brach; Alessandro Epasto; Alessandro Panconesi; Piotr Sankowski (COSN, 2014)

Online Bipartite Matching in Offline Time. - Bartlomiej Bosek; Dariusz Leniowski; Piotr Sankowski; Anna Zych (FOCS, 2014)

Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching. - Marek Adamczyk; Piotr Sankowski; Qiang Zhang (SAGT, 2014)

Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem. - Attila Bernáth; Krzysztof Ciebiera; Piotr Godlewski; Piotr Sankowski (SEA, 2014)

Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets. - Riccardo Colini-Baldeschi; Stefano Leonardi 001; Piotr Sankowski; Qiang Zhang (WINE, 2014)

Approximation Algorithms for Steiner Tree Problems Based on Universal Solution Frameworks. - Krzysztof Ciebiera; Piotr Godlewski; Piotr Sankowski; Piotr Wygocki (CoRR, 2014)

Revenue Maximization Envy-Free Pricing for Homogeneous Resources. - Gianpiero Monaco; Piotr Sankowski; Qiang Zhang (IJCAI, 2015)

Online Bipartite Matching in Offline Time (Abstract). - Piotr Sankowski (SOFSEM, 2015)

The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree. - Jakub Lacki; Jakub Ocwieja; Marcin Pilipczuk; Piotr Sankowski; Anna Zych (STOC, 2015)

Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings. - Marek Cygan; Harold N. Gabow; Piotr Sankowski (J. ACM, 2015)

Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. - Glencora Borradaile; Piotr Sankowski; Christian Wulff-Nilsen (ACM Trans. Algorithms, 2015)

The ring design game with fair cost allocation. - Angelo Fanelli 001; Dariusz Leniowski; Gianpiero Monaco; Piotr Sankowski (Theor. Comput. Sci., 2015)

Stochastic Query Covering for Fast Approximate Document Retrieval. - Aris Anagnostopoulos; Luca Becchetti; Ilaria Bordino; Stefano Leonardi 001; Ida Mele; Piotr Sankowski (ACM Trans. Inf. Syst., 2015)

Locality-Sensitive Hashing Without False Negatives for l_p. - Andrzej Pacuk; Piotr Sankowski; Karol Wegrzycki; Piotr Wygocki (COCOON, 2016)

Network Elicitation in Adversarial Environment. - Marcin Dziubinski; Piotr Sankowski; Qiang Zhang (GameSec, 2016)

There is Something Beyond the Twitter Network. - Andrzej Pacuk; Piotr Sankowski; Karol Wegrzycki; Piotr Wygocki (HT, 2016)

RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. - Andrzej Pacuk; Piotr Sankowski; Karol Wegrzycki; Adam Witkowski; Piotr Wygocki (RecSys Challenge, 2016)

Algorithmic Complexity of Power Law Networks. - Pawel Brach; Marek Cygan; Jakub Lacki; Piotr Sankowski (SODA, 2016)

Online Pricing with Impatient Bidders. - Marek Cygan; Marcin Mucha; Piotr Sankowski; Qiang Zhang (SODA, 2016)

Online Network Design with Outliers. - Aris Anagnostopoulos; Fabrizio Grandoni 001; Stefano Leonardi 001; Piotr Sankowski (Algorithmica, 2016)

Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m10/7 log W) Time. - Michael B. Cohen; Aleksander Madry; Piotr Sankowski; Adrian Vladu (CoRR, 2016)

Contracting a Planar Graph Efficiently. - Jacob Holm; Giuseppe F. Italiano; Adam Karczmarz; Jakub Lacki; Eva Rotenberg; Piotr Sankowski (ESA, 2017)

Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}. - Piotr Sankowski; Piotr Wygocki (ISAAC, 2017)

Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract). - Michael B. Cohen; Aleksander Madry; Piotr Sankowski; Adrian Vladu (SODA, 2017)

Decremental single-source reachability in planar digraphs. - Giuseppe F. Italiano; Adam Karczmarz; Jakub Lacki; Piotr Sankowski (STOC, 2017)

Why Do Cascade Sizes Follow a Power-Law? - Karol Wegrzycki; Piotr Sankowski; Andrzej Pacuk; Piotr Wygocki (WWW, 2017)

Approximate nearest neighbors search without false negatives for l2. - Piotr Sankowski; Piotr Wygocki (CoRR, 2017)

Planar Perfect Matching is in NC. - Piotr Sankowski (CoRR, 2017)

Optimal Decremental Connectivity in Planar Graphs. - Jakub Lacki; Piotr Sankowski (Theory Comput. Syst., 2017)

Online Facility Location with Deletions. - Marek Cygan; Artur Czumaj; Marcin Mucha; Piotr Sankowski (ESA, 2018)

NC Algorithms for Weighted Planar Perfect Matching and Related Problems. - Piotr Sankowski (ICALP, 2018)

Optimal Dynamic Strings. - Pawel Gawrychowski; Adam Karczmarz; Tomasz Kociumaka; Jakub Lacki; Piotr Sankowski (SODA, 2018)

Shortest Augmenting Paths for Online Matchings on Trees. - Bartlomiej Bosek; Dariusz Leniowski; Piotr Sankowski; Anna Zych-Pawlewicz (Theory Comput. Syst., 2018)

Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. - Marcin Pilipczuk; Michal Pilipczuk; Piotr Sankowski; Erik Jan van Leeuwen (ACM Trans. Algorithms, 2018)

Min-Cost Flow in Unit-Capacity Planar Graphs. - Adam Karczmarz; Piotr Sankowski (ESA, 2019)

(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. - Fabrizio Grandoni 001; Stefano Leonardi 001; Piotr Sankowski; Chris Schwiegelshohn; Shay Solomon (SODA, 2019)

Improved Distance Queries and Cycle Counting by Frobenius Normal Form. - Piotr Sankowski; Karol Wegrzycki (Theory Comput. Syst., 2019)

Walking randomly, massively, and efficiently. - Jakub Lacki; Slobodan Mitrovic; Krzysztof Onak; Piotr Sankowski (STOC, 2020)

Round Compression for Parallel Matching Algorithms. - Artur Czumaj; Jakub Lacki; Aleksander Madry; Slobodan Mitrovic; Krzysztof Onak; Piotr Sankowski (SIAM J. Comput., 2020)

Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. - Adam Karczmarz; Jakub Pawlewicz; Piotr Sankowski (SoCG, 2021)

Decomposable Submodular Function Minimization via Maximum Flow. - Kyriakos Axiotis; Adam Karczmarz; Anish Mukherjee 001; Piotr Sankowski; Adrian Vladu (ICML, 2021)

A Deterministic Parallel APSP Algorithm and its Applications. - Adam Karczmarz; Piotr Sankowski (SODA, 2021)

Budget Feasible Mechanisms on Matroids. - Stefano Leonardi 001; Gianpiero Monaco; Piotr Sankowski; Qiang Zhang (Algorithmica, 2021)

Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf. - Adam Karczmarz; Anish Mukherjee 001; Piotr Sankowski; Piotr Wygocki (CoRR, 2021)

Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors. - Harold N. Gabow; Piotr Sankowski (SIAM J. Comput., 2021)

Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths. - Harold N. Gabow; Piotr Sankowski (SIAM J. Comput., 2021)

Improving Ads-Profitability Using Traffic-Fingerprints. - Adam Gabriel Dobrakowski; Andrzej Pacuk; Piotr Sankowski; Marcin Mucha; Pawel Brach (AusDM, 2022)

Subquadratic dynamic path reporting in directed graphs against an adaptive adversary. - Adam Karczmarz; Anish Mukherjee 001; Piotr Sankowski (STOC, 2022)

Improved feature importance computation for tree models based on the Banzhaf value. - Adam Karczmarz; Tomasz P. Michalak; Anish Mukherjee 001; Piotr Sankowski; Piotr Wygocki (UAI, 2022)

A tight bound for shortest augmenting paths on trees. - Bartlomiej Bosek; Dariusz Leniowski; Piotr Sankowski; Anna Zych-Pawlewicz (Theor. Comput. Sci., 2022)

Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. - Adam Karczmarz; Piotr Sankowski (FOCS, 2023)

Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs. - Adam Karczmarz; Piotr Sankowski (ICALP, 2023)

Analyzing the Influence of Language Model-Generated Responses in Mitigating Hate Speech on Social Media Directed at Ukrainian Refugees in Poland. - Jakub Podolak; Szymon Lukasik; Pawel Balawender; Jan Ossowski; Katarzyna Bakowicz; Piotr Sankowski (CoRR, 2023)

Contrastive News and Social Media Linking using BERT for Articles and Tweets across Dual Platforms. - Jan Piotrowski; Marek Wachnicki; Mateusz Perlik; Jakub Podolak; Grzegorz Rucki; Michal Brzozowski; Pawel Olejnik; Julian Kozlowski; Tomasz Nocon; Jakub Koziel; Stanislaw Gizinski; Piotr Sankowski (CoRR, 2023)

Multi-level Aggregation with Delays and Stochastic Arrivals. - Mathieu Mari; Michal Pawlowski; Runtian Ren; Piotr Sankowski (AAMAS, 2024)

LLM generated responses to mitigate the impact of hate speech. - Jakub Podolak; Szymon Lukasik; Pawel Balawender; Jan Ossowski; Jan Piotrowski; Katarzyna Bakowicz; Piotr Sankowski (EMNLP (Findings), 2024)

Dynamic PageRank: Algorithms and Lower Bounds. - Rajesh Jayaram; Jakub Lacki; Slobodan Mitrovic; Krzysztof Onak; Piotr Sankowski (ICALP, 2024)

Scaling Laws for Fine-Grained Mixture of Experts. - Jan Ludziejewski; Jakub Krajewski; Kamil Adamczewski; Maciej Pióro; Michal Krutul; Szymon Antoniak; Kamil Ciebiera; Krystian Król; Tomasz Odrzygózdz; Piotr Sankowski; Marek Cygan; Sebastian Jaszczur (ICML, 2024)

Online Multi-Level Aggregation with Delays and Stochastic Arrivals. - Mathieu Mari; Michal Pawlowski; Runtian Ren; Piotr Sankowski (ISAAC, 2024)

Shortest Disjoint Paths on a Grid. - Mathieu Mari; Anish Mukherjee 001; Michal Pilipczuk; Piotr Sankowski (SODA, 2024)

Modeling Online Paging in Multi-Core Systems. - Mathieu Mari; Anish Mukherjee 001; Runtian Ren; Piotr Sankowski (CoRR, 2024)

In-Context Learning of Physical Properties: Few-Shot Adaptation to Out-of-Distribution Molecular Graphs. - Grzegorz Kaszuba; Amirhossein D. Naghdi; Dario Massa; Stefanos Papanikolaou; Andrzej Jaszkiewicz; Piotr Sankowski (CoRR, 2024)

Fully Dynamic Shortest Paths in Sparse Digraphs. - Adam Karczmarz; Piotr Sankowski (CoRR, 2024)

PUB: Plot Understanding Benchmark and Dataset for Evaluating Large Language Models on Synthetic Visual Data Interpretation. - Aneta Pawelec; Victoria Sara Wesolowska; Zuzanna Baczek; Piotr Sankowski (CoRR, 2024)

Accurate Estimation of Feature Importance Faithfulness for Tree Models. - Mateusz Gajewski; Adam Karczmarz; Mateusz Rapicki; Piotr Sankowski (AAAI, 2025)

Wait, that's not an option: LLMs Robustness with Incorrect Multiple-Choice Options. - Gracjan Góral; Emilia Wisnios; Piotr Sankowski; Pawel Budzianowski (ACL (1), 2025)

Faster Semi-Streaming Matchings via Alternating Trees. - Slobodan Mitrovic; Anish Mukherjee 001; Piotr Sankowski; Wen-Horng Sheu (ICALP, 2025)

Joint MoE Scaling Laws: Mixture of Experts Can Be Memory Efficient. - Jan Ludziejewski; Maciej Pióro; Jakub Krajewski; Maciej Stefaniak; Michal Krutul; Jan Malasnicki; Marek Cygan; Piotr Sankowski; Kamil Adamczewski; Piotr Milos; Sebastian Jaszczur (CoRR, 2025)

Since Faithfulness Fails: The Performance Limits of Neural Causal Discovery. - Mateusz Olko; Mateusz Gajewski; Joanna Wojciechowska; Mikolaj Morzy; Piotr Sankowski; Piotr Milos (CoRR, 2025)

EXALT: EXplainable ALgorithmic Tools for Optimization Problems. - Zuzanna Baczek; Michal Bizon; Aneta Pawelec; Piotr Sankowski (CoRR, 2025)

Online Matching with Delays and Stochastic Arrival Times. - Mathieu Mari; Michal Pawlowski; Runtian Ren; Piotr Sankowski (Theory Comput. Syst., 2025)

VARSHAP: Addressing Global Dependency Problems in Explainable AI with Variance-Based Local Feature Attribution. - Mateusz Gajewski; Mikolaj Morzy; Adam Karczmarz; Piotr Sankowski (CoRR, 2025)

Decoupled Relative Learning Rate Schedules. - Jan Ludziejewski; Jan Malasnicki; Maciej Pióro; Michal Krutul; Kamil Ciebiera; Maciej Stefaniak; Jakub Krajewski; Piotr Sankowski; Marek Cygan; Kamil Adamczewski; Sebastian Jaszczur (CoRR, 2025)