Piotr Sankowski

167 papers A* 40A 21B 12Misc 3Journal 78Unranked 13
YearRankTypeTitle / Venue / Authors
2026 J jnl
Forecasting Research Trends Using Knowledge Graphs and Large Language Models.
Adv. Intell. Syst.
Maciej Tomczak, Yang Jeong Park, Chia-Wei Hsu, Payden Brown, Dario Massa, Piotr Sankowski, Ju Li, Stefanos Papanikolaou
2025 A* conf
Accurate Estimation of Feature Importance Faithfulness for Tree Models.
AAAI
Mateusz Gajewski, Adam Karczmarz, Mateusz Rapicki, Piotr Sankowski
2025 J jnl
Decoupled Relative Learning Rate Schedules.
CoRR
Jan Ludziejewski, Jan Malasnicki, Maciej Pióro, Michal Krutul, Kamil Ciebiera, Maciej Stefaniak, Jakub Krajewski, Piotr Sankowski, Marek Cygan, Kamil Adamczewski, Sebastian Jaszczur
2025 J jnl
EXALT: EXplainable ALgorithmic Tools for Optimization Problems.
CoRR
Zuzanna Baczek, Michal Bizon, Aneta Pawelec, Piotr Sankowski
2025 J jnl
Efficient autoencoder pipeline for discovering high entropy alloys with molecular dynamics data.
Mach. Learn. Sci. Technol.
Amirhossein D. Naghdi, Grzegorz Kaszuba, Stefanos Papanikolaou, Andrzej Jaszkiewicz, Piotr Sankowski
2025 A* conf
Faster Semi-Streaming Matchings via Alternating Trees.
ICALP
Slobodan Mitrovic, Anish Mukherjee, Piotr Sankowski, Wen-Horng Sheu
2025 A* conf
Joint MoE Scaling Laws: Mixture of Experts Can Be Memory Efficient.
ICML
Jan Ludziejewski, Maciej Pióro, Jakub Krajewski, Maciej Stefaniak, Michal Krutul, Jan Malasnicki, Marek Cygan, Piotr Sankowski, Kamil Adamczewski, Piotr Milos, Sebastian Jaszczur
2025 J jnl
Joint MoE Scaling Laws: Mixture of Experts Can Be Memory Efficient.
CoRR
Jan Ludziejewski, Maciej Pióro, Jakub Krajewski, Maciej Stefaniak, Michal Krutul, Jan Malasnicki, Marek Cygan, Piotr Sankowski, Kamil Adamczewski, Piotr Milos, Sebastian Jaszczur
2025 A conf
Knowledge-Driven Bayesian Uncertainty Quantification for Reliable Fake News Detection.
ECAI
Julia Puczynska, Youcef Djenouri, Michal Bizon, Tomasz P. Michalak, Piotr Sankowski
2025 J jnl
Online Matching with Delays and Stochastic Arrival Times.
Theory Comput. Syst.
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
2025 A* conf
Since Faithfulness Fails: The Performance Limits of Neural Causal Discovery.
ICML
Mateusz Olko, Mateusz Gajewski, Joanna Wojciechowska, Mikolaj Morzy, Piotr Sankowski, Piotr Milos
2025 J jnl
Since Faithfulness Fails: The Performance Limits of Neural Causal Discovery.
CoRR
Mateusz Olko, Mateusz Gajewski, Joanna Wojciechowska, Mikolaj Morzy, Piotr Sankowski, Piotr Milos
2025 J jnl
VARSHAP: Addressing Global Dependency Problems in Explainable AI with Variance-Based Local Feature Attribution.
CoRR
Mateusz Gajewski, Mikolaj Morzy, Adam Karczmarz, Piotr Sankowski
2025 — conf
Wait, that's not an option: LLMs Robustness with Incorrect Multiple-Choice Options.
ACL (1)
Gracjan Góral, Emilia Wisnios, Piotr Sankowski, Pawel Budzianowski
2024 J jnl
Accurate estimation of feature importance faithfulness for tree models.
CoRR
Mateusz Gajewski, Adam Karczmarz, Mateusz Rapicki, Piotr Sankowski
2024 A* conf
Dynamic PageRank: Algorithms and Lower Bounds.
ICALP
Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2024 J jnl
Dynamic PageRank: Algorithms and Lower Bounds.
CoRR
Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2024 J jnl
Faster Semi-streaming Matchings via Alternating Trees.
CoRR
Slobodan Mitrovic, Anish Mukherjee, Piotr Sankowski, Wen-Horng Sheu
2024 J jnl
Fully Dynamic Shortest Paths in Sparse Digraphs.
CoRR
Adam Karczmarz, Piotr Sankowski
2024 J jnl
In-Context Learning of Physical Properties: Few-Shot Adaptation to Out-of-Distribution Molecular Graphs.
CoRR
Grzegorz Kaszuba, Amirhossein D. Naghdi, Dario Massa, Stefanos Papanikolaou, Andrzej Jaszkiewicz, Piotr Sankowski
2024 — conf
LLM generated responses to mitigate the impact of hate speech.
EMNLP (Findings)
Jakub Podolak, Szymon Lukasik, Pawel Balawender, Jan Ossowski, Jan Piotrowski, Katarzyna Bakowicz, Piotr Sankowski
2024 J jnl
Modeling Online Paging in Multi-Core Systems.
CoRR
Mathieu Mari, Anish Mukherjee, Runtian Ren, Piotr Sankowski
2024 A conf
Multi-level Aggregation with Delays and Stochastic Arrivals.
AAMAS
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
2024 B conf
Online Multi-Level Aggregation with Delays and Stochastic Arrivals.
ISAAC
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
2024 J jnl
Online Multi-level Aggregation with Delays and Stochastic Arrivals.
CoRR
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
2024 J jnl
PUB: Plot Understanding Benchmark and Dataset for Evaluating Large Language Models on Synthetic Visual Data Interpretation.
CoRR
Aneta Pawelec, Victoria Sara Wesolowska, Zuzanna Baczek, Piotr Sankowski
2024 A* conf
Scaling Laws for Fine-Grained Mixture of Experts.
ICML
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
2024 J jnl
Scaling Laws for Fine-Grained Mixture of Experts.
CoRR
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
2024 A* conf
Shortest Disjoint Paths on a Grid.
SODA
Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski
2023 J jnl
Analyzing the Influence of Language Model-Generated Responses in Mitigating Hate Speech on Social Media Directed at Ukrainian Refugees in Poland.
CoRR
Jakub Podolak, Szymon Lukasik, Pawel Balawender, Jan Ossowski, Katarzyna Bakowicz, Piotr Sankowski
2023 J jnl
Contrastive News and Social Media Linking using BERT for Articles and Tweets across Dual Platforms.
CoRR
Jan Piotrowski, Marek Wachnicki, Mateusz Perlik, Jakub Podolak, Grzegorz Rucki, Michal Brzozowski, Pawel Olejnik, Julian Kozlowski, Tomasz Nocon, Jakub Koziel, Stanislaw Gizinski, Piotr Sankowski
2023 A* conf
Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs.
ICALP
Adam Karczmarz, Piotr Sankowski
2023 A conf
Online Matching with Delays and Stochastic Arrival Times.
AAMAS
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
2023 A* conf
Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form.
FOCS
Adam Karczmarz, Piotr Sankowski
2023 J jnl
Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form.
CoRR
Adam Karczmarz, Piotr Sankowski
2022 J jnl
A tight bound for shortest augmenting paths on trees.
Theor. Comput. Sci.
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
2022 A conf
Improved feature importance computation for tree models based on the Banzhaf value.
UAI
Adam Karczmarz, Tomasz P. Michalak, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki
2022 Misc conf
Improving Ads-Profitability Using Traffic-Fingerprints.
AusDM
Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski, Marcin Mucha, Pawel Brach
2022 J jnl
Improving Ads-Profitability Using Traffic-Fingerprints.
CoRR
Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski, Marcin Mucha, Pawel Brach
2022 J jnl
Online matching with delays and stochastic arrival times.
CoRR
Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski
2022 J jnl
Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary.
CoRR
Adam Karczmarz, Anish Mukherjee, Piotr Sankowski
2022 A* conf
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary.
STOC
Adam Karczmarz, Anish Mukherjee, Piotr Sankowski
2021 A* conf
A Deterministic Parallel APSP Algorithm and its Applications.
SODA
Adam Karczmarz, Piotr Sankowski
2021 J jnl
A Deterministic Parallel APSP Algorithm and its Applications.
CoRR
Adam Karczmarz, Piotr Sankowski
2021 J jnl
Algorithms for Weighted Matching Generalizations I: Bipartite Graphs,
SIAM J. Comput.
Harold N. Gabow, Piotr Sankowski
2021 J jnl
Algorithms for Weighted Matching Generalizations II:
SIAM J. Comput.
Harold N. Gabow, Piotr Sankowski
2021 J jnl
Budget Feasible Mechanisms on Matroids.
Algorithmica
Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
2021 A* conf
Decomposable Submodular Function Minimization via Maximum Flow.
ICML
Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu
2021 J jnl
Decomposable Submodular Function Minimization via Maximum Flow.
CoRR
Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu
2021 J jnl
Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf.
CoRR
Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki
2021 A* conf
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs.
SoCG
Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski
2021 J jnl
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs.
CoRR
Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski
2020 J jnl
Round Compression for Parallel Matching Algorithms.
SIAM J. Comput.
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2020 A* conf
Walking randomly, massively, and efficiently.
STOC
Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2019 A* conf
(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time.
SODA
Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon
2019 J jnl
Improved Distance Queries and Cycle Counting by Frobenius Normal Form.
Theory Comput. Syst.
Piotr Sankowski, Karol Wegrzycki
2019 A conf
Min-Cost Flow in Unit-Capacity Planar Graphs.
ESA
Adam Karczmarz, Piotr Sankowski
2019 J jnl
Min-Cost Flow in Unit-Capacity Planar Graphs.
CoRR
Adam Karczmarz, Piotr Sankowski
2019 J jnl
Walking Randomly, Massively, and Efficiently.
CoRR
Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2018 B conf
A Tight Bound for Shortest Augmenting Paths on Trees.
LATIN
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
2018 A* conf
NC Algorithms for Weighted Planar Perfect Matching and Related Problems.
ICALP
Piotr Sankowski
2018 J jnl
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs.
ACM Trans. Algorithms
Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2018 A conf
Online Facility Location with Deletions.
ESA
Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski
2018 J jnl
Online Facility Location with Deletions.
CoRR
Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski
2018 A* conf
Optimal Dynamic Strings.
SODA
Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski
2018 A* conf
Round compression for parallel matching algorithms.
STOC
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2018 J jnl
Shortest Augmenting Paths for Online Matchings on Trees.
Theory Comput. Syst.
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz
2017 B conf
Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}.
ISAAC
Piotr Sankowski, Piotr Wygocki
2017 J jnl
Approximate nearest neighbors search without false negatives for l
CoRR
Piotr Sankowski, Piotr Wygocki
2017 B conf
Budget Feasible Mechanisms on Matroids.
IPCO
Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
2017 A conf
Contracting a Planar Graph Efficiently.
ESA
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
2017 J jnl
Contracting a Planar Graph Efficiently.
CoRR
Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski
2017 J jnl
Decremental Single-Source Reachability in Planar Digraphs.
CoRR
Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
2017 A* conf
Decremental single-source reachability in planar digraphs.
STOC
Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski
2017 A conf
Improved Distance Queries and Cycle Counting by Frobenius Normal Form.
STACS
Piotr Sankowski, Karol Wegrzycki
2017 A* conf
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (
SODA
Michael B. Cohen, Aleksander Madry, Piotr Sankowski, Adrian Vladu
2017 J jnl
Optimal Decremental Connectivity in Planar Graphs.
Theory Comput. Syst.
Jakub Lacki, Piotr Sankowski
2017 J jnl
Planar Perfect Matching is in NC.
CoRR
Piotr Sankowski
2017 J jnl
Round Compression for Parallel Matching Algorithms.
CoRR
Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski
2017 J jnl
The Shortest Augmenting Paths for Online Matchings on Trees.
CoRR
Bartlomiej Bosek, Dariusz Leniowski, Anna Zych, Piotr Sankowski
2017 A* conf
Why Do Cascade Sizes Follow a Power-Law?
WWW
Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki
2017 J jnl
Why Do Cascade Sizes Follow a Power-Law?
CoRR
Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki
2016 A ed.
24th Annual European Symposium on Algorithms, ESA 2016, Aarhus, Denmark, August 22-24, 2016
ESA
Piotr Sankowski, Christos D. Zaroliagis
2016 A* conf
Algorithmic Complexity of Power Law Networks.
SODA
Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski
2016 J jnl
Budget Feasible Mechanisms on Matroids.
CoRR
Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
2016 Misc conf
Locality-Sensitive Hashing Without False Negatives for l_p.
COCOON
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
2016 J jnl
Locality-Sensitive Hashing without False Negatives for l_p.
CoRR
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
2016 J jnl
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m
CoRR
Michael B. Cohen, Aleksander Madry, Piotr Sankowski, Adrian Vladu
2016 — conf
Network Elicitation in Adversarial Environment.
GameSec
Marcin Dziubinski, Piotr Sankowski, Qiang Zhang
2016 J jnl
Online Network Design with Outliers.
Algorithmica
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski
2016 A* conf
Online Pricing with Impatient Bidders.
SODA
Marek Cygan, Marcin Mucha, Piotr Sankowski, Qiang Zhang
2016 — conf
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting.
RecSys Challenge
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki
2016 J jnl
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting.
CoRR
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki
2016 — conf
There is Something Beyond the Twitter Network.
HT
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
2016 J jnl
There is Something Beyond the Twitter Network.
CoRR
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
2015 J jnl
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings.
J. ACM
Marek Cygan, Harold N. Gabow, Piotr Sankowski
2015 J jnl
Algorithmic Complexity of Power Law Networks.
CoRR
Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski
2015 J jnl
Min
ACM Trans. Algorithms
Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen
2015 B conf
Online Bipartite Matching in Offline Time (Abstract).
SOFSEM
Piotr Sankowski
2015 A conf
Optimal Decremental Connectivity in Planar Graphs.
STACS
Jakub Lacki, Piotr Sankowski
2015 J jnl
Optimal Dynamic Strings.
CoRR
Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski
2015 A* conf
Revenue Maximization Envy-Free Pricing for Homogeneous Resources.
IJCAI
Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
2015 B conf
Shortest Augmenting Paths for Online Matchings on Trees.
WAOA
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych
2015 J jnl
Stochastic Query Covering for Fast Approximate Document Retrieval.
ACM Trans. Inf. Syst.
Aris Anagnostopoulos, Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Ida Mele, Piotr Sankowski
2015 A* conf
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree.
STOC
Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych
2015 J jnl
The ring design game with fair cost allocation.
Theor. Comput. Sci.
Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski
2014 J jnl
Approximation Algorithms for Steiner Tree Problems Based on Universal Solution Frameworks.
CoRR
Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski, Piotr Wygocki
2014 B conf
Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching.
SAGT
Marek Adamczyk, Piotr Sankowski, Qiang Zhang
2014 J jnl
Efficiency of Truthful and Symmetric Mechanisms in One-sided Matching.
CoRR
Marek Adamczyk, Piotr Sankowski, Qiang Zhang
2014 B conf
Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem.
SEA
Attila Bernáth, Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski
2014 A* conf
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs.
FOCS
Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2014 A* conf
Online Bipartite Matching in Offline Time.
FOCS
Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych
2014 J jnl
Optimal decremental connectivity in planar graphs.
CoRR
Jakub Lacki, Piotr Sankowski
2014 — conf
Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets.
WINE
Riccardo Colini-Baldeschi, Stefano Leonardi, Piotr Sankowski, Qiang Zhang
2014 — conf
Spreading rumours without the network.
COSN
Pawel Brach, Alessandro Epasto, Alessandro Panconesi, Piotr Sankowski
2013 A* conf
Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors.
FOCS
Harold N. Gabow, Piotr Sankowski
2013 J jnl
Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors
CoRR
Harold N. Gabow, Piotr Sankowski
2013 A conf
Catch them if you can: how to serve impatient users.
ITCS
Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski
2013 J jnl
Dynamic Steiner Tree in Planar Graphs.
CoRR
Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych
2013 J jnl
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs.
CoRR
Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2013 A conf
Reachability in graph timelines.
ITCS
Jakub Lacki, Piotr Sankowski
2013 J jnl
Set Covering with Our Eyes Closed.
SIAM J. Comput.
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh
2013 A conf
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs.
STACS
Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen
2012 A conf
A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees.
ESA
Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk, Piotr Sankowski
2012 J jnl
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings
CoRR
Marek Cygan, Harold N. Gabow, Piotr Sankowski
2012 A* conf
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings.
FOCS
Marek Cygan, Harold N. Gabow, Piotr Sankowski
2012 A* conf
Revenue maximizing envy-free multi-unit auctions with budgets.
EC
Michal Feldman, Amos Fiat, Stefano Leonardi, Piotr Sankowski
2012 J jnl
Single Source - All Sinks Max Flows in Planar Digraphs
CoRR
Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
2012 A* conf
Single Source - All Sinks Max Flows in Planar Digraphs.
FOCS
Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
2012 — conf
The Ring Design Game with Fair Cost Allocation - [Extended Abstract].
WINE
Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco, Piotr Sankowski
2011 J jnl
Approximation Algorithms for Union and Intersection Covering Problems
CoRR
Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
2011 — conf
Approximation Algorithms for Union and Intersection Covering Problems.
FSTTCS
Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
2011 J jnl
Dynamic normal forms and dynamic characteristic polynomial.
Theor. Comput. Sci.
Gudmund Skovbjerg Frandsen, Piotr Sankowski
2011 A* conf
Improved algorithms for min cut and max flow in undirected planar graphs.
STOC
Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen
2011 B ed.
Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings
MFCS
Filip Murlak, Piotr Sankowski
2011 A conf
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time.
ESA
Jakub Lacki, Piotr Sankowski
2011 J jnl
Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time
CoRR
Jakub Lacki, Piotr Sankowski
2011 A* conf
Single valued combinatorial auctions with budgets.
EC
Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski
2011 A conf
Stochastic query covering.
WSDM
Aris Anagnostopoulos, Luca Becchetti, Stefano Leonardi, Ida Mele, Piotr Sankowski
2010 J jnl
Combinatorial Auctions with Budgets
CoRR
Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski
2010 — conf
Fast Approximation in Subspaces by Doubling Metric Decomposition.
ESA (1)
Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
2010 J jnl
Fast Dynamic Transitive Closure with Lookahead.
Algorithmica
Piotr Sankowski, Marcin Mucha
2010 J jnl
Improved Minimum Cuts and Maximum Flows in Undirected Planar Graphs
CoRR
Giuseppe F. Italiano, Piotr Sankowski
2010 J jnl
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
CoRR
Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen
2010 A* conf
Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.
FOCS
Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen
2010 — conf
Online Network Design with Outliers.
ICALP (1)
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski
2009 J jnl
Fast Approximation in Subspaces by Doubling Metric Decomposition
CoRR
Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
2009 J jnl
Maximum weight bipartite matching in matrix multiplication time.
Theor. Comput. Sci.
Piotr Sankowski
2008 B conf
Algebraic Graph Algorithms.
MFCS
Piotr Sankowski
2008 — conf
Dynamic Normal Forms and Dynamic Characteristic Polynomial.
ICALP (1)
Gudmund Skovbjerg Frandsen, Piotr Sankowski
2008 J jnl
Processor Efficient Parallel Matching.
Theory Comput. Syst.
Piotr Sankowski
2008 A* conf
Set Covering with our Eyes Closed.
FOCS
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh
2008 A* conf
Stochastic analyses for online combinatorial optimization problems.
SODA
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski
2007 A conf
Dynamic Plane Transitive Closure.
ESA
Krzysztof Diks, Piotr Sankowski
2007 A* conf
Faster dynamic matchings and vertex connectivity.
SODA
Piotr Sankowski
2007 A* conf
Network formation games with local coalitions.
PODC
Stefano Leonardi, Piotr Sankowski
2006 J jnl
Maximum Matchings in Planar Graphs via Gaussian Elimination.
Algorithmica
Marcin Mucha, Piotr Sankowski
2006 — conf
Weighted Bipartite Matching in Matrix Multiplication Time.
ICALP (1)
Piotr Sankowski
2005 B conf
Processor efficient parallel matching.
SPAA
Piotr Sankowski
2005 A conf
Shortest Paths in Matrix Multiplication Time.
ESA
Piotr Sankowski
2005 Misc conf
Subquadratic Algorithm for Dynamic Shortest Distances.
COCOON
Piotr Sankowski
2004 A* conf
Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract).
FOCS
Piotr Sankowski
2004 B conf
Improving Web Sites by Automatic Source Code Analysis and Modifications.
ICWE
Krzysztof Ciebiera, Piotr Sankowski
2004 A conf
Maximum Matchings in Planar Graphs via Gaussian Elimination.
ESA
Marcin Mucha, Piotr Sankowski
2004 A* conf
Maximum Matchings via Gaussian Elimination.
FOCS
Marcin Mucha, Piotr Sankowski
2003 A conf
Alternative Algorithms for Counting All Matchings in Graphs.
STACS
Piotr Sankowski
2003 A conf
Multisampling: A New Approach to Uniform Sampling and Approximate Counting.
ESA
Piotr Sankowski