×

zbMATH — the first resource for mathematics

Sankowski, Piotr

Compute Distance To:
Author ID: sankowski.piotr Recent zbMATH articles by "Sankowski, Piotr"
Published as: Sankowski, Piotr
Documents Indexed: 58 Publications since 2003, including 2 Books

Publications by Year

Citations contained in zbMATH

36 Publications have been cited 202 times in 167 Documents Cited by Year
Maximum matchings in planar graphs via Gaussian elimination. Zbl 1111.05304
Mucha, Marcin; Sankowski, Piotr
44
2004
Improved algorithms for Min-cut and Max-flow in undirected planar graphs. Zbl 1288.05276
Italiano, Giuseppe F.; Nussbaum, Yahav; Sankowski, Piotr; Wulff-Nilsen, Christian
13
2011
Stochastic analyses for online combinatorial optimization problems. Zbl 1192.90169
Garg, Naveen; Gupta, Anupam; Leonardi, Stefano; Sankowski, Piotr
13
2008
Maximum matchings in planar graphs via Gaussian elimination. Zbl 1117.68056
Mucha, Marcin; Sankowski, Piotr
13
2006
Faster dynamic matchings and vertex connectivity. Zbl 1302.05195
Sankowski, Piotr
11
2007
Maximum weight bipartite matching in matrix multiplication time. Zbl 1228.05238
Sankowski, Piotr
9
2009
Network formation games with local coalitions. Zbl 1283.68057
Leonardi, Stefano; Sankowski, Piotr
9
2007
Subexponential-time parameterized algorithm for Steiner tree on planar graphs. Zbl 1354.68132
Pilipczuk, Marcin; Pilipczuk, Michał; Sankowski, Piotr; Van Leeuwen, Erik Jan
8
2013
Min-cuts and shortest cycles in planar graphs in \(O(n \log\log n)\) time. Zbl 1346.05286
Łącki, Jakub; Sankowski, Piotr
8
2011
The power of dynamic distance oracles, efficient dynamic algorithms for the Steiner tree. Zbl 1321.68389
Łącki, Jakub; Oćwieja, Jakub; Pilipczuk, Marcin; Sankowski, Piotr; Zych, Anna
6
2015
Negative-weight shortest paths and unit capacity minimum cost flow in \(\tilde{O}(m^{10/7}\log W)\) time (extended abstract). Zbl 1410.68291
Cohen, Michael B.; Mądry, Aleksander; Sankowski, Piotr; Vladu, Adrian
5
2017
Algorithmic applications of Baur-Strassen’s theorem, shortest cycles, diameter, and matchings. Zbl 1426.05164
Cygan, Marek; Gabow, Harold N.; Sankowski, Piotr
5
2015
The ring design game with fair cost allocation. Zbl 1303.68026
Fanelli, Angelo; Leniowski, Dariusz; Monaco, Gianpiero; Sankowski, Piotr
5
2015
Revenue maximizing envy-free fixed-price auctions with budgets. Zbl 1406.91166
Colini-Baldeschi, Riccardo; Leonardi, Stefano; Sankowski, Piotr; Zhang, Qiang
5
2014
Shortest paths in matrix multiplication time. Zbl 1142.05369
Sankowski, Piotr
5
2005
Weighted bipartite matching in matrix multiplication time. Zbl 1223.05241
Sankowski, Piotr
4
2006
Optimal dynamic strings. Zbl 1403.68372
Gawrychowski, Paweł; Karczmarz, Adam; Kociumaka, Tomasz; Łącki, Jakub; Sankowski, Piotr
3
2018
Algorithmic complexity of power law networks. Zbl 1394.68010
Brach, Paweł; Cygan, Marek; Łącki, Jakub; Sankowski, Piotr
3
2016
Locality-sensitive hashing without false negatives for \(l_p\). Zbl 1454.68035
Pacuk, Andrzej; Sankowski, Piotr; Wegrzycki, Karol; Wygocki, Piotr
3
2016
Min \(st\)-cut oracle for planar graphs with near-linear preprocessing time. Zbl 1398.68217
Borradaile, Glencora; Sankowski, Piotr; Wulff-Nilsen, Christian
3
2015
Set covering with our eyes closed. Zbl 1275.68158
Grandoni, Fabrizio; Gupta, Anupam; Leonardi, Stefano; Miettinen, Pauli; Sankowski, Piotr; Singh, Mohit
3
2013
Dynamic normal forms and dynamic characteristic polynomial. Zbl 1153.65332
Frandsen, Gudmund Skovbjerg; Sankowski, Piotr
3
2008
Alternative algorithms for counting all matchings in graphs. Zbl 1035.05091
Sankowski, Piotr
3
2003
Optimal decremental connectivity in planar graphs. Zbl 1356.05149
Lacki, Jakub; Sankowski, Piotr
2
2015
A path-decomposition theorem with applications to pricing and covering on trees. Zbl 1365.68350
Cygan, Marek; Grandoni, Fabrizio; Leonardi, Stefano; Pilipczuk, Marcin; Sankowski, Piotr
2
2012
Fast dynamic transitive closure with lookahead. Zbl 1191.68855
Sankowski, Piotr; Mucha, Marcin
2
2010
Dynamic plane transitive closure. Zbl 1151.05330
Diks, Krzysztof; Sankowski, Piotr
2
2007
Subquadratic algorithm for dynamic shortest distances. Extended abstract. Zbl 1128.68553
Sankowski, Piotr
2
2005
Round compression for parallel matching algorithms. Zbl 1427.68354
Czumaj, Artur; Łącki, Jakub; Mądry, Aleksander; Mitrović, Slobodan; Onak, Krzysztof; Sankowski, Piotr
1
2018
Network sparsification for Steiner problems on planar and bounded-genus graphs. Zbl 1454.68114
Pilipczuk, Marcin; Pilipczuk, Michał; Sankowski, Piotr; van Leeuwen, Erik Jan
1
2018
Shortest augmenting paths for online matchings on trees. Zbl 1390.68768
Bosek, Bartłomiej; Leniowski, Dariusz; Sankowski, Piotr; Zych-Pawlewicz, Anna
1
2018
Improved distance queries and cycle counting by Frobenius normal form. Zbl 1402.68107
Sankowski, Piotr; Węgrzycki, Karol
1
2017
Network elicitation in adversarial environment. Zbl 1453.91031
Dziubiński, Marcin; Sankowski, Piotr; Zhang, Qiang
1
2016
Reachability in graph timelines. Zbl 1362.68061
Łącki, Jakub; Sankowski, Piotr
1
2013
Online network design with outliers. Zbl 1287.68012
Anagnostopoulos, Aris; Grandoni, Fabrizio; Leonardi, Stefano; Sankowski, Piotr
1
2010
Algebraic graph algorithms. Zbl 1173.05354
Sankowski, Piotr
1
2008
Optimal dynamic strings. Zbl 1403.68372
Gawrychowski, Paweł; Karczmarz, Adam; Kociumaka, Tomasz; Łącki, Jakub; Sankowski, Piotr
3
2018
Round compression for parallel matching algorithms. Zbl 1427.68354
Czumaj, Artur; Łącki, Jakub; Mądry, Aleksander; Mitrović, Slobodan; Onak, Krzysztof; Sankowski, Piotr
1
2018
Network sparsification for Steiner problems on planar and bounded-genus graphs. Zbl 1454.68114
Pilipczuk, Marcin; Pilipczuk, Michał; Sankowski, Piotr; van Leeuwen, Erik Jan
1
2018
Shortest augmenting paths for online matchings on trees. Zbl 1390.68768
Bosek, Bartłomiej; Leniowski, Dariusz; Sankowski, Piotr; Zych-Pawlewicz, Anna
1
2018
Negative-weight shortest paths and unit capacity minimum cost flow in \(\tilde{O}(m^{10/7}\log W)\) time (extended abstract). Zbl 1410.68291
Cohen, Michael B.; Mądry, Aleksander; Sankowski, Piotr; Vladu, Adrian
5
2017
Improved distance queries and cycle counting by Frobenius normal form. Zbl 1402.68107
Sankowski, Piotr; Węgrzycki, Karol
1
2017
Algorithmic complexity of power law networks. Zbl 1394.68010
Brach, Paweł; Cygan, Marek; Łącki, Jakub; Sankowski, Piotr
3
2016
Locality-sensitive hashing without false negatives for \(l_p\). Zbl 1454.68035
Pacuk, Andrzej; Sankowski, Piotr; Wegrzycki, Karol; Wygocki, Piotr
3
2016
Network elicitation in adversarial environment. Zbl 1453.91031
Dziubiński, Marcin; Sankowski, Piotr; Zhang, Qiang
1
2016
The power of dynamic distance oracles, efficient dynamic algorithms for the Steiner tree. Zbl 1321.68389
Łącki, Jakub; Oćwieja, Jakub; Pilipczuk, Marcin; Sankowski, Piotr; Zych, Anna
6
2015
Algorithmic applications of Baur-Strassen’s theorem, shortest cycles, diameter, and matchings. Zbl 1426.05164
Cygan, Marek; Gabow, Harold N.; Sankowski, Piotr
5
2015
The ring design game with fair cost allocation. Zbl 1303.68026
Fanelli, Angelo; Leniowski, Dariusz; Monaco, Gianpiero; Sankowski, Piotr
5
2015
Min \(st\)-cut oracle for planar graphs with near-linear preprocessing time. Zbl 1398.68217
Borradaile, Glencora; Sankowski, Piotr; Wulff-Nilsen, Christian
3
2015
Optimal decremental connectivity in planar graphs. Zbl 1356.05149
Lacki, Jakub; Sankowski, Piotr
2
2015
Revenue maximizing envy-free fixed-price auctions with budgets. Zbl 1406.91166
Colini-Baldeschi, Riccardo; Leonardi, Stefano; Sankowski, Piotr; Zhang, Qiang
5
2014
Subexponential-time parameterized algorithm for Steiner tree on planar graphs. Zbl 1354.68132
Pilipczuk, Marcin; Pilipczuk, Michał; Sankowski, Piotr; Van Leeuwen, Erik Jan
8
2013
Set covering with our eyes closed. Zbl 1275.68158
Grandoni, Fabrizio; Gupta, Anupam; Leonardi, Stefano; Miettinen, Pauli; Sankowski, Piotr; Singh, Mohit
3
2013
Reachability in graph timelines. Zbl 1362.68061
Łącki, Jakub; Sankowski, Piotr
1
2013
A path-decomposition theorem with applications to pricing and covering on trees. Zbl 1365.68350
Cygan, Marek; Grandoni, Fabrizio; Leonardi, Stefano; Pilipczuk, Marcin; Sankowski, Piotr
2
2012
Improved algorithms for Min-cut and Max-flow in undirected planar graphs. Zbl 1288.05276
Italiano, Giuseppe F.; Nussbaum, Yahav; Sankowski, Piotr; Wulff-Nilsen, Christian
13
2011
Min-cuts and shortest cycles in planar graphs in \(O(n \log\log n)\) time. Zbl 1346.05286
Łącki, Jakub; Sankowski, Piotr
8
2011
Fast dynamic transitive closure with lookahead. Zbl 1191.68855
Sankowski, Piotr; Mucha, Marcin
2
2010
Online network design with outliers. Zbl 1287.68012
Anagnostopoulos, Aris; Grandoni, Fabrizio; Leonardi, Stefano; Sankowski, Piotr
1
2010
Maximum weight bipartite matching in matrix multiplication time. Zbl 1228.05238
Sankowski, Piotr
9
2009
Stochastic analyses for online combinatorial optimization problems. Zbl 1192.90169
Garg, Naveen; Gupta, Anupam; Leonardi, Stefano; Sankowski, Piotr
13
2008
Dynamic normal forms and dynamic characteristic polynomial. Zbl 1153.65332
Frandsen, Gudmund Skovbjerg; Sankowski, Piotr
3
2008
Algebraic graph algorithms. Zbl 1173.05354
Sankowski, Piotr
1
2008
Faster dynamic matchings and vertex connectivity. Zbl 1302.05195
Sankowski, Piotr
11
2007
Network formation games with local coalitions. Zbl 1283.68057
Leonardi, Stefano; Sankowski, Piotr
9
2007
Dynamic plane transitive closure. Zbl 1151.05330
Diks, Krzysztof; Sankowski, Piotr
2
2007
Maximum matchings in planar graphs via Gaussian elimination. Zbl 1117.68056
Mucha, Marcin; Sankowski, Piotr
13
2006
Weighted bipartite matching in matrix multiplication time. Zbl 1223.05241
Sankowski, Piotr
4
2006
Shortest paths in matrix multiplication time. Zbl 1142.05369
Sankowski, Piotr
5
2005
Subquadratic algorithm for dynamic shortest distances. Extended abstract. Zbl 1128.68553
Sankowski, Piotr
2
2005
Maximum matchings in planar graphs via Gaussian elimination. Zbl 1111.05304
Mucha, Marcin; Sankowski, Piotr
44
2004
Alternative algorithms for counting all matchings in graphs. Zbl 1035.05091
Sankowski, Piotr
3
2003
all top 5

Cited by 350 Authors

9 Sankowski, Piotr
7 Mozes, Shay
6 Rauch Henzinger, Monika
4 Flammini, Michele
4 Leonardi, Stefano
4 Lokshtanov, Daniel
4 Saurabh, Saket
3 Christodoulou, George C.
3 Fomin, Fedor V.
3 Goranci, Gramoz
3 Grandoni, Fabrizio
3 Hoefer, Martin
3 Italiano, Giuseppe Francesco
3 Katrenič, Ján
3 Mertzios, George B.
3 Moscardelli, Luca
3 Nichterlein, André
3 Niedermeier, Rolf
3 Nussbaum, Yahav
3 Peng, Pan
3 Pilipczuk, Marcin
3 Sgouritsa, Alkmini
2 Àlvarez, Carme
2 Angelopoulos, Spyros
2 Baswana, Surender
2 Bernstein, Aaron
2 Bhattacharya, Sayan
2 Bilò, Vittorio
2 Cygan, Marek
2 Duan, Ran
2 Feldman, Michal
2 Feldmann, Andreas Emil
2 Fox, Kyle
2 Galčík, František
2 Gupta, Manoj Kumar
2 Gutin, Gregory Z.
2 Han, Yijie
2 Huang, Chien-Chung
2 Iwata, Satoru
2 Kaplan, Haim
2 Kaski, Petteri
2 Kavitha, Telikepalli
2 Laslier, Benoît
2 Lê Văn Băng
2 Liotta, Giuseppe
2 Mamageishvili, Akaki
2 Marx, Dániel
2 Mihalák, Matúš
2 Monaco, Gianpiero
2 Montecchiani, Fabrizio
2 Mucha, Marcin
2 Naor, Joseph Seffi
2 Nayyeri, Amir
2 Panigrahi, Debmalya
2 Panolan, Fahad
2 Pettie, Seth
2 Pilipczuk, Michał
2 Rappaport, David
2 Schieber, Baruch
2 Semanišin, Gabriel
2 Sen, Sandeep
2 Serna, Maria José
2 Seshadhri, Comandur
2 Shachnai, Hadas
2 Sommer, Christian
2 Suchý, Ondřej
2 Takamatsu, Mizuyo
2 Tamir, Tami
2 Toninelli, Fabio Lucio
2 Tóth, Csaba D.
2 Wahlström, Magnus
2 Weimann, Oren
2 Wojtaszczyk, Jakub Onufry
1 Adiga, Abhijin
1 Aguiar, António Pedro
1 Amir, Amihood
1 Anagnostopoulos, Aris
1 Arkin, Esther M.
1 Ausiello, Giorgio
1 Bae, Sang Won
1 Balseiro, Santiago R.
1 Bannai, Hideo
1 Başar, Tamer
1 Baste, Julien
1 Baveja, Alok
1 Belmonte, Antonio
1 Besser, Bert
1 Biedl, Therese C.
1 Björklund, Andreas
1 Blesa, Maria J.
1 Bonamy, Marthe
1 Boria, Nicolas
1 Borodin, Allan B.
1 Borradaile, Glencora
1 Bosek, Bartłomiej
1 Boysen, Nils
1 Brandt, Sebastian F.
1 Brânzei, Simina
1 Bro Miltersen, Peter
1 Brown, David B.
...and 250 more Authors

Citations by Year