 | 2008 |
|---|
| 19 |       | Fabrizio Grandoni,
Anupam Gupta,
Stefano Leonardi,
Pauli Miettinen,
Piotr Sankowski,
Mohit Singh:
Set Covering with our Eyes Closed.
FOCS 2008: 347-356 |
| 18 | | Gudmund Skovbjerg Frandsen,
Piotr Sankowski:
Dynamic Normal Forms and Dynamic Characteristic Polynomial.
ICALP (1) 2008: 434-446 |
| 17 | | Piotr Sankowski:
Algebraic Graph Algorithms.
MFCS 2008: 68-82 |
| 16 | | Naveen Garg,
Anupam Gupta,
Stefano Leonardi,
Piotr Sankowski:
Stochastic analyses for online combinatorial optimization problems.
SODA 2008: 942-951 |
| 15 | | Piotr Sankowski:
Processor Efficient Parallel Matching.
Theory Comput. Syst. 42(1): 73-90 (2008) |
| 2007 |
|---|
| 14 | | Krzysztof Diks,
Piotr Sankowski:
Dynamic Plane Transitive Closure.
ESA 2007: 594-604 |
| 13 | | Stefano Leonardi,
Piotr Sankowski:
Network formation games with local coalitions.
PODC 2007: 299-305 |
| 12 | | Piotr Sankowski:
Faster dynamic matchings and vertex connectivity.
SODA 2007: 118-126 |
| 2006 |
|---|
| 11 | | Piotr Sankowski:
Weighted Bipartite Matching in Matrix Multiplication Time.
ICALP (1) 2006: 274-285 |
| 10 | | Marcin Mucha,
Piotr Sankowski:
Maximum Matchings in Planar Graphs via Gaussian Elimination.
Algorithmica 45(1): 3-20 (2006) |
| 2005 |
|---|
| 9 | | Piotr Sankowski:
Subquadratic Algorithm for Dynamic Shortest Distances.
COCOON 2005: 461-470 |
| 8 | | Piotr Sankowski:
Shortest Paths in Matrix Multiplication Time.
ESA 2005: 770-778 |
| 7 | | Piotr Sankowski:
Processor efficient parallel matching.
SPAA 2005: 165-170 |
| 2004 |
|---|
| 6 | | Marcin Mucha,
Piotr Sankowski:
Maximum Matchings in Planar Graphs via Gaussian Elimination.
ESA 2004: 532-543 |
| 5 | | Marcin Mucha,
Piotr Sankowski:
Maximum Matchings via Gaussian Elimination.
FOCS 2004: 248-255 |
| 4 | | Piotr Sankowski:
Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract).
FOCS 2004: 509-517 |
| 3 | | Krzysztof Ciebiera,
Piotr Sankowski:
Improving Web Sites by Automatic Source Code Analysis and Modifications.
ICWE 2004: 579-580 |
| 2003 |
|---|
| 2 | | Piotr Sankowski:
Multisampling: A New Approach to Uniform Sampling and Approximate Counting.
ESA 2003: 740-751 |
| 1 | | Piotr Sankowski:
Alternative Algorithms for Counting All Matchings in Graphs.
STACS 2003: 427-438 |
