Piotr Sankowski - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Stochastic query coveringAris Anagnostopoulos, Luca Becchetti, Stefano Leonardi, Ida Mele, Piotr Sankowski. wsdm 2011: 725-734 [doi]

Single valued combinatorial auctions with budgetsAmos Fiat, Stefano Leonardi, Jared Saia, Piotr Sankowski. sigecom 2011: 223-232 [doi]

Dynamic normal forms and dynamic characteristic polynomialGudmund Skovbjerg Frandsen, Piotr Sankowski. TCS, 412(16):1470-1483, 2011. [doi]

Improved algorithms for min cut and max flow in undirected planar graphsGiuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen. stoc 2011: 313-322 [doi]

Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) TimeJakub Lacki, Piotr Sankowski. esa 2011: 155-166 [doi]

Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. ProceedingsFilip Murlak, Piotr Sankowski, editors, Volume 6907 of Lecture Notes in Computer Science, Springer, 2011. [doi]

2010

2009

Maximum weight bipartite matching in matrix multiplication timePiotr Sankowski. TCS, 410(44):4480-4488, 2009. [doi]

2008

2007

Dynamic Plane Transitive ClosureKrzysztof Diks, Piotr Sankowski. esa 2007: 594-604 [doi]

Network formation games with local coalitionsStefano Leonardi, Piotr Sankowski. podc 2007: 299-305 [doi]

Faster dynamic matchings and vertex connectivityPiotr Sankowski. soda 2007: 118-126 [doi]

2006

Maximum Matchings in Planar Graphs via Gaussian EliminationMarcin Mucha, Piotr Sankowski. algorithmica, 45(1):3-20, 2006. [doi]

Weighted Bipartite Matching in Matrix Multiplication TimePiotr Sankowski. icalp 2006: 274-285 [doi]

2005

Subquadratic Algorithm for Dynamic Shortest DistancesPiotr Sankowski. cocoon 2005: 461-470 [doi]

Shortest Paths in Matrix Multiplication TimePiotr Sankowski. esa 2005: 770-778 [doi]

Processor efficient parallel matchingPiotr Sankowski. spaa 2005: 165-170 [doi]

2004

Improving Web Sites by Automatic Source Code Analysis and ModificationsKrzysztof Ciebiera, Piotr Sankowski. ICWE 2004: 579-580 [doi]

Maximum Matchings via Gaussian EliminationMarcin Mucha, Piotr Sankowski. focs 2004: 248-255 [doi]

Maximum Matchings in Planar Graphs via Gaussian EliminationMarcin Mucha, Piotr Sankowski. esa 2004: 532-543 [doi]

Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)Piotr Sankowski. focs 2004: 509-517 [doi]

2003

Alternative Algorithms for Counting All Matchings in GraphsPiotr Sankowski. STACS 2003: 427-438 [doi]

Multisampling: A New Approach to Uniform Sampling and Approximate CountingPiotr Sankowski. esa 2003: 740-751 [doi]