Piotr Sankowski

According to our database1, Piotr Sankowski authored at least 79 papers between 2003 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Round Compression for Parallel Matching Algorithms.
SIAM J. Comput., 2020

Walking randomly, massively, and efficiently.
Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Improved Distance Queries and Cycle Counting by Frobenius Normal Form.
Theory Comput. Syst., 2019

(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Min-Cost Flow in Unit-Capacity Planar Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs.
ACM Trans. Algorithms, 2018

Shortest Augmenting Paths for Online Matchings on Trees.
Theory Comput. Syst., 2018

Optimal Dynamic Strings.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

A Tight Bound for Shortest Augmenting Paths on Trees.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

NC Algorithms for Weighted Planar Perfect Matching and Related Problems.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Online Facility Location with Deletions.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Optimal Decremental Connectivity in Planar Graphs.
Theory Comput. Syst., 2017

Planar Perfect Matching is in NC.
CoRR, 2017

Approximate nearest neighbors search without false negatives for l<sub>2</sub>.
CoRR, 2017

Why Do Cascade Sizes Follow a Power-Law?
Proceedings of the 26th International Conference on World Wide Web, 2017

Decremental single-source reachability in planar digraphs.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (<i>m</i><sup>10/7</sup> log <i>W</i>) Time (Extended Abstract).
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Budget Feasible Mechanisms on Matroids.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Contracting a Planar Graph Efficiently.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m<sup>10/7</sup> log W) Time.
CoRR, 2016

Online Network Design with Outliers.
Algorithmica, 2016

Online Pricing with Impatient Bidders.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Algorithmic Complexity of Power Law Networks.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting.
Proceedings of the 2016 Recommender Systems Challenge, 2016

There is Something Beyond the Twitter Network.
Proceedings of the 27th ACM Conference on Hypertext and Social Media, 2016

Network Elicitation in Adversarial Environment.
Proceedings of the Decision and Game Theory for Security - 7th International Conference, 2016

Locality-Sensitive Hashing Without False Negatives for l_p.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Stochastic Query Covering for Fast Approximate Document Retrieval.
ACM Trans. Inf. Syst., 2015

The ring design game with fair cost allocation.
Theor. Comput. Sci., 2015

Min <i>st</i>-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.
ACM Trans. Algorithms, 2015

Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings.
J. ACM, 2015

The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Online Bipartite Matching in Offline Time (Abstract).
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Revenue Maximization Envy-Free Pricing for Homogeneous Resources.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
Approximation Algorithms for Steiner Tree Problems Based on Universal Solution Frameworks.
CoRR, 2014

Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching.
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Online Bipartite Matching in Offline Time.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Spreading rumours without the network.
Proceedings of the second ACM conference on Online social networks, 2014

2013
Set Covering with Our Eyes Closed.
SIAM J. Comput., 2013

Dynamic Steiner Tree in Planar Graphs.
CoRR, 2013

Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Reachability in graph timelines.
Proceedings of the Innovations in Theoretical Computer Science, 2013

Catch them if you can: how to serve impatient users.
Proceedings of the Innovations in Theoretical Computer Science, 2013

Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012
The Ring Design Game with Fair Cost Allocation - [Extended Abstract].
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Revenue maximizing envy-free multi-unit auctions with budgets.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Single Source - All Sinks Max Flows in Planar Digraphs.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Dynamic normal forms and dynamic characteristic polynomial.
Theor. Comput. Sci., 2011

Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time
CoRR, 2011

Stochastic query covering.
Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Improved algorithms for min cut and max flow in undirected planar graphs.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Single valued combinatorial auctions with budgets.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Approximation Algorithms for Union and Intersection Covering Problems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Improved Minimum Cuts and Maximum Flows in Undirected Planar Graphs
CoRR, 2010

Combinatorial Auctions with Budgets
CoRR, 2010

Fast Dynamic Transitive Closure with Lookahead.
Algorithmica, 2010

Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Fast Approximation in Subspaces by Doubling Metric Decomposition.
Proceedings of the Algorithms, 2010

2009
Maximum weight bipartite matching in matrix multiplication time.
Theor. Comput. Sci., 2009

2008
Processor Efficient Parallel Matching.
Theory Comput. Syst., 2008

Stochastic analyses for online combinatorial optimization problems.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Algebraic Graph Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007
Faster dynamic matchings and vertex connectivity.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Network formation games with local coalitions.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Dynamic Plane Transitive Closure.
Proceedings of the Algorithms, 2007

2006
Maximum Matchings in Planar Graphs via Gaussian Elimination.
Algorithmica, 2006

Weighted Bipartite Matching in Matrix Multiplication Time.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Shortest Paths in Matrix Multiplication Time.
Proceedings of the Algorithms, 2005

Subquadratic Algorithm for Dynamic Shortest Distances.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Improving Web Sites by Automatic Source Code Analysis and Modifications.
Proceedings of the Web Engineering - 4th International Conference, 2004

Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract).
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

Maximum Matchings via Gaussian Elimination.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003
Alternative Algorithms for Counting All Matchings in Graphs.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Multisampling: A New Approach to Uniform Sampling and Approximate Counting.
Proceedings of the Algorithms, 2003


  Loading...