Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Piotr Sankowski
2018
- Piotr Sankowski and Karol Zbigniew Węgrzycki, Improved Distance Queries and Cycle Counting by Frobenius Normal Form, Theory Of Computing Systems 2018.see in PBN
- Paweł Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Łącki and Piotr Sankowski, Optimal Dynamic Strings, in: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, SIAM, 2018, p. 1509–1528.see in PBN
- Marek Adam Cygan, Artur Czumaj, Marcin Ireneusz Mucha and Piotr Sankowski, Online Facility Location with Deletions, in: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, 2018, r. 21, p. 1–15.see in PBN
- Marcin Pilipczuk, Michał Pilipczuk, Piotr Sankowski and Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, Acm Transactions On Algorithms 14 (4) 2018, p. 53:1–53:73.see in PBN
2017
- Karol Zbigniew Węgrzycki, Piotr Sankowski, Andrzej Krzysztof Pacuk and Piotr Wygocki, Why Do Cascade Sizes Follow a Power-Law?, in: Proceedings of the 26th International Conference on World Wide Web, 2017, p. 569–576.see in PBN
- Piotr Sankowski and Karol Zbigniew Węgrzycki, Improved Distance Queries and Cycle Counting by Frobenius Normal Form, in: 34th Symposium on Theoretical Aspects of Computer Science, 2017, r. 56, p. 1–14.see in PBN
- Piotr Sankowski and Piotr Wygocki, Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrtloglogn, in: 28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017, p. 63:1–63:12.see in PBN
- Michael B. Cohen, Aleksander Mądry, Piotr Sankowski and Adrian Vladu, Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m^10/7 log W) Time, in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, Society for Industrial and Applied Mathematics, 2017, p. 752–771.see in PBN
- Jacob Holm, Giuseppe F. Italiano, Adam Karol Karczmarz, Jakub Włodzimierz Łącki, Eva Rotenberg and Piotr Sankowski, Contracting a Planar Graph Efficiently, in: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017, p. 50:1–50:15.see in PBN
- Giuseppe F. Italiano, Adam Karol Karczmarz, Jakub Włodzimierz Łącki and Piotr Sankowski, Decremental Single-source Reachability in Planar Digraphs, in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, p. 1108–1121.see in PBN
2016
- Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi and Piotr Sankowski, Online Network Design with Outliers, Algorithmica 76 (1) 2016, p. 88–109.see in PBN
- Marcin Konrad Dziubiński, Piotr Sankowski and Qiang Zhang, Network elicitation in adversarial environment, in: Proceedings of the 7th International Conference on Decision and Game Theory for Security, GameSec 2016, Springer, New York 2016, p. 397–414.see in PBN
- Piotr Sankowski and Zaroliagis Christos (eds.), 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016.see in PBN
- Andrzej Krzysztof Pacuk, Piotr Sankowski, Karol Zbigniew Węgrzycki and Piotr Wygocki, There is Something Beyond the Twitter Network, in: Proceedings of the 27th ACM Conference on Hypertext and Social Media, 2016, p. 279–284.see in PBN
- Andrzej Krzysztof Pacuk, Piotr Sankowski, Karol Zbigniew Węgrzycki and Piotr Wygocki, Locality-Sensitive Hashing Without False Negatives for \$\$l\_p\$\$, in: Computing and Combinatorics : 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings, 2016, p. 105–118.see in PBN
- Marek Adam Cygan, Marcin Ireneusz Mucha, Piotr Sankowski and Qiang Zhang, Online Pricing with Impatient Bidders, in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, p. 190–201.see in PBN
- Marcin Ireneusz Mucha and Piotr Sankowski, Maximum Matching, in: Encyclopedia of Algorithms, Springer, 2016, p. 1238–1240.see in PBN
- Paweł Jarosław Brach, Marek Adam Cygan, Jakub Włodzimierz Łącki and Piotr Sankowski, Algorithmic Complexity of Power Law Networks, in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, p. 1306–1325.see in PBN
- Andrzej Krzysztof Pacuk, Piotr Sankowski, Karol Zbigniew Węgrzycki, Adam Wojciech Witkowski and Piotr Wygocki, RecSys Challenge 2016: Job Recommendations Based on Preselection of Offers and Gradient Boosting, in: Proceedings of the Recommender Systems Challenge, ACM, 2016, p. 10:1–10:4.see in PBN
2015
- Aris Anagnostopoulos, Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Ida Mele and Piotr Sankowski, Stochastic Query Covering for Fast Approximate Document Retrieval, Acm Transactions On Information Systems 33 (3) 2015, p. 11:1–11:35.see in PBN
- Glencora Borradaile, Piotr Sankowski and Christian Wulff-Nilsen, Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, Acm Transactions On Algorithms 2015.see in PBN
- Marek Adam Cygan, Harold N. Gabow and Piotr Sankowski, Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings, Journal Of The Acm 62 (4) 2015, p. 28.see in PBN
- Jakub Włodzimierz Łącki, Jakub Oćwieja, Marcin Pilipczuk, Piotr Sankowski and Anna Katarzyna Zych, The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree, in: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, ACM, 2015, p. 11–20.see in PBN
2014
- Riccardo Colini-Baldeschi, Stefano Leonardi, Piotr Sankowski and Qiang Zhang, Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets, Lecture Notes In Computer Science 2014.see in PBN
- Paweł Jarosław Brach, Alessandro Epasto, Alessandro Panconesi and Piotr Sankowski, Spreading Rumours Without the Network, in: Proceedings of the Second ACM Conference on Online Social Networks, 2014, p. 107–118.see in PBN
- Attila Bernáth, Krzysztof Ciebiera, Piotr Godlewski and Piotr Sankowski, Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem., Lecture Notes In Computer Science 2014.see in PBN
- Marek Adamczyk, Piotr Sankowski and Qiang Zhang, Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching, Lecture Notes In Computer Science 2014.see in PBN
- Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski and Anna Katarzyna Zych, Online Bipartite Matching in Offline Time, in: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, IEEE Computer Society, 2014, p. 384–393.see in PBN
- Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco and Piotr Sankowski, The ring design game with fair cost allocation, Theoretical Computer Science 2014.see in PBN
- Marcin Pilipczuk, Michał Pilipczuk, Piotr Sankowski and Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, in: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, IEEE Computer Society, 2014, p. 276–285.see in PBN
2013
- Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski and Mohit Singh, Set Covering with Our Eyes Closed, Siam Journal On Computing 42 (3) 2013, p. 808–830.see in PBN
- Jakub Włodzimierz Łącki and Piotr Sankowski, Reachability in graph timelines, in: Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013, ACM, 2013, p. 257–268.see in PBN
- Marcin Łukasz Pilipczuk, Michał Pilipczuk, Piotr Sankowski and Erik Jan van Leeuwen, Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs, in: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany 2013, p. 353–364.see in PBN
- Marek Adam Cygan, Marcin Ireneusz Mucha, Piotr Sankowski, Matthias Englert and Anupam Gupta, Catch them if you can: how to serve impatient users, in: Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013, ACM, 2013.see in PBN
2012
- Marek Cygan, Harold N. Gabow and Piotr Sankowski, Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings, in: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, IEEE Computer Society, 2012.see in PBN
- Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk and Piotr Sankowski, A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees, in: Algorithms - ESA 2012 - 20th Annual European Symposium, Springer, 2012, p. 349–360.see in PBN
- Angelo Fanelli, Dariusz Leniowski, Gianpiero Monaco and Piotr Sankowski, The Ring Design Game with Fair Cost Allocation - [Extended Abstract], in: WINE, 2012.see in PBN
- Michał Feldman, Amos Fiat, Stefano Leonardi and Piotr Sankowski, Revenue maximizing envy-free multi-unit auctions with budgets, in: ACM Conference on Electronic Commerce, 2012.see in PBN
- Jakub Łącki, Yahav Nussbaum, Piotr Sankowski and Christian Wulff-Nilsen, Single Source - All Sinks Max Flows in Planar Digraphs, in: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, IEEE Computer Society, 2012.see in PBN
- M. Bukała, Piotr Sankowski, R. Buczko and P. Kacman, Structural and electronic properties of Pb$_1$-$x$Cd$_x$Te and Pb$_1$-$x$Mn$_x$Te ternary alloys, Physical Review B 86 2012, p. 085205.see in PBN
2011
- Małgorzata Bukała, Piotr Sankowski, Ryszard Buczko and Perła Kacman, Crystal and electronic structure of PbTe/CdTe nanostructures, Nanoscale Research Letters 6 (1) 2011, p. 1–7.see in PBN
- Jakub Łącki and Piotr Sankowski, Min-Cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time, Lecture Notes In Computer Science 6942 2011, p. 155–166.see in PBN
- Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk and Piotr Sankowski, Approximation Algorithms for Union and Intersection Covering Problems, in: Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 2011, Leibniz-Zentrum fuer Informatik, Dagstuhl 2011, p. 28–40.see in PBN
- Filip Murlak and Piotr Sankowski (eds.), Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011., Springer, Berlin 2011.see in PBN
- Gudmund Frandsen and Piotr Sankowski, Dynamic normal forms and dynamic characteristic polynomial, Theoretical Computer Science 412 (16) 2011, p. 1470–1483.see in PBN
- Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski and Christian Wulff-Nilsen, Improved algorithms for min cut and max flow in undirected planar graphs, in: STOC, ACM, San Jose 2011.see in PBN
- Amos Fiat, Stefano Leonardi, Jared Saia and Piotr Sankowski, Single valued combinatorial auctions with budgets, in: ACM Conference on Electronic Commerce, 2011.see in PBN
- Aris Anagnostopoulos, Luca Becchetti, Stefano Leonardi, Ida Mele and Piotr Sankowski, Stochastic query covering, in: WSDM, ACM, Hong Kong 2011.see in PBN
2010
- Marek Cygan, Łukasz Kowalik, Marcin Mucha, Marcin Pilipczuk and Piotr Sankowski, Fast Approximation in Subspaces by Doubling Metric Decomposition, Lecture Notes In Computer Science 6346 2010, p. 72–83.see in PBN
- Glencora Borradaile, Piotr Sankowski and Christian Wulff-Nilsen, Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time, in: FOCS, 2010.see in PBN
- Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi and Piotr Sankowski, Online Network Design with Outliers, Lecture Notes In Computer Science 6198 2010, p. 114–126.see in PBN
- Piotr Sankowski and Marcin Mucha, Fast Dynamic Transitive Closure with Lookahead, Algorithmica 56 (2) 2010, p. 180–197.see in PBN
2009
- Piotr Sankowski, Maximum weight bipartite matching in matrix multiplication time, Theoretical Computer Science 410 (44) 2009, p. 4480–4488.see in PBN
- M. Szot, A. Szczerbakow, K. Dybko, L. Kowalczyk, E. Smajek, V. Domukhovski, E. Łusakowska, P. Dziawa, A. Mycielski, T. Story, M. Bukała, M. Galicka, Piotr Sankowski, R. Buczko and P. Kacman, Experimental and Theoretical Analysis οf PbTe-CdTe Solid Solution Grown by Physical Vapour Transport Method, Acta Physica Polonica A 116 (5) 2009, p. 959–961.see in PBN
- Piotr Sankowski and Perła Kacman, Modeling of Tunneling Magnetoresistance in (Ga, Mn) As-TRILAYERS, International Journal Of Modern Physics B 23 (12-13) 2009, p. 2969–2973.see in PBN
2008
- P Sankowski, Perla Kacman and Jacek Majewski, Modeling of bias anomaly in (Ga,Mn)As tunneling magnetoresistance structures, Journal Of Applied Physics 103 2008, p. 1–10.see in PBN
- Piotr Sankowski, P. Kacman and J. A. Majewski, Self-consistent model of spin dependent tunneling in (Ga,Mn)As structures, Physica E-low-dimensional Systems & Nanostructures 40 (6) 2008, p. 1944–1946.see in PBN
- Gudmund Skovbjerg Frandsen and Piotr Sankowski, Dynamic Normal Forms and Dynamic Characteristic Polynomial, Lecture Notes In Computer Science 5125 2008, p. 434–446.see in PBN
- Piotr Sankowski, Algebraic Graph Algorithms, Lecture Notes In Computer Science 5162 2008, p. 68–82.see in PBN
- Naveen Garg, Anupam Gupta, Stefano Leonardi and Piotr Sankowski, Stochastic analyses for online combinatorial optimization problems, in: SODA, 2008.see in PBN
- Piotr Sankowski, Processor Efficient Parallel Matching, Theory Of Computing Systems 42 (1) 2008, p. 73–90.see in PBN
- Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski and Mohit Singh, Set Covering with our Eyes Closed., in: FOCS, 2008.see in PBN
- Piotr Sankowski, P. Kacman and J. A. Majewski, Modeling of bias anomaly in (Ga,Mn)As structures, Journal Of Applied Physics 103 (10) 2008, p. 103709–103702.see in PBN
2007
- Piotr Sankowski, P. Kacman, J. Majewski and Tomasz Dietl, Spin-dependent tunneling in modulated structures of (Ga,Mn)As, Physica Status Solidi C-conferences 4 (2) 2007, p. 493–496.see in PBN
- Piotr Sankowski, P. Kacman, J. Majewski and Tomasz Dietl, Vertical spin transport in semiconductor heterostructures, Low Temperature Physics 33 2007, p. 187.see in PBN
- Krzysztof Diks and Piotr Sankowski, Dynamic Plane Transitive Closure, Lecture Notes In Computer Science 4698 2007, p. 594–604.see in PBN
- Piotr Sankowski, Faster dynamic matchings and vertex connectivity, in: SODA 2007, SIAM Ź, Louisiana 2007.see in PBN
- S. Leonardi and Piotr Sankowski, Network Formation Games with Local Coalitions, in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (PODC 2007), Oregon 2007.see in PBN
- Piotr Sankowski, P. Kacman, J. Majewski and Tomasz Dietl, Spin-dependent tunneling in modulated structures of (Ga,Mn)As, Physical Review B 75 2007, p. 45306.see in PBN
2006
- Marcin Mucha and Piotr Sankowski, Maximum Matchings in Planar Graphs via Gaussian Elimination, Algorithmica 45 (1) 2006, p. 3–20.see in PBN
- Piotr Sankowski, Weighted Bipartite Matching in Matrix Multiplication Time, Lecture Notes In Computer Science 4052 2006, p. 274–285.see in PBN
- Piotr Sankowski, P. Kacman, J. Majewski and T. Dietl, Spin-dependent tunneling in modulated structures of (Ga,Mn)As, Physical Review B 75 2006, p. 45306.see in PBN
- Piotr Sankowski and Perła Kacman, Spin-Dependent Phenomena in (Ga,Mn)As Heterostructures, Acta Physica Polonica A 110 (2) 2006, p. 139–150.see in PBN
- Piotr Sankowski, Perła Kacman, Jacek Majewski and J. Dietl, Tight-binding model of spin-polarized tunnelling in (Ga,Mn)As-basek structures, Physica E-low-dimensional Systems & Nanostructures 32 2006, p. 275–378.see in PBN
- Piotr Sankowski, P. Kacman, J. Majewski and T. Dietl, Theory of spin-dependent tunneling and resonant tunneling in layered structures based on (Ga,Mn)As, Physica Status Solidi C-conferences 3 2006, p. 4188–4191.see in PBN
2005
- H. Kepa, C. Majkrzak, Piotr Sankowski, P. Kacman and T. Giebultowicz, Neutron diffraction and reflectivity studies of Eu chalogenide based superlattices, Journal Of Alloys And Compounds 401 2005, p. 238–248.see in PBN
- Piotr Sankowski, Shortest Paths in Matrix Multiplication Time, Lecture Notes In Computer Science 3669 2005, p. 770–778.see in PBN
- Piotr Sankowski, Subquadratic Algorithm for Dynamic Shortest Distances, Lecture Notes In Computer Science 3595 2005, p. 461–470.see in PBN
- P. Van Dorpe, W. Van Roy, J. De Boeck, G. Borghs, Piotr Sankowski, P. Kacman, J. Majewski and T. Dietl, Voltage controlled spin injection in (Ga,Mn)As/(Al,Ga)As Zener diode, Physical Review B 72 2005, p. 205322.see in PBN
- Piotr Sankowski and P. Kacman, Interlayer Exchange Coupling in (Ga,Mn)As-based Superlattices, Physical Review B 71 2005, p. 201303.see in PBN
2004
- Henryk Kępa, Piotr Sankowski, Perła Kacman, A Sipatov, C Majkrzak and T Giebultowicz, Antiferromagnetic interlayer coupling in EuS/YbSe superlattices, Journal Of Magnetism And Magnetic Materials 272-276 (Part 1) 2004, p. 323–324.see in PBN
- Piotr Sankowski, Henryk Kępa, P Kacman, A Sipatov, C Majkrzak and T Giebultowicz, Interlayer coupling in EuS-based superlattices deduced from neutron scattering experiments, Acta Physica Polonica A 105 (6) 2004, p. 607–614.see in PBN
- Krzysztof Ciebiera and Piotr Sankowski, Improving Web Sites by Automatic Source Code Analysis and Modification, Lecture Notes In Computer Science 3140 2004, p. 579–580.see in PBN
- Marcin Mucha and Piotr Sankowski, Maximum Matchings in Planar Graphs via Gaussian Elimination, Lecture Notes In Computer Science 3221 2004, p. 532–543.see in PBN
- Marcin Mucha and Piotr Sankowski, Maximum Matchings via Gaussian Elimination, in: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, USA 2004.see in PBN
- Piotr Sankowski, Dynamic Transitive Closure via Dynamic Matrix Inverse, in: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, USA 2004.see in PBN
- P. Sankowski, H. Kępa, P. Kacman, A. Sipatov, C. Majkrzak and T. Giebultowicz, Interlayer Coupling in EuS-Based Superlattices Deduced from Neutron Scattering Experiments, Acta Physica Polonica A 105 2004, p. 607–614.see in PBN
2003
- Piotr Sankowski, Alternative Algorithm for Counting All Matchings in Graphs, Lecture Notes In Computer Science 2607 2003, p. 427–438.see in PBN
- Piotr Sankowski, Multisampling: a New Approach to Uniform Sampling and Approximate Counting, Lecture Notes In Computer Science 2832 2003, p. 740–751.see in PBN
- Piotr Sankowski and Perla Kacman, Interlayer Coupling in EuS-based Superlattices (Dependence on the Energy Structure of Non-magnetic Layer), Acta Physica Polonica A 103 (6) 2003, p. 621–628.see in PBN
- Krzysztof Ciebiera and Piotr Sankowski, Inteligentny system dopasowania struktury pasmowej dla modelu ciasnego wiązania, in: V Krajowa Konferencja Naukowa Inżynieria Wiedzy i Systemy Ekspertowe 2003, Wrocław 2003.see in PBN
- P. Sankowski and P. Kacman, Interlayer Coupling in EuS-Based Superlattices (Dependence on the Energy Structure of Non-Magnetic Layer), Acta Physica Polonica A 103 2003, p. 621–628.see in PBN
You are not logged in | log in
