BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × France
1 × Iceland
1 × Italy
2 × USA
Collaborated with:
G.S.Frandsen G.F.Italiano Y.Nussbaum C.Wulff-Nilsen A.Anagnostopoulos F.Grandoni S.Leonardi J.Lacki J.Ocwieja M.Pilipczuk A.Zych
Talks about:
dynam (4) algorithm (2) characterist (1) undirect (1) polynomi (1) bipartit (1) steiner (1) outlier (1) network (1) multipl (1)

Person: Piotr Sankowski

DBLP DBLP: Sankowski:Piotr

Contributed to:

STOC 20152015
STOC 20112011
ICALP (1) 20102010
ICALP (1) 20082008
ICALP (1) 20062006

Wrote 5 papers:

STOC-2015-LackiOPSZ #algorithm #distance #performance #power of
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree (JL, JO, MP, PS, AZ), pp. 11–20.
STOC-2011-ItalianoNSW #algorithm #graph
Improved algorithms for min cut and max flow in undirected planar graphs (GFI, YN, PS, CWN), pp. 313–322.
ICALP-v1-2010-AnagnostopoulosGLS #design #network #online
Online Network Design with Outliers (AA, FG, SL, PS), pp. 114–126.
ICALP-A-2008-FrandsenS #normalisation #polynomial
Dynamic Normal Forms and Dynamic Characteristic Polynomial (GSF, PS), pp. 434–446.
ICALP-v1-2006-Sankowski #matrix #multi
Weighted Bipartite Matching in Matrix Multiplication Time (PS), pp. 274–285.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.