default search action
Piotr Sankowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c80]Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski:
Multi-level Aggregation with Delays and Stochastic Arrivals. AAMAS 2024: 2378-2380 - [c79]Jakub Podolak, Szymon Lukasik, Pawel Balawender, Jan Ossowski, Jan Piotrowski, Katarzyna Bakowicz, Piotr Sankowski:
LLM generated responses to mitigate the impact of hate speech. EMNLP (Findings) 2024: 15860-15876 - [c78]Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Dynamic PageRank: Algorithms and Lower Bounds. ICALP 2024: 90:1-90:19 - [c77]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:
Scaling Laws for Fine-Grained Mixture of Experts. ICML 2024 - [c76]Mathieu Mari, Anish Mukherjee
, Michal Pilipczuk, Piotr Sankowski:
Shortest Disjoint Paths on a Grid. SODA 2024: 346-365 - [i49]Mathieu Mari, Anish Mukherjee, Runtian Ren, Piotr Sankowski:
Modeling Online Paging in Multi-Core Systems. CoRR abs/2401.05834 (2024) - [i48]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 abs/2402.07871 (2024) - [i47]Mateusz Gajewski, Adam Karczmarz, Mateusz Rapicki, Piotr Sankowski:
Accurate estimation of feature importance faithfulness for tree models. CoRR abs/2404.03426 (2024) - [i46]Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski:
Online Multi-level Aggregation with Delays and Stochastic Arrivals. CoRR abs/2404.09711 (2024) - [i45]Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Dynamic PageRank: Algorithms and Lower Bounds. CoRR abs/2404.16267 (2024) - [i44]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 abs/2406.01808 (2024) - [i43]Adam Karczmarz, Piotr Sankowski:
Fully Dynamic Shortest Paths in Sparse Digraphs. CoRR abs/2408.14406 (2024) - [i42]Aneta Pawelec, Victoria Sara Wesolowska, Zuzanna Baczek, Piotr Sankowski:
PUB: Plot Understanding Benchmark and Dataset for Evaluating Large Language Models on Synthetic Visual Data Interpretation. CoRR abs/2409.02617 (2024) - 2023
- [c75]Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski:
Online Matching with Delays and Stochastic Arrival Times. AAMAS 2023: 976-984 - [c74]Adam Karczmarz, Piotr Sankowski:
Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. FOCS 2023: 1745-1756 - [c73]Adam Karczmarz, Piotr Sankowski:
Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs. ICALP 2023: 84:1-84:20 - [i41]Adam Karczmarz, Piotr Sankowski:
Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. CoRR abs/2308.08870 (2023) - [i40]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 abs/2311.16905 (2023) - [i39]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 abs/2312.07599 (2023) - 2022
- [j20]Bartlomiej Bosek
A tight bound for shortest augmenting paths on trees. Theor. Comput. Sci. 901: 45-61 (2022) - [c72]Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski, Marcin Mucha, Pawel Brach:
Improving Ads-Profitability Using Traffic-Fingerprints. AusDM 2022: 205-216 - [c71]Adam Karczmarz, Anish Mukherjee
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary. STOC 2022: 1643-1656 - [c70]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: 969-979 - [i38]Adam Karczmarz, Anish Mukherjee, Piotr Sankowski:
Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary. CoRR abs/2203.16992 (2022) - [i37]Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski, Marcin Mucha, Pawel Brach:
Improving Ads-Profitability Using Traffic-Fingerprints. CoRR abs/2206.02630 (2022) - [i36]Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski:
Online matching with delays and stochastic arrival times. CoRR abs/2210.07018 (2022) - 2021
- [j19]Stefano Leonardi
Budget Feasible Mechanisms on Matroids. Algorithmica 83(5): 1222-1237 (2021) - [j18]Harold N. Gabow, Piotr Sankowski:
Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors. SIAM J. Comput. 50(2): 440-486 (2021) - [j17]Harold N. Gabow, Piotr Sankowski:
Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths. SIAM J. Comput. 50(2): 555-601 (2021) - [c69]Adam Karczmarz
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. SoCG 2021: 46:1-46:15 - [c68]Kyriakos Axiotis, Adam Karczmarz
Decomposable Submodular Function Minimization via Maximum Flow. ICML 2021: 446-456 - [c67]Adam Karczmarz
A Deterministic Parallel APSP Algorithm and its Applications. SODA 2021: 255-272 - [i35]Adam Karczmarz, Piotr Sankowski:
A Deterministic Parallel APSP Algorithm and its Applications. CoRR abs/2101.02311 (2021) - [i34]Kyriakos Axiotis, Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Adrian Vladu:
Decomposable Submodular Function Minimization via Maximum Flow. CoRR abs/2103.03868 (2021) - [i33]Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski:
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. CoRR abs/2103.09684 (2021) - [i32]Adam Karczmarz, Anish Mukherjee, Piotr Sankowski, Piotr Wygocki:
Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf. CoRR abs/2108.04126 (2021) - 2020
- [j16]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak
Round Compression for Parallel Matching Algorithms. SIAM J. Comput. 49(5) (2020) - [c66]Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak
Walking randomly, massively, and efficiently. STOC 2020: 364-377
2010 – 2019
- 2019
- [j15]Piotr Sankowski, Karol Wegrzycki
Improved Distance Queries and Cycle Counting by Frobenius Normal Form. Theory Comput. Syst. 63(5): 1049-1067 (2019) - [c65]Adam Karczmarz
Min-Cost Flow in Unit-Capacity Planar Graphs. ESA 2019: 66:1-66:17 - [c64]Fabrizio Grandoni
(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. SODA 2019: 1886-1898 - [i31]Adam Karczmarz, Piotr Sankowski:
Min-Cost Flow in Unit-Capacity Planar Graphs. CoRR abs/1907.02274 (2019) - [i30]Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Walking Randomly, Massively, and Efficiently. CoRR abs/1907.05391 (2019) - 2018
- [j14]Bartlomiej Bosek
Shortest Augmenting Paths for Online Matchings on Trees. Theory Comput. Syst. 62(2): 337-348 (2018) - [j13]Marcin Pilipczuk
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. ACM Trans. Algorithms 14(4): 53:1-53:73 (2018) - [c63]Marek Cygan
Online Facility Location with Deletions. ESA 2018: 21:1-21:15 - [c62]Piotr Sankowski:
NC Algorithms for Weighted Planar Perfect Matching and Related Problems. ICALP 2018: 97:1-97:16 - [c61]Bartlomiej Bosek
A Tight Bound for Shortest Augmenting Paths on Trees. LATIN 2018: 201-216 - [c60]Pawel Gawrychowski
Optimal Dynamic Strings. SODA 2018: 1509-1528 - [c59]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round compression for parallel matching algorithms. STOC 2018: 471-484 - [i29]Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski:
Online Facility Location with Deletions. CoRR abs/1807.03839 (2018) - 2017
- [j12]Jakub Lacki, Piotr Sankowski:
Optimal Decremental Connectivity in Planar Graphs. Theory Comput. Syst. 61(4): 1037-1053 (2017) - [c58]Jacob Holm
Contracting a Planar Graph Efficiently. ESA 2017: 50:1-50:15 - [c57]Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang:
Budget Feasible Mechanisms on Matroids. IPCO 2017: 368-379 - [c56]Piotr Sankowski, Piotr Wygocki:
Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}. ISAAC 2017: 63:1-63:12 - [c55]Michael B. Cohen, Aleksander Madry, Piotr Sankowski, Adrian Vladu:
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract). SODA 2017: 752-771 - [c54]Piotr Sankowski, Karol Wegrzycki
Improved Distance Queries and Cycle Counting by Frobenius Normal Form. STACS 2017: 56:1-56:14 - [c53]Giuseppe F. Italiano, Adam Karczmarz
Decremental single-source reachability in planar digraphs. STOC 2017: 1108-1121 - [c52]Karol Wegrzycki
Why Do Cascade Sizes Follow a Power-Law? WWW 2017: 569-576 - [i28]Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki:
Why Do Cascade Sizes Follow a Power-Law? CoRR abs/1702.05913 (2017) - [i27]Bartlomiej Bosek, Dariusz Leniowski, Anna Zych, Piotr Sankowski:
The Shortest Augmenting Paths for Online Matchings on Trees. CoRR abs/1704.02093 (2017) - [i26]Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski:
Decremental Single-Source Reachability in Planar Digraphs. CoRR abs/1705.11163 (2017) - [i25]Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Eva Rotenberg, Piotr Sankowski:
Contracting a Planar Graph Efficiently. CoRR abs/1706.10228 (2017) - [i24]Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski:
Round Compression for Parallel Matching Algorithms. CoRR abs/1707.03478 (2017) - [i23]Piotr Sankowski, Piotr Wygocki:
Approximate nearest neighbors search without false negatives for l2. CoRR abs/1708.06395 (2017) - [i22]Piotr Sankowski:
Planar Perfect Matching is in NC. CoRR abs/1709.07869 (2017) - 2016
- [j11]Aris Anagnostopoulos
Online Network Design with Outliers. Algorithmica 76(1): 88-109 (2016) - [c51]Andrzej Pacuk
Locality-Sensitive Hashing Without False Negatives for l_p. COCOON 2016: 105-118 - [c50]Marcin Dziubinski
Network Elicitation in Adversarial Environment. GameSec 2016: 397-414 - [c49]Andrzej Pacuk
There is Something Beyond the Twitter Network. HT 2016: 279-284 - [c48]Andrzej Pacuk
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. RecSys Challenge 2016: 10:1-10:4 - [c47]Marek Cygan, Marcin Mucha, Piotr Sankowski, Qiang Zhang:
Online Pricing with Impatient Bidders. SODA 2016: 190-201 - [c46]Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski:
Algorithmic Complexity of Power Law Networks. SODA 2016: 1306-1325 - [e2]Piotr Sankowski, Christos D. Zaroliagis:
24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark. LIPIcs 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-015-6 [contents] - [i21]Michael B. Cohen, Aleksander Madry, Piotr Sankowski, Adrian Vladu:
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m10/7 log W) Time. CoRR abs/1605.01717 (2016) - [i20]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki:
Locality-Sensitive Hashing without False Negatives for l_p. CoRR abs/1611.09317 (2016) - [i19]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki:
There is Something Beyond the Twitter Network. CoRR abs/1611.09387 (2016) - [i18]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki:
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. CoRR abs/1612.00959 (2016) - [i17]Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang:
Budget Feasible Mechanisms on Matroids. CoRR abs/1612.03150 (2016) - 2015
- [j10]Marek Cygan
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings. J. ACM 62(4): 28:1-28:30 (2015) - [j9]Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen:
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. ACM Trans. Algorithms 11(3): 16:1-16:29 (2015) - [j8]Angelo Fanelli
The ring design game with fair cost allocation. Theor. Comput. Sci. 562: 90-100 (2015) - [j7]Aris Anagnostopoulos
Stochastic Query Covering for Fast Approximate Document Retrieval. ACM Trans. Inf. Syst. 33(3): 11:1-11:35 (2015) - [c45]Gianpiero Monaco, Piotr Sankowski, Qiang Zhang:
Revenue Maximization Envy-Free Pricing for Homogeneous Resources. IJCAI 2015: 90-96 - [c44]Piotr Sankowski:
Online Bipartite Matching in Offline Time (Abstract). SOFSEM 2015: 45 - [c43]Jakub Lacki, Piotr Sankowski:
Optimal Decremental Connectivity in Planar Graphs. STACS 2015: 608-621 - [c42]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: 11-20 - [c41]Bartlomiej Bosek
Shortest Augmenting Paths for Online Matchings on Trees. WAOA 2015: 59-71 - [i16]Pawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski:
Algorithmic Complexity of Power Law Networks. CoRR abs/1507.02426 (2015) - [i15]Pawel Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Lacki, Piotr Sankowski:
Optimal Dynamic Strings. CoRR abs/1511.02612 (2015) - 2014
- [c40]Pawel Brach, Alessandro Epasto, Alessandro Panconesi, Piotr Sankowski:
Spreading rumours without the network. COSN 2014: 107-118 - [c39]Marcin Pilipczuk
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. FOCS 2014: 276-285 - [c38]Bartlomiej Bosek
Online Bipartite Matching in Offline Time. FOCS 2014: 384-393 - [c37]Marek Adamczyk, Piotr Sankowski, Qiang Zhang:
Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching. SAGT 2014: 13-24 - [c36]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: 74-86 - [c35]Riccardo Colini-Baldeschi, Stefano Leonardi, Piotr Sankowski, Qiang Zhang:
Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets. WINE 2014: 233-246 - [i14]Marek Adamczyk, Piotr Sankowski, Qiang Zhang:
Efficiency of Truthful and Symmetric Mechanisms in One-sided Matching. CoRR abs/1407.3957 (2014) - [i13]Jakub Lacki, Piotr Sankowski:
Optimal decremental connectivity in planar graphs. CoRR abs/1409.7240 (2014) - [i12]Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski, Piotr Wygocki:
Approximation Algorithms for Steiner Tree Problems Based on Universal Solution Frameworks. CoRR abs/1410.7534 (2014) - 2013
- [j6]Fabrizio Grandoni
Set Covering with Our Eyes Closed. SIAM J. Comput. 42(3): 808-830 (2013) - [c34]Harold N. Gabow, Piotr Sankowski:
Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors. FOCS 2013: 137-146 - [c33]Jakub Lacki, Piotr Sankowski:
Reachability in graph timelines. ITCS 2013: 257-268 - [c32]Marek Cygan
Catch them if you can: how to serve impatient users. ITCS 2013: 485-494 - [c31]Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen:
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. STACS 2013: 353-364 - [i11]Harold N. Gabow, Piotr Sankowski:
Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors. CoRR abs/1304.6740 (2013) - [i10]Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen:
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. CoRR abs/1306.6593 (2013) - [i9]Jakub Lacki, Jakub Ocwieja, Marcin Pilipczuk, Piotr Sankowski, Anna Zych:
Dynamic Steiner Tree in Planar Graphs. CoRR abs/1308.3336 (2013) - 2012
- [c30]Marek Cygan
A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees. ESA 2012: 349-360 - [c29]Marek Cygan
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. FOCS 2012: 531-540 - [c28]Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen:
Single Source - All Sinks Max Flows in Planar Digraphs. FOCS 2012: 599-608 - [c27]Michal Feldman, Amos Fiat, Stefano Leonardi, Piotr Sankowski:
Revenue maximizing envy-free multi-unit auctions with budgets. EC 2012: 532-549 - [c26]Angelo Fanelli
The Ring Design Game with Fair Cost Allocation - [Extended Abstract]. WINE 2012: 546-552 - [i8]Marek Cygan, Harold N. Gabow, Piotr Sankowski:
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings. CoRR abs/1204.1616 (2012) - [i7]Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen:
Single Source - All Sinks Max Flows in Planar Digraphs. CoRR abs/1210.4811 (2012) - 2011
- [j5]Gudmund Skovbjerg Frandsen, Piotr Sankowski:
Dynamic normal forms and dynamic characteristic polynomial. Theor. Comput. Sci. 412(16): 1470-1483 (2011) - [c25]Jakub Lacki, Piotr Sankowski:
Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time. ESA 2011: 155-166 - [c24]Marek Cygan
Approximation Algorithms for Union and Intersection Covering Problems. FSTTCS 2011: 28-40 - [c23]Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski:
Single valued combinatorial auctions with budgets. EC 2011: 223-232 - [c22]Giuseppe F. Italiano
Improved algorithms for min cut and max flow in undirected planar graphs. STOC 2011: 313-322 - [c21]Aris Anagnostopoulos
Stochastic query covering. WSDM 2011: 725-734 - [e1]Filip Murlak, Piotr Sankowski:
Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings. Lecture Notes in Computer Science 6907, Springer 2011, ISBN 978-3-642-22992-3 [contents] - [i6]Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski:
Approximation Algorithms for Union and Intersection Covering Problems. CoRR abs/1102.5105 (2011) - [i5]Jakub Lacki, Piotr Sankowski:
Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time. CoRR abs/1104.4890 (2011) - 2010
- [j4]Piotr Sankowski, Marcin Mucha
Fast Dynamic Transitive Closure with Lookahead. Algorithmica 56(2): 180-197 (2010) - [c20]Marek Cygan
Fast Approximation in Subspaces by Doubling Metric Decomposition. ESA (1) 2010: 72-83 - [c19]Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen:
Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. FOCS 2010: 601-610 - [c18]Aris Anagnostopoulos
Online Network Design with Outliers. ICALP (1) 2010: 114-126 - [i4]Amos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski:
Combinatorial Auctions with Budgets. CoRR abs/1001.1686 (2010) - [i3]Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen:
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. CoRR abs/1003.1320 (2010) - [i2]Giuseppe F. Italiano, Piotr Sankowski:
Improved Minimum Cuts and Maximum Flows in Undirected Planar Graphs. CoRR abs/1011.2843 (2010)
2000 – 2009
- 2009
- [j3]Piotr Sankowski:
Maximum weight bipartite matching in matrix multiplication time. Theor. Comput. Sci. 410(44): 4480-4488 (2009) - [i1]Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski:
Fast Approximation in Subspaces by Doubling Metric Decomposition. CoRR abs/0911.1626 (2009) - 2008
- [j2]Piotr Sankowski:
Processor Efficient Parallel Matching. Theory Comput. Syst. 42(1): 73-90 (2008) - [c17]Fabrizio Grandoni
Set Covering with our Eyes Closed. FOCS 2008: 347-356 - [c16]Gudmund Skovbjerg Frandsen, Piotr Sankowski:
Dynamic Normal Forms and Dynamic Characteristic Polynomial. ICALP (1) 2008: 434-446 - [c15]Piotr Sankowski:
Algebraic Graph Algorithms. MFCS 2008: 68-82 - [c14]Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski:
Stochastic analyses for online combinatorial optimization problems. SODA 2008: 942-951 - 2007
- [c13]Krzysztof Diks, Piotr Sankowski:
Dynamic Plane Transitive Closure. ESA 2007: 594-604 - [c12]Stefano Leonardi, Piotr Sankowski:
Network formation games with local coalitions. PODC 2007: 299-305 - [c11]Piotr Sankowski:
Faster dynamic matchings and vertex connectivity. SODA 2007: 118-126 - 2006
- [j1]Marcin Mucha
Maximum Matchings in Planar Graphs via Gaussian Elimination. Algorithmica 45(1): 3-20 (2006) - [c10]Piotr Sankowski:
Weighted Bipartite Matching in Matrix Multiplication Time. ICALP (1) 2006: 274-285 - 2005
- [c9]Piotr Sankowski:
Subquadratic Algorithm for Dynamic Shortest Distances. COCOON 2005: 461-470 - [c8]Piotr Sankowski:
Shortest Paths in Matrix Multiplication Time. ESA 2005: 770-778 - [c7]Piotr Sankowski:
Processor efficient parallel matching. SPAA 2005: 165-170 - 2004
- [c6]Marcin Mucha, Piotr Sankowski:
Maximum Matchings in Planar Graphs via Gaussian Elimination. ESA 2004: 532-543 - [c5]Marcin Mucha, Piotr Sankowski:
Maximum Matchings via Gaussian Elimination. FOCS 2004: 248-255 - [c4]Piotr Sankowski:
Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract). FOCS 2004: 509-517 - [c3]Krzysztof Ciebiera, Piotr Sankowski:
Improving Web Sites by Automatic Source Code Analysis and Modifications. ICWE 2004: 579-580 - 2003
- [c2]Piotr Sankowski:
Multisampling: A New Approach to Uniform Sampling and Approximate Counting. ESA 2003: 740-751 - [c1]Piotr Sankowski:
Alternative Algorithms for Counting All Matchings in Graphs. STACS 2003: 427-438
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-19 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: