Piotr Sankowski

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 75

Top Venues

CoRR

SODA

STOC

ICALP

Publications

Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
Multi-level Aggregation with Delays and Stochastic Arrivals. AAMAS (2024)
Grzegorz Kaszuba, Amirhossein D. Naghdi, Dario Massa, Stefanos Papanikolaou, Andrzej Jaszkiewicz, Piotr Sankowski
In-Context Learning of Physical Properties: Few-Shot Adaptation to Out-of-Distribution Molecular Graphs. CoRR (2024)
Mathieu Mari, Anish Mukherjee, Runtian Ren, Piotr Sankowski
Modeling Online Paging in Multi-Core Systems. CoRR (2024)
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
Online Multi-level Aggregation with Delays and Stochastic Arrivals. CoRR (2024)
Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Dynamic PageRank: Algorithms and Lower Bounds. CoRR (2024)
Mateusz Gajewski, Adam Karczmarz, Mateusz Rapicki, Piotr Sankowski
Accurate estimation of feature importance faithfulness for tree models. CoRR (2024)
Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski
Shortest Disjoint Paths on a Grid. SODA (2024)
Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Dynamic PageRank: Algorithms and Lower Bounds. ICALP (2024)
Jakub Krajewski, Jan Ludziejewski, Kamil Adamczewski, Maciej Pióro, Michal Krutul, Szymon Antoniak, Kamil Ciebiera, Krystian Król, Tomasz Odrzygózdz, Piotr Sankowski, Marek Cygan, Sebastian Jaszczur
Scaling Laws for Fine-Grained Mixture of Experts. CoRR (2024)
Adam Karczmarz, Piotr Sankowski
Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. CoRR (2023)
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
Online Matching with Delays and Stochastic Arrival Times. AAMAS (2023)
Jan Piotrowski, Marek Wachnicki, Mateusz Perlik, Jakub Podolak, Grzegorz Rucki, Michal Brzozowski, Pawel Olejnik, Julian Kozlowski, Tomasz Nocon, Jakub Koziel, Stanislaw Gizinski, Piotr Sankowski
Contrastive News and Social Media Linking using BERT for Articles and Tweets across Dual Platforms. CoRR (2023)
Adam Karczmarz, Piotr Sankowski
Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. FOCS (2023)
Jakub Podolak, Szymon Lukasik, Pawel Balawender, Jan Ossowski, Katarzyna Bakowicz, Piotr Sankowski
Analyzing the Influence of Language Model-Generated Responses in Mitigating Hate Speech on Social Media Directed at Ukrainian Refugees in Poland. CoRR (2023)
Adam Karczmarz, Piotr Sankowski
Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs. ICALP (2023)
Adam Karczmarz, Anish Mukherjee, Piotr Sankowski
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary. STOC (2022)
Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski, Marcin Mucha, Pawel Brach
Improving Ads-Profitability Using Traffic-Fingerprints. AusDM (2022)
Adam Karczmarz, Tomasz P. Michalak, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki
Improved feature importance computation for tree models based on the Banzhaf value. UAI (2022)
Adam Karczmarz, Anish Mukherjee, Piotr Sankowski
Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary. CoRR (2022)
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
A tight bound for shortest augmenting paths on trees. Theor. Comput. Sci. 901 (2022)
Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski, Marcin Mucha, Pawel Brach
Improving Ads-Profitability Using Traffic-Fingerprints. CoRR (2022)
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
Online matching with delays and stochastic arrival times. CoRR (2022)
Adam Karczmarz, Piotr Sankowski
A Deterministic Parallel APSP Algorithm and its Applications. SODA (2021)
Harold N. Gabow, Piotr Sankowski
-factors and the Special Case of Shortest Paths. SIAM J. Comput. 50 (2) (2021)
Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu
Decomposable Submodular Function Minimization via Maximum Flow. ICML (2021)
Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
Budget Feasible Mechanisms on Matroids. Algorithmica 83 (5) (2021)
Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki
Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf. CoRR (2021)
Adam Karczmarz, Piotr Sankowski
A Deterministic Parallel APSP Algorithm and its Applications. CoRR (2021)
Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu
Decomposable Submodular Function Minimization via Maximum Flow. CoRR (2021)
Harold N. Gabow, Piotr Sankowski
-factors. SIAM J. Comput. 50 (2) (2021)
Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. SoCG (2021)
Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. CoRR (2021)
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Round Compression for Parallel Matching Algorithms. SIAM J. Comput. 49 (5) (2020)
Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Walking randomly, massively, and efficiently. STOC (2020)
Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon
(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. SODA (2019)
Adam Karczmarz, Piotr Sankowski
Min-Cost Flow in Unit-Capacity Planar Graphs. ESA (2019)
Adam Karczmarz, Piotr Sankowski
Min-Cost Flow in Unit-Capacity Planar Graphs. CoRR (2019)
Piotr Sankowski, Karol Wegrzycki
Improved Distance Queries and Cycle Counting by Frobenius Normal Form. Theory Comput. Syst. 63 (5) (2019)
Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Walking Randomly, Massively, and Efficiently. CoRR (2019)
Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski
Online Facility Location with Deletions. ESA (2018)
Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski
Optimal Dynamic Strings. SODA (2018)
Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski
Online Facility Location with Deletions. CoRR (2018)
Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. ACM Trans. Algorithms 14 (4) (2018)
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
A Tight Bound for Shortest Augmenting Paths on Trees. LATIN (2018)
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Round compression for parallel matching algorithms. STOC (2018)
Piotr Sankowski
NC Algorithms for Weighted Planar Perfect Matching and Related Problems. ICALP (2018)
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
Shortest Augmenting Paths for Online Matchings on Trees. Theory Comput. Syst. 62 (2) (2018)
Michael B. Cohen, Aleksander Madry, Piotr Sankowski, Adrian Vladu
) Time (Extended Abstract). SODA (2017)
Piotr Sankowski
Planar Perfect Matching is in NC. CoRR (2017)
Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki
Why Do Cascade Sizes Follow a Power-Law? CoRR (2017)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
Contracting a Planar Graph Efficiently. CoRR (2017)
Jakub Lacki, Piotr Sankowski
Optimal Decremental Connectivity in Planar Graphs. Theory Comput. Syst. 61 (4) (2017)
Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
Budget Feasible Mechanisms on Matroids. IPCO (2017)
Piotr Sankowski, Piotr Wygocki
. CoRR (2017)
Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
Decremental Single-Source Reachability in Planar Digraphs. CoRR (2017)
Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki
Why Do Cascade Sizes Follow a Power-Law? WWW (2017)
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
Round Compression for Parallel Matching Algorithms. CoRR (2017)
Piotr Sankowski, Piotr Wygocki
sqrt{loglog{n}}. ISAAC (2017)
Bartlomiej Bosek, Dariusz Leniowski, Anna Zych, Piotr Sankowski
The Shortest Augmenting Paths for Online Matchings on Trees. CoRR (2017)
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
Contracting a Planar Graph Efficiently. ESA (2017)
Piotr Sankowski, Karol Wegrzycki
Improved Distance Queries and Cycle Counting by Frobenius Normal Form. STACS (2017)
Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
Decremental single-source reachability in planar digraphs. STOC (2017)
Piotr Sankowski, Karol Wegrzycki
Improved Distance Queries and Cycle Counting by Frobenius Normal Form. CoRR (2016)
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski
Online Network Design with Outliers. Algorithmica 76 (1) (2016)
Marek Cygan, Marcin Mucha, Piotr Sankowski, Qiang Zhang
Online Pricing with Impatient Bidders. SODA (2016)
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
There is Something Beyond the Twitter Network. CoRR (2016)
Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski
Algorithmic Complexity of Power Law Networks. SODA (2016)
Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
Budget Feasible Mechanisms on Matroids. CoRR (2016)
Michael B. Cohen, Aleksander Madry, Piotr Sankowski, Adrian Vladu
log W) Time. CoRR (2016)
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. RecSys Challenge (2016)
Marcin Dziubinski, Piotr Sankowski, Qiang Zhang
Network Elicitation in Adversarial Environment. GameSec (2016)
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
Locality-Sensitive Hashing without False Negatives for l_p. CoRR (2016)
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
Locality-Sensitive Hashing Without False Negatives for l_p. COCOON (2016)
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. CoRR (2016)
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
There is Something Beyond the Twitter Network. HT (2016)
Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen
-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. ACM Trans. Algorithms 11 (3) (2015)
Marek Cygan, Harold N. Gabow, Piotr Sankowski
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings. J. ACM 62 (4) (2015)
Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski
Optimal Dynamic Strings. CoRR (2015)
Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski
Algorithmic Complexity of Power Law Networks. CoRR (2015)
Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski
The ring design game with fair cost allocation. Theor. Comput. Sci. 562 (2015)
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych
Shortest Augmenting Paths for Online Matchings on Trees. WAOA (2015)
Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
Revenue Maximization Envy-Free Pricing for Homogeneous Resources. IJCAI (2015)
Aris Anagnostopoulos, Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Ida Mele, Piotr Sankowski
Stochastic Query Covering for Fast Approximate Document Retrieval. ACM Trans. Inf. Syst. 33 (3) (2015)
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)
Piotr Sankowski
Online Bipartite Matching in Offline Time (Abstract). SOFSEM (2015)
Jakub Lacki, Piotr Sankowski
Optimal Decremental Connectivity in Planar Graphs. STACS (2015)
Attila Bernáth, Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski
Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem. SEA (2014)
Riccardo Colini-Baldeschi, Stefano Leonardi, Piotr Sankowski, Qiang Zhang
Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets. WINE (2014)
Marek Adamczyk, Piotr Sankowski, Qiang Zhang
Efficiency of Truthful and Symmetric Mechanisms in One-sided Matching. CoRR (2014)
Pawel Brach, Alessandro Epasto, Alessandro Panconesi, Piotr Sankowski
Spreading rumours without the network. COSN (2014)
Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski, Piotr Wygocki
Approximation Algorithms for Steiner Tree Problems Based on Universal Solution Frameworks. CoRR (2014)
Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. FOCS (2014)
Marek Adamczyk, Piotr Sankowski, Qiang Zhang
Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching. SAGT (2014)
Jakub Lacki, Piotr Sankowski
Optimal decremental connectivity in planar graphs. CoRR (2014)
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych
Online Bipartite Matching in Offline Time. FOCS (2014)
Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski
Catch them if you can: how to serve impatient users. ITCS (2013)
Harold N. Gabow, Piotr Sankowski
Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors. FOCS (2013)
Jakub Lacki, Piotr Sankowski
Reachability in graph timelines. ITCS (2013)
Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych
Dynamic Steiner Tree in Planar Graphs. CoRR (2013)
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh
Set Covering with Our Eyes Closed. SIAM J. Comput. 42 (3) (2013)

Piotr Sankowski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Piotr Sankowski