var bibbase_data = {"data":"\n\n
\n\n \n\n \n\n \n\n \n \n\n \n\n\n\n
\n\n \n\n\n
\n \n\n Excellent! Next, you can embed this page using\n one of several \n options.\n
\n\n
\n \n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.
  4. \n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2017\n \n \n (19)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Contracting a Planar Graph Efficiently.\n \n\n\n \n Holm, J.; Italiano, G. F.; Karczmarz, A.; Lacki, J.; Rotenberg, E.; and Sankowski, P.\n \n\n\n \n\n\n\n In 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, pages 50:1--50:15, 2017. \n \n\n\n\n
\n\n\n \n \n \n \"ContractingPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/esa/HolmIKLRS17,\n  author    = {Jacob Holm and\n               Giuseppe F. Italiano and\n               Adam Karczmarz and\n               Jakub Lacki and\n               Eva Rotenberg and\n               Piotr Sankowski},\n  title     = {Contracting a Planar Graph Efficiently},\n  booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September\n               4-6, 2017, Vienna, Austria},\n  pages     = {50:1--50:15},\n  year      = {2017},\n  crossref  = {DBLP:conf/esa/2017},\n  url       = {https://doi.org/10.4230/LIPIcs.ESA.2017.50},\n  doi       = {10.4230/LIPIcs.ESA.2017.50},\n  timestamp = {Thu, 28 Sep 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/HolmIKLRS17},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Budget Feasible Mechanisms on Matroids.\n \n\n\n \n Leonardi, S.; Monaco, G.; Sankowski, P.; and Zhang, Q.\n \n\n\n \n\n\n\n In Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings, pages 368--379, 2017. \n \n\n\n\n
\n\n\n \n \n \n \"BudgetPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/ipco/LeonardiMSZ17,\n  author    = {Stefano Leonardi and\n               Gianpiero Monaco and\n               Piotr Sankowski and\n               Qiang Zhang},\n  title     = {Budget Feasible Mechanisms on Matroids},\n  booktitle = {Integer Programming and Combinatorial Optimization - 19th International\n               Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings},\n  pages     = {368--379},\n  year      = {2017},\n  crossref  = {DBLP:conf/ipco/2017},\n  url       = {https://doi.org/10.1007/978-3-319-59250-3_30},\n  doi       = {10.1007/978-3-319-59250-3_30},\n  timestamp = {Tue, 06 Jun 2017 17:32:10 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/ipco/LeonardiMSZ17},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (\\emphm\\(^\\mbox10/7\\) log \\emphW) Time (Extended Abstract).\n \n\n\n \n Cohen, M. B.; Madry, A.; Sankowski, P.; and Vladu, A.\n \n\n\n \n\n\n\n In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pages 752--771, 2017. \n \n\n\n\n
\n\n\n \n \n \n \"Negative-WeightPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/soda/CohenMSV17,\n  author    = {Michael B. Cohen and\n               Aleksander Madry and\n               Piotr Sankowski and\n               Adrian Vladu},\n  title     = {Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow\n               in {\\~{O}} (\\emph{m}\\({}^{\\mbox{10/7}}\\) log \\emph{W}) Time (Extended\n               Abstract)},\n  booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete\n               Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January\n               16-19},\n  pages     = {752--771},\n  year      = {2017},\n  crossref  = {DBLP:conf/soda/2017},\n  url       = {https://doi.org/10.1137/1.9781611974782.48},\n  doi       = {10.1137/1.9781611974782.48},\n  timestamp = {Wed, 24 May 2017 08:31:21 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/soda/CohenMSV17},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Improved Distance Queries and Cycle Counting by Frobenius Normal Form.\n \n\n\n \n Sankowski, P.; and Wegrzycki, K.\n \n\n\n \n\n\n\n In 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pages 56:1--56:14, 2017. \n \n\n\n\n
\n\n\n \n \n \n \"ImprovedPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/stacs/SankowskiW17,\n  author    = {Piotr Sankowski and\n               Karol Wegrzycki},\n  title     = {Improved Distance Queries and Cycle Counting by Frobenius Normal Form},\n  booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}\n               2017, March 8-11, 2017, Hannover, Germany},\n  pages     = {56:1--56:14},\n  year      = {2017},\n  crossref  = {DBLP:conf/stacs/2017},\n  url       = {https://doi.org/10.4230/LIPIcs.STACS.2017.56},\n  doi       = {10.4230/LIPIcs.STACS.2017.56},\n  timestamp = {Fri, 26 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/stacs/SankowskiW17},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Decremental single-source reachability in planar digraphs.\n \n\n\n \n Italiano, G. F.; Karczmarz, A.; Lacki, J.; and Sankowski, P.\n \n\n\n \n\n\n\n In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, pages 1108--1121, 2017. \n \n\n\n\n
\n\n\n \n \n \n \"DecrementalPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/stoc/ItalianoKLS17,\n  author    = {Giuseppe F. Italiano and\n               Adam Karczmarz and\n               Jakub Lacki and\n               Piotr Sankowski},\n  title     = {Decremental single-source reachability in planar digraphs},\n  booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory\n               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},\n  pages     = {1108--1121},\n  year      = {2017},\n  crossref  = {DBLP:conf/stoc/2017},\n  url       = {http://doi.acm.org/10.1145/3055399.3055480},\n  doi       = {10.1145/3055399.3055480},\n  timestamp = {Sat, 17 Jun 2017 18:46:21 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/stoc/ItalianoKLS17},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Why Do Cascade Sizes Follow a Power-Law?.\n \n\n\n \n Wegrzycki, K.; Sankowski, P.; Pacuk, A.; and Wygocki, P.\n \n\n\n \n\n\n\n In Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3-7, 2017, pages 569--576, 2017. \n \n\n\n\n
\n\n\n \n \n \n \"WhyPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/www/WegrzyckiSPW17,\n  author    = {Karol Wegrzycki and\n               Piotr Sankowski and\n               Andrzej Pacuk and\n               Piotr Wygocki},\n  title     = {Why Do Cascade Sizes Follow a Power-Law?},\n  booktitle = {Proceedings of the 26th International Conference on World Wide Web,\n               {WWW} 2017, Perth, Australia, April 3-7, 2017},\n  pages     = {569--576},\n  year      = {2017},\n  crossref  = {DBLP:conf/www/2017},\n  url       = {http://doi.acm.org/10.1145/3038912.3052565},\n  doi       = {10.1145/3038912.3052565},\n  timestamp = {Fri, 07 Apr 2017 08:18:14 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/www/WegrzyckiSPW17},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Why Do Cascade Sizes Follow a Power-Law?.\n \n\n\n \n Wegrzycki, K.; Sankowski, P.; Pacuk, A.; and Wygocki, P.\n \n\n\n \n\n\n\n CoRR, abs/1702.05913. 2017.\n \n\n\n\n
\n\n\n \n \n \n \"WhyPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/WegrzyckiSPW17,\n  author    = {Karol Wegrzycki and\n               Piotr Sankowski and\n               Andrzej Pacuk and\n               Piotr Wygocki},\n  title     = {Why Do Cascade Sizes Follow a Power-Law?},\n  journal   = {CoRR},\n  volume    = {abs/1702.05913},\n  year      = {2017},\n  url       = {http://arxiv.org/abs/1702.05913},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/WegrzyckiSPW17},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n The Shortest Augmenting Paths for Online Matchings on Trees.\n \n\n\n \n Bosek, B.; Leniowski, D.; Zych, A.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1704.02093. 2017.\n \n\n\n\n
\n\n\n \n \n \n \"ThePaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/BosekLZS17,\n  author    = {Bartlomiej Bosek and\n               Dariusz Leniowski and\n               Anna Zych and\n               Piotr Sankowski},\n  title     = {The Shortest Augmenting Paths for Online Matchings on Trees},\n  journal   = {CoRR},\n  volume    = {abs/1704.02093},\n  year      = {2017},\n  url       = {http://arxiv.org/abs/1704.02093},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/BosekLZS17},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Decremental Single-Source Reachability in Planar Digraphs.\n \n\n\n \n Italiano, G. F.; Karczmarz, A.; Lacki, J.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1705.11163. 2017.\n \n\n\n\n
\n\n\n \n \n \n \"DecrementalPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/ItalianoKLS17,\n  author    = {Giuseppe F. Italiano and\n               Adam Karczmarz and\n               Jakub Lacki and\n               Piotr Sankowski},\n  title     = {Decremental Single-Source Reachability in Planar Digraphs},\n  journal   = {CoRR},\n  volume    = {abs/1705.11163},\n  year      = {2017},\n  url       = {http://arxiv.org/abs/1705.11163},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/ItalianoKLS17},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Contracting a Planar Graph Efficiently.\n \n\n\n \n Holm, J.; Italiano, G. F.; Karczmarz, A.; Lacki, J.; Rotenberg, E.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1706.10228. 2017.\n \n\n\n\n
\n\n\n \n \n \n \"ContractingPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/HolmIKLRS17,\n  author    = {Jacob Holm and\n               Giuseppe F. Italiano and\n               Adam Karczmarz and\n               Jakub Lacki and\n               Eva Rotenberg and\n               Piotr Sankowski},\n  title     = {Contracting a Planar Graph Efficiently},\n  journal   = {CoRR},\n  volume    = {abs/1706.10228},\n  year      = {2017},\n  url       = {http://arxiv.org/abs/1706.10228},\n  timestamp = {Mon, 17 Jul 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/HolmIKLRS17},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Round Compression for Parallel Matching Algorithms.\n \n\n\n \n Czumaj, A.; Lacki, J.; Madry, A.; Mitrovic, S.; Onak, K.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1707.03478. 2017.\n \n\n\n\n
\n\n\n \n \n \n \"RoundPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/CzumajLMMOS17,\n  author    = {Artur Czumaj and\n               Jakub Lacki and\n               Aleksander Madry and\n               Slobodan Mitrovic and\n               Krzysztof Onak and\n               Piotr Sankowski},\n  title     = {Round Compression for Parallel Matching Algorithms},\n  journal   = {CoRR},\n  volume    = {abs/1707.03478},\n  year      = {2017},\n  url       = {http://arxiv.org/abs/1707.03478},\n  timestamp = {Sat, 05 Aug 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/CzumajLMMOS17},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Approximate nearest neighbors search without false negatives for l\\(_\\mbox2\\).\n \n\n\n \n Sankowski, P.; and Wygocki, P.\n \n\n\n \n\n\n\n CoRR, abs/1708.06395. 2017.\n \n\n\n\n
\n\n\n \n \n \n \"ApproximatePaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/abs-1708-06395,\n  author    = {Piotr Sankowski and\n               Piotr Wygocki},\n  title     = {Approximate nearest neighbors search without false negatives for l\\({}_{\\mbox{2}}\\)},\n  journal   = {CoRR},\n  volume    = {abs/1708.06395},\n  year      = {2017},\n  url       = {http://arxiv.org/abs/1708.06395},\n  timestamp = {Tue, 05 Sep 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1708-06395},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Planar Perfect Matching is in NC.\n \n\n\n \n Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1709.07869. 2017.\n \n\n\n\n
\n\n\n \n \n \n \"PlanarPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/abs-1709-07869,\n  author    = {Piotr Sankowski},\n  title     = {Planar Perfect Matching is in {NC}},\n  journal   = {CoRR},\n  volume    = {abs/1709.07869},\n  year      = {2017},\n  url       = {http://arxiv.org/abs/1709.07869},\n  timestamp = {Thu, 05 Oct 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1709-07869},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria.\n \n\n\n \n Pruhs, K.; and Sohler, C.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 87, of LIPIcs. 2017.Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.\n \n\n\n\n
\n\n\n \n \n \n \"25thPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/esa/2017,\n  editor    = {Kirk Pruhs and\n               Christian Sohler},\n  title     = {25th Annual European Symposium on Algorithms, {ESA} 2017, September\n               4-6, 2017, Vienna, Austria},\n  series    = {LIPIcs},\n  volume    = {87},\n  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},\n  year      = {2017},\n  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-049-1},\n  isbn      = {978-3-95977-049-1},\n  timestamp = {Wed, 27 Sep 2017 14:22:05 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/2017},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings.\n \n\n\n \n Eisenbrand, F.; and Könemann, J.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 10328, of Lecture Notes in Computer Science. 2017.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"IntegerPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/ipco/2017,\n  editor    = {Friedrich Eisenbrand and\n               Jochen K{\\"{o}}nemann},\n  title     = {Integer Programming and Combinatorial Optimization - 19th International\n               Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {10328},\n  publisher = {Springer},\n  year      = {2017},\n  url       = {https://doi.org/10.1007/978-3-319-59250-3},\n  doi       = {10.1007/978-3-319-59250-3},\n  isbn      = {978-3-319-59249-7},\n  timestamp = {Tue, 06 Jun 2017 17:32:10 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/ipco/2017},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19.\n \n\n\n \n Klein, P. N.\n , editor\n .\n \n\n\n \n\n\n\n 2017.SIAM.\n \n\n\n\n
\n\n\n \n \n \n \"ProceedingsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/soda/2017,\n  editor    = {Philip N. Klein},\n  title     = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete\n               Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January\n               16-19},\n  publisher = {{SIAM}},\n  year      = {2017},\n  url       = {https://doi.org/10.1137/1.9781611974782},\n  doi       = {10.1137/1.9781611974782},\n  isbn      = {978-1-61197-478-2},\n  timestamp = {Wed, 24 May 2017 08:31:21 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/soda/2017},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany.\n \n\n\n \n Vollmer, H.; and Vallée, B.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 66, of LIPIcs. 2017.Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.\n \n\n\n\n
\n\n\n \n \n \n \"34thPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/stacs/2017,\n  editor    = {Heribert Vollmer and\n               Brigitte Vall{\\'{e}}e},\n  title     = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}\n               2017, March 8-11, 2017, Hannover, Germany},\n  series    = {LIPIcs},\n  volume    = {66},\n  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},\n  year      = {2017},\n  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-028-6},\n  isbn      = {978-3-95977-028-6},\n  timestamp = {Mon, 20 Mar 2017 13:32:28 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/stacs/2017},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017.\n \n\n\n \n Hatami, H.; McKenzie, P.; and King, V.\n , editor\n s.\n \n\n\n \n\n\n\n 2017.ACM.\n \n\n\n\n
\n\n\n \n \n \n \"ProceedingsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/stoc/2017,\n  editor    = {Hamed Hatami and\n               Pierre McKenzie and\n               Valerie King},\n  title     = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory\n               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},\n  publisher = {{ACM}},\n  year      = {2017},\n  url       = {http://doi.acm.org/10.1145/3055399},\n  doi       = {10.1145/3055399},\n  isbn      = {978-1-4503-4528-6},\n  timestamp = {Sat, 17 Jun 2017 18:46:21 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/stoc/2017},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the 26th International Conference on World Wide Web, WWW 2017, Perth, Australia, April 3-7, 2017.\n \n\n\n \n Barrett, R.; Cummings, R.; Agichtein, E.; and Gabrilovich, E.\n , editor\n s.\n \n\n\n \n\n\n\n 2017.ACM.\n \n\n\n\n
\n\n\n \n \n \n \"ProceedingsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/www/2017,\n  editor    = {Rick Barrett and\n               Rick Cummings and\n               Eugene Agichtein and\n               Evgeniy Gabrilovich},\n  title     = {Proceedings of the 26th International Conference on World Wide Web,\n               {WWW} 2017, Perth, Australia, April 3-7, 2017},\n  publisher = {{ACM}},\n  year      = {2017},\n  url       = {http://doi.acm.org/10.1145/3038912},\n  doi       = {10.1145/3038912},\n  isbn      = {978-1-4503-4913-0},\n  timestamp = {Fri, 07 Apr 2017 08:18:14 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/www/2017},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (19)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Online Network Design with Outliers.\n \n\n\n \n Anagnostopoulos, A.; Grandoni, F.; Leonardi, S.; and Sankowski, P.\n \n\n\n \n\n\n\n Algorithmica, 76(1): 88--109. 2016.\n \n\n\n\n
\n\n\n \n \n \n \"OnlinePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/algorithmica/Anagnostopoulos16,\n  author    = {Aris Anagnostopoulos and\n               Fabrizio Grandoni and\n               Stefano Leonardi and\n               Piotr Sankowski},\n  title     = {Online Network Design with Outliers},\n  journal   = {Algorithmica},\n  volume    = {76},\n  number    = {1},\n  pages     = {88--109},\n  year      = {2016},\n  url       = {https://doi.org/10.1007/s00453-015-0021-y},\n  doi       = {10.1007/s00453-015-0021-y},\n  timestamp = {Wed, 17 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/algorithmica/Anagnostopoulos16},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Locality-Sensitive Hashing Without False Negatives for l_p.\n \n\n\n \n Pacuk, A.; Sankowski, P.; Wegrzycki, K.; and Wygocki, P.\n \n\n\n \n\n\n\n In Computing and Combinatorics - 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings, pages 105--118, 2016. \n \n\n\n\n
\n\n\n \n \n \n \"Locality-SensitivePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/cocoon/PacukSWW16,\n  author    = {Andrzej Pacuk and\n               Piotr Sankowski and\n               Karol Wegrzycki and\n               Piotr Wygocki},\n  title     = {Locality-Sensitive Hashing Without False Negatives for l{\\_}p},\n  booktitle = {Computing and Combinatorics - 22nd International Conference, {COCOON}\n               2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings},\n  pages     = {105--118},\n  year      = {2016},\n  crossref  = {DBLP:conf/cocoon/2016},\n  url       = {https://doi.org/10.1007/978-3-319-42634-1_9},\n  doi       = {10.1007/978-3-319-42634-1_9},\n  timestamp = {Tue, 23 May 2017 01:10:56 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/cocoon/PacukSWW16},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Network Elicitation in Adversarial Environment.\n \n\n\n \n Dziubinski, M.; Sankowski, P.; and Zhang, Q.\n \n\n\n \n\n\n\n In Decision and Game Theory for Security - 7th International Conference, GameSec 2016, New York, NY, USA, November 2-4, 2016, Proceedings, pages 397--414, 2016. \n \n\n\n\n
\n\n\n \n \n \n \"NetworkPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/gamesec/DziubinskiSZ16,\n  author    = {Marcin Dziubinski and\n               Piotr Sankowski and\n               Qiang Zhang},\n  title     = {Network Elicitation in Adversarial Environment},\n  booktitle = {Decision and Game Theory for Security - 7th International Conference,\n               GameSec 2016, New York, NY, USA, November 2-4, 2016, Proceedings},\n  pages     = {397--414},\n  year      = {2016},\n  crossref  = {DBLP:conf/gamesec/2016},\n  url       = {https://doi.org/10.1007/978-3-319-47413-7_23},\n  doi       = {10.1007/978-3-319-47413-7_23},\n  timestamp = {Tue, 23 May 2017 01:06:26 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/gamesec/DziubinskiSZ16},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n There is Something Beyond the Twitter Network.\n \n\n\n \n Pacuk, A.; Sankowski, P.; Wegrzycki, K.; and Wygocki, P.\n \n\n\n \n\n\n\n In Proceedings of the 27th ACM Conference on Hypertext and Social Media, HT 2016, Halifax, NS, Canada, July 10-13, 2016, pages 279--284, 2016. \n \n\n\n\n
\n\n\n \n \n \n \"TherePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/ht/PacukSWW16,\n  author    = {Andrzej Pacuk and\n               Piotr Sankowski and\n               Karol Wegrzycki and\n               Piotr Wygocki},\n  title     = {There is Something Beyond the Twitter Network},\n  booktitle = {Proceedings of the 27th {ACM} Conference on Hypertext and Social Media,\n               {HT} 2016, Halifax, NS, Canada, July 10-13, 2016},\n  pages     = {279--284},\n  year      = {2016},\n  crossref  = {DBLP:conf/ht/2016},\n  url       = {http://doi.acm.org/10.1145/2914586.2914623},\n  doi       = {10.1145/2914586.2914623},\n  timestamp = {Sun, 10 Jul 2016 18:08:22 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/ht/PacukSWW16},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting.\n \n\n\n \n Pacuk, A.; Sankowski, P.; Wegrzycki, K.; Witkowski, A.; and Wygocki, P.\n \n\n\n \n\n\n\n In Proceedings of the 2016 Recommender Systems Challenge, RecSys Challenge 2016, Boston, Massachusetts, USA, September 15, 2016, pages 10:1--10:4, 2016. \n \n\n\n\n
\n\n\n \n \n \n \"RecSysPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/recsys/PacukSWWW16,\n  author    = {Andrzej Pacuk and\n               Piotr Sankowski and\n               Karol Wegrzycki and\n               Adam Witkowski and\n               Piotr Wygocki},\n  title     = {RecSys Challenge 2016: job recommendations based on preselection of\n               offers and gradient boosting},\n  booktitle = {Proceedings of the 2016 Recommender Systems Challenge, RecSys Challenge\n               2016, Boston, Massachusetts, USA, September 15, 2016},\n  pages     = {10:1--10:4},\n  year      = {2016},\n  crossref  = {DBLP:conf/recsys/2016challenge},\n  url       = {http://doi.acm.org/10.1145/2987538.2987544},\n  doi       = {10.1145/2987538.2987544},\n  timestamp = {Fri, 06 Jan 2017 08:36:39 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/recsys/PacukSWWW16},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Online Pricing with Impatient Bidders.\n \n\n\n \n Cygan, M.; Mucha, M.; Sankowski, P.; and Zhang, Q.\n \n\n\n \n\n\n\n In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 190--201, 2016. \n \n\n\n\n
\n\n\n \n \n \n \"OnlinePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/soda/CyganMSZ16,\n  author    = {Marek Cygan and\n               Marcin Mucha and\n               Piotr Sankowski and\n               Qiang Zhang},\n  title     = {Online Pricing with Impatient Bidders},\n  booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete\n               Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},\n  pages     = {190--201},\n  year      = {2016},\n  crossref  = {DBLP:conf/soda/2016},\n  url       = {https://doi.org/10.1137/1.9781611974331.ch15},\n  doi       = {10.1137/1.9781611974331.ch15},\n  timestamp = {Wed, 24 May 2017 08:31:21 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/soda/CyganMSZ16},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algorithmic Complexity of Power Law Networks.\n \n\n\n \n Brach, P.; Cygan, M.; Lacki, J.; and Sankowski, P.\n \n\n\n \n\n\n\n In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1306--1325, 2016. \n \n\n\n\n
\n\n\n \n \n \n \"AlgorithmicPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/soda/BrachCLS16,\n  author    = {Pawel Brach and\n               Marek Cygan and\n               Jakub Lacki and\n               Piotr Sankowski},\n  title     = {Algorithmic Complexity of Power Law Networks},\n  booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete\n               Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},\n  pages     = {1306--1325},\n  year      = {2016},\n  crossref  = {DBLP:conf/soda/2016},\n  url       = {https://doi.org/10.1137/1.9781611974331.ch91},\n  doi       = {10.1137/1.9781611974331.ch91},\n  timestamp = {Wed, 24 May 2017 08:31:21 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/soda/BrachCLS16},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark.\n \n\n\n \n Sankowski, P.; and Zaroliagis, C. D.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 57, of LIPIcs. 2016.Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.\n \n\n\n\n
\n\n\n \n \n \n \"24thPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/esa/2016,\n  editor    = {Piotr Sankowski and\n               Christos D. Zaroliagis},\n  title     = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,\n               2016, Aarhus, Denmark},\n  series    = {LIPIcs},\n  volume    = {57},\n  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},\n  year      = {2016},\n  url       = {http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=16013},\n  isbn      = {978-3-95977-015-6},\n  timestamp = {Tue, 30 Aug 2016 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/2016},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m\\(^\\mbox10/7\\) log W) Time.\n \n\n\n \n Cohen, M. B.; Madry, A.; Sankowski, P.; and Vladu, A.\n \n\n\n \n\n\n\n CoRR, abs/1605.01717. 2016.\n \n\n\n\n
\n\n\n \n \n \n \"Negative-WeightPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/CohenMSV16,\n  author    = {Michael B. Cohen and\n               Aleksander Madry and\n               Piotr Sankowski and\n               Adrian Vladu},\n  title     = {Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow\n               in {\\~{O}}(m\\({}^{\\mbox{10/7}}\\) log {W)} Time},\n  journal   = {CoRR},\n  volume    = {abs/1605.01717},\n  year      = {2016},\n  url       = {http://arxiv.org/abs/1605.01717},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/CohenMSV16},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Improved Distance Queries and Cycle Counting by Frobenius Normal Form.\n \n\n\n \n Sankowski, P.; and Wegrzycki, K.\n \n\n\n \n\n\n\n CoRR, abs/1611.03789. 2016.\n \n\n\n\n
\n\n\n \n \n \n \"ImprovedPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/SankowskiW16,\n  author    = {Piotr Sankowski and\n               Karol Wegrzycki},\n  title     = {Improved Distance Queries and Cycle Counting by Frobenius Normal Form},\n  journal   = {CoRR},\n  volume    = {abs/1611.03789},\n  year      = {2016},\n  url       = {http://arxiv.org/abs/1611.03789},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/SankowskiW16},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Locality-Sensitive Hashing without False Negatives for l_p.\n \n\n\n \n Pacuk, A.; Sankowski, P.; Wegrzycki, K.; and Wygocki, P.\n \n\n\n \n\n\n\n CoRR, abs/1611.09317. 2016.\n \n\n\n\n
\n\n\n \n \n \n \"Locality-SensitivePaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/PacukSWW16,\n  author    = {Andrzej Pacuk and\n               Piotr Sankowski and\n               Karol Wegrzycki and\n               Piotr Wygocki},\n  title     = {Locality-Sensitive Hashing without False Negatives for l{\\_}p},\n  journal   = {CoRR},\n  volume    = {abs/1611.09317},\n  year      = {2016},\n  url       = {http://arxiv.org/abs/1611.09317},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/PacukSWW16},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n There is Something Beyond the Twitter Network.\n \n\n\n \n Pacuk, A.; Sankowski, P.; Wegrzycki, K.; and Wygocki, P.\n \n\n\n \n\n\n\n CoRR, abs/1611.09387. 2016.\n \n\n\n\n
\n\n\n \n \n \n \"TherePaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/PacukSWW16a,\n  author    = {Andrzej Pacuk and\n               Piotr Sankowski and\n               Karol Wegrzycki and\n               Piotr Wygocki},\n  title     = {There is Something Beyond the Twitter Network},\n  journal   = {CoRR},\n  volume    = {abs/1611.09387},\n  year      = {2016},\n  url       = {http://arxiv.org/abs/1611.09387},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/PacukSWW16a},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting.\n \n\n\n \n Pacuk, A.; Sankowski, P.; Wegrzycki, K.; Witkowski, A.; and Wygocki, P.\n \n\n\n \n\n\n\n CoRR, abs/1612.00959. 2016.\n \n\n\n\n
\n\n\n \n \n \n \"RecSysPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/PacukSWWW16,\n  author    = {Andrzej Pacuk and\n               Piotr Sankowski and\n               Karol Wegrzycki and\n               Adam Witkowski and\n               Piotr Wygocki},\n  title     = {RecSys Challenge 2016: job recommendations based on preselection of\n               offers and gradient boosting},\n  journal   = {CoRR},\n  volume    = {abs/1612.00959},\n  year      = {2016},\n  url       = {http://arxiv.org/abs/1612.00959},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/PacukSWWW16},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Budget Feasible Mechanisms on Matroids.\n \n\n\n \n Leonardi, S.; Monaco, G.; Sankowski, P.; and Zhang, Q.\n \n\n\n \n\n\n\n CoRR, abs/1612.03150. 2016.\n \n\n\n\n
\n\n\n \n \n \n \"BudgetPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/LeonardiMSZ16,\n  author    = {Stefano Leonardi and\n               Gianpiero Monaco and\n               Piotr Sankowski and\n               Qiang Zhang},\n  title     = {Budget Feasible Mechanisms on Matroids},\n  journal   = {CoRR},\n  volume    = {abs/1612.03150},\n  year      = {2016},\n  url       = {http://arxiv.org/abs/1612.03150},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/LeonardiMSZ16},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Computing and Combinatorics - 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings.\n \n\n\n \n Dinh, T. N.; and Thai, M. T.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 9797, of Lecture Notes in Computer Science. 2016.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"ComputingPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/cocoon/2016,\n  editor    = {Thang N. Dinh and\n               My T. Thai},\n  title     = {Computing and Combinatorics - 22nd International Conference, {COCOON}\n               2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {9797},\n  publisher = {Springer},\n  year      = {2016},\n  url       = {https://doi.org/10.1007/978-3-319-42634-1},\n  doi       = {10.1007/978-3-319-42634-1},\n  isbn      = {978-3-319-42633-4},\n  timestamp = {Tue, 23 May 2017 01:10:56 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/cocoon/2016},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Decision and Game Theory for Security - 7th International Conference, GameSec 2016, New York, NY, USA, November 2-4, 2016, Proceedings.\n \n\n\n \n Zhu, Q.; Alpcan, T.; Panaousis, E. A.; Tambe, M.; and Casey, W.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 9996, of Lecture Notes in Computer Science. 2016.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"DecisionPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/gamesec/2016,\n  editor    = {Quanyan Zhu and\n               Tansu Alpcan and\n               Emmanouil A. Panaousis and\n               Milind Tambe and\n               William Casey},\n  title     = {Decision and Game Theory for Security - 7th International Conference,\n               GameSec 2016, New York, NY, USA, November 2-4, 2016, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {9996},\n  publisher = {Springer},\n  year      = {2016},\n  url       = {https://doi.org/10.1007/978-3-319-47413-7},\n  doi       = {10.1007/978-3-319-47413-7},\n  isbn      = {978-3-319-47412-0},\n  timestamp = {Tue, 23 May 2017 01:06:26 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/gamesec/2016},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the 27th ACM Conference on Hypertext and Social Media, HT 2016, Halifax, NS, Canada, July 10-13, 2016.\n \n\n\n \n Blustein, J.; Herder, E.; Rubart, J.; and Ashman, H.\n , editor\n s.\n \n\n\n \n\n\n\n 2016.ACM.\n \n\n\n\n
\n\n\n \n \n \n \"ProceedingsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/ht/2016,\n  editor    = {Jamie Blustein and\n               Eelco Herder and\n               Jessica Rubart and\n               Helen Ashman},\n  title     = {Proceedings of the 27th {ACM} Conference on Hypertext and Social Media,\n               {HT} 2016, Halifax, NS, Canada, July 10-13, 2016},\n  publisher = {{ACM}},\n  year      = {2016},\n  url       = {http://doi.acm.org/10.1145/2914586},\n  doi       = {10.1145/2914586},\n  isbn      = {978-1-4503-4247-6},\n  timestamp = {Sun, 10 Jul 2016 18:08:22 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/ht/2016},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the 2016 Recommender Systems Challenge, RecSys Challenge 2016, Boston, Massachusetts, USA, September 15, 2016.\n \n\n\n \n Abel, F.; Benczúr, A. A.; Kohlsdorf, D.; Larson, M.; and Pálovics, R.\n , editor\n s.\n \n\n\n \n\n\n\n 2016.ACM.\n \n\n\n\n
\n\n\n \n \n \n \"ProceedingsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/recsys/2016challenge,\n  editor    = {Fabian Abel and\n               Andr{\\'{a}}s A. Bencz{\\'{u}}r and\n               Daniel Kohlsdorf and\n               Martha Larson and\n               R{\\'{o}}bert P{\\'{a}}lovics},\n  title     = {Proceedings of the 2016 Recommender Systems Challenge, RecSys Challenge\n               2016, Boston, Massachusetts, USA, September 15, 2016},\n  publisher = {{ACM}},\n  year      = {2016},\n  url       = {http://doi.acm.org/10.1145/2987538},\n  doi       = {10.1145/2987538},\n  isbn      = {978-1-4503-4801-0},\n  timestamp = {Fri, 06 Jan 2017 08:36:39 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/recsys/2016challenge},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016.\n \n\n\n \n Krauthgamer, R.\n , editor\n .\n \n\n\n \n\n\n\n 2016.SIAM.\n \n\n\n\n
\n\n\n \n \n \n \"ProceedingsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/soda/2016,\n  editor    = {Robert Krauthgamer},\n  title     = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete\n               Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},\n  publisher = {{SIAM}},\n  year      = {2016},\n  url       = {https://doi.org/10.1137/1.9781611974331},\n  doi       = {10.1137/1.9781611974331},\n  isbn      = {978-1-61197-433-1},\n  timestamp = {Wed, 24 May 2017 08:31:21 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/soda/2016},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (16)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings.\n \n\n\n \n Cygan, M.; Gabow, H. N.; and Sankowski, P.\n \n\n\n \n\n\n\n J. ACM, 62(4): 28:1--28:30. 2015.\n \n\n\n\n
\n\n\n \n \n \n \"AlgorithmicPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/jacm/CyganGS15,\n  author    = {Marek Cygan and\n               Harold N. Gabow and\n               Piotr Sankowski},\n  title     = {Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles,\n               Diameter, and Matchings},\n  journal   = {J. {ACM}},\n  volume    = {62},\n  number    = {4},\n  pages     = {28:1--28:30},\n  year      = {2015},\n  url       = {http://doi.acm.org/10.1145/2736283},\n  doi       = {10.1145/2736283},\n  timestamp = {Fri, 09 Dec 2016 00:00:00 +0100},\n  biburl    = {http://dblp.org/rec/bib/journals/jacm/CyganGS15},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Min \\emphst-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.\n \n\n\n \n Borradaile, G.; Sankowski, P.; and Wulff-Nilsen, C.\n \n\n\n \n\n\n\n ACM Trans. Algorithms, 11(3): 16:1--16:29. 2015.\n \n\n\n\n
\n\n\n \n \n \n \"MinPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/talg/BorradaileSW15,\n  author    = {Glencora Borradaile and\n               Piotr Sankowski and\n               Christian Wulff{-}Nilsen},\n  title     = {Min \\emph{st}-Cut Oracle for Planar Graphs with Near-Linear Preprocessing\n               Time},\n  journal   = {{ACM} Trans. Algorithms},\n  volume    = {11},\n  number    = {3},\n  pages     = {16:1--16:29},\n  year      = {2015},\n  url       = {http://doi.acm.org/10.1145/2684068},\n  doi       = {10.1145/2684068},\n  timestamp = {Wed, 09 Mar 2016 00:00:00 +0100},\n  biburl    = {http://dblp.org/rec/bib/journals/talg/BorradaileSW15},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n The ring design game with fair cost allocation.\n \n\n\n \n Fanelli, A.; Leniowski, D.; Monaco, G.; and Sankowski, P.\n \n\n\n \n\n\n\n Theor. Comput. Sci., 562: 90--100. 2015.\n \n\n\n\n
\n\n\n \n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/tcs/FanelliLMS15,\n  author    = {Angelo Fanelli and\n               Dariusz Leniowski and\n               Gianpiero Monaco and\n               Piotr Sankowski},\n  title     = {The ring design game with fair cost allocation},\n  journal   = {Theor. Comput. Sci.},\n  volume    = {562},\n  pages     = {90--100},\n  year      = {2015},\n  url       = {https://doi.org/10.1016/j.tcs.2014.09.035},\n  doi       = {10.1016/j.tcs.2014.09.035},\n  timestamp = {Sun, 28 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/tcs/FanelliLMS15},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Stochastic Query Covering for Fast Approximate Document Retrieval.\n \n\n\n \n Anagnostopoulos, A.; Becchetti, L.; Bordino, I.; Leonardi, S.; Mele, I.; and Sankowski, P.\n \n\n\n \n\n\n\n ACM Trans. Inf. Syst., 33(3): 11:1--11:35. 2015.\n \n\n\n\n
\n\n\n \n \n \n \"StochasticPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/tois/Anagnostopoulos15,\n  author    = {Aris Anagnostopoulos and\n               Luca Becchetti and\n               Ilaria Bordino and\n               Stefano Leonardi and\n               Ida Mele and\n               Piotr Sankowski},\n  title     = {Stochastic Query Covering for Fast Approximate Document Retrieval},\n  journal   = {{ACM} Trans. Inf. Syst.},\n  volume    = {33},\n  number    = {3},\n  pages     = {11:1--11:35},\n  year      = {2015},\n  url       = {http://doi.acm.org/10.1145/2699671},\n  doi       = {10.1145/2699671},\n  timestamp = {Mon, 20 Apr 2015 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/tois/Anagnostopoulos15},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Revenue Maximization Envy-Free Pricing for Homogeneous Resources.\n \n\n\n \n Monaco, G.; Sankowski, P.; and Zhang, Q.\n \n\n\n \n\n\n\n In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 90--96, 2015. \n \n\n\n\n
\n\n\n \n \n \n \"RevenuePaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/ijcai/MonacoSZ15,\n  author    = {Gianpiero Monaco and\n               Piotr Sankowski and\n               Qiang Zhang},\n  title     = {Revenue Maximization Envy-Free Pricing for Homogeneous Resources},\n  booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on\n               Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July\n               25-31, 2015},\n  pages     = {90--96},\n  year      = {2015},\n  crossref  = {DBLP:conf/ijcai/2015},\n  url       = {http://ijcai.org/Abstract/15/020},\n  timestamp = {Wed, 20 Jul 2016 15:18:06 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/ijcai/MonacoSZ15},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Online Bipartite Matching in Offline Time (Abstract).\n \n\n\n \n Sankowski, P.\n \n\n\n \n\n\n\n In SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015. Proceedings, pages 45, 2015. \n \n\n\n\n
\n\n\n \n \n \n \"OnlinePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/sofsem/Sankowski15,\n  author    = {Piotr Sankowski},\n  title     = {Online Bipartite Matching in Offline Time (Abstract)},\n  booktitle = {{SOFSEM} 2015: Theory and Practice of Computer Science - 41st International\n               Conference on Current Trends in Theory and Practice of Computer Science,\n               Pec pod Sn{\\v{e}}{\\v{z}}kou, Czech Republic, January 24-29, 2015.\n               Proceedings},\n  pages     = {45},\n  year      = {2015},\n  crossref  = {DBLP:conf/sofsem/2015},\n  url       = {https://doi.org/10.1007/978-3-662-46078-8_4},\n  doi       = {10.1007/978-3-662-46078-8_4},\n  timestamp = {Thu, 15 Jun 2017 21:37:45 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/sofsem/Sankowski15},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Optimal Decremental Connectivity in Planar Graphs.\n \n\n\n \n Lacki, J.; and Sankowski, P.\n \n\n\n \n\n\n\n In 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany, pages 608--621, 2015. \n \n\n\n\n
\n\n\n \n \n \n \"OptimalPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/stacs/LackiS15,\n  author    = {Jakub Lacki and\n               Piotr Sankowski},\n  title     = {Optimal Decremental Connectivity in Planar Graphs},\n  booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,\n               {STACS} 2015, March 4-7, 2015, Garching, Germany},\n  pages     = {608--621},\n  year      = {2015},\n  crossref  = {DBLP:conf/stacs/2015},\n  url       = {https://doi.org/10.4230/LIPIcs.STACS.2015.608},\n  doi       = {10.4230/LIPIcs.STACS.2015.608},\n  timestamp = {Fri, 26 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/stacs/LackiS15},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree.\n \n\n\n \n Lacki, J.; Ocwieja, J.; Pilipczuk, M.; Sankowski, P.; and Zych, A.\n \n\n\n \n\n\n\n In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pages 11--20, 2015. \n \n\n\n\n
\n\n\n \n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/stoc/LackiOPSZ15,\n  author    = {Jakub Lacki and\n               Jakub Ocwieja and\n               Marcin Pilipczuk and\n               Piotr Sankowski and\n               Anna Zych},\n  title     = {The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms\n               for the Steiner Tree},\n  booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory\n               of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},\n  pages     = {11--20},\n  year      = {2015},\n  crossref  = {DBLP:conf/stoc/2015},\n  url       = {http://doi.acm.org/10.1145/2746539.2746615},\n  doi       = {10.1145/2746539.2746615},\n  timestamp = {Wed, 10 Jun 2015 17:10:14 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/stoc/LackiOPSZ15},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Shortest Augmenting Paths for Online Matchings on Trees.\n \n\n\n \n Bosek, B.; Leniowski, D.; Sankowski, P.; and Zych, A.\n \n\n\n \n\n\n\n In Approximation and Online Algorithms - 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers, pages 59--71, 2015. \n \n\n\n\n
\n\n\n \n \n \n \"ShortestPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/waoa/BosekLSZ15,\n  author    = {Bartlomiej Bosek and\n               Dariusz Leniowski and\n               Piotr Sankowski and\n               Anna Zych},\n  title     = {Shortest Augmenting Paths for Online Matchings on Trees},\n  booktitle = {Approximation and Online Algorithms - 13th International Workshop,\n               {WAOA} 2015, Patras, Greece, September 17-18, 2015. Revised Selected\n               Papers},\n  pages     = {59--71},\n  year      = {2015},\n  crossref  = {DBLP:conf/waoa/2015},\n  url       = {https://doi.org/10.1007/978-3-319-28684-6_6},\n  doi       = {10.1007/978-3-319-28684-6_6},\n  timestamp = {Fri, 26 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/waoa/BosekLSZ15},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algorithmic Complexity of Power Law Networks.\n \n\n\n \n Brach, P.; Cygan, M.; Lacki, J.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1507.02426. 2015.\n \n\n\n\n
\n\n\n \n \n \n \"AlgorithmicPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/BrachCLS15,\n  author    = {Pawel Brach and\n               Marek Cygan and\n               Jakub Lacki and\n               Piotr Sankowski},\n  title     = {Algorithmic Complexity of Power Law Networks},\n  journal   = {CoRR},\n  volume    = {abs/1507.02426},\n  year      = {2015},\n  url       = {http://arxiv.org/abs/1507.02426},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/BrachCLS15},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Optimal Dynamic Strings.\n \n\n\n \n Gawrychowski, P.; Karczmarz, A.; Kociumaka, T.; Lacki, J.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1511.02612. 2015.\n \n\n\n\n
\n\n\n \n \n \n \"OptimalPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/GawrychowskiKKL15,\n  author    = {Pawel Gawrychowski and\n               Adam Karczmarz and\n               Tomasz Kociumaka and\n               Jakub Lacki and\n               Piotr Sankowski},\n  title     = {Optimal Dynamic Strings},\n  journal   = {CoRR},\n  volume    = {abs/1511.02612},\n  year      = {2015},\n  url       = {http://arxiv.org/abs/1511.02612},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/GawrychowskiKKL15},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015.\n \n\n\n \n Yang, Q.; and Wooldridge, M.\n , editor\n s.\n \n\n\n \n\n\n\n 2015.AAAI Press.\n \n\n\n\n
\n\n\n \n \n \n \"ProceedingsPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/ijcai/2015,\n  editor    = {Qiang Yang and\n               Michael Wooldridge},\n  title     = {Proceedings of the Twenty-Fourth International Joint Conference on\n               Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July\n               25-31, 2015},\n  publisher = {{AAAI} Press},\n  year      = {2015},\n  url       = {http://ijcai.org/proceedings/2015},\n  isbn      = {978-1-57735-738-4},\n  timestamp = {Wed, 20 Jul 2016 15:18:06 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/ijcai/2015},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24-29, 2015. Proceedings.\n \n\n\n \n Italiano, G. F.; Margaria-Steffen, T.; Pokorný, J.; Quisquater, J.; and Wattenhofer, R.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 8939, of Lecture Notes in Computer Science. 2015.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"SOFSEMPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/sofsem/2015,\n  editor    = {Giuseppe F. Italiano and\n               Tiziana Margaria{-}Steffen and\n               Jaroslav Pokorn{\\'{y}} and\n               Jean{-}Jacques Quisquater and\n               Roger Wattenhofer},\n  title     = {{SOFSEM} 2015: Theory and Practice of Computer Science - 41st International\n               Conference on Current Trends in Theory and Practice of Computer Science,\n               Pec pod Sn{\\v{e}}{\\v{z}}kou, Czech Republic, January 24-29, 2015.\n               Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {8939},\n  publisher = {Springer},\n  year      = {2015},\n  url       = {https://doi.org/10.1007/978-3-662-46078-8},\n  doi       = {10.1007/978-3-662-46078-8},\n  isbn      = {978-3-662-46077-1},\n  timestamp = {Thu, 15 Jun 2017 21:37:45 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/sofsem/2015},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany.\n \n\n\n \n Mayr, E. W.; and Ollinger, N.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 30, of LIPIcs. 2015.Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.\n \n\n\n\n
\n\n\n \n \n \n \"32ndPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/stacs/2015,\n  editor    = {Ernst W. Mayr and\n               Nicolas Ollinger},\n  title     = {32nd International Symposium on Theoretical Aspects of Computer Science,\n               {STACS} 2015, March 4-7, 2015, Garching, Germany},\n  series    = {LIPIcs},\n  volume    = {30},\n  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},\n  year      = {2015},\n  url       = {http://www.dagstuhl.de/dagpub/978-3-939897-78-1},\n  isbn      = {978-3-939897-78-1},\n  timestamp = {Mon, 09 Mar 2015 12:14:01 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/stacs/2015},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015.\n \n\n\n \n Servedio, R. A.; and Rubinfeld, R.\n , editor\n s.\n \n\n\n \n\n\n\n 2015.ACM.\n \n\n\n\n
\n\n\n \n \n \n \"ProceedingsPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/stoc/2015,\n  editor    = {Rocco A. Servedio and\n               Ronitt Rubinfeld},\n  title     = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory\n               of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},\n  publisher = {{ACM}},\n  year      = {2015},\n  url       = {http://dl.acm.org/citation.cfm?id=2746539},\n  isbn      = {978-1-4503-3536-2},\n  timestamp = {Wed, 10 Jun 2015 17:10:14 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/stoc/2015},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Approximation and Online Algorithms - 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers.\n \n\n\n \n Sanità, L.; and Skutella, M.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 9499, of Lecture Notes in Computer Science. 2015.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"ApproximationPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/waoa/2015,\n  editor    = {Laura Sanit{\\`{a}} and\n               Martin Skutella},\n  title     = {Approximation and Online Algorithms - 13th International Workshop,\n               {WAOA} 2015, Patras, Greece, September 17-18, 2015. Revised Selected\n               Papers},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {9499},\n  publisher = {Springer},\n  year      = {2015},\n  url       = {https://doi.org/10.1007/978-3-319-28684-6},\n  doi       = {10.1007/978-3-319-28684-6},\n  isbn      = {978-3-319-28683-9},\n  timestamp = {Fri, 26 May 2017 00:49:32 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/waoa/2015},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (14)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Spreading rumours without the network.\n \n\n\n \n Brach, P.; Epasto, A.; Panconesi, A.; and Sankowski, P.\n \n\n\n \n\n\n\n In Proceedings of the second ACM conference on Online social networks, COSN 2014, Dublin, Ireland, October 1-2, 2014, pages 107--118, 2014. \n \n\n\n\n
\n\n\n \n \n \n \"SpreadingPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/cosn/BrachEPS14,\n  author    = {Pawel Brach and\n               Alessandro Epasto and\n               Alessandro Panconesi and\n               Piotr Sankowski},\n  title     = {Spreading rumours without the network},\n  booktitle = {Proceedings of the second {ACM} conference on Online social networks,\n               {COSN} 2014, Dublin, Ireland, October 1-2, 2014},\n  pages     = {107--118},\n  year      = {2014},\n  crossref  = {DBLP:conf/cosn/2014},\n  url       = {http://doi.acm.org/10.1145/2660460.2660472},\n  doi       = {10.1145/2660460.2660472},\n  timestamp = {Wed, 25 Mar 2015 09:44:43 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/cosn/BrachEPS14},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs.\n \n\n\n \n Pilipczuk, M.; Pilipczuk, M.; Sankowski, P.; and van Leeuwen, E. J.\n \n\n\n \n\n\n\n In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pages 276--285, 2014. \n \n\n\n\n
\n\n\n \n \n \n \"NetworkPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/focs/PilipczukPSL14,\n  author    = {Marcin Pilipczuk and\n               Michal Pilipczuk and\n               Piotr Sankowski and\n               Erik Jan van Leeuwen},\n  title     = {Network Sparsification for Steiner Problems on Planar and Bounded-Genus\n               Graphs},\n  booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}\n               2014, Philadelphia, PA, USA, October 18-21, 2014},\n  pages     = {276--285},\n  year      = {2014},\n  crossref  = {DBLP:conf/focs/2014},\n  url       = {https://doi.org/10.1109/FOCS.2014.37},\n  doi       = {10.1109/FOCS.2014.37},\n  timestamp = {Fri, 19 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/PilipczukPSL14},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Online Bipartite Matching in Offline Time.\n \n\n\n \n Bosek, B.; Leniowski, D.; Sankowski, P.; and Zych, A.\n \n\n\n \n\n\n\n In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pages 384--393, 2014. \n \n\n\n\n
\n\n\n \n \n \n \"OnlinePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/focs/BosekLSZ14,\n  author    = {Bartlomiej Bosek and\n               Dariusz Leniowski and\n               Piotr Sankowski and\n               Anna Zych},\n  title     = {Online Bipartite Matching in Offline Time},\n  booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}\n               2014, Philadelphia, PA, USA, October 18-21, 2014},\n  pages     = {384--393},\n  year      = {2014},\n  crossref  = {DBLP:conf/focs/2014},\n  url       = {https://doi.org/10.1109/FOCS.2014.48},\n  doi       = {10.1109/FOCS.2014.48},\n  timestamp = {Fri, 19 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/BosekLSZ14},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching.\n \n\n\n \n Adamczyk, M.; Sankowski, P.; and Zhang, Q.\n \n\n\n \n\n\n\n In Algorithmic Game Theory - 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 - October 2, 2014. Proceedings, pages 13--24, 2014. \n \n\n\n\n
\n\n\n \n \n \n \"EfficiencyPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/sagt/AdamczykSZ14,\n  author    = {Marek Adamczyk and\n               Piotr Sankowski and\n               Qiang Zhang},\n  title     = {Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching},\n  booktitle = {Algorithmic Game Theory - 7th International Symposium, {SAGT} 2014,\n               Haifa, Israel, September 30 - October 2, 2014. Proceedings},\n  pages     = {13--24},\n  year      = {2014},\n  crossref  = {DBLP:conf/sagt/2014},\n  url       = {https://doi.org/10.1007/978-3-662-44803-8_2},\n  doi       = {10.1007/978-3-662-44803-8_2},\n  timestamp = {Sun, 21 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/sagt/AdamczykSZ14},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem.\n \n\n\n \n Bernáth, A.; Ciebiera, K.; Godlewski, P.; and Sankowski, P.\n \n\n\n \n\n\n\n In Experimental Algorithms - 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings, pages 74--86, 2014. \n \n\n\n\n
\n\n\n \n \n \n \"ImplementationPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/wea/BernathCGS14,\n  author    = {Attila Bern{\\'{a}}th and\n               Krzysztof Ciebiera and\n               Piotr Godlewski and\n               Piotr Sankowski},\n  title     = {Implementation of the Iterative Relaxation Algorithm for the Minimum\n               Bounded-Degree Spanning Tree Problem},\n  booktitle = {Experimental Algorithms - 13th International Symposium, {SEA} 2014,\n               Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings},\n  pages     = {74--86},\n  year      = {2014},\n  crossref  = {DBLP:conf/wea/2014},\n  url       = {https://doi.org/10.1007/978-3-319-07959-2_7},\n  doi       = {10.1007/978-3-319-07959-2_7},\n  timestamp = {Wed, 17 May 2017 10:54:01 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/wea/BernathCGS14},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets.\n \n\n\n \n Colini-Baldeschi, R.; Leonardi, S.; Sankowski, P.; and Zhang, Q.\n \n\n\n \n\n\n\n In Web and Internet Economics - 10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014. Proceedings, pages 233--246, 2014. \n \n\n\n\n
\n\n\n \n \n \n \"RevenuePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/wine/Colini-BaldeschiLSZ14,\n  author    = {Riccardo Colini{-}Baldeschi and\n               Stefano Leonardi and\n               Piotr Sankowski and\n               Qiang Zhang},\n  title     = {Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets},\n  booktitle = {Web and Internet Economics - 10th International Conference, {WINE}\n               2014, Beijing, China, December 14-17, 2014. Proceedings},\n  pages     = {233--246},\n  year      = {2014},\n  crossref  = {DBLP:conf/wine/2014},\n  url       = {https://doi.org/10.1007/978-3-319-13129-0_18},\n  doi       = {10.1007/978-3-319-13129-0_18},\n  timestamp = {Fri, 26 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/wine/Colini-BaldeschiLSZ14},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Efficiency of Truthful and Symmetric Mechanisms in One-sided Matching.\n \n\n\n \n Adamczyk, M.; Sankowski, P.; and Zhang, Q.\n \n\n\n \n\n\n\n CoRR, abs/1407.3957. 2014.\n \n\n\n\n
\n\n\n \n \n \n \"EfficiencyPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/AdamczykSZ14,\n  author    = {Marek Adamczyk and\n               Piotr Sankowski and\n               Qiang Zhang},\n  title     = {Efficiency of Truthful and Symmetric Mechanisms in One-sided Matching},\n  journal   = {CoRR},\n  volume    = {abs/1407.3957},\n  year      = {2014},\n  url       = {http://arxiv.org/abs/1407.3957},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/AdamczykSZ14},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Optimal decremental connectivity in planar graphs.\n \n\n\n \n Lacki, J.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1409.7240. 2014.\n \n\n\n\n
\n\n\n \n \n \n \"OptimalPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/LackiS14,\n  author    = {Jakub Lacki and\n               Piotr Sankowski},\n  title     = {Optimal decremental connectivity in planar graphs},\n  journal   = {CoRR},\n  volume    = {abs/1409.7240},\n  year      = {2014},\n  url       = {http://arxiv.org/abs/1409.7240},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/LackiS14},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Approximation Algorithms for Steiner Tree Problems Based on Universal Solution Frameworks.\n \n\n\n \n Ciebiera, K.; Godlewski, P.; Sankowski, P.; and Wygocki, P.\n \n\n\n \n\n\n\n CoRR, abs/1410.7534. 2014.\n \n\n\n\n
\n\n\n \n \n \n \"ApproximationPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/CiebieraGSW14,\n  author    = {Krzysztof Ciebiera and\n               Piotr Godlewski and\n               Piotr Sankowski and\n               Piotr Wygocki},\n  title     = {Approximation Algorithms for Steiner Tree Problems Based on Universal\n               Solution Frameworks},\n  journal   = {CoRR},\n  volume    = {abs/1410.7534},\n  year      = {2014},\n  url       = {http://arxiv.org/abs/1410.7534},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/CiebieraGSW14},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the second ACM conference on Online social networks, COSN 2014, Dublin, Ireland, October 1-2, 2014.\n \n\n\n \n Sala, A.; Goel, A.; and Gummadi, K. P.\n , editor\n s.\n \n\n\n \n\n\n\n 2014.ACM.\n \n\n\n\n
\n\n\n \n \n \n \"ProceedingsPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/cosn/2014,\n  editor    = {Alessandra Sala and\n               Ashish Goel and\n               Krishna P. Gummadi},\n  title     = {Proceedings of the second {ACM} conference on Online social networks,\n               {COSN} 2014, Dublin, Ireland, October 1-2, 2014},\n  publisher = {{ACM}},\n  year      = {2014},\n  url       = {http://dl.acm.org/citation.cfm?id=2660460},\n  isbn      = {978-1-4503-3198-2},\n  timestamp = {Wed, 25 Mar 2015 09:44:43 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/cosn/2014},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014.\n \n\n\n \n \n \n\n\n \n\n\n\n 2014.IEEE Computer Society.\n \n\n\n\n
\n\n\n \n \n \n \"55thPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/focs/2014,\n  title     = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}\n               2014, Philadelphia, PA, USA, October 18-21, 2014},\n  publisher = {{IEEE} Computer Society},\n  year      = {2014},\n  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6975722},\n  isbn      = {978-1-4799-6517-5},\n  timestamp = {Thu, 23 Jun 2016 15:53:28 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/2014},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algorithmic Game Theory - 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 - October 2, 2014. Proceedings.\n \n\n\n \n Lavi, R.\n , editor\n .\n \n\n\n \n\n\n\n Volume 8768, of Lecture Notes in Computer Science. 2014.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"AlgorithmicPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/sagt/2014,\n  editor    = {Ron Lavi},\n  title     = {Algorithmic Game Theory - 7th International Symposium, {SAGT} 2014,\n               Haifa, Israel, September 30 - October 2, 2014. Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {8768},\n  publisher = {Springer},\n  year      = {2014},\n  url       = {https://doi.org/10.1007/978-3-662-44803-8},\n  doi       = {10.1007/978-3-662-44803-8},\n  isbn      = {978-3-662-44802-1},\n  timestamp = {Sun, 21 May 2017 00:17:27 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/sagt/2014},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Experimental Algorithms - 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings.\n \n\n\n \n Gudmundsson, J.; and Katajainen, J.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 8504, of Lecture Notes in Computer Science. 2014.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"ExperimentalPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/wea/2014,\n  editor    = {Joachim Gudmundsson and\n               Jyrki Katajainen},\n  title     = {Experimental Algorithms - 13th International Symposium, {SEA} 2014,\n               Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {8504},\n  publisher = {Springer},\n  year      = {2014},\n  url       = {https://doi.org/10.1007/978-3-319-07959-2},\n  doi       = {10.1007/978-3-319-07959-2},\n  isbn      = {978-3-319-07958-5},\n  timestamp = {Wed, 17 May 2017 10:54:01 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/wea/2014},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Web and Internet Economics - 10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014. Proceedings.\n \n\n\n \n Liu, T.; Qi, Q.; and Ye, Y.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 8877, of Lecture Notes in Computer Science. 2014.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"WebPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/wine/2014,\n  editor    = {Tie{-}Yan Liu and\n               Qi Qi and\n               Yinyu Ye},\n  title     = {Web and Internet Economics - 10th International Conference, {WINE}\n               2014, Beijing, China, December 14-17, 2014. Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {8877},\n  publisher = {Springer},\n  year      = {2014},\n  url       = {https://doi.org/10.1007/978-3-319-13129-0},\n  doi       = {10.1007/978-3-319-13129-0},\n  isbn      = {978-3-319-13128-3},\n  timestamp = {Fri, 26 May 2017 00:49:40 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/wine/2014},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (11)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Set Covering with Our Eyes Closed.\n \n\n\n \n Grandoni, F.; Gupta, A.; Leonardi, S.; Miettinen, P.; Sankowski, P.; and Singh, M.\n \n\n\n \n\n\n\n SIAM J. Comput., 42(3): 808--830. 2013.\n \n\n\n\n
\n\n\n \n \n \n \"SetPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/siamcomp/GrandoniGLMSS13,\n  author    = {Fabrizio Grandoni and\n               Anupam Gupta and\n               Stefano Leonardi and\n               Pauli Miettinen and\n               Piotr Sankowski and\n               Mohit Singh},\n  title     = {Set Covering with Our Eyes Closed},\n  journal   = {{SIAM} J. Comput.},\n  volume    = {42},\n  number    = {3},\n  pages     = {808--830},\n  year      = {2013},\n  url       = {https://doi.org/10.1137/100802888},\n  doi       = {10.1137/100802888},\n  timestamp = {Sat, 27 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GrandoniGLMSS13},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors.\n \n\n\n \n Gabow, H. N.; and Sankowski, P.\n \n\n\n \n\n\n\n In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 137--146, 2013. \n \n\n\n\n
\n\n\n \n \n \n \"AlgebraicPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/focs/GabowS13,\n  author    = {Harold N. Gabow and\n               Piotr Sankowski},\n  title     = {Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and\n               F-Factors},\n  booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}\n               2013, 26-29 October, 2013, Berkeley, CA, {USA}},\n  pages     = {137--146},\n  year      = {2013},\n  crossref  = {DBLP:conf/focs/2013},\n  url       = {https://doi.org/10.1109/FOCS.2013.23},\n  doi       = {10.1109/FOCS.2013.23},\n  timestamp = {Fri, 19 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/GabowS13},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Reachability in graph timelines.\n \n\n\n \n Lacki, J.; and Sankowski, P.\n \n\n\n \n\n\n\n In Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013, pages 257--268, 2013. \n \n\n\n\n
\n\n\n \n \n \n \"ReachabilityPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/innovations/LackiS13,\n  author    = {Jakub Lacki and\n               Piotr Sankowski},\n  title     = {Reachability in graph timelines},\n  booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,\n               CA, USA, January 9-12, 2013},\n  pages     = {257--268},\n  year      = {2013},\n  crossref  = {DBLP:conf/innovations/2013},\n  url       = {http://doi.acm.org/10.1145/2422436.2422468},\n  doi       = {10.1145/2422436.2422468},\n  timestamp = {Sun, 17 Feb 2013 11:19:02 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/innovations/LackiS13},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Catch them if you can: how to serve impatient users.\n \n\n\n \n Cygan, M.; Englert, M.; Gupta, A.; Mucha, M.; and Sankowski, P.\n \n\n\n \n\n\n\n In Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013, pages 485--494, 2013. \n \n\n\n\n
\n\n\n \n \n \n \"CatchPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/innovations/CyganEGMS13,\n  author    = {Marek Cygan and\n               Matthias Englert and\n               Anupam Gupta and\n               Marcin Mucha and\n               Piotr Sankowski},\n  title     = {Catch them if you can: how to serve impatient users},\n  booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,\n               CA, USA, January 9-12, 2013},\n  pages     = {485--494},\n  year      = {2013},\n  crossref  = {DBLP:conf/innovations/2013},\n  url       = {http://doi.acm.org/10.1145/2422436.2422489},\n  doi       = {10.1145/2422436.2422489},\n  timestamp = {Sun, 17 Feb 2013 11:19:02 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/innovations/CyganEGMS13},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs.\n \n\n\n \n Pilipczuk, M.; Pilipczuk, M.; Sankowski, P.; and van Leeuwen, E. J.\n \n\n\n \n\n\n\n In 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pages 353--364, 2013. \n \n\n\n\n
\n\n\n \n \n \n \"Subexponential-TimePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/stacs/PilipczukPSL13,\n  author    = {Marcin Pilipczuk and\n               Michal Pilipczuk and\n               Piotr Sankowski and\n               Erik Jan van Leeuwen},\n  title     = {Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar\n               Graphs},\n  booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,\n               {STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},\n  pages     = {353--364},\n  year      = {2013},\n  crossref  = {DBLP:conf/stacs/2013},\n  url       = {https://doi.org/10.4230/LIPIcs.STACS.2013.353},\n  doi       = {10.4230/LIPIcs.STACS.2013.353},\n  timestamp = {Fri, 26 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/stacs/PilipczukPSL13},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and f-Factors.\n \n\n\n \n Gabow, H. N.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1304.6740. 2013.\n \n\n\n\n
\n\n\n \n \n \n \"AlgebraicPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/abs-1304-6740,\n  author    = {Harold N. Gabow and\n               Piotr Sankowski},\n  title     = {Algebraic Algorithms for b-Matching, Shortest Undirected Paths, and\n               f-Factors},\n  journal   = {CoRR},\n  volume    = {abs/1304.6740},\n  year      = {2013},\n  url       = {http://arxiv.org/abs/1304.6740},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1304-6740},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs.\n \n\n\n \n Pilipczuk, M.; Pilipczuk, M.; Sankowski, P.; and van Leeuwen, E. J.\n \n\n\n \n\n\n\n CoRR, abs/1306.6593. 2013.\n \n\n\n\n
\n\n\n \n \n \n \"NetworkPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/PilipczukPSL13,\n  author    = {Marcin Pilipczuk and\n               Michal Pilipczuk and\n               Piotr Sankowski and\n               Erik Jan van Leeuwen},\n  title     = {Network Sparsification for Steiner Problems on Planar and Bounded-Genus\n               Graphs},\n  journal   = {CoRR},\n  volume    = {abs/1306.6593},\n  year      = {2013},\n  url       = {http://arxiv.org/abs/1306.6593},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/PilipczukPSL13},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Dynamic Steiner Tree in Planar Graphs.\n \n\n\n \n Lacki, J.; Ocwieja, J.; Pilipczuk, M.; Sankowski, P.; and Zych, A.\n \n\n\n \n\n\n\n CoRR, abs/1308.3336. 2013.\n \n\n\n\n
\n\n\n \n \n \n \"DynamicPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/LackiOPSZ13,\n  author    = {Jakub Lacki and\n               Jakub Ocwieja and\n               Marcin Pilipczuk and\n               Piotr Sankowski and\n               Anna Zych},\n  title     = {Dynamic Steiner Tree in Planar Graphs},\n  journal   = {CoRR},\n  volume    = {abs/1308.3336},\n  year      = {2013},\n  url       = {http://arxiv.org/abs/1308.3336},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/LackiOPSZ13},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA.\n \n\n\n \n \n \n\n\n \n\n\n\n 2013.IEEE Computer Society.\n \n\n\n\n
\n\n\n \n \n \n \"54thPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/focs/2013,\n  title     = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}\n               2013, 26-29 October, 2013, Berkeley, CA, {USA}},\n  publisher = {{IEEE} Computer Society},\n  year      = {2013},\n  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6685222},\n  isbn      = {978-0-7695-5135-7},\n  timestamp = {Mon, 15 Dec 2014 18:48:45 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/2013},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013.\n \n\n\n \n Kleinberg, R. D.\n , editor\n .\n \n\n\n \n\n\n\n 2013.ACM.\n \n\n\n\n
\n\n\n \n \n \n \"InnovationsPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/innovations/2013,\n  editor    = {Robert D. Kleinberg},\n  title     = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,\n               CA, USA, January 9-12, 2013},\n  publisher = {{ACM}},\n  year      = {2013},\n  url       = {http://dl.acm.org/citation.cfm?id=2422436},\n  isbn      = {978-1-4503-1859-4},\n  timestamp = {Sun, 17 Feb 2013 11:19:02 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/innovations/2013},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany.\n \n\n\n \n Portier, N.; and Wilke, T.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 20, of LIPIcs. 2013.Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.\n \n\n\n\n
\n\n\n \n \n \n \"30thPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/stacs/2013,\n  editor    = {Natacha Portier and\n               Thomas Wilke},\n  title     = {30th International Symposium on Theoretical Aspects of Computer Science,\n               {STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},\n  series    = {LIPIcs},\n  volume    = {20},\n  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},\n  year      = {2013},\n  url       = {http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=13002},\n  isbn      = {978-3-939897-50-7},\n  timestamp = {Tue, 26 Feb 2013 10:40:05 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/stacs/2013},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (11)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees.\n \n\n\n \n Cygan, M.; Grandoni, F.; Leonardi, S.; Pilipczuk, M.; and Sankowski, P.\n \n\n\n \n\n\n\n In Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, pages 349--360, 2012. \n \n\n\n\n
\n\n\n \n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/esa/CyganGLPS12,\n  author    = {Marek Cygan and\n               Fabrizio Grandoni and\n               Stefano Leonardi and\n               Marcin Pilipczuk and\n               Piotr Sankowski},\n  title     = {A Path-Decomposition Theorem with Applications to Pricing and Covering\n               on Trees},\n  booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,\n               Slovenia, September 10-12, 2012. Proceedings},\n  pages     = {349--360},\n  year      = {2012},\n  crossref  = {DBLP:conf/esa/2012},\n  url       = {https://doi.org/10.1007/978-3-642-33090-2_31},\n  doi       = {10.1007/978-3-642-33090-2_31},\n  timestamp = {Fri, 26 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/CyganGLPS12},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings.\n \n\n\n \n Cygan, M.; Gabow, H. N.; and Sankowski, P.\n \n\n\n \n\n\n\n In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012, pages 531--540, 2012. \n \n\n\n\n
\n\n\n \n \n \n \"AlgorithmicPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/focs/CyganGS12,\n  author    = {Marek Cygan and\n               Harold N. Gabow and\n               Piotr Sankowski},\n  title     = {Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles,\n               Diameter and Matchings},\n  booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}\n               2012, New Brunswick, NJ, USA, October 20-23, 2012},\n  pages     = {531--540},\n  year      = {2012},\n  crossref  = {DBLP:conf/focs/2012},\n  url       = {https://doi.org/10.1109/FOCS.2012.72},\n  doi       = {10.1109/FOCS.2012.72},\n  timestamp = {Fri, 19 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/CyganGS12},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Single Source - All Sinks Max Flows in Planar Digraphs.\n \n\n\n \n Lacki, J.; Nussbaum, Y.; Sankowski, P.; and Wulff-Nilsen, C.\n \n\n\n \n\n\n\n In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012, pages 599--608, 2012. \n \n\n\n\n
\n\n\n \n \n \n \"SinglePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/focs/LackiNSW12,\n  author    = {Jakub Lacki and\n               Yahav Nussbaum and\n               Piotr Sankowski and\n               Christian Wulff{-}Nilsen},\n  title     = {Single Source - All Sinks Max Flows in Planar Digraphs},\n  booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}\n               2012, New Brunswick, NJ, USA, October 20-23, 2012},\n  pages     = {599--608},\n  year      = {2012},\n  crossref  = {DBLP:conf/focs/2012},\n  url       = {https://doi.org/10.1109/FOCS.2012.66},\n  doi       = {10.1109/FOCS.2012.66},\n  timestamp = {Fri, 19 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/LackiNSW12},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Revenue maximizing envy-free multi-unit auctions with budgets.\n \n\n\n \n Feldman, M.; Fiat, A.; Leonardi, S.; and Sankowski, P.\n \n\n\n \n\n\n\n In ACM Conference on Electronic Commerce, EC '12, Valencia, Spain, June 4-8, 2012, pages 532--549, 2012. \n \n\n\n\n
\n\n\n \n \n \n \"RevenuePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/sigecom/FeldmanFLS12,\n  author    = {Michal Feldman and\n               Amos Fiat and\n               Stefano Leonardi and\n               Piotr Sankowski},\n  title     = {Revenue maximizing envy-free multi-unit auctions with budgets},\n  booktitle = {{ACM} Conference on Electronic Commerce, {EC} '12, Valencia, Spain,\n               June 4-8, 2012},\n  pages     = {532--549},\n  year      = {2012},\n  crossref  = {DBLP:conf/sigecom/2012},\n  url       = {http://doi.acm.org/10.1145/2229012.2229052},\n  doi       = {10.1145/2229012.2229052},\n  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/sigecom/FeldmanFLS12},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n The Ring Design Game with Fair Cost Allocation - [Extended Abstract].\n \n\n\n \n Fanelli, A.; Leniowski, D.; Monaco, G.; and Sankowski, P.\n \n\n\n \n\n\n\n In Internet and Network Economics - 8th International Workshop, WINE 2012, Liverpool, UK, December 10-12, 2012. Proceedings, pages 546--552, 2012. \n \n\n\n\n
\n\n\n \n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/wine/FanelliLMS12,\n  author    = {Angelo Fanelli and\n               Dariusz Leniowski and\n               Gianpiero Monaco and\n               Piotr Sankowski},\n  title     = {The Ring Design Game with Fair Cost Allocation - [Extended Abstract]},\n  booktitle = {Internet and Network Economics - 8th International Workshop, {WINE}\n               2012, Liverpool, UK, December 10-12, 2012. Proceedings},\n  pages     = {546--552},\n  year      = {2012},\n  crossref  = {DBLP:conf/wine/2012},\n  url       = {https://doi.org/10.1007/978-3-642-35311-6_45},\n  doi       = {10.1007/978-3-642-35311-6_45},\n  timestamp = {Fri, 26 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/wine/FanelliLMS12},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings.\n \n\n\n \n Cygan, M.; Gabow, H. N.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1204.1616. 2012.\n \n\n\n\n
\n\n\n \n \n \n \"AlgorithmicPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/abs-1204-1616,\n  author    = {Marek Cygan and\n               Harold N. Gabow and\n               Piotr Sankowski},\n  title     = {Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles,\n               Diameter and Matchings},\n  journal   = {CoRR},\n  volume    = {abs/1204.1616},\n  year      = {2012},\n  url       = {http://arxiv.org/abs/1204.1616},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1204-1616},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Single Source - All Sinks Max Flows in Planar Digraphs.\n \n\n\n \n Lacki, J.; Nussbaum, Y.; Sankowski, P.; and Wulff-Nilsen, C.\n \n\n\n \n\n\n\n CoRR, abs/1210.4811. 2012.\n \n\n\n\n
\n\n\n \n \n \n \"SinglePaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/abs-1210-4811,\n  author    = {Jakub Lacki and\n               Yahav Nussbaum and\n               Piotr Sankowski and\n               Christian Wulff{-}Nilsen},\n  title     = {Single Source - All Sinks Max Flows in Planar Digraphs},\n  journal   = {CoRR},\n  volume    = {abs/1210.4811},\n  year      = {2012},\n  url       = {http://arxiv.org/abs/1210.4811},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1210-4811},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings.\n \n\n\n \n Epstein, L.; and Ferragina, P.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 7501, of Lecture Notes in Computer Science. 2012.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"AlgorithmsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/esa/2012,\n  editor    = {Leah Epstein and\n               Paolo Ferragina},\n  title     = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,\n               Slovenia, September 10-12, 2012. Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {7501},\n  publisher = {Springer},\n  year      = {2012},\n  url       = {https://doi.org/10.1007/978-3-642-33090-2},\n  doi       = {10.1007/978-3-642-33090-2},\n  isbn      = {978-3-642-33089-6},\n  timestamp = {Fri, 26 May 2017 00:49:36 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/2012},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012.\n \n\n\n \n \n \n\n\n \n\n\n\n 2012.IEEE Computer Society.\n \n\n\n\n
\n\n\n \n \n \n \"53rdPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/focs/2012,\n  title     = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}\n               2012, New Brunswick, NJ, USA, October 20-23, 2012},\n  publisher = {{IEEE} Computer Society},\n  year      = {2012},\n  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6374356},\n  isbn      = {978-1-4673-4383-1},\n  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/2012},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n ACM Conference on Electronic Commerce, EC '12, Valencia, Spain, June 4-8, 2012.\n \n\n\n \n Faltings, B.; Leyton-Brown, K.; and Ipeirotis, P.\n , editor\n s.\n \n\n\n \n\n\n\n 2012.ACM.\n \n\n\n\n
\n\n\n \n \n \n \"ACMPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/sigecom/2012,\n  editor    = {Boi Faltings and\n               Kevin Leyton{-}Brown and\n               Panos Ipeirotis},\n  title     = {{ACM} Conference on Electronic Commerce, {EC} '12, Valencia, Spain,\n               June 4-8, 2012},\n  publisher = {{ACM}},\n  year      = {2012},\n  url       = {http://dl.acm.org/citation.cfm?id=2229012},\n  isbn      = {978-1-4503-1415-2},\n  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/sigecom/2012},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Internet and Network Economics - 8th International Workshop, WINE 2012, Liverpool, UK, December 10-12, 2012. Proceedings.\n \n\n\n \n Goldberg, P. W.\n , editor\n .\n \n\n\n \n\n\n\n Volume 7695, of Lecture Notes in Computer Science. 2012.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"InternetPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/wine/2012,\n  editor    = {Paul W. Goldberg},\n  title     = {Internet and Network Economics - 8th International Workshop, {WINE}\n               2012, Liverpool, UK, December 10-12, 2012. Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {7695},\n  publisher = {Springer},\n  year      = {2012},\n  url       = {https://doi.org/10.1007/978-3-642-35311-6},\n  doi       = {10.1007/978-3-642-35311-6},\n  isbn      = {978-3-642-35310-9},\n  timestamp = {Fri, 26 May 2017 00:49:40 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/wine/2012},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2011\n \n \n (14)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Dynamic normal forms and dynamic characteristic polynomial.\n \n\n\n \n Frandsen, G. S.; and Sankowski, P.\n \n\n\n \n\n\n\n Theor. Comput. Sci., 412(16): 1470--1483. 2011.\n \n\n\n\n
\n\n\n \n \n \n \"DynamicPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/tcs/FrandsenS11,\n  author    = {Gudmund Skovbjerg Frandsen and\n               Piotr Sankowski},\n  title     = {Dynamic normal forms and dynamic characteristic polynomial},\n  journal   = {Theor. Comput. Sci.},\n  volume    = {412},\n  number    = {16},\n  pages     = {1470--1483},\n  year      = {2011},\n  url       = {https://doi.org/10.1016/j.tcs.2010.11.049},\n  doi       = {10.1016/j.tcs.2010.11.049},\n  timestamp = {Sun, 28 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/tcs/FrandsenS11},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time.\n \n\n\n \n Lacki, J.; and Sankowski, P.\n \n\n\n \n\n\n\n In Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings, pages 155--166, 2011. \n \n\n\n\n
\n\n\n \n \n \n \"Min-CutsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/esa/LackiS11,\n  author    = {Jakub Lacki and\n               Piotr Sankowski},\n  title     = {Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time},\n  booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\\"{u}}cken,\n               Germany, September 5-9, 2011. Proceedings},\n  pages     = {155--166},\n  year      = {2011},\n  crossref  = {DBLP:conf/esa/2011},\n  url       = {https://doi.org/10.1007/978-3-642-23719-5_14},\n  doi       = {10.1007/978-3-642-23719-5_14},\n  timestamp = {Fri, 26 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/LackiS11},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Approximation Algorithms for Union and Intersection Covering Problems.\n \n\n\n \n Cygan, M.; Grandoni, F.; Leonardi, S.; Mucha, M.; Pilipczuk, M.; and Sankowski, P.\n \n\n\n \n\n\n\n In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pages 28--40, 2011. \n \n\n\n\n
\n\n\n \n \n \n \"ApproximationPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/fsttcs/CyganGLMPS11,\n  author    = {Marek Cygan and\n               Fabrizio Grandoni and\n               Stefano Leonardi and\n               Marcin Mucha and\n               Marcin Pilipczuk and\n               Piotr Sankowski},\n  title     = {Approximation Algorithms for Union and Intersection Covering Problems},\n  booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and\n               Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,\n               Mumbai, India},\n  pages     = {28--40},\n  year      = {2011},\n  crossref  = {DBLP:conf/fsttcs/2011},\n  url       = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.28},\n  doi       = {10.4230/LIPIcs.FSTTCS.2011.28},\n  timestamp = {Wed, 24 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/CyganGLMPS11},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Single valued combinatorial auctions with budgets.\n \n\n\n \n Fiat, A.; Leonardi, S.; Saia, J.; and Sankowski, P.\n \n\n\n \n\n\n\n In Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), San Jose, CA, USA, June 5-9, 2011, pages 223--232, 2011. \n \n\n\n\n
\n\n\n \n \n \n \"SinglePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/sigecom/FiatLSS11,\n  author    = {Amos Fiat and\n               Stefano Leonardi and\n               Jared Saia and\n               Piotr Sankowski},\n  title     = {Single valued combinatorial auctions with budgets},\n  booktitle = {Proceedings 12th {ACM} Conference on Electronic Commerce (EC-2011),\n               San Jose, CA, USA, June 5-9, 2011},\n  pages     = {223--232},\n  year      = {2011},\n  crossref  = {DBLP:conf/sigecom/2011},\n  url       = {http://doi.acm.org/10.1145/1993574.1993609},\n  doi       = {10.1145/1993574.1993609},\n  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/sigecom/FiatLSS11},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Improved algorithms for min cut and max flow in undirected planar graphs.\n \n\n\n \n Italiano, G. F.; Nussbaum, Y.; Sankowski, P.; and Wulff-Nilsen, C.\n \n\n\n \n\n\n\n In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, pages 313--322, 2011. \n \n\n\n\n
\n\n\n \n \n \n \"ImprovedPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/stoc/ItalianoNSW11,\n  author    = {Giuseppe F. Italiano and\n               Yahav Nussbaum and\n               Piotr Sankowski and\n               Christian Wulff{-}Nilsen},\n  title     = {Improved algorithms for min cut and max flow in undirected planar\n               graphs},\n  booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}\n               2011, San Jose, CA, USA, 6-8 June 2011},\n  pages     = {313--322},\n  year      = {2011},\n  crossref  = {DBLP:conf/stoc/2011},\n  url       = {http://doi.acm.org/10.1145/1993636.1993679},\n  doi       = {10.1145/1993636.1993679},\n  timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/stoc/ItalianoNSW11},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Stochastic query covering.\n \n\n\n \n Anagnostopoulos, A.; Becchetti, L.; Leonardi, S.; Mele, I.; and Sankowski, P.\n \n\n\n \n\n\n\n In Proceedings of the Forth International Conference on Web Search and Web Data Mining, WSDM 2011, Hong Kong, China, February 9-12, 2011, pages 725--734, 2011. \n \n\n\n\n
\n\n\n \n \n \n \"StochasticPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/wsdm/AnagnostopoulosBLMS11,\n  author    = {Aris Anagnostopoulos and\n               Luca Becchetti and\n               Stefano Leonardi and\n               Ida Mele and\n               Piotr Sankowski},\n  title     = {Stochastic query covering},\n  booktitle = {Proceedings of the Forth International Conference on Web Search and\n               Web Data Mining, {WSDM} 2011, Hong Kong, China, February 9-12, 2011},\n  pages     = {725--734},\n  year      = {2011},\n  crossref  = {DBLP:conf/wsdm/2011},\n  url       = {http://doi.acm.org/10.1145/1935826.1935923},\n  doi       = {10.1145/1935826.1935923},\n  timestamp = {Mon, 31 Jan 2011 13:29:32 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/wsdm/AnagnostopoulosBLMS11},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings.\n \n\n\n \n Murlak, F.; and Sankowski, P.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 6907, of Lecture Notes in Computer Science. 2011.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"MathematicalPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/mfcs/2011,\n  editor    = {Filip Murlak and\n               Piotr Sankowski},\n  title     = {Mathematical Foundations of Computer Science 2011 - 36th International\n               Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {6907},\n  publisher = {Springer},\n  year      = {2011},\n  url       = {https://doi.org/10.1007/978-3-642-22993-0},\n  doi       = {10.1007/978-3-642-22993-0},\n  isbn      = {978-3-642-22992-3},\n  timestamp = {Thu, 25 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/mfcs/2011},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Approximation Algorithms for Union and Intersection Covering Problems.\n \n\n\n \n Cygan, M.; Grandoni, F.; Leonardi, S.; Mucha, M.; Pilipczuk, M.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1102.5105. 2011.\n \n\n\n\n
\n\n\n \n \n \n \"ApproximationPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/abs-1102-5105,\n  author    = {Marek Cygan and\n               Fabrizio Grandoni and\n               Stefano Leonardi and\n               Marcin Mucha and\n               Marcin Pilipczuk and\n               Piotr Sankowski},\n  title     = {Approximation Algorithms for Union and Intersection Covering Problems},\n  journal   = {CoRR},\n  volume    = {abs/1102.5105},\n  year      = {2011},\n  url       = {http://arxiv.org/abs/1102.5105},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1102-5105},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time.\n \n\n\n \n Lacki, J.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1104.4890. 2011.\n \n\n\n\n
\n\n\n \n \n \n \"Min-cutsPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/abs-1104-4890,\n  author    = {Jakub Lacki and\n               Piotr Sankowski},\n  title     = {Min-cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time},\n  journal   = {CoRR},\n  volume    = {abs/1104.4890},\n  year      = {2011},\n  url       = {http://arxiv.org/abs/1104.4890},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1104-4890},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings.\n \n\n\n \n Demetrescu, C.; and Halldórsson, M. M.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 6942, of Lecture Notes in Computer Science. 2011.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"AlgorithmsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/esa/2011,\n  editor    = {Camil Demetrescu and\n               Magn{\\'{u}}s M. Halld{\\'{o}}rsson},\n  title     = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\\"{u}}cken,\n               Germany, September 5-9, 2011. Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {6942},\n  publisher = {Springer},\n  year      = {2011},\n  url       = {https://doi.org/10.1007/978-3-642-23719-5},\n  doi       = {10.1007/978-3-642-23719-5},\n  isbn      = {978-3-642-23718-8},\n  timestamp = {Fri, 26 May 2017 00:49:36 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/2011},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India.\n \n\n\n \n Chakraborty, S.; and Kumar, A.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 13, of LIPIcs. 2011.Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.\n \n\n\n\n
\n\n\n \n \n \n \"IARCSPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/fsttcs/2011,\n  editor    = {Supratik Chakraborty and\n               Amit Kumar},\n  title     = {{IARCS} Annual Conference on Foundations of Software Technology and\n               Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,\n               Mumbai, India},\n  series    = {LIPIcs},\n  volume    = {13},\n  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},\n  year      = {2011},\n  url       = {http://drops.dagstuhl.de/portals/extern/index.php?semnr=110010},\n  isbn      = {978-3-939897-34-7},\n  timestamp = {Tue, 26 Feb 2013 10:43:30 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/2011},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), San Jose, CA, USA, June 5-9, 2011.\n \n\n\n \n Shoham, Y.; Chen, Y.; and Roughgarden, T.\n , editor\n s.\n \n\n\n \n\n\n\n 2011.ACM.\n \n\n\n\n
\n\n\n \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/sigecom/2011,\n  editor    = {Yoav Shoham and\n               Yan Chen and\n               Tim Roughgarden},\n  title     = {Proceedings 12th {ACM} Conference on Electronic Commerce (EC-2011),\n               San Jose, CA, USA, June 5-9, 2011},\n  publisher = {{ACM}},\n  year      = {2011},\n  isbn      = {978-1-4503-0261-6},\n  timestamp = {Mon, 24 Feb 2014 16:09:46 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/sigecom/2011},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011.\n \n\n\n \n Fortnow, L.; and Vadhan, S. P.\n , editor\n s.\n \n\n\n \n\n\n\n 2011.ACM.\n \n\n\n\n
\n\n\n \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/stoc/2011,\n  editor    = {Lance Fortnow and\n               Salil P. Vadhan},\n  title     = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}\n               2011, San Jose, CA, USA, 6-8 June 2011},\n  publisher = {{ACM}},\n  year      = {2011},\n  isbn      = {978-1-4503-0691-1},\n  timestamp = {Tue, 22 May 2012 21:36:56 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/stoc/2011},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the Forth International Conference on Web Search and Web Data Mining, WSDM 2011, Hong Kong, China, February 9-12, 2011.\n \n\n\n \n King, I.; Nejdl, W.; and Li, H.\n , editor\n s.\n \n\n\n \n\n\n\n 2011.ACM.\n \n\n\n\n
\n\n\n \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/wsdm/2011,\n  editor    = {Irwin King and\n               Wolfgang Nejdl and\n               Hang Li},\n  title     = {Proceedings of the Forth International Conference on Web Search and\n               Web Data Mining, {WSDM} 2011, Hong Kong, China, February 9-12, 2011},\n  publisher = {{ACM}},\n  year      = {2011},\n  isbn      = {978-1-4503-0493-1},\n  timestamp = {Mon, 31 Jan 2011 13:29:32 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/wsdm/2011},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (10)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Fast Dynamic Transitive Closure with Lookahead.\n \n\n\n \n Sankowski, P.; and Mucha, M.\n \n\n\n \n\n\n\n Algorithmica, 56(2): 180--197. 2010.\n \n\n\n\n
\n\n\n \n \n \n \"FastPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/algorithmica/SankowskiM10,\n  author    = {Piotr Sankowski and\n               Marcin Mucha},\n  title     = {Fast Dynamic Transitive Closure with Lookahead},\n  journal   = {Algorithmica},\n  volume    = {56},\n  number    = {2},\n  pages     = {180--197},\n  year      = {2010},\n  url       = {https://doi.org/10.1007/s00453-008-9166-2},\n  doi       = {10.1007/s00453-008-9166-2},\n  timestamp = {Wed, 17 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/algorithmica/SankowskiM10},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Fast Approximation in Subspaces by Doubling Metric Decomposition.\n \n\n\n \n Cygan, M.; Kowalik, L.; Mucha, M.; Pilipczuk, M.; and Sankowski, P.\n \n\n\n \n\n\n\n In Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I, pages 72--83, 2010. \n \n\n\n\n
\n\n\n \n \n \n \"FastPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/esa/CyganKMPS10,\n  author    = {Marek Cygan and\n               Lukasz Kowalik and\n               Marcin Mucha and\n               Marcin Pilipczuk and\n               Piotr Sankowski},\n  title     = {Fast Approximation in Subspaces by Doubling Metric Decomposition},\n  booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,\n               UK, September 6-8, 2010. Proceedings, Part {I}},\n  pages     = {72--83},\n  year      = {2010},\n  crossref  = {DBLP:conf/esa/2010-1},\n  url       = {https://doi.org/10.1007/978-3-642-15775-2_7},\n  doi       = {10.1007/978-3-642-15775-2_7},\n  timestamp = {Tue, 25 Jul 2017 16:35:22 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/CyganKMPS10},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.\n \n\n\n \n Borradaile, G.; Sankowski, P.; and Wulff-Nilsen, C.\n \n\n\n \n\n\n\n In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA, pages 601--610, 2010. \n \n\n\n\n
\n\n\n \n \n \n \"MinPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/focs/BorradaileSW10,\n  author    = {Glencora Borradaile and\n               Piotr Sankowski and\n               Christian Wulff{-}Nilsen},\n  title     = {Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing\n               Time},\n  booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}\n               2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},\n  pages     = {601--610},\n  year      = {2010},\n  crossref  = {DBLP:conf/focs/2010},\n  url       = {https://doi.org/10.1109/FOCS.2010.63},\n  doi       = {10.1109/FOCS.2010.63},\n  timestamp = {Fri, 19 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/BorradaileSW10},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Online Network Design with Outliers.\n \n\n\n \n Anagnostopoulos, A.; Grandoni, F.; Leonardi, S.; and Sankowski, P.\n \n\n\n \n\n\n\n In Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I, pages 114--126, 2010. \n \n\n\n\n
\n\n\n \n \n \n \"OnlinePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/icalp/AnagnostopoulosGLS10,\n  author    = {Aris Anagnostopoulos and\n               Fabrizio Grandoni and\n               Stefano Leonardi and\n               Piotr Sankowski},\n  title     = {Online Network Design with Outliers},\n  booktitle = {Automata, Languages and Programming, 37th International Colloquium,\n               {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part\n               {I}},\n  pages     = {114--126},\n  year      = {2010},\n  crossref  = {DBLP:conf/icalp/2010-1},\n  url       = {https://doi.org/10.1007/978-3-642-14165-2_11},\n  doi       = {10.1007/978-3-642-14165-2_11},\n  timestamp = {Sun, 04 Jun 2017 10:07:29 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/icalp/AnagnostopoulosGLS10},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Combinatorial Auctions with Budgets.\n \n\n\n \n Fiat, A.; Leonardi, S.; Saia, J.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1001.1686. 2010.\n \n\n\n\n
\n\n\n \n \n \n \"CombinatorialPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/abs-1001-1686,\n  author    = {Amos Fiat and\n               Stefano Leonardi and\n               Jared Saia and\n               Piotr Sankowski},\n  title     = {Combinatorial Auctions with Budgets},\n  journal   = {CoRR},\n  volume    = {abs/1001.1686},\n  year      = {2010},\n  url       = {http://arxiv.org/abs/1001.1686},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1001-1686},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time.\n \n\n\n \n Borradaile, G.; Sankowski, P.; and Wulff-Nilsen, C.\n \n\n\n \n\n\n\n CoRR, abs/1003.1320. 2010.\n \n\n\n\n
\n\n\n \n \n \n \"MinPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/abs-1003-1320,\n  author    = {Glencora Borradaile and\n               Piotr Sankowski and\n               Christian Wulff{-}Nilsen},\n  title     = {Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing\n               Time},\n  journal   = {CoRR},\n  volume    = {abs/1003.1320},\n  year      = {2010},\n  url       = {http://arxiv.org/abs/1003.1320},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1003-1320},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Improved Minimum Cuts and Maximum Flows in Undirected Planar Graphs.\n \n\n\n \n Italiano, G. F.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/1011.2843. 2010.\n \n\n\n\n
\n\n\n \n \n \n \"ImprovedPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/abs-1011-2843,\n  author    = {Giuseppe F. Italiano and\n               Piotr Sankowski},\n  title     = {Improved Minimum Cuts and Maximum Flows in Undirected Planar Graphs},\n  journal   = {CoRR},\n  volume    = {abs/1011.2843},\n  year      = {2010},\n  url       = {http://arxiv.org/abs/1011.2843},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1011-2843},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I.\n \n\n\n \n de Berg, M.; and Meyer, U.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 6346, of Lecture Notes in Computer Science. 2010.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"AlgorithmsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/esa/2010-1,\n  editor    = {Mark de Berg and\n               Ulrich Meyer},\n  title     = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,\n               UK, September 6-8, 2010. Proceedings, Part {I}},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {6346},\n  publisher = {Springer},\n  year      = {2010},\n  url       = {https://doi.org/10.1007/978-3-642-15775-2},\n  doi       = {10.1007/978-3-642-15775-2},\n  isbn      = {978-3-642-15774-5},\n  timestamp = {Tue, 25 Jul 2017 16:35:22 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/2010-1},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA.\n \n\n\n \n \n \n\n\n \n\n\n\n 2010.IEEE Computer Society.\n \n\n\n\n
\n\n\n \n \n \n \"51thPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/focs/2010,\n  title     = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}\n               2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},\n  publisher = {{IEEE} Computer Society},\n  year      = {2010},\n  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5669376},\n  isbn      = {978-0-7695-4244-7},\n  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/2010},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.\n \n\n\n \n Abramsky, S.; Gavoille, C.; Kirchner, C.; auf der Heide, F. M.; and Spirakis, P. G.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 6198, of Lecture Notes in Computer Science. 2010.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"Automata,Paper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/icalp/2010-1,\n  editor    = {Samson Abramsky and\n               Cyril Gavoille and\n               Claude Kirchner and\n               Friedhelm Meyer auf der Heide and\n               Paul G. Spirakis},\n  title     = {Automata, Languages and Programming, 37th International Colloquium,\n               {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part\n               {I}},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {6198},\n  publisher = {Springer},\n  year      = {2010},\n  url       = {https://doi.org/10.1007/978-3-642-14165-2},\n  doi       = {10.1007/978-3-642-14165-2},\n  isbn      = {978-3-642-14164-5},\n  timestamp = {Sun, 04 Jun 2017 10:07:29 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/icalp/2010-1},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (2)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Maximum weight bipartite matching in matrix multiplication time.\n \n\n\n \n Sankowski, P.\n \n\n\n \n\n\n\n Theor. Comput. Sci., 410(44): 4480--4488. 2009.\n \n\n\n\n
\n\n\n \n \n \n \"MaximumPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/tcs/Sankowski09,\n  author    = {Piotr Sankowski},\n  title     = {Maximum weight bipartite matching in matrix multiplication time},\n  journal   = {Theor. Comput. Sci.},\n  volume    = {410},\n  number    = {44},\n  pages     = {4480--4488},\n  year      = {2009},\n  url       = {https://doi.org/10.1016/j.tcs.2009.07.028},\n  doi       = {10.1016/j.tcs.2009.07.028},\n  timestamp = {Sun, 28 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/tcs/Sankowski09},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Fast Approximation in Subspaces by Doubling Metric Decomposition.\n \n\n\n \n Cygan, M.; Kowalik, L.; Mucha, M.; Pilipczuk, M.; and Sankowski, P.\n \n\n\n \n\n\n\n CoRR, abs/0911.1626. 2009.\n \n\n\n\n
\n\n\n \n \n \n \"FastPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/corr/abs-0911-1626,\n  author    = {Marek Cygan and\n               Lukasz Kowalik and\n               Marcin Mucha and\n               Marcin Pilipczuk and\n               Piotr Sankowski},\n  title     = {Fast Approximation in Subspaces by Doubling Metric Decomposition},\n  journal   = {CoRR},\n  volume    = {abs/0911.1626},\n  year      = {2009},\n  url       = {http://arxiv.org/abs/0911.1626},\n  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-0911-1626},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (9)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Processor Efficient Parallel Matching.\n \n\n\n \n Sankowski, P.\n \n\n\n \n\n\n\n Theory Comput. Syst., 42(1): 73--90. 2008.\n \n\n\n\n
\n\n\n \n \n \n \"ProcessorPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/mst/Sankowski08,\n  author    = {Piotr Sankowski},\n  title     = {Processor Efficient Parallel Matching},\n  journal   = {Theory Comput. Syst.},\n  volume    = {42},\n  number    = {1},\n  pages     = {73--90},\n  year      = {2008},\n  url       = {https://doi.org/10.1007/s00224-007-9018-5},\n  doi       = {10.1007/s00224-007-9018-5},\n  timestamp = {Sun, 28 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/mst/Sankowski08},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Set Covering with our Eyes Closed.\n \n\n\n \n Grandoni, F.; Gupta, A.; Leonardi, S.; Miettinen, P.; Sankowski, P.; and Singh, M.\n \n\n\n \n\n\n\n In 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pages 347--356, 2008. \n \n\n\n\n
\n\n\n \n \n \n \"SetPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/focs/GrandoniGLMSS08,\n  author    = {Fabrizio Grandoni and\n               Anupam Gupta and\n               Stefano Leonardi and\n               Pauli Miettinen and\n               Piotr Sankowski and\n               Mohit Singh},\n  title     = {Set Covering with our Eyes Closed},\n  booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}\n               2008, October 25-28, 2008, Philadelphia, PA, {USA}},\n  pages     = {347--356},\n  year      = {2008},\n  crossref  = {DBLP:conf/focs/2008},\n  url       = {https://doi.org/10.1109/FOCS.2008.31},\n  doi       = {10.1109/FOCS.2008.31},\n  timestamp = {Fri, 19 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/GrandoniGLMSS08},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Dynamic Normal Forms and Dynamic Characteristic Polynomial.\n \n\n\n \n Frandsen, G. S.; and Sankowski, P.\n \n\n\n \n\n\n\n In Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pages 434--446, 2008. \n \n\n\n\n
\n\n\n \n \n \n \"DynamicPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/icalp/FrandsenS08,\n  author    = {Gudmund Skovbjerg Frandsen and\n               Piotr Sankowski},\n  title     = {Dynamic Normal Forms and Dynamic Characteristic Polynomial},\n  booktitle = {Automata, Languages and Programming, 35th International Colloquium,\n               {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part\n               {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},\n  pages     = {434--446},\n  year      = {2008},\n  crossref  = {DBLP:conf/icalp/2008-1},\n  url       = {https://doi.org/10.1007/978-3-540-70575-8_36},\n  doi       = {10.1007/978-3-540-70575-8_36},\n  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/icalp/FrandsenS08},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algebraic Graph Algorithms.\n \n\n\n \n Sankowski, P.\n \n\n\n \n\n\n\n In Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pages 68--82, 2008. \n \n\n\n\n
\n\n\n \n \n \n \"AlgebraicPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/mfcs/Sankowski08,\n  author    = {Piotr Sankowski},\n  title     = {Algebraic Graph Algorithms},\n  booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International\n               Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},\n  pages     = {68--82},\n  year      = {2008},\n  crossref  = {DBLP:conf/mfcs/2008},\n  url       = {https://doi.org/10.1007/978-3-540-85238-4_5},\n  doi       = {10.1007/978-3-540-85238-4_5},\n  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/mfcs/Sankowski08},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Stochastic analyses for online combinatorial optimization problems.\n \n\n\n \n Garg, N.; Gupta, A.; Leonardi, S.; and Sankowski, P.\n \n\n\n \n\n\n\n In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pages 942--951, 2008. \n \n\n\n\n
\n\n\n \n \n \n \"StochasticPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/soda/GargGLS08,\n  author    = {Naveen Garg and\n               Anupam Gupta and\n               Stefano Leonardi and\n               Piotr Sankowski},\n  title     = {Stochastic analyses for online combinatorial optimization problems},\n  booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete\n               Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,\n               2008},\n  pages     = {942--951},\n  year      = {2008},\n  crossref  = {DBLP:conf/soda/2008},\n  url       = {http://dl.acm.org/citation.cfm?id=1347082.1347185},\n  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/soda/GargGLS08},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA.\n \n\n\n \n \n \n\n\n \n\n\n\n 2008.IEEE Computer Society.\n \n\n\n\n
\n\n\n \n \n \n \"49thPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/focs/2008,\n  title     = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}\n               2008, October 25-28, 2008, Philadelphia, PA, {USA}},\n  publisher = {{IEEE} Computer Society},\n  year      = {2008},\n  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4690923},\n  isbn      = {978-0-7695-3436-7},\n  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/2008},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games.\n \n\n\n \n Aceto, L.; Damg\\aard, I.; Goldberg, L. A.; Halldórsson, M. M.; Ingólfsdóttir, A.; and Walukiewicz, I.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 5125, of Lecture Notes in Computer Science. 2008.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"Automata,Paper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/icalp/2008-1,\n  editor    = {Luca Aceto and\n               Ivan Damg{\\aa}rd and\n               Leslie Ann Goldberg and\n               Magn{\\'{u}}s M. Halld{\\'{o}}rsson and\n               Anna Ing{\\'{o}}lfsd{\\'{o}}ttir and\n               Igor Walukiewicz},\n  title     = {Automata, Languages and Programming, 35th International Colloquium,\n               {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part\n               {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {5125},\n  publisher = {Springer},\n  year      = {2008},\n  url       = {https://doi.org/10.1007/978-3-540-70575-8},\n  doi       = {10.1007/978-3-540-70575-8},\n  isbn      = {978-3-540-70574-1},\n  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/icalp/2008-1},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings.\n \n\n\n \n Ochmanski, E.; and Tyszkiewicz, J.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 5162, of Lecture Notes in Computer Science. 2008.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"MathematicalPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/mfcs/2008,\n  editor    = {Edward Ochmanski and\n               Jerzy Tyszkiewicz},\n  title     = {Mathematical Foundations of Computer Science 2008, 33rd International\n               Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {5162},\n  publisher = {Springer},\n  year      = {2008},\n  url       = {https://doi.org/10.1007/978-3-540-85238-4},\n  doi       = {10.1007/978-3-540-85238-4},\n  isbn      = {978-3-540-85237-7},\n  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/mfcs/2008},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008.\n \n\n\n \n Teng, S.\n , editor\n .\n \n\n\n \n\n\n\n 2008.SIAM.\n \n\n\n\n
\n\n\n \n \n \n \"ProceedingsPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/soda/2008,\n  editor    = {Shang{-}Hua Teng},\n  title     = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete\n               Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,\n               2008},\n  publisher = {{SIAM}},\n  year      = {2008},\n  url       = {http://dl.acm.org/citation.cfm?id=1347082},\n  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/soda/2008},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2007\n \n \n (6)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Dynamic Plane Transitive Closure.\n \n\n\n \n Diks, K.; and Sankowski, P.\n \n\n\n \n\n\n\n In Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pages 594--604, 2007. \n \n\n\n\n
\n\n\n \n \n \n \"DynamicPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/esa/DiksS07,\n  author    = {Krzysztof Diks and\n               Piotr Sankowski},\n  title     = {Dynamic Plane Transitive Closure},\n  booktitle = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,\n               October 8-10, 2007, Proceedings},\n  pages     = {594--604},\n  year      = {2007},\n  crossref  = {DBLP:conf/esa/2007},\n  url       = {https://doi.org/10.1007/978-3-540-75520-3_53},\n  doi       = {10.1007/978-3-540-75520-3_53},\n  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/DiksS07},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Network formation games with local coalitions.\n \n\n\n \n Leonardi, S.; and Sankowski, P.\n \n\n\n \n\n\n\n In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pages 299--305, 2007. \n \n\n\n\n
\n\n\n \n \n \n \"NetworkPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/podc/LeonardiS07,\n  author    = {Stefano Leonardi and\n               Piotr Sankowski},\n  title     = {Network formation games with local coalitions},\n  booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Principles\n               of Distributed Computing, {PODC} 2007, Portland, Oregon, USA, August\n               12-15, 2007},\n  pages     = {299--305},\n  year      = {2007},\n  crossref  = {DBLP:conf/podc/2007},\n  url       = {http://doi.acm.org/10.1145/1281100.1281143},\n  doi       = {10.1145/1281100.1281143},\n  timestamp = {Wed, 23 May 2012 14:26:11 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/podc/LeonardiS07},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Faster dynamic matchings and vertex connectivity.\n \n\n\n \n Sankowski, P.\n \n\n\n \n\n\n\n In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pages 118--126, 2007. \n \n\n\n\n
\n\n\n \n \n \n \"FasterPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/soda/Sankowski07,\n  author    = {Piotr Sankowski},\n  title     = {Faster dynamic matchings and vertex connectivity},\n  booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete\n               Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,\n               2007},\n  pages     = {118--126},\n  year      = {2007},\n  crossref  = {DBLP:conf/soda/2007},\n  url       = {http://dl.acm.org/citation.cfm?id=1283383.1283397},\n  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/soda/Sankowski07},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings.\n \n\n\n \n Arge, L.; Hoffmann, M.; and Welzl, E.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 4698, of Lecture Notes in Computer Science. 2007.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"AlgorithmsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/esa/2007,\n  editor    = {Lars Arge and\n               Michael Hoffmann and\n               Emo Welzl},\n  title     = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,\n               October 8-10, 2007, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {4698},\n  publisher = {Springer},\n  year      = {2007},\n  url       = {https://doi.org/10.1007/978-3-540-75520-3},\n  doi       = {10.1007/978-3-540-75520-3},\n  isbn      = {978-3-540-75519-7},\n  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/2007},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007.\n \n\n\n \n Gupta, I.; and Wattenhofer, R.\n , editor\n s.\n \n\n\n \n\n\n\n 2007.ACM.\n \n\n\n\n
\n\n\n \n \n \n \"ProceedingsPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/podc/2007,\n  editor    = {Indranil Gupta and\n               Roger Wattenhofer},\n  title     = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Principles\n               of Distributed Computing, {PODC} 2007, Portland, Oregon, USA, August\n               12-15, 2007},\n  publisher = {{ACM}},\n  year      = {2007},\n  url       = {http://dl.acm.org/citation.cfm?id=1281100},\n  isbn      = {978-1-59593-616-5},\n  timestamp = {Wed, 23 May 2012 14:26:11 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/podc/2007},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007.\n \n\n\n \n Bansal, N.; Pruhs, K.; and Stein, C.\n , editor\n s.\n \n\n\n \n\n\n\n 2007.SIAM.\n \n\n\n\n
\n\n\n \n \n \n \"ProceedingsPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/soda/2007,\n  editor    = {Nikhil Bansal and\n               Kirk Pruhs and\n               Clifford Stein},\n  title     = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete\n               Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,\n               2007},\n  publisher = {{SIAM}},\n  year      = {2007},\n  url       = {http://dl.acm.org/citation.cfm?id=1283383},\n  isbn      = {978-0-898716-24-5},\n  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/soda/2007},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2006\n \n \n (3)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Maximum Matchings in Planar Graphs via Gaussian Elimination.\n \n\n\n \n Mucha, M.; and Sankowski, P.\n \n\n\n \n\n\n\n Algorithmica, 45(1): 3--20. 2006.\n \n\n\n\n
\n\n\n \n \n \n \"MaximumPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@article{DBLP:journals/algorithmica/MuchaS06,\n  author    = {Marcin Mucha and\n               Piotr Sankowski},\n  title     = {Maximum Matchings in Planar Graphs via Gaussian Elimination},\n  journal   = {Algorithmica},\n  volume    = {45},\n  number    = {1},\n  pages     = {3--20},\n  year      = {2006},\n  url       = {https://doi.org/10.1007/s00453-005-1187-5},\n  doi       = {10.1007/s00453-005-1187-5},\n  timestamp = {Wed, 17 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/journals/algorithmica/MuchaS06},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Weighted Bipartite Matching in Matrix Multiplication Time.\n \n\n\n \n Sankowski, P.\n \n\n\n \n\n\n\n In Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pages 274--285, 2006. \n \n\n\n\n
\n\n\n \n \n \n \"WeightedPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/icalp/Sankowski06,\n  author    = {Piotr Sankowski},\n  title     = {Weighted Bipartite Matching in Matrix Multiplication Time},\n  booktitle = {Automata, Languages and Programming, 33rd International Colloquium,\n               {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},\n  pages     = {274--285},\n  year      = {2006},\n  crossref  = {DBLP:conf/icalp/2006-1},\n  url       = {https://doi.org/10.1007/11786986_25},\n  doi       = {10.1007/11786986_25},\n  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/icalp/Sankowski06},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I.\n \n\n\n \n Bugliesi, M.; Preneel, B.; Sassone, V.; and Wegener, I.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 4051, of Lecture Notes in Computer Science. 2006.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"Automata,Paper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/icalp/2006-1,\n  editor    = {Michele Bugliesi and\n               Bart Preneel and\n               Vladimiro Sassone and\n               Ingo Wegener},\n  title     = {Automata, Languages and Programming, 33rd International Colloquium,\n               {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {4051},\n  publisher = {Springer},\n  year      = {2006},\n  url       = {https://doi.org/10.1007/11786986},\n  doi       = {10.1007/11786986},\n  isbn      = {3-540-35904-4},\n  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/icalp/2006-1},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2005\n \n \n (6)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Subquadratic Algorithm for Dynamic Shortest Distances.\n \n\n\n \n Sankowski, P.\n \n\n\n \n\n\n\n In Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pages 461--470, 2005. \n \n\n\n\n
\n\n\n \n \n \n \"SubquadraticPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/cocoon/Sankowski05,\n  author    = {Piotr Sankowski},\n  title     = {Subquadratic Algorithm for Dynamic Shortest Distances},\n  booktitle = {Computing and Combinatorics, 11th Annual International Conference,\n               {COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings},\n  pages     = {461--470},\n  year      = {2005},\n  crossref  = {DBLP:conf/cocoon/2005},\n  url       = {https://doi.org/10.1007/11533719_47},\n  doi       = {10.1007/11533719_47},\n  timestamp = {Tue, 30 May 2017 16:36:53 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/cocoon/Sankowski05},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Shortest Paths in Matrix Multiplication Time.\n \n\n\n \n Sankowski, P.\n \n\n\n \n\n\n\n In Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pages 770--778, 2005. \n \n\n\n\n
\n\n\n \n \n \n \"ShortestPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/esa/Sankowski05,\n  author    = {Piotr Sankowski},\n  title     = {Shortest Paths in Matrix Multiplication Time},\n  booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de\n               Mallorca, Spain, October 3-6, 2005, Proceedings},\n  pages     = {770--778},\n  year      = {2005},\n  crossref  = {DBLP:conf/esa/2005},\n  url       = {https://doi.org/10.1007/11561071_68},\n  doi       = {10.1007/11561071_68},\n  timestamp = {Tue, 30 May 2017 16:36:52 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/Sankowski05},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Processor efficient parallel matching.\n \n\n\n \n Sankowski, P.\n \n\n\n \n\n\n\n In SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pages 165--170, 2005. \n \n\n\n\n
\n\n\n \n \n \n \"ProcessorPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/spaa/Sankowski05,\n  author    = {Piotr Sankowski},\n  title     = {Processor efficient parallel matching},\n  booktitle = {{SPAA} 2005: Proceedings of the 17th Annual {ACM} Symposium on Parallelism\n               in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada,\n               {USA}},\n  pages     = {165--170},\n  year      = {2005},\n  crossref  = {DBLP:conf/spaa/2005},\n  url       = {http://doi.acm.org/10.1145/1073970.1073994},\n  doi       = {10.1145/1073970.1073994},\n  timestamp = {Thu, 23 Jun 2011 21:54:18 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/spaa/Sankowski05},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings.\n \n\n\n \n Wang, L.\n , editor\n .\n \n\n\n \n\n\n\n Volume 3595, of Lecture Notes in Computer Science. 2005.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"ComputingPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/cocoon/2005,\n  editor    = {Lusheng Wang},\n  title     = {Computing and Combinatorics, 11th Annual International Conference,\n               {COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {3595},\n  publisher = {Springer},\n  year      = {2005},\n  url       = {https://doi.org/10.1007/11533719},\n  doi       = {10.1007/11533719},\n  isbn      = {3-540-28061-8},\n  timestamp = {Tue, 30 May 2017 16:36:53 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/cocoon/2005},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings.\n \n\n\n \n Brodal, G. S.; and Leonardi, S.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 3669, of Lecture Notes in Computer Science. 2005.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"AlgorithmsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/esa/2005,\n  editor    = {Gerth St{\\o}lting Brodal and\n               Stefano Leonardi},\n  title     = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de\n               Mallorca, Spain, October 3-6, 2005, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {3669},\n  publisher = {Springer},\n  year      = {2005},\n  url       = {https://doi.org/10.1007/11561071},\n  doi       = {10.1007/11561071},\n  isbn      = {3-540-29118-0},\n  timestamp = {Tue, 30 May 2017 16:36:52 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/2005},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA.\n \n\n\n \n Gibbons, P. B.; and Spirakis, P. G.\n , editor\n s.\n \n\n\n \n\n\n\n 2005.ACM.\n \n\n\n\n
\n\n\n \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/spaa/2005,\n  editor    = {Phillip B. Gibbons and\n               Paul G. Spirakis},\n  title     = {{SPAA} 2005: Proceedings of the 17th Annual {ACM} Symposium on Parallelism\n               in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada,\n               {USA}},\n  publisher = {{ACM}},\n  year      = {2005},\n  isbn      = {1-58113-986-1},\n  timestamp = {Thu, 23 Jun 2011 21:54:18 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/spaa/2005},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2004\n \n \n (7)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Maximum Matchings in Planar Graphs via Gaussian Elimination.\n \n\n\n \n Mucha, M.; and Sankowski, P.\n \n\n\n \n\n\n\n In Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pages 532--543, 2004. \n \n\n\n\n
\n\n\n \n \n \n \"MaximumPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/esa/MuchaS04,\n  author    = {Marcin Mucha and\n               Piotr Sankowski},\n  title     = {Maximum Matchings in Planar Graphs via Gaussian Elimination},\n  booktitle = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway,\n               September 14-17, 2004, Proceedings},\n  pages     = {532--543},\n  year      = {2004},\n  crossref  = {DBLP:conf/esa/2004},\n  url       = {https://doi.org/10.1007/978-3-540-30140-0_48},\n  doi       = {10.1007/978-3-540-30140-0_48},\n  timestamp = {Tue, 30 May 2017 12:57:44 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/MuchaS04},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Maximum Matchings via Gaussian Elimination.\n \n\n\n \n Mucha, M.; and Sankowski, P.\n \n\n\n \n\n\n\n In 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pages 248--255, 2004. \n \n\n\n\n
\n\n\n \n \n \n \"MaximumPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/focs/MuchaS04,\n  author    = {Marcin Mucha and\n               Piotr Sankowski},\n  title     = {Maximum Matchings via Gaussian Elimination},\n  booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19\n               October 2004, Rome, Italy, Proceedings},\n  pages     = {248--255},\n  year      = {2004},\n  crossref  = {DBLP:conf/focs/2004},\n  url       = {https://doi.org/10.1109/FOCS.2004.40},\n  doi       = {10.1109/FOCS.2004.40},\n  timestamp = {Fri, 19 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/MuchaS04},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract).\n \n\n\n \n Sankowski, P.\n \n\n\n \n\n\n\n In 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pages 509--517, 2004. \n \n\n\n\n
\n\n\n \n \n \n \"DynamicPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/focs/Sankowski04,\n  author    = {Piotr Sankowski},\n  title     = {Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)},\n  booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19\n               October 2004, Rome, Italy, Proceedings},\n  pages     = {509--517},\n  year      = {2004},\n  crossref  = {DBLP:conf/focs/2004},\n  url       = {https://doi.org/10.1109/FOCS.2004.25},\n  doi       = {10.1109/FOCS.2004.25},\n  timestamp = {Fri, 19 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/Sankowski04},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Improving Web Sites by Automatic Source Code Analysis and Modifications.\n \n\n\n \n Ciebiera, K.; and Sankowski, P.\n \n\n\n \n\n\n\n In Web Engineering - 4th International Conference, ICWE 2004, Munich, Germany, July 26-30, 2004, Proceedings, pages 579--580, 2004. \n \n\n\n\n
\n\n\n \n \n \n \"ImprovingPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/icwe/CiebieraS04,\n  author    = {Krzysztof Ciebiera and\n               Piotr Sankowski},\n  title     = {Improving Web Sites by Automatic Source Code Analysis and Modifications},\n  booktitle = {Web Engineering - 4th International Conference, {ICWE} 2004, Munich,\n               Germany, July 26-30, 2004, Proceedings},\n  pages     = {579--580},\n  year      = {2004},\n  crossref  = {DBLP:conf/icwe/2004},\n  url       = {https://doi.org/10.1007/978-3-540-27834-4_73},\n  doi       = {10.1007/978-3-540-27834-4_73},\n  timestamp = {Tue, 30 May 2017 12:57:44 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/icwe/CiebieraS04},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings.\n \n\n\n \n Albers, S.; and Radzik, T.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 3221, of Lecture Notes in Computer Science. 2004.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"AlgorithmsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/esa/2004,\n  editor    = {Susanne Albers and\n               Tomasz Radzik},\n  title     = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway,\n               September 14-17, 2004, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {3221},\n  publisher = {Springer},\n  year      = {2004},\n  url       = {https://doi.org/10.1007/b100428},\n  doi       = {10.1007/b100428},\n  isbn      = {3-540-23025-4},\n  timestamp = {Tue, 30 May 2017 12:57:44 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/2004},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings.\n \n\n\n \n \n \n\n\n \n\n\n\n 2004.IEEE Computer Society.\n \n\n\n\n
\n\n\n \n \n \n \"45thPaper\n  \n \n\n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/focs/2004,\n  title     = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19\n               October 2004, Rome, Italy, Proceedings},\n  publisher = {{IEEE} Computer Society},\n  year      = {2004},\n  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9430},\n  isbn      = {0-7695-2228-9},\n  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},\n  biburl    = {http://dblp.org/rec/bib/conf/focs/2004},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Web Engineering - 4th International Conference, ICWE 2004, Munich, Germany, July 26-30, 2004, Proceedings.\n \n\n\n \n Koch, N.; Fraternali, P.; and Wirsing, M.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 3140, of Lecture Notes in Computer Science. 2004.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"WebPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/icwe/2004,\n  editor    = {Nora Koch and\n               Piero Fraternali and\n               Martin Wirsing},\n  title     = {Web Engineering - 4th International Conference, {ICWE} 2004, Munich,\n               Germany, July 26-30, 2004, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {3140},\n  publisher = {Springer},\n  year      = {2004},\n  url       = {https://doi.org/10.1007/b99180},\n  doi       = {10.1007/b99180},\n  isbn      = {3-540-22511-0},\n  timestamp = {Tue, 30 May 2017 12:57:44 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/icwe/2004},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2003\n \n \n (4)\n \n \n
\n
\n \n \n
\n
\n \n \n\n \n \n \n \n Multisampling: A New Approach to Uniform Sampling and Approximate Counting.\n \n\n\n \n Sankowski, P.\n \n\n\n \n\n\n\n In Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pages 740--751, 2003. \n \n\n\n\n
\n\n\n \n \n \n \"Multisampling:Paper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/esa/Sankowski03,\n  author    = {Piotr Sankowski},\n  title     = {Multisampling: {A} New Approach to Uniform Sampling and Approximate\n               Counting},\n  booktitle = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest,\n               Hungary, September 16-19, 2003, Proceedings},\n  pages     = {740--751},\n  year      = {2003},\n  crossref  = {DBLP:conf/esa/2003},\n  url       = {https://doi.org/10.1007/978-3-540-39658-1_66},\n  doi       = {10.1007/978-3-540-39658-1_66},\n  timestamp = {Thu, 15 Jun 2017 21:39:12 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/Sankowski03},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Alternative Algorithms for Counting All Matchings in Graphs.\n \n\n\n \n Sankowski, P.\n \n\n\n \n\n\n\n In STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pages 427--438, 2003. \n \n\n\n\n
\n\n\n \n \n \n \"AlternativePaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@inproceedings{DBLP:conf/stacs/Sankowski03,\n  author    = {Piotr Sankowski},\n  title     = {Alternative Algorithms for Counting All Matchings in Graphs},\n  booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer\n               Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},\n  pages     = {427--438},\n  year      = {2003},\n  crossref  = {DBLP:conf/stacs/2003},\n  url       = {https://doi.org/10.1007/3-540-36494-3_38},\n  doi       = {10.1007/3-540-36494-3_38},\n  timestamp = {Mon, 29 May 2017 16:53:43 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/stacs/Sankowski03},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings.\n \n\n\n \n Battista, G. D.; and Zwick, U.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 2832, of Lecture Notes in Computer Science. 2003.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"AlgorithmsPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/esa/2003,\n  editor    = {Giuseppe Di Battista and\n               Uri Zwick},\n  title     = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest,\n               Hungary, September 16-19, 2003, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {2832},\n  publisher = {Springer},\n  year      = {2003},\n  url       = {https://doi.org/10.1007/b13632},\n  doi       = {10.1007/b13632},\n  isbn      = {3-540-20064-9},\n  timestamp = {Thu, 15 Jun 2017 21:39:12 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/esa/2003},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n
\n
\n \n \n\n \n \n \n \n STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings.\n \n\n\n \n Alt, H.; and Habib, M.\n , editor\n s.\n \n\n\n \n\n\n\n Volume 2607, of Lecture Notes in Computer Science. 2003.Springer.\n \n\n\n\n
\n\n\n \n \n \n \"STACSPaper\n  \n \n\n \n \n doi\n  \n \n\n bibtex \n \n \n \n\n  \n\n \n buy\n \n\n \n\n \n\n \n \n \n \n \n \n \n \n\n\n
\n
@proceedings{DBLP:conf/stacs/2003,\n  editor    = {Helmut Alt and\n               Michel Habib},\n  title     = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer\n               Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {2607},\n  publisher = {Springer},\n  year      = {2003},\n  url       = {https://doi.org/10.1007/3-540-36494-3},\n  doi       = {10.1007/3-540-36494-3},\n  isbn      = {3-540-00623-0},\n  timestamp = {Mon, 29 May 2017 16:53:43 +0200},\n  biburl    = {http://dblp.org/rec/bib/conf/stacs/2003},\n  bibsource = {dblp computer science bibliography, http://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n
\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n
\n
\n \n

Embedding in another Page

\n
\n
\n\n

\n Copy&paste any of the following snippets into an existing\n page to embed this page. For more details see the\n documention.\n

\n\n JavaScript\n (Easiest)\n
\n \n <script src=\"https://bibbase.org/dblp/piotr_sankowski?jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/dblp/piotr_sankowski?jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n
\n \n <iframe src=\"https://bibbase.org/dblp/piotr_sankowski?jsonp=1\"></iframe>\n \n
\n\n \n
\n
\n \n
\n
\n\n \n \n \n \n\n
\n\n"}; document.write(bibbase_data.data);