\n \n \n
\n
\n \n 2025\n \n \n (9)\n \n \n
\n
\n \n \n
\n
\n\n \n \n \n \n \n \n Online Matching with Delays and Stochastic Arrival Times.\n \n \n \n \n\n\n \n Mari, M.; Pawlowski, M.; Ren, R.; and Sankowski, P.\n\n\n \n\n\n\n
Theory Comput. Syst., 69(1): 12. 2025.\n
\n\n
\n\n
\n\n
\n\n \n \n ![\"Online](\"//bibbase.org/img/filetypes/link.svg\"\n\t "\\"Paper\\"\n\t")
Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/mst/MariPRS25,\n author = {Mathieu Mari and\n Michal Pawlowski and\n Runtian Ren and\n Piotr Sankowski},\n title = {Online Matching with Delays and Stochastic Arrival Times},\n journal = {Theory Comput. Syst.},\n volume = {69},\n number = {1},\n pages = {12},\n year = {2025},\n url = {https://doi.org/10.1007/s00224-024-10207-6},\n doi = {10.1007/S00224-024-10207-6},\n timestamp = {Thu, 27 Feb 2025 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/mst/MariPRS25.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Accurate Estimation of Feature Importance Faithfulness for Tree Models.\n \n \n \n \n\n\n \n Gajewski, M.; Karczmarz, A.; Rapicki, M.; and Sankowski, P.\n\n\n \n\n\n\n In
AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA, pages 16691–16698, 2025. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/aaai/GajewskiKRS25,\n author = {Mateusz Gajewski and\n Adam Karczmarz and\n Mateusz Rapicki and\n Piotr Sankowski},\n title = {Accurate Estimation of Feature Importance Faithfulness for Tree Models},\n booktitle = {AAAI-25, Sponsored by the Association for the Advancement of Artificial\n Intelligence, February 25 - March 4, 2025, Philadelphia, PA, {USA}},\n pages = {16691--16698},\n year = {2025},\n crossref = {DBLP:conf/aaai/2025},\n url = {https://doi.org/10.1609/aaai.v39i16.33834},\n doi = {10.1609/AAAI.V39I16.33834},\n timestamp = {Thu, 17 Apr 2025 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/aaai/GajewskiKRS25.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Wait, that's not an option: LLMs Robustness with Incorrect Multiple-Choice Options.\n \n \n \n \n\n\n \n Góral, G.; Wisnios, E.; Sankowski, P.; and Budzianowski, P.\n\n\n \n\n\n\n In
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), ACL 2025, Vienna, Austria, July 27 - August 1, 2025, pages 1495–1515, 2025. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/acl/GoralWSB25,\n author = {Gracjan G{\\'{o}}ral and\n Emilia Wisnios and\n Piotr Sankowski and\n Pawel Budzianowski},\n title = {Wait, that's not an option: LLMs Robustness with Incorrect Multiple-Choice\n Options},\n booktitle = {Proceedings of the 63rd Annual Meeting of the Association for Computational\n Linguistics (Volume 1: Long Papers), {ACL} 2025, Vienna, Austria,\n July 27 - August 1, 2025},\n pages = {1495--1515},\n year = {2025},\n crossref = {DBLP:conf/acl/2025-1},\n url = {https://aclanthology.org/2025.acl-long.75/},\n timestamp = {Thu, 24 Jul 2025 21:25:39 +0200},\n biburl = {https://dblp.org/rec/conf/acl/GoralWSB25.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Faster Semi-Streaming Matchings via Alternating Trees.\n \n \n \n \n\n\n \n Mitrovic, S.; Mukherjee, A.; Sankowski, P.; and Sheu, W.\n\n\n \n\n\n\n In
52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, July 8-11, 2025, Aarhus, Denmark, pages 119:1–119:19, 2025. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/icalp/Mitrovic0SS25,\n author = {Slobodan Mitrovic and\n Anish Mukherjee and\n Piotr Sankowski and\n Wen{-}Horng Sheu},\n title = {Faster Semi-Streaming Matchings via Alternating Trees},\n booktitle = {52nd International Colloquium on Automata, Languages, and Programming,\n {ICALP} 2025, July 8-11, 2025, Aarhus, Denmark},\n pages = {119:1--119:19},\n year = {2025},\n crossref = {DBLP:conf/icalp/2025},\n url = {https://doi.org/10.4230/LIPIcs.ICALP.2025.119},\n doi = {10.4230/LIPICS.ICALP.2025.119},\n timestamp = {Tue, 05 Aug 2025 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/icalp/Mitrovic0SS25.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Joint MoE Scaling Laws: Mixture of Experts Can Be Memory Efficient.\n \n \n \n \n\n\n \n Ludziejewski, J.; Pióro, M.; Krajewski, J.; Stefaniak, M.; Krutul, M.; Malasnicki, J.; Cygan, M.; Sankowski, P.; Adamczewski, K.; Milos, P.; and Jaszczur, S.\n\n\n \n\n\n\n
CoRR, abs/2502.05172. 2025.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2502-05172,\n author = {Jan Ludziejewski and\n Maciej Pi{\\'{o}}ro and\n Jakub Krajewski and\n Maciej Stefaniak and\n Michal Krutul and\n Jan Malasnicki and\n Marek Cygan and\n Piotr Sankowski and\n Kamil Adamczewski and\n Piotr Milos and\n Sebastian Jaszczur},\n title = {Joint MoE Scaling Laws: Mixture of Experts Can Be Memory Efficient},\n journal = {CoRR},\n volume = {abs/2502.05172},\n year = {2025},\n url = {https://doi.org/10.48550/arXiv.2502.05172},\n doi = {10.48550/ARXIV.2502.05172},\n eprinttype = {arXiv},\n eprint = {2502.05172},\n timestamp = {Wed, 12 Mar 2025 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/corr/abs-2502-05172.bib},\n bibsource = {dblp computer science bibliography, https://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 VARSHAP: Addressing Global Dependency Problems in Explainable AI with Variance-Based Local Feature Attribution.\n \n \n \n \n\n\n \n Gajewski, M.; Morzy, M.; Karczmarz, A.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/2506.07229. 2025.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2506-07229,\n author = {Mateusz Gajewski and\n Mikolaj Morzy and\n Adam Karczmarz and\n Piotr Sankowski},\n title = {{VARSHAP:} Addressing Global Dependency Problems in Explainable {AI}\n with Variance-Based Local Feature Attribution},\n journal = {CoRR},\n volume = {abs/2506.07229},\n year = {2025},\n url = {https://doi.org/10.48550/arXiv.2506.07229},\n doi = {10.48550/ARXIV.2506.07229},\n eprinttype = {arXiv},\n eprint = {2506.07229},\n timestamp = {Mon, 07 Jul 2025 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2506-07229.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Decoupled Relative Learning Rate Schedules.\n \n \n \n \n\n\n \n Ludziejewski, J.; Malasnicki, J.; Pióro, M.; Krutul, M.; Ciebiera, K.; Stefaniak, M.; Krajewski, J.; Sankowski, P.; Cygan, M.; Adamczewski, K.; and Jaszczur, S.\n\n\n \n\n\n\n
CoRR, abs/2507.03526. 2025.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2507-03526,\n author = {Jan Ludziejewski and\n Jan Malasnicki and\n Maciej Pi{\\'{o}}ro and\n Michal Krutul and\n Kamil Ciebiera and\n Maciej Stefaniak and\n Jakub Krajewski and\n Piotr Sankowski and\n Marek Cygan and\n Kamil Adamczewski and\n Sebastian Jaszczur},\n title = {Decoupled Relative Learning Rate Schedules},\n journal = {CoRR},\n volume = {abs/2507.03526},\n year = {2025},\n url = {https://doi.org/10.48550/arXiv.2507.03526},\n doi = {10.48550/ARXIV.2507.03526},\n eprinttype = {arXiv},\n eprint = {2507.03526},\n timestamp = {Sun, 10 Aug 2025 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2507-03526.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2024\n \n \n (15)\n \n \n
\n
\n \n \n
\n
\n\n \n \n \n \n \n \n Multi-level Aggregation with Delays and Stochastic Arrivals.\n \n \n \n \n\n\n \n Mari, M.; Pawlowski, M.; Ren, R.; and Sankowski, P.\n\n\n \n\n\n\n In
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2024, Auckland, New Zealand, May 6-10, 2024, pages 2378–2380, 2024. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/atal/MariPRS24,\n author = {Mathieu Mari and\n Michal Pawlowski and\n Runtian Ren and\n Piotr Sankowski},\n title = {Multi-level Aggregation with Delays and Stochastic Arrivals},\n booktitle = {Proceedings of the 23rd International Conference on Autonomous Agents\n and Multiagent Systems, {AAMAS} 2024, Auckland, New Zealand, May 6-10,\n 2024},\n pages = {2378--2380},\n year = {2024},\n crossref = {DBLP:conf/atal/2024},\n url = {https://dl.acm.org/doi/10.5555/3635637.3663166},\n doi = {10.5555/3635637.3663166},\n timestamp = {Wed, 26 Jun 2024 14:06:50 +0200},\n biburl = {https://dblp.org/rec/conf/atal/MariPRS24.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n LLM generated responses to mitigate the impact of hate speech.\n \n \n \n \n\n\n \n Podolak, J.; Lukasik, S.; Balawender, P.; Ossowski, J.; Piotrowski, J.; Bakowicz, K.; and Sankowski, P.\n\n\n \n\n\n\n In
Findings of the Association for Computational Linguistics: EMNLP 2024, Miami, Florida, USA, November 12-16, 2024, pages 15860–15876, 2024. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/emnlp/PodolakLBOPBS24,\n author = {Jakub Podolak and\n Szymon Lukasik and\n Pawel Balawender and\n Jan Ossowski and\n Jan Piotrowski and\n Katarzyna Bakowicz and\n Piotr Sankowski},\n title = {{LLM} generated responses to mitigate the impact of hate speech},\n booktitle = {Findings of the Association for Computational Linguistics: {EMNLP}\n 2024, Miami, Florida, USA, November 12-16, 2024},\n pages = {15860--15876},\n year = {2024},\n crossref = {DBLP:conf/emnlp/2024f},\n url = {https://doi.org/10.18653/v1/2024.findings-emnlp.931},\n doi = {10.18653/V1/2024.FINDINGS-EMNLP.931},\n timestamp = {Fri, 13 Jun 2025 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/emnlp/PodolakLBOPBS24.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Dynamic PageRank: Algorithms and Lower Bounds.\n \n \n \n \n\n\n \n Jayaram, R.; Lacki, J.; Mitrovic, S.; Onak, K.; and Sankowski, P.\n\n\n \n\n\n\n In
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia, pages 90:1–90:19, 2024. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/icalp/JayaramLMOS24,\n author = {Rajesh Jayaram and\n Jakub Lacki and\n Slobodan Mitrovic and\n Krzysztof Onak and\n Piotr Sankowski},\n title = {Dynamic PageRank: Algorithms and Lower Bounds},\n booktitle = {51st International Colloquium on Automata, Languages, and Programming,\n {ICALP} 2024, July 8-12, 2024, Tallinn, Estonia},\n pages = {90:1--90:19},\n year = {2024},\n crossref = {DBLP:conf/icalp/2024},\n url = {https://doi.org/10.4230/LIPIcs.ICALP.2024.90},\n doi = {10.4230/LIPICS.ICALP.2024.90},\n timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},\n biburl = {https://dblp.org/rec/conf/icalp/JayaramLMOS24.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Scaling Laws for Fine-Grained Mixture of Experts.\n \n \n \n \n\n\n \n Ludziejewski, J.; Krajewski, J.; Adamczewski, K.; Pióro, M.; Krutul, M.; Antoniak, S.; Ciebiera, K.; Król, K.; Odrzygózdz, T.; Sankowski, P.; Cygan, M.; and Jaszczur, S.\n\n\n \n\n\n\n In
Forty-first International Conference on Machine Learning, ICML 2024, Vienna, Austria, July 21-27, 2024, 2024. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/icml/LudziejewskiKAP24,\n author = {Jan Ludziejewski and\n Jakub Krajewski and\n Kamil Adamczewski and\n Maciej Pi{\\'{o}}ro and\n Michal Krutul and\n Szymon Antoniak and\n Kamil Ciebiera and\n Krystian Kr{\\'{o}}l and\n Tomasz Odrzyg{\\'{o}}zdz and\n Piotr Sankowski and\n Marek Cygan and\n Sebastian Jaszczur},\n title = {Scaling Laws for Fine-Grained Mixture of Experts},\n booktitle = {Forty-first International Conference on Machine Learning, {ICML} 2024,\n Vienna, Austria, July 21-27, 2024},\n year = {2024},\n crossref = {DBLP:conf/icml/2024},\n url = {https://openreview.net/forum?id=yoqdlynCRs},\n timestamp = {Mon, 02 Sep 2024 16:45:29 +0200},\n biburl = {https://dblp.org/rec/conf/icml/LudziejewskiKAP24.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Online Multi-Level Aggregation with Delays and Stochastic Arrivals.\n \n \n \n \n\n\n \n Mari, M.; Pawlowski, M.; Ren, R.; and Sankowski, P.\n\n\n \n\n\n\n In
35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia, pages 49:1–49:20, 2024. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/isaac/MariPRS24,\n author = {Mathieu Mari and\n Michal Pawlowski and\n Runtian Ren and\n Piotr Sankowski},\n title = {Online Multi-Level Aggregation with Delays and Stochastic Arrivals},\n booktitle = {35th International Symposium on Algorithms and Computation, {ISAAC}\n 2024, December 8-11, 2024, Sydney, Australia},\n pages = {49:1--49:20},\n year = {2024},\n crossref = {DBLP:conf/isaac/2024},\n url = {https://doi.org/10.4230/LIPIcs.ISAAC.2024.49},\n doi = {10.4230/LIPICS.ISAAC.2024.49},\n timestamp = {Wed, 04 Dec 2024 17:11:34 +0100},\n biburl = {https://dblp.org/rec/conf/isaac/MariPRS24.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Shortest Disjoint Paths on a Grid.\n \n \n \n \n\n\n \n Mari, M.; Mukherjee, A.; Pilipczuk, M.; and Sankowski, P.\n\n\n \n\n\n\n In
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pages 346–365, 2024. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/soda/MariMS24,\n author = {Mathieu Mari and\n Anish Mukherjee and\n Michal Pilipczuk and\n Piotr Sankowski},\n title = {Shortest Disjoint Paths on a Grid},\n booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,\n {SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},\n pages = {346--365},\n year = {2024},\n crossref = {DBLP:conf/soda/2024},\n url = {https://doi.org/10.1137/1.9781611977912.14},\n doi = {10.1137/1.9781611977912.14},\n timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/soda/MariMS24.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Modeling Online Paging in Multi-Core Systems.\n \n \n \n \n\n\n \n Mari, M.; Mukherjee, A.; Ren, R.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/2401.05834. 2024.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2401-05834,\n author = {Mathieu Mari and\n Anish Mukherjee and\n Runtian Ren and\n Piotr Sankowski},\n title = {Modeling Online Paging in Multi-Core Systems},\n journal = {CoRR},\n volume = {abs/2401.05834},\n year = {2024},\n url = {https://doi.org/10.48550/arXiv.2401.05834},\n doi = {10.48550/ARXIV.2401.05834},\n eprinttype = {arXiv},\n eprint = {2401.05834},\n timestamp = {Thu, 25 Jan 2024 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/corr/abs-2401-05834.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Scaling Laws for Fine-Grained Mixture of Experts.\n \n \n \n \n\n\n \n Krajewski, J.; Ludziejewski, J.; Adamczewski, K.; Pióro, M.; Krutul, M.; Antoniak, S.; Ciebiera, K.; Król, K.; Odrzygózdz, T.; Sankowski, P.; Cygan, M.; and Jaszczur, S.\n\n\n \n\n\n\n
CoRR, abs/2402.07871. 2024.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2402-07871,\n author = {Jakub Krajewski and\n Jan Ludziejewski and\n Kamil Adamczewski and\n Maciej Pi{\\'{o}}ro and\n Michal Krutul and\n Szymon Antoniak and\n Kamil Ciebiera and\n Krystian Kr{\\'{o}}l and\n Tomasz Odrzyg{\\'{o}}zdz and\n Piotr Sankowski and\n Marek Cygan and\n Sebastian Jaszczur},\n title = {Scaling Laws for Fine-Grained Mixture of Experts},\n journal = {CoRR},\n volume = {abs/2402.07871},\n year = {2024},\n url = {https://doi.org/10.48550/arXiv.2402.07871},\n doi = {10.48550/ARXIV.2402.07871},\n eprinttype = {arXiv},\n eprint = {2402.07871},\n timestamp = {Mon, 19 Feb 2024 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/corr/abs-2402-07871.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Accurate estimation of feature importance faithfulness for tree models.\n \n \n \n \n\n\n \n Gajewski, M.; Karczmarz, A.; Rapicki, M.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/2404.03426. 2024.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2404-03426,\n author = {Mateusz Gajewski and\n Adam Karczmarz and\n Mateusz Rapicki and\n Piotr Sankowski},\n title = {Accurate estimation of feature importance faithfulness for tree models},\n journal = {CoRR},\n volume = {abs/2404.03426},\n year = {2024},\n url = {https://doi.org/10.48550/arXiv.2404.03426},\n doi = {10.48550/ARXIV.2404.03426},\n eprinttype = {arXiv},\n eprint = {2404.03426},\n timestamp = {Mon, 13 May 2024 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2404-03426.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Online Multi-level Aggregation with Delays and Stochastic Arrivals.\n \n \n \n \n\n\n \n Mari, M.; Pawlowski, M.; Ren, R.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/2404.09711. 2024.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2404-09711,\n author = {Mathieu Mari and\n Michal Pawlowski and\n Runtian Ren and\n Piotr Sankowski},\n title = {Online Multi-level Aggregation with Delays and Stochastic Arrivals},\n journal = {CoRR},\n volume = {abs/2404.09711},\n year = {2024},\n url = {https://doi.org/10.48550/arXiv.2404.09711},\n doi = {10.48550/ARXIV.2404.09711},\n eprinttype = {arXiv},\n eprint = {2404.09711},\n timestamp = {Wed, 15 May 2024 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2404-09711.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Dynamic PageRank: Algorithms and Lower Bounds.\n \n \n \n \n\n\n \n Jayaram, R.; Lacki, J.; Mitrovic, S.; Onak, K.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/2404.16267. 2024.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2404-16267,\n author = {Rajesh Jayaram and\n Jakub Lacki and\n Slobodan Mitrovic and\n Krzysztof Onak and\n Piotr Sankowski},\n title = {Dynamic PageRank: Algorithms and Lower Bounds},\n journal = {CoRR},\n volume = {abs/2404.16267},\n year = {2024},\n url = {https://doi.org/10.48550/arXiv.2404.16267},\n doi = {10.48550/ARXIV.2404.16267},\n eprinttype = {arXiv},\n eprint = {2404.16267},\n timestamp = {Mon, 03 Jun 2024 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2404-16267.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n In-Context Learning of Physical Properties: Few-Shot Adaptation to Out-of-Distribution Molecular Graphs.\n \n \n \n \n\n\n \n Kaszuba, G.; Naghdi, A. D.; Massa, D.; Papanikolaou, S.; Jaszkiewicz, A.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/2406.01808. 2024.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2406-01808,\n author = {Grzegorz Kaszuba and\n Amirhossein D. Naghdi and\n Dario Massa and\n Stefanos Papanikolaou and\n Andrzej Jaszkiewicz and\n Piotr Sankowski},\n title = {In-Context Learning of Physical Properties: Few-Shot Adaptation to\n Out-of-Distribution Molecular Graphs},\n journal = {CoRR},\n volume = {abs/2406.01808},\n year = {2024},\n url = {https://doi.org/10.48550/arXiv.2406.01808},\n doi = {10.48550/ARXIV.2406.01808},\n eprinttype = {arXiv},\n eprint = {2406.01808},\n timestamp = {Thu, 04 Jul 2024 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2406-01808.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Fully Dynamic Shortest Paths in Sparse Digraphs.\n \n \n \n \n\n\n \n Karczmarz, A.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/2408.14406. 2024.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2408-14406,\n author = {Adam Karczmarz and\n Piotr Sankowski},\n title = {Fully Dynamic Shortest Paths in Sparse Digraphs},\n journal = {CoRR},\n volume = {abs/2408.14406},\n year = {2024},\n url = {https://doi.org/10.48550/arXiv.2408.14406},\n doi = {10.48550/ARXIV.2408.14406},\n eprinttype = {arXiv},\n eprint = {2408.14406},\n timestamp = {Sat, 28 Sep 2024 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2408-14406.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n PUB: Plot Understanding Benchmark and Dataset for Evaluating Large Language Models on Synthetic Visual Data Interpretation.\n \n \n \n \n\n\n \n Pawelec, A.; Wesolowska, V. S.; Baczek, Z.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/2409.02617. 2024.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2409-02617,\n author = {Aneta Pawelec and\n Victoria Sara Wesolowska and\n Zuzanna Baczek and\n Piotr Sankowski},\n title = {{PUB:} Plot Understanding Benchmark and Dataset for Evaluating Large\n Language Models on Synthetic Visual Data Interpretation},\n journal = {CoRR},\n volume = {abs/2409.02617},\n year = {2024},\n url = {https://doi.org/10.48550/arXiv.2409.02617},\n doi = {10.48550/ARXIV.2409.02617},\n eprinttype = {arXiv},\n eprint = {2409.02617},\n timestamp = {Sat, 05 Oct 2024 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2409-02617.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Faster Semi-streaming Matchings via Alternating Trees.\n \n \n \n \n\n\n \n Mitrovic, S.; Mukherjee, A.; Sankowski, P.; and Sheu, W.\n\n\n \n\n\n\n
CoRR, abs/2412.19057. 2024.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2412-19057,\n author = {Slobodan Mitrovic and\n Anish Mukherjee and\n Piotr Sankowski and\n Wen{-}Horng Sheu},\n title = {Faster Semi-streaming Matchings via Alternating Trees},\n journal = {CoRR},\n volume = {abs/2412.19057},\n year = {2024},\n url = {https://doi.org/10.48550/arXiv.2412.19057},\n doi = {10.48550/ARXIV.2412.19057},\n eprinttype = {arXiv},\n eprint = {2412.19057},\n timestamp = {Sat, 25 Jan 2025 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/corr/abs-2412-19057.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2023\n \n \n (6)\n \n \n
\n
\n \n \n
\n
\n\n \n \n \n \n \n \n Online Matching with Delays and Stochastic Arrival Times.\n \n \n \n \n\n\n \n Mari, M.; Pawlowski, M.; Ren, R.; and Sankowski, P.\n\n\n \n\n\n\n In
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2023, London, United Kingdom, 29 May 2023 - 2 June 2023, pages 976–984, 2023. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/atal/MariPRS23,\n author = {Mathieu Mari and\n Michal Pawlowski and\n Runtian Ren and\n Piotr Sankowski},\n title = {Online Matching with Delays and Stochastic Arrival Times},\n booktitle = {Proceedings of the 2023 International Conference on Autonomous Agents\n and Multiagent Systems, {AAMAS} 2023, London, United Kingdom, 29 May\n 2023 - 2 June 2023},\n pages = {976--984},\n year = {2023},\n crossref = {DBLP:conf/atal/2023},\n url = {https://dl.acm.org/doi/10.5555/3545946.3598737},\n doi = {10.5555/3545946.3598737},\n timestamp = {Tue, 23 May 2023 14:27:14 +0200},\n biburl = {https://dblp.org/rec/conf/atal/MariPRS23.bib},\n bibsource = {dblp computer science bibliography, https://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 Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs.\n \n \n \n \n\n\n \n Karczmarz, A.; and Sankowski, P.\n\n\n \n\n\n\n In
50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, pages 84:1–84:20, 2023. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/icalp/KarczmarzS23,\n author = {Adam Karczmarz and\n Piotr Sankowski},\n title = {Fully Dynamic Shortest Paths and Reachability in Sparse Digraphs},\n booktitle = {50th International Colloquium on Automata, Languages, and Programming,\n {ICALP} 2023, July 10-14, 2023, Paderborn, Germany},\n pages = {84:1--84:20},\n year = {2023},\n crossref = {DBLP:conf/icalp/2023},\n url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.84},\n doi = {10.4230/LIPICS.ICALP.2023.84},\n timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},\n biburl = {https://dblp.org/rec/conf/icalp/KarczmarzS23.bib},\n bibsource = {dblp computer science bibliography, https://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 Contrastive News and Social Media Linking using BERT for Articles and Tweets across Dual Platforms.\n \n \n \n \n\n\n \n Piotrowski, J.; Wachnicki, M.; Perlik, M.; Podolak, J.; Rucki, G.; Brzozowski, M.; Olejnik, P.; Kozlowski, J.; Nocon, T.; Koziel, J.; Gizinski, S.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/2312.07599. 2023.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2312-07599,\n author = {Jan Piotrowski and\n Marek Wachnicki and\n Mateusz Perlik and\n Jakub Podolak and\n Grzegorz Rucki and\n Michal Brzozowski and\n Pawel Olejnik and\n Julian Kozlowski and\n Tomasz Nocon and\n Jakub Koziel and\n Stanislaw Gizinski and\n Piotr Sankowski},\n title = {Contrastive News and Social Media Linking using {BERT} for Articles\n and Tweets across Dual Platforms},\n journal = {CoRR},\n volume = {abs/2312.07599},\n year = {2023},\n url = {https://doi.org/10.48550/arXiv.2312.07599},\n doi = {10.48550/ARXIV.2312.07599},\n eprinttype = {arXiv},\n eprint = {2312.07599},\n timestamp = {Thu, 01 May 2025 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2312-07599.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2022\n \n \n (7)\n \n \n
\n
\n \n \n
\n
\n\n \n \n \n \n \n \n A tight bound for shortest augmenting paths on trees.\n \n \n \n \n\n\n \n Bosek, B.; Leniowski, D.; Sankowski, P.; and Zych-Pawlewicz, A.\n\n\n \n\n\n\n
Theor. Comput. Sci., 901: 45–61. 2022.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\n\n\n
\n
@article{DBLP:journals/tcs/BosekLSZ22,\n author = {Bartlomiej Bosek and\n Dariusz Leniowski and\n Piotr Sankowski and\n Anna Zych{-}Pawlewicz},\n title = {A tight bound for shortest augmenting paths on trees},\n journal = {Theor. Comput. Sci.},\n volume = {901},\n pages = {45--61},\n year = {2022},\n url = {https://doi.org/10.1016/j.tcs.2021.11.025},\n doi = {10.1016/J.TCS.2021.11.025},\n timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/tcs/BosekLSZ22.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Improving Ads-Profitability Using Traffic-Fingerprints.\n \n \n \n \n\n\n \n Dobrakowski, A. G.; Pacuk, A.; Sankowski, P.; Mucha, M.; and Brach, P.\n\n\n \n\n\n\n In
Data Mining - 20th Australasian Conference, AusDM 2022, Western Sydney, Australia, December 12-15, 2022, Proceedings, pages 205–216, 2022. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/ausdm/DobrakowskiPSMB22,\n author = {Adam Gabriel Dobrakowski and\n Andrzej Pacuk and\n Piotr Sankowski and\n Marcin Mucha and\n Pawel Brach},\n title = {Improving Ads-Profitability Using Traffic-Fingerprints},\n booktitle = {Data Mining - 20th Australasian Conference, AusDM 2022, Western Sydney,\n Australia, December 12-15, 2022, Proceedings},\n pages = {205--216},\n year = {2022},\n crossref = {DBLP:conf/ausdm/2022},\n url = {https://doi.org/10.1007/978-981-19-8746-5\\_15},\n doi = {10.1007/978-981-19-8746-5\\_15},\n timestamp = {Thu, 05 Jun 2025 07:32:56 +0200},\n biburl = {https://dblp.org/rec/conf/ausdm/DobrakowskiPSMB22.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Subquadratic dynamic path reporting in directed graphs against an adaptive adversary.\n \n \n \n \n\n\n \n Karczmarz, A.; Mukherjee, A.; and Sankowski, P.\n\n\n \n\n\n\n In
STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pages 1643–1656, 2022. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/stoc/Karczmarz0S22,\n author = {Adam Karczmarz and\n Anish Mukherjee and\n Piotr Sankowski},\n title = {Subquadratic dynamic path reporting in directed graphs against an\n adaptive adversary},\n booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,\n Rome, Italy, June 20 - 24, 2022},\n pages = {1643--1656},\n year = {2022},\n crossref = {DBLP:conf/stoc/2022},\n url = {https://doi.org/10.1145/3519935.3520058},\n doi = {10.1145/3519935.3520058},\n timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/stoc/Karczmarz0S22.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Improved feature importance computation for tree models based on the Banzhaf value.\n \n \n \n \n\n\n \n Karczmarz, A.; Michalak, T. P.; Mukherjee, A.; Sankowski, P.; and Wygocki, P.\n\n\n \n\n\n\n In
Uncertainty in Artificial Intelligence, Proceedings of the Thirty-Eighth Conference on Uncertainty in Artificial Intelligence, UAI 2022, 1-5 August 2022, Eindhoven, The Netherlands, pages 969–979, 2022. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/uai/KarczmarzM0SW22,\n author = {Adam Karczmarz and\n Tomasz P. Michalak and\n Anish Mukherjee and\n Piotr Sankowski and\n Piotr Wygocki},\n title = {Improved feature importance computation for tree models based on the\n Banzhaf value},\n booktitle = {Uncertainty in Artificial Intelligence, Proceedings of the Thirty-Eighth\n Conference on Uncertainty in Artificial Intelligence, {UAI} 2022,\n 1-5 August 2022, Eindhoven, The Netherlands},\n pages = {969--979},\n year = {2022},\n crossref = {DBLP:conf/uai/2022},\n url = {https://proceedings.mlr.press/v180/karczmarz22a.html},\n timestamp = {Mon, 07 Nov 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/uai/KarczmarzM0SW22.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary.\n \n \n \n \n\n\n \n Karczmarz, A.; Mukherjee, A.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/2203.16992. 2022.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2203-16992,\n author = {Adam Karczmarz and\n Anish Mukherjee and\n Piotr Sankowski},\n title = {Subquadratic Dynamic Path Reporting in Directed Graphs Against an\n Adaptive Adversary},\n journal = {CoRR},\n volume = {abs/2203.16992},\n year = {2022},\n url = {https://doi.org/10.48550/arXiv.2203.16992},\n doi = {10.48550/ARXIV.2203.16992},\n eprinttype = {arXiv},\n eprint = {2203.16992},\n timestamp = {Mon, 04 Apr 2022 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2203-16992.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Improving Ads-Profitability Using Traffic-Fingerprints.\n \n \n \n \n\n\n \n Dobrakowski, A. G.; Pacuk, A.; Sankowski, P.; Mucha, M.; and Brach, P.\n\n\n \n\n\n\n
CoRR, abs/2206.02630. 2022.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2206-02630,\n author = {Adam Gabriel Dobrakowski and\n Andrzej Pacuk and\n Piotr Sankowski and\n Marcin Mucha and\n Pawel Brach},\n title = {Improving Ads-Profitability Using Traffic-Fingerprints},\n journal = {CoRR},\n volume = {abs/2206.02630},\n year = {2022},\n url = {https://doi.org/10.48550/arXiv.2206.02630},\n doi = {10.48550/ARXIV.2206.02630},\n eprinttype = {arXiv},\n eprint = {2206.02630},\n timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2206-02630.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Online matching with delays and stochastic arrival times.\n \n \n \n \n\n\n \n Mari, M.; Pawlowski, M.; Ren, R.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/2210.07018. 2022.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2210-07018,\n author = {Mathieu Mari and\n Michal Pawlowski and\n Runtian Ren and\n Piotr Sankowski},\n title = {Online matching with delays and stochastic arrival times},\n journal = {CoRR},\n volume = {abs/2210.07018},\n year = {2022},\n url = {https://doi.org/10.48550/arXiv.2210.07018},\n doi = {10.48550/ARXIV.2210.07018},\n eprinttype = {arXiv},\n eprint = {2210.07018},\n timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2210-07018.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2021\n \n \n (10)\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\n\n \n Leonardi, S.; Monaco, G.; Sankowski, P.; and Zhang, Q.\n\n\n \n\n\n\n
Algorithmica, 83(5): 1222–1237. 2021.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\n\n\n
\n
@article{DBLP:journals/algorithmica/LeonardiMSZ21,\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 = {Algorithmica},\n volume = {83},\n number = {5},\n pages = {1222--1237},\n year = {2021},\n url = {https://doi.org/10.1007/s00453-020-00781-9},\n doi = {10.1007/S00453-020-00781-9},\n timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/algorithmica/LeonardiMSZ21.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, \\emphb-matching, and Unweighted \\emphf-factors.\n \n \n \n \n\n\n \n Gabow, H. N.; and Sankowski, P.\n\n\n \n\n\n\n
SIAM J. Comput., 50(2): 440–486. 2021.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/siamcomp/GabowS21,\n author = {Harold N. Gabow and\n Piotr Sankowski},\n title = {Algorithms for Weighted Matching Generalizations {I:} Bipartite Graphs,\n \\emph{b}-matching, and Unweighted \\emph{f}-factors},\n journal = {{SIAM} J. Comput.},\n volume = {50},\n number = {2},\n pages = {440--486},\n year = {2021},\n url = {https://doi.org/10.1137/16M1106195},\n doi = {10.1137/16M1106195},\n timestamp = {Tue, 11 May 2021 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/siamcomp/GabowS21.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Algorithms for Weighted Matching Generalizations II: \\emphf-factors and the Special Case of Shortest Paths.\n \n \n \n \n\n\n \n Gabow, H. N.; and Sankowski, P.\n\n\n \n\n\n\n
SIAM J. Comput., 50(2): 555–601. 2021.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/siamcomp/GabowS21a,\n author = {Harold N. Gabow and\n Piotr Sankowski},\n title = {Algorithms for Weighted Matching Generalizations {II:} \\emph{f}-factors\n and the Special Case of Shortest Paths},\n journal = {{SIAM} J. Comput.},\n volume = {50},\n number = {2},\n pages = {555--601},\n year = {2021},\n url = {https://doi.org/10.1137/16M1106225},\n doi = {10.1137/16M1106225},\n timestamp = {Tue, 11 May 2021 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/siamcomp/GabowS21a.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs.\n \n \n \n \n\n\n \n Karczmarz, A.; Pawlewicz, J.; and Sankowski, P.\n\n\n \n\n\n\n In
37th International Symposium on Computational Geometry, SoCG 2021, June 7-11, 2021, Buffalo, NY, USA (Virtual Conference), pages 46:1–46:15, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/compgeom/KarczmarzPS21,\n author = {Adam Karczmarz and\n Jakub Pawlewicz and\n Piotr Sankowski},\n title = {Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs},\n booktitle = {37th International Symposium on Computational Geometry, SoCG 2021,\n June 7-11, 2021, Buffalo, NY, {USA} (Virtual Conference)},\n pages = {46:1--46:15},\n year = {2021},\n crossref = {DBLP:conf/compgeom/2021},\n url = {https://doi.org/10.4230/LIPIcs.SoCG.2021.46},\n doi = {10.4230/LIPICS.SOCG.2021.46},\n timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},\n biburl = {https://dblp.org/rec/conf/compgeom/KarczmarzPS21.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Decomposable Submodular Function Minimization via Maximum Flow.\n \n \n \n \n\n\n \n Axiotis, K.; Karczmarz, A.; Mukherjee, A.; Sankowski, P.; and Vladu, A.\n\n\n \n\n\n\n In
Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event, pages 446–456, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/icml/AxiotisK0SV21,\n author = {Kyriakos Axiotis and\n Adam Karczmarz and\n Anish Mukherjee and\n Piotr Sankowski and\n Adrian Vladu},\n title = {Decomposable Submodular Function Minimization via Maximum Flow},\n booktitle = {Proceedings of the 38th International Conference on Machine Learning,\n {ICML} 2021, 18-24 July 2021, Virtual Event},\n pages = {446--456},\n year = {2021},\n crossref = {DBLP:conf/icml/2021},\n url = {http://proceedings.mlr.press/v139/axiotis21a.html},\n timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/icml/AxiotisK0SV21.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n A Deterministic Parallel APSP Algorithm and its Applications.\n \n \n \n \n\n\n \n Karczmarz, A.; and Sankowski, P.\n\n\n \n\n\n\n In
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pages 255–272, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/soda/KarczmarzS21,\n author = {Adam Karczmarz and\n Piotr Sankowski},\n title = {A Deterministic Parallel {APSP} Algorithm and its Applications},\n booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,\n {SODA} 2021, Virtual Conference, January 10 - 13, 2021},\n pages = {255--272},\n year = {2021},\n crossref = {DBLP:conf/soda/2021},\n url = {https://doi.org/10.1137/1.9781611976465.17},\n doi = {10.1137/1.9781611976465.17},\n timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},\n biburl = {https://dblp.org/rec/conf/soda/KarczmarzS21.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n A Deterministic Parallel APSP Algorithm and its Applications.\n \n \n \n \n\n\n \n Karczmarz, A.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/2101.02311. 2021.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2101-02311,\n author = {Adam Karczmarz and\n Piotr Sankowski},\n title = {A Deterministic Parallel {APSP} Algorithm and its Applications},\n journal = {CoRR},\n volume = {abs/2101.02311},\n year = {2021},\n url = {https://arxiv.org/abs/2101.02311},\n eprinttype = {arXiv},\n eprint = {2101.02311},\n timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/corr/abs-2101-02311.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Decomposable Submodular Function Minimization via Maximum Flow.\n \n \n \n \n\n\n \n Axiotis, K.; Karczmarz, A.; Mukherjee, A.; Sankowski, P.; and Vladu, A.\n\n\n \n\n\n\n
CoRR, abs/2103.03868. 2021.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2103-03868,\n author = {Kyriakos Axiotis and\n Adam Karczmarz and\n Anish Mukherjee and\n Piotr Sankowski and\n Adrian Vladu},\n title = {Decomposable Submodular Function Minimization via Maximum Flow},\n journal = {CoRR},\n volume = {abs/2103.03868},\n year = {2021},\n url = {https://arxiv.org/abs/2103.03868},\n eprinttype = {arXiv},\n eprint = {2103.03868},\n timestamp = {Tue, 04 May 2021 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2103-03868.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs.\n \n \n \n \n\n\n \n Karczmarz, A.; Pawlewicz, J.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/2103.09684. 2021.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2103-09684,\n author = {Adam Karczmarz and\n Jakub Pawlewicz and\n Piotr Sankowski},\n title = {Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs},\n journal = {CoRR},\n volume = {abs/2103.09684},\n year = {2021},\n url = {https://arxiv.org/abs/2103.09684},\n eprinttype = {arXiv},\n eprint = {2103.09684},\n timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/corr/abs-2103-09684.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Improved Feature Importance Computations for Tree Models: Shapley vs. Banzhaf.\n \n \n \n \n\n\n \n Karczmarz, A.; Mukherjee, A.; Sankowski, P.; and Wygocki, P.\n\n\n \n\n\n\n
CoRR, abs/2108.04126. 2021.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-2108-04126,\n author = {Adam Karczmarz and\n Anish Mukherjee and\n Piotr Sankowski and\n Piotr Wygocki},\n title = {Improved Feature Importance Computations for Tree Models: Shapley\n vs. Banzhaf},\n journal = {CoRR},\n volume = {abs/2108.04126},\n year = {2021},\n url = {https://arxiv.org/abs/2108.04126},\n eprinttype = {arXiv},\n eprint = {2108.04126},\n timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-2108-04126.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2020\n \n \n (2)\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\n\n \n Czumaj, A.; Lacki, J.; Madry, A.; Mitrovic, S.; Onak, K.; and Sankowski, P.\n\n\n \n\n\n\n
SIAM J. Comput., 49(5). 2020.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\n\n\n
\n
@article{DBLP:journals/siamcomp/CzumajLMMOS20,\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 = {{SIAM} J. Comput.},\n volume = {49},\n number = {5},\n year = {2020},\n url = {https://doi.org/10.1137/18M1197655},\n doi = {10.1137/18M1197655},\n timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/siamcomp/CzumajLMMOS20.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Walking randomly, massively, and efficiently.\n \n \n \n \n\n\n \n Lacki, J.; Mitrovic, S.; Onak, K.; and Sankowski, P.\n\n\n \n\n\n\n In
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020, pages 364–377, 2020. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/stoc/LackiMOS20,\n author = {Jakub Lacki and\n Slobodan Mitrovic and\n Krzysztof Onak and\n Piotr Sankowski},\n title = {Walking randomly, massively, and efficiently},\n booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory\n of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},\n pages = {364--377},\n year = {2020},\n crossref = {DBLP:conf/stoc/2020},\n url = {https://doi.org/10.1145/3357713.3384303},\n doi = {10.1145/3357713.3384303},\n timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},\n biburl = {https://dblp.org/rec/conf/stoc/LackiMOS20.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2019\n \n \n (5)\n \n \n
\n
\n \n \n
\n\n\n
\n
\n\n \n \n \n \n \n \n Min-Cost Flow in Unit-Capacity Planar Graphs.\n \n \n \n \n\n\n \n Karczmarz, A.; and Sankowski, P.\n\n\n \n\n\n\n In
27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany, pages 66:1–66:17, 2019. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/esa/KarczmarzS19,\n author = {Adam Karczmarz and\n Piotr Sankowski},\n title = {Min-Cost Flow in Unit-Capacity Planar Graphs},\n booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September\n 9-11, 2019, Munich/Garching, Germany},\n pages = {66:1--66:17},\n year = {2019},\n crossref = {DBLP:conf/esa/2019},\n url = {https://doi.org/10.4230/LIPIcs.ESA.2019.66},\n doi = {10.4230/LIPICS.ESA.2019.66},\n timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},\n biburl = {https://dblp.org/rec/conf/esa/KarczmarzS19.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n (1 + \\(ε\\))-Approximate Incremental Matching in Constant Deterministic Amortized Time.\n \n \n \n \n\n\n \n Grandoni, F.; Leonardi, S.; Sankowski, P.; Schwiegelshohn, C.; and Solomon, S.\n\n\n \n\n\n\n In
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 1886–1898, 2019. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/soda/0001LSSS19,\n author = {Fabrizio Grandoni and\n Stefano Leonardi and\n Piotr Sankowski and\n Chris Schwiegelshohn and\n Shay Solomon},\n title = {{(1} + {\\(\\epsilon\\)})-Approximate Incremental Matching in Constant\n Deterministic Amortized Time},\n booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete\n Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,\n 2019},\n pages = {1886--1898},\n year = {2019},\n crossref = {DBLP:conf/soda/2019},\n url = {https://doi.org/10.1137/1.9781611975482.114},\n doi = {10.1137/1.9781611975482.114},\n timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/soda/0001LSSS19.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Min-Cost Flow in Unit-Capacity Planar Graphs.\n \n \n \n \n\n\n \n Karczmarz, A.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1907.02274. 2019.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-1907-02274,\n author = {Adam Karczmarz and\n Piotr Sankowski},\n title = {Min-Cost Flow in Unit-Capacity Planar Graphs},\n journal = {CoRR},\n volume = {abs/1907.02274},\n year = {2019},\n url = {http://arxiv.org/abs/1907.02274},\n eprinttype = {arXiv},\n eprint = {1907.02274},\n timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1907-02274.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Walking Randomly, Massively, and Efficiently.\n \n \n \n \n\n\n \n Lacki, J.; Mitrovic, S.; Onak, K.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1907.05391. 2019.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\n
\n
@article{DBLP:journals/corr/abs-1907-05391,\n author = {Jakub Lacki and\n Slobodan Mitrovic and\n Krzysztof Onak and\n Piotr Sankowski},\n title = {Walking Randomly, Massively, and Efficiently},\n journal = {CoRR},\n volume = {abs/1907.05391},\n year = {2019},\n url = {http://arxiv.org/abs/1907.05391},\n eprinttype = {arXiv},\n eprint = {1907.05391},\n timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1907-05391.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2018\n \n \n (8)\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\n\n \n Bosek, B.; Leniowski, D.; Sankowski, P.; and Zych-Pawlewicz, A.\n\n\n \n\n\n\n
Theory Comput. Syst., 62(2): 337–348. 2018.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\n\n\n
\n
@article{DBLP:journals/mst/BosekLSZ18,\n author = {Bartlomiej Bosek and\n Dariusz Leniowski and\n Piotr Sankowski and\n Anna Zych{-}Pawlewicz},\n title = {Shortest Augmenting Paths for Online Matchings on Trees},\n journal = {Theory Comput. Syst.},\n volume = {62},\n number = {2},\n pages = {337--348},\n year = {2018},\n url = {https://doi.org/10.1007/s00224-017-9838-x},\n doi = {10.1007/S00224-017-9838-X},\n timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/mst/BosekLSZ18.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Pilipczuk, M.; Pilipczuk, M.; Sankowski, P.; and van Leeuwen, E. J.\n\n\n \n\n\n\n
ACM Trans. Algorithms, 14(4): 53:1–53:73. 2018.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/talg/PilipczukPSL18,\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 = {{ACM} Trans. Algorithms},\n volume = {14},\n number = {4},\n pages = {53:1--53:73},\n year = {2018},\n url = {https://doi.org/10.1145/3239560},\n doi = {10.1145/3239560},\n timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/talg/PilipczukPSL18.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Online Facility Location with Deletions.\n \n \n \n \n\n\n \n Cygan, M.; Czumaj, A.; Mucha, M.; and Sankowski, P.\n\n\n \n\n\n\n In
26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, pages 21:1–21:15, 2018. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\n\n\n
\n
@inproceedings{DBLP:conf/esa/CyganCMS18,\n author = {Marek Cygan and\n Artur Czumaj and\n Marcin Mucha and\n Piotr Sankowski},\n title = {Online Facility Location with Deletions},\n booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,\n 2018, Helsinki, Finland},\n pages = {21:1--21:15},\n year = {2018},\n crossref = {DBLP:conf/esa/2018},\n url = {https://doi.org/10.4230/LIPIcs.ESA.2018.21},\n doi = {10.4230/LIPICS.ESA.2018.21},\n timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},\n biburl = {https://dblp.org/rec/conf/esa/CyganCMS18.bib},\n bibsource = {dblp computer science bibliography, https://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 A Tight Bound for Shortest Augmenting Paths on Trees.\n \n \n \n \n\n\n \n Bosek, B.; Leniowski, D.; Sankowski, P.; and Zych-Pawlewicz, A.\n\n\n \n\n\n\n In
LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings, pages 201–216, 2018. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/latin/BosekLSZ18,\n author = {Bartlomiej Bosek and\n Dariusz Leniowski and\n Piotr Sankowski and\n Anna Zych{-}Pawlewicz},\n title = {A Tight Bound for Shortest Augmenting Paths on Trees},\n booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,\n Buenos Aires, Argentina, April 16-19, 2018, Proceedings},\n pages = {201--216},\n year = {2018},\n crossref = {DBLP:conf/latin/2018},\n url = {https://doi.org/10.1007/978-3-319-77404-6\\_16},\n doi = {10.1007/978-3-319-77404-6\\_16},\n timestamp = {Tue, 14 May 2019 10:00:53 +0200},\n biburl = {https://dblp.org/rec/conf/latin/BosekLSZ18.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Gawrychowski, P.; Karczmarz, A.; Kociumaka, T.; Lacki, J.; and Sankowski, P.\n\n\n \n\n\n\n In
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 1509–1528, 2018. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/soda/GawrychowskiKKL18,\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 booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete\n Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},\n pages = {1509--1528},\n year = {2018},\n crossref = {DBLP:conf/soda/2018},\n url = {https://doi.org/10.1137/1.9781611975031.99},\n doi = {10.1137/1.9781611975031.99},\n timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/soda/GawrychowskiKKL18.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Czumaj, A.; Lacki, J.; Madry, A.; Mitrovic, S.; Onak, K.; and Sankowski, P.\n\n\n \n\n\n\n In
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pages 471–484, 2018. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@inproceedings{DBLP:conf/stoc/CzumajLMMOS18,\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 booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory\n of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},\n pages = {471--484},\n year = {2018},\n crossref = {DBLP:conf/stoc/2018},\n url = {https://doi.org/10.1145/3188745.3188764},\n doi = {10.1145/3188745.3188764},\n timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/stoc/CzumajLMMOS18.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Online Facility Location with Deletions.\n \n \n \n \n\n\n \n Cygan, M.; Czumaj, A.; Mucha, M.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1807.03839. 2018.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\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\n\n\n
\n
@article{DBLP:journals/corr/abs-1807-03839,\n author = {Marek Cygan and\n Artur Czumaj and\n Marcin Mucha and\n Piotr Sankowski},\n title = {Online Facility Location with Deletions},\n journal = {CoRR},\n volume = {abs/1807.03839},\n year = {2018},\n url = {http://arxiv.org/abs/1807.03839},\n eprinttype = {arXiv},\n eprint = {1807.03839},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1807-03839.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2017\n \n \n (15)\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\n\n \n Lacki, J.; and Sankowski, P.\n\n\n \n\n\n\n
Theory Comput. Syst., 61(4): 1037–1053. 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\n
\n
@article{DBLP:journals/mst/LackiS17,\n author = {Jakub Lacki and\n Piotr Sankowski},\n title = {Optimal Decremental Connectivity in Planar Graphs},\n journal = {Theory Comput. Syst.},\n volume = {61},\n number = {4},\n pages = {1037--1053},\n year = {2017},\n url = {https://doi.org/10.1007/s00224-016-9709-x},\n doi = {10.1007/S00224-016-9709-X},\n timestamp = {Thu, 19 Oct 2017 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/mst/LackiS17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Holm, J.; Italiano, G. F.; Karczmarz, A.; Lacki, J.; Rotenberg, E.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Fri, 09 Apr 2021 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/esa/HolmIKLRS17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Leonardi, S.; Monaco, G.; Sankowski, P.; and Zhang, Q.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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, 27 Dec 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/ipco/LeonardiMSZ17.bib},\n bibsource = {dblp computer science bibliography, https://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 Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (\\emphm\\(^\\mbox10/7\\) log \\emphW) Time (Extended Abstract).\n \n \n \n \n\n\n \n Cohen, M. B.; Madry, A.; Sankowski, P.; and Vladu, A.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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 = {Tue, 02 Feb 2021 17:07:33 +0100},\n biburl = {https://dblp.org/rec/conf/soda/CohenMSV17.bib},\n bibsource = {dblp computer science bibliography, https://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 Decremental single-source reachability in planar digraphs.\n \n \n \n \n\n\n \n Italiano, G. F.; Karczmarz, A.; Lacki, J.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {https://doi.org/10.1145/3055399.3055480},\n doi = {10.1145/3055399.3055480},\n timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/stoc/ItalianoKLS17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Wegrzycki, K.; Sankowski, P.; Pacuk, A.; and Wygocki, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {https://doi.org/10.1145/3038912.3052565},\n doi = {10.1145/3038912.3052565},\n timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/www/WegrzyckiSPW17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Wegrzycki, K.; Sankowski, P.; Pacuk, A.; and Wygocki, P.\n\n\n \n\n\n\n
CoRR, abs/1702.05913. 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1702.05913},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/WegrzyckiSPW17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Bosek, B.; Leniowski, D.; Zych, A.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1704.02093. 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1704.02093},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/BosekLZS17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Italiano, G. F.; Karczmarz, A.; Lacki, J.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1705.11163. 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1705.11163},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/ItalianoKLS17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Holm, J.; Italiano, G. F.; Karczmarz, A.; Lacki, J.; Rotenberg, E.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1706.10228. 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1706.10228},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/HolmIKLRS17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Czumaj, A.; Lacki, J.; Madry, A.; Mitrovic, S.; Onak, K.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1707.03478. 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1707.03478},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/CzumajLMMOS17.bib},\n bibsource = {dblp computer science bibliography, https://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 Planar Perfect Matching is in NC.\n \n \n \n \n\n\n \n Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1709.07869. 2017.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1709.07869},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1709-07869.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2016\n \n \n (13)\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\n\n \n Anagnostopoulos, A.; Grandoni, F.; Leonardi, S.; and Sankowski, P.\n\n\n \n\n\n\n
Algorithmica, 76(1): 88–109. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Mon, 28 Aug 2023 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/algorithmica/Anagnostopoulos16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Pacuk, A.; Sankowski, P.; Wegrzycki, K.; and Wygocki, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Sat, 19 Oct 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/cocoon/PacukSWW16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Dziubinski, M.; Sankowski, P.; and Zhang, Q.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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, 14 May 2019 10:00:49 +0200},\n biburl = {https://dblp.org/rec/conf/gamesec/DziubinskiSZ16.bib},\n bibsource = {dblp computer science bibliography, https://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 RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting.\n \n \n \n \n\n\n \n Pacuk, A.; Sankowski, P.; Wegrzycki, K.; Witkowski, A.; and Wygocki, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {https://doi.org/10.1145/2987538.2987544},\n doi = {10.1145/2987538.2987544},\n timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/recsys/PacukSWWW16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Cygan, M.; Mucha, M.; Sankowski, P.; and Zhang, Q.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Tue, 02 Feb 2021 17:07:56 +0100},\n biburl = {https://dblp.org/rec/conf/soda/CyganMSZ16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Brach, P.; Cygan, M.; Lacki, J.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Tue, 02 Feb 2021 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/soda/BrachCLS16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Sankowski, P.; and Zaroliagis, C. D.,\n editors.\n \n\n\n \n\n\n\n Volume 57, of LIPIcs.Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 f{\\"{u}}r 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, 11 Feb 2020 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/esa/2016.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Cohen, M. B.; Madry, A.; Sankowski, P.; and Vladu, A.\n\n\n \n\n\n\n
CoRR, abs/1605.01717. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1605.01717},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/CohenMSV16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Pacuk, A.; Sankowski, P.; Wegrzycki, K.; and Wygocki, P.\n\n\n \n\n\n\n
CoRR, abs/1611.09317. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1611.09317},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/PacukSWW16.bib},\n bibsource = {dblp computer science bibliography, https://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 RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting.\n \n \n \n \n\n\n \n Pacuk, A.; Sankowski, P.; Wegrzycki, K.; Witkowski, A.; and Wygocki, P.\n\n\n \n\n\n\n
CoRR, abs/1612.00959. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1612.00959},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/PacukSWWW16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Leonardi, S.; Monaco, G.; Sankowski, P.; and Zhang, Q.\n\n\n \n\n\n\n
CoRR, abs/1612.03150. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1612.03150},\n timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/corr/LeonardiMSZ16.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2015\n \n \n (11)\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\n\n \n Cygan, M.; Gabow, H. N.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {https://doi.org/10.1145/2736283},\n doi = {10.1145/2736283},\n timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/jacm/CyganGS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Borradaile, G.; Sankowski, P.; and Wulff-Nilsen, C.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {https://doi.org/10.1145/2684068},\n doi = {10.1145/2684068},\n timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/talg/BorradaileSW15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Fanelli, A.; Leniowski, D.; Monaco, G.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Wed, 17 Feb 2021 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/tcs/FanelliLMS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Anagnostopoulos, A.; Becchetti, L.; Bordino, I.; Leonardi, S.; Mele, I.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {https://doi.org/10.1145/2699671},\n doi = {10.1145/2699671},\n timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/tois/Anagnostopoulos15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Monaco, G.; Sankowski, P.; and Zhang, Q.\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 Paper\n \n \n\n \n\n \n link\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\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 = {Tue, 20 Aug 2019 16:16:43 +0200},\n biburl = {https://dblp.org/rec/conf/ijcai/MonacoSZ15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Sun, 02 Jun 2019 21:12:07 +0200},\n biburl = {https://dblp.org/rec/conf/sofsem/Sankowski15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Lacki, J.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Tue, 11 Feb 2020 15:52:14 +0100},\n biburl = {https://dblp.org/rec/conf/stacs/LackiS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Lacki, J.; Ocwieja, J.; Pilipczuk, M.; Sankowski, P.; and Zych, A.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {https://doi.org/10.1145/2746539.2746615},\n doi = {10.1145/2746539.2746615},\n timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/stoc/LackiOPSZ15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Bosek, B.; Leniowski, D.; Sankowski, P.; and Zych, A.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Tue, 14 May 2019 10:00:46 +0200},\n biburl = {https://dblp.org/rec/conf/waoa/BosekLSZ15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Brach, P.; Cygan, M.; Lacki, J.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1507.02426. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1507.02426},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/BrachCLS15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Gawrychowski, P.; Karczmarz, A.; Kociumaka, T.; Lacki, J.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1511.02612. 2015.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1511.02612},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/GawrychowskiKKL15.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2014\n \n \n (9)\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\n\n \n Brach, P.; Epasto, A.; Panconesi, A.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {https://doi.org/10.1145/2660460.2660472},\n doi = {10.1145/2660460.2660472},\n timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/cosn/BrachEPS14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Pilipczuk, M.; Pilipczuk, M.; Sankowski, P.; and van Leeuwen, E. J.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Tue, 08 Jul 2025 16:37:45 +0200},\n biburl = {https://dblp.org/rec/conf/focs/PilipczukPSL14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Bosek, B.; Leniowski, D.; Sankowski, P.; and Zych, A.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Thu, 23 Mar 2023 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/focs/BosekLSZ14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Adamczyk, M.; Sankowski, P.; and Zhang, Q.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Tue, 14 May 2019 10:00:42 +0200},\n biburl = {https://dblp.org/rec/conf/sagt/AdamczykSZ14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Bernáth, A.; Ciebiera, K.; Godlewski, P.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Tue, 14 May 2019 10:00:42 +0200},\n biburl = {https://dblp.org/rec/conf/wea/BernathCGS14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Colini-Baldeschi, R.; Leonardi, S.; Sankowski, P.; and Zhang, Q.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Tue, 27 Dec 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/wine/Colini-BaldeschiLSZ14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Adamczyk, M.; Sankowski, P.; and Zhang, Q.\n\n\n \n\n\n\n
CoRR, abs/1407.3957. 2014.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1407.3957},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/AdamczykSZ14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Lacki, J.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1409.7240. 2014.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1409.7240},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/LackiS14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Ciebiera, K.; Godlewski, P.; Sankowski, P.; and Wygocki, P.\n\n\n \n\n\n\n
CoRR, abs/1410.7534. 2014.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1410.7534},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/CiebieraGSW14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2013\n \n \n (8)\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\n\n \n Grandoni, F.; Gupta, A.; Leonardi, S.; Miettinen, P.; Sankowski, P.; and Singh, M.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Tue, 27 Dec 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/siamcomp/GrandoniGLMSS13.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Gabow, H. N.; and Sankowski, P.\n\n\n \n\n\n\n In
54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, Berkeley, CA, USA, October, 26-29, 2013, pages 137–146, 2013. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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, Berkeley, CA, USA, October, 26-29, 2013},\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 = {Tue, 08 Jul 2025 16:37:30 +0200},\n biburl = {https://dblp.org/rec/conf/focs/GabowS13.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Lacki, J.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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 = {https://doi.org/10.1145/2422436.2422468},\n doi = {10.1145/2422436.2422468},\n timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/innovations/LackiS13.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Cygan, M.; Englert, M.; Gupta, A.; Mucha, M.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {https://doi.org/10.1145/2422436.2422489},\n doi = {10.1145/2422436.2422489},\n timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/innovations/CyganEGMS13.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Pilipczuk, M.; Pilipczuk, M.; Sankowski, P.; and van Leeuwen, E. J.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Wed, 21 Aug 2024 22:46:00 +0200},\n biburl = {https://dblp.org/rec/conf/stacs/PilipczukPSL13.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Gabow, H. N.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1304.6740. 2013.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\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\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 eprinttype = {arXiv},\n eprint = {1304.6740},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1304-6740.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Pilipczuk, M.; Pilipczuk, M.; Sankowski, P.; and van Leeuwen, E. J.\n\n\n \n\n\n\n
CoRR, abs/1306.6593. 2013.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1306.6593},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/PilipczukPSL13.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Lacki, J.; Ocwieja, J.; Pilipczuk, M.; Sankowski, P.; and Zych, A.\n\n\n \n\n\n\n
CoRR, abs/1308.3336. 2013.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\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\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 eprinttype = {arXiv},\n eprint = {1308.3336},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/LackiOPSZ13.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2012\n \n \n (7)\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\n\n \n Cygan, M.; Grandoni, F.; Leonardi, S.; Pilipczuk, M.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Tue, 27 Dec 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/esa/CyganGLPS12.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Cygan, M.; Gabow, H. N.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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 = {Tue, 08 Jul 2025 16:37:15 +0200},\n biburl = {https://dblp.org/rec/conf/focs/CyganGS12.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Lacki, J.; Nussbaum, Y.; Sankowski, P.; and Wulff-Nilsen, C.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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 = {Thu, 23 Mar 2023 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/focs/LackiNSW12.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Feldman, M.; Fiat, A.; Leonardi, S.; and Sankowski, P.\n\n\n \n\n\n\n In
Proceedings of the 13th ACM Conference on Electronic Commerce, EC 2012, Valencia, Spain, June 4-8, 2012, pages 532–549, 2012. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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 = {Proceedings of the 13th {ACM} Conference on Electronic Commerce, {EC}\n 2012, Valencia, Spain, June 4-8, 2012},\n pages = {532--549},\n year = {2012},\n crossref = {DBLP:conf/sigecom/2012},\n url = {https://doi.org/10.1145/2229012.2229052},\n doi = {10.1145/2229012.2229052},\n timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/sigecom/FeldmanFLS12.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Fanelli, A.; Leniowski, D.; Monaco, G.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Sat, 05 Sep 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/wine/FanelliLMS12.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Cygan, M.; Gabow, H. N.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1204.1616. 2012.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\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\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 eprinttype = {arXiv},\n eprint = {1204.1616},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1204-1616.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Lacki, J.; Nussbaum, Y.; Sankowski, P.; and Wulff-Nilsen, C.\n\n\n \n\n\n\n
CoRR, abs/1210.4811. 2012.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\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\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 eprinttype = {arXiv},\n eprint = {1210.4811},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1210-4811.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2011\n \n \n (9)\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\n\n \n Lacki, J.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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 = {Tue, 14 May 2019 10:00:54 +0200},\n biburl = {https://dblp.org/rec/conf/esa/LackiS11.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Cygan, M.; Grandoni, F.; Leonardi, S.; Mucha, M.; Pilipczuk, M.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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, 21 Aug 2024 22:46:00 +0200},\n biburl = {https://dblp.org/rec/conf/fsttcs/CyganGLMPS11.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Fiat, A.; Leonardi, S.; Saia, J.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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 = {https://doi.org/10.1145/1993574.1993609},\n doi = {10.1145/1993574.1993609},\n timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/sigecom/FiatLSS11.bib},\n bibsource = {dblp computer science bibliography, https://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 Stochastic query covering.\n \n \n \n \n\n\n \n Anagnostopoulos, A.; Becchetti, L.; Leonardi, S.; Mele, I.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {https://doi.org/10.1145/1935826.1935923},\n doi = {10.1145/1935826.1935923},\n timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/wsdm/AnagnostopoulosBLMS11.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Murlak, F.; and Sankowski, P.,\n editors.\n \n\n\n \n\n\n\n Volume 6907, of Lecture Notes in Computer Science.Springer. 2011.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Tue, 14 May 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/mfcs/2011.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Cygan, M.; Grandoni, F.; Leonardi, S.; Mucha, M.; Pilipczuk, M.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1102.5105. 2011.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1102.5105},\n timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/corr/abs-1102-5105.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Lacki, J.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1104.4890. 2011.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\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\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 eprinttype = {arXiv},\n eprint = {1104.4890},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1104-4890.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2010\n \n \n (7)\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\n\n \n Sankowski, P.; and Mucha, M.\n\n\n \n\n\n\n
Algorithmica, 56(2): 180–197. 2010.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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, 25 Sep 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/algorithmica/SankowskiM10.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Cygan, M.; Kowalik, L.; Mucha, M.; Pilipczuk, M.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Sat, 19 Oct 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/esa/CyganKMPS10.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Borradaile, G.; Sankowski, P.; and Wulff-Nilsen, C.\n\n\n \n\n\n\n In
51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, Las Vegas, Nevada, USA, October 23-26, 2010, pages 601–610, 2010. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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, Las Vegas, Nevada, USA, October 23-26, 2010},\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 = {Tue, 08 Jul 2025 16:36:37 +0200},\n biburl = {https://dblp.org/rec/conf/focs/BorradaileSW10.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Anagnostopoulos, A.; Grandoni, F.; Leonardi, S.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Mon, 28 Aug 2023 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/icalp/AnagnostopoulosGLS10.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Fiat, A.; Leonardi, S.; Saia, J.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1001.1686. 2010.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\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\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 eprinttype = {arXiv},\n eprint = {1001.1686},\n timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/corr/abs-1001-1686.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Borradaile, G.; Sankowski, P.; and Wulff-Nilsen, C.\n\n\n \n\n\n\n
CoRR, abs/1003.1320. 2010.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\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\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 eprinttype = {arXiv},\n eprint = {1003.1320},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1003-1320.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Italiano, G. F.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/1011.2843. 2010.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {1011.2843},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-1011-2843.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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 = {Wed, 17 Feb 2021 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/tcs/Sankowski09.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Cygan, M.; Kowalik, L.; Mucha, M.; Pilipczuk, M.; and Sankowski, P.\n\n\n \n\n\n\n
CoRR, abs/0911.1626. 2009.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\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\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 eprinttype = {arXiv},\n eprint = {0911.1626},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/abs-0911-1626.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2008\n \n \n (5)\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\n\n \n Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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 = {https://dblp.org/rec/journals/mst/Sankowski08.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Grandoni, F.; Gupta, A.; Leonardi, S.; Miettinen, P.; Sankowski, P.; and Singh, M.\n\n\n \n\n\n\n In
49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, Philadelphia, PA, USA, October 25-28, 2008, pages 347–356, 2008. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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, Philadelphia, PA, USA, October 25-28, 2008},\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 = {Tue, 08 Jul 2025 16:35:29 +0200},\n biburl = {https://dblp.org/rec/conf/focs/GrandoniGLMSS08.bib},\n bibsource = {dblp computer science bibliography, https://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 Algebraic Graph Algorithms.\n \n \n \n \n\n\n \n Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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, 14 May 2019 10:00:37 +0200},\n biburl = {https://dblp.org/rec/conf/mfcs/Sankowski08.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Garg, N.; Gupta, A.; Leonardi, S.; and Sankowski, P.\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 Paper\n \n \n\n \n\n \n link\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\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 = {Tue, 27 Dec 2022 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/soda/GargGLS08.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2007\n \n \n (3)\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\n\n \n Diks, K.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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 = {Tue, 14 May 2019 10:00:54 +0200},\n biburl = {https://dblp.org/rec/conf/esa/DiksS07.bib},\n bibsource = {dblp computer science bibliography, https://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 Faster dynamic matchings and vertex connectivity.\n \n \n \n \n\n\n \n Sankowski, P.\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 Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\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\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 = {Tue, 15 Feb 2022 07:54:27 +0100},\n biburl = {https://dblp.org/rec/conf/soda/Sankowski07.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2006\n \n \n (2)\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\n\n \n Mucha, M.; and Sankowski, P.\n\n\n \n\n\n\n
Algorithmica, 45(1): 3–20. 2006.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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, 25 Sep 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/algorithmica/MuchaS06.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {Tue, 14 May 2019 10:00:44 +0200},\n biburl = {https://dblp.org/rec/conf/icalp/Sankowski06.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2005\n \n \n (3)\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\n\n \n Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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, 14 May 2019 10:00:35 +0200},\n biburl = {https://dblp.org/rec/conf/cocoon/Sankowski05.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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, 27 Dec 2022 09:06:31 +0100},\n biburl = {https://dblp.org/rec/conf/esa/Sankowski05.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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 = {https://doi.org/10.1145/1073970.1073994},\n doi = {10.1145/1073970.1073994},\n timestamp = {Wed, 21 Nov 2018 11:12:26 +0100},\n biburl = {https://dblp.org/rec/conf/spaa/Sankowski05.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2004\n \n \n (4)\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\n\n \n Mucha, M.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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, 14 May 2019 10:00:54 +0200},\n biburl = {https://dblp.org/rec/conf/esa/MuchaS04.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Mucha, M.; and Sankowski, P.\n\n\n \n\n\n\n In
45th Symposium on Foundations of Computer Science, FOCS 2004, Rome, Italy, October 17-19, 2004, Proceedings, pages 248–255, 2004. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 7 downloads\n \n \n\n \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, Rome,\n Italy, October 17-19, 2004, 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 = {Tue, 08 Jul 2025 16:41:21 +0200},\n biburl = {https://dblp.org/rec/conf/focs/MuchaS04.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Sankowski, P.\n\n\n \n\n\n\n In
45th Symposium on Foundations of Computer Science, FOCS 2004, Rome, Italy, October 17-19, 2004, Proceedings, pages 509–517, 2004. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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, Rome,\n Italy, October 17-19, 2004, 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 = {Thu, 23 Mar 2023 00:00:00 +0100},\n biburl = {https://dblp.org/rec/conf/focs/Sankowski04.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\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\n\n \n Ciebiera, K.; and Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\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\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, 14 May 2019 10:00:53 +0200},\n biburl = {https://dblp.org/rec/conf/icwe/CiebieraS04.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n \n 2003\n \n \n (2)\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\n\n \n Sankowski, P.\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\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\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 = {Thu, 14 Oct 2021 10:38:16 +0200},\n biburl = {https://dblp.org/rec/conf/stacs/Sankowski03.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
![\"Loading..\"](\"//bibbase.org/img/ajax-loader.gif\")
\n\n![\"bibbase.org\"\n](\"//bibbase.org/img/logo.svg\"\n "\\"BibBase")
\n \n