BibTeX records: Marcin Mucha

download as .bib file

@inproceedings{DBLP:conf/aaai/BienkowskiM23,
  author       = {Marcin Bienkowski and
                  Marcin Mucha},
  editor       = {Brian Williams and
                  Yiling Chen and
                  Jennifer Neville},
  title        = {An Improved Algorithm for Online Min-Sum Set Cover},
  booktitle    = {Thirty-Seventh {AAAI} Conference on Artificial Intelligence, {AAAI}
                  2023, Thirty-Fifth Conference on Innovative Applications of Artificial
                  Intelligence, {IAAI} 2023, Thirteenth Symposium on Educational Advances
                  in Artificial Intelligence, {EAAI} 2023, Washington, DC, USA, February
                  7-14, 2023},
  pages        = {6815--6822},
  publisher    = {{AAAI} Press},
  year         = {2023},
  url          = {https://doi.org/10.1609/aaai.v37i6.25835},
  doi          = {10.1609/AAAI.V37I6.25835},
  timestamp    = {Mon, 04 Sep 2023 12:29:24 +0200},
  biburl       = {https://dblp.org/rec/conf/aaai/BienkowskiM23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ausdm/DobrakowskiPSMB22,
  author       = {Adam Gabriel Dobrakowski and
                  Andrzej Pacuk and
                  Piotr Sankowski and
                  Marcin Mucha and
                  Pawel Brach},
  editor       = {Laurence A. F. Park and
                  Heitor Murilo Gomes and
                  Maryam Gholami Doborjeh and
                  Yee Ling Boo and
                  Yun Sing Koh and
                  Yanchang Zhao and
                  Graham Williams and
                  Simeon Simoff},
  title        = {Improving Ads-Profitability Using Traffic-Fingerprints},
  booktitle    = {Data Mining - 20th Australasian Conference, AusDM 2022, Western Sydney,
                  Australia, December 12-15, 2022, Proceedings},
  series       = {Communications in Computer and Information Science},
  volume       = {1741},
  pages        = {205--216},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-981-19-8746-5\_15},
  doi          = {10.1007/978-981-19-8746-5\_15},
  timestamp    = {Tue, 06 Dec 2022 09:25:02 +0100},
  biburl       = {https://dblp.org/rec/conf/ausdm/DobrakowskiPSMB22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/GuptaLLMNS22,
  author       = {Anupam Gupta and
                  Euiwoong Lee and
                  Jason Li and
                  Marcin Mucha and
                  Heather Newman and
                  Sherry Sarkar},
  editor       = {Karen I. Aardal and
                  Laura Sanit{\`{a}}},
  title        = {Matroid-Based {TSP} Rounding for Half-Integral Solutions},
  booktitle    = {Integer Programming and Combinatorial Optimization - 23rd International
                  Conference, {IPCO} 2022, Eindhoven, The Netherlands, June 27-29, 2022,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13265},
  pages        = {305--318},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-06901-7\_23},
  doi          = {10.1007/978-3-031-06901-7\_23},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/GuptaLLMNS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-02630,
  author       = {Adam Gabriel Dobrakowski and
                  Andrzej Pacuk and
                  Piotr Sankowski and
                  Marcin Mucha and
                  Pawel Brach},
  title        = {Improving Ads-Profitability Using Traffic-Fingerprints},
  journal      = {CoRR},
  volume       = {abs/2206.02630},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2206.02630},
  doi          = {10.48550/ARXIV.2206.02630},
  eprinttype    = {arXiv},
  eprint       = {2206.02630},
  timestamp    = {Tue, 14 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2206-02630.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-04870,
  author       = {Marcin Bienkowski and
                  Marcin Mucha},
  title        = {An Improved Algorithm For Online Reranking},
  journal      = {CoRR},
  volume       = {abs/2209.04870},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2209.04870},
  doi          = {10.48550/ARXIV.2209.04870},
  eprinttype    = {arXiv},
  eprint       = {2209.04870},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2209-04870.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-09290,
  author       = {Anupam Gupta and
                  Euiwoong Lee and
                  Jason Li and
                  Marcin Mucha and
                  Heather Newman and
                  Sherry Sarkar},
  title        = {Matroid-Based {TSP} Rounding for Half-Integral Solutions},
  journal      = {CoRR},
  volume       = {abs/2111.09290},
  year         = {2021},
  url          = {https://arxiv.org/abs/2111.09290},
  eprinttype    = {arXiv},
  eprint       = {2111.09290},
  timestamp    = {Mon, 22 Nov 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2111-09290.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MuchaS20,
  author       = {Marcin Mucha and
                  Marcin Smulewicz},
  title        = {Improved approximation for Fractionally Subadditive Network Design},
  journal      = {Inf. Process. Lett.},
  volume       = {154},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.ipl.2019.105861},
  doi          = {10.1016/J.IPL.2019.105861},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/MuchaS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KowalikMNPSW20,
  author       = {Lukasz Kowalik and
                  Marcin Mucha and
                  Wojciech Nadara and
                  Marcin Pilipczuk and
                  Manuel Sorge and
                  Piotr Wygocki},
  editor       = {Yixin Cao and
                  Marcin Pilipczuk},
  title        = {The {PACE} 2020 Parameterized Algorithms and Computational Experiments
                  Challenge: Treedepth},
  booktitle    = {15th International Symposium on Parameterized and Exact Computation,
                  {IPEC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {180},
  pages        = {37:1--37:18},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.IPEC.2020.37},
  doi          = {10.4230/LIPICS.IPEC.2020.37},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/iwpec/KowalikMNPSW20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganMWW19,
  author       = {Marek Cygan and
                  Marcin Mucha and
                  Karol Wegrzycki and
                  Michal Wlodarczyk},
  title        = {On Problems Equivalent to (min, +)-Convolution},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {15},
  number       = {1},
  pages        = {14:1--14:25},
  year         = {2019},
  url          = {https://doi.org/10.1145/3293465},
  doi          = {10.1145/3293465},
  timestamp    = {Tue, 16 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/CyganMWW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BienkowskiBM19,
  author       = {Marcin Bienkowski and
                  Jaroslaw Byrka and
                  Marcin Mucha},
  title        = {Dynamic Beats Fixed: On Phase-based Algorithms for File Migration},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {15},
  number       = {4},
  pages        = {46:1--46:21},
  year         = {2019},
  url          = {https://doi.org/10.1145/3340296},
  doi          = {10.1145/3340296},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/BienkowskiBM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MuchaNPW19,
  author       = {Marcin Mucha and
                  Jesper Nederlof and
                  Jakub Pawlewicz and
                  Karol Wegrzycki},
  editor       = {Michael A. Bender and
                  Ola Svensson and
                  Grzegorz Herman},
  title        = {Equal-Subset-Sum Faster Than the Meet-in-the-Middle},
  booktitle    = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
                  9-11, 2019, Munich/Garching, Germany},
  series       = {LIPIcs},
  volume       = {144},
  pages        = {73:1--73:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2019.73},
  doi          = {10.4230/LIPICS.ESA.2019.73},
  timestamp    = {Mon, 23 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/MuchaNPW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MuchaW019,
  author       = {Marcin Mucha and
                  Karol Wegrzycki and
                  Michal Wlodarczyk},
  editor       = {Timothy M. Chan},
  title        = {A Subquadratic Approximation Scheme for Partition},
  booktitle    = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
                  2019},
  pages        = {70--88},
  publisher    = {{SIAM}},
  year         = {2019},
  url          = {https://doi.org/10.1137/1.9781611975482.5},
  doi          = {10.1137/1.9781611975482.5},
  timestamp    = {Tue, 16 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/MuchaW019.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-02424,
  author       = {Marcin Mucha and
                  Jesper Nederlof and
                  Jakub Pawlewicz and
                  Karol Wegrzycki},
  title        = {Equal-Subset-Sum Faster Than the Meet-in-the-Middle},
  journal      = {CoRR},
  volume       = {abs/1905.02424},
  year         = {2019},
  url          = {http://arxiv.org/abs/1905.02424},
  eprinttype    = {arXiv},
  eprint       = {1905.02424},
  timestamp    = {Mon, 27 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1905-02424.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CyganCMS18,
  author       = {Marek Cygan and
                  Artur Czumaj and
                  Marcin Mucha and
                  Piotr Sankowski},
  editor       = {Yossi Azar and
                  Hannah Bast and
                  Grzegorz Herman},
  title        = {Online Facility Location with Deletions},
  booktitle    = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
                  2018, Helsinki, Finland},
  series       = {LIPIcs},
  volume       = {112},
  pages        = {21:1--21:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2018.21},
  doi          = {10.4230/LIPICS.ESA.2018.21},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/CyganCMS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-02269,
  author       = {Marcin Mucha and
                  Karol Wegrzycki and
                  Michal Wlodarczyk},
  title        = {Subquadratic Approximation Scheme for Partition},
  journal      = {CoRR},
  volume       = {abs/1804.02269},
  year         = {2018},
  url          = {http://arxiv.org/abs/1804.02269},
  eprinttype    = {arXiv},
  eprint       = {1804.02269},
  timestamp    = {Wed, 24 Oct 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1804-02269.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-03839,
  author       = {Marek Cygan and
                  Artur Czumaj and
                  Marcin Mucha and
                  Piotr Sankowski},
  title        = {Online Facility Location with Deletions},
  journal      = {CoRR},
  volume       = {abs/1807.03839},
  year         = {2018},
  url          = {http://arxiv.org/abs/1807.03839},
  eprinttype    = {arXiv},
  eprint       = {1807.03839},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1807-03839.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Mucha17,
  author       = {Marcin Mucha},
  editor       = {Juha K{\"{a}}rkk{\"{a}}inen and
                  Jakub Radoszewski and
                  Wojciech Rytter},
  title        = {Shortest Superstring},
  booktitle    = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
                  July 4-6, 2017, Warsaw, Poland},
  series       = {LIPIcs},
  volume       = {78},
  pages        = {3:1--3:1},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.CPM.2017.3},
  doi          = {10.4230/LIPICS.CPM.2017.3},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/cpm/Mucha17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BienkowskiBM17,
  author       = {Marcin Bienkowski and
                  Jaroslaw Byrka and
                  Marcin Mucha},
  editor       = {Ioannis Chatzigiannakis and
                  Piotr Indyk and
                  Fabian Kuhn and
                  Anca Muscholl},
  title        = {Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration},
  booktitle    = {44th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  series       = {LIPIcs},
  volume       = {80},
  pages        = {13:1--13:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2017.13},
  doi          = {10.4230/LIPICS.ICALP.2017.13},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/BienkowskiBM17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CyganMWW17,
  author       = {Marek Cygan and
                  Marcin Mucha and
                  Karol Wegrzycki and
                  Michal Wlodarczyk},
  editor       = {Ioannis Chatzigiannakis and
                  Piotr Indyk and
                  Fabian Kuhn and
                  Anca Muscholl},
  title        = {On Problems Equivalent to (min, +)-Convolution},
  booktitle    = {44th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  series       = {LIPIcs},
  volume       = {80},
  pages        = {22:1--22:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2017.22},
  doi          = {10.4230/LIPICS.ICALP.2017.22},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/CyganMWW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CyganMWW17,
  author       = {Marek Cygan and
                  Marcin Mucha and
                  Karol Wegrzycki and
                  Michal Wlodarczyk},
  title        = {On problems equivalent to (min, +)-convolution},
  journal      = {CoRR},
  volume       = {abs/1702.07669},
  year         = {2017},
  url          = {http://arxiv.org/abs/1702.07669},
  eprinttype    = {arXiv},
  eprint       = {1702.07669},
  timestamp    = {Wed, 24 Oct 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/CyganMWW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/MuchaS16,
  author       = {Marcin Mucha and
                  Maxim Sviridenko},
  title        = {No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman
                  Problem},
  journal      = {Math. Oper. Res.},
  volume       = {41},
  number       = {1},
  pages        = {247--254},
  year         = {2016},
  url          = {https://doi.org/10.1287/moor.2015.0725},
  doi          = {10.1287/MOOR.2015.0725},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/MuchaS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CyganMSZ16,
  author       = {Marek Cygan and
                  Marcin Mucha and
                  Piotr Sankowski and
                  Qiang Zhang},
  editor       = {Robert Krauthgamer},
  title        = {Online Pricing with Impatient Bidders},
  booktitle    = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  pages        = {190--201},
  publisher    = {{SIAM}},
  year         = {2016},
  url          = {https://doi.org/10.1137/1.9781611974331.ch15},
  doi          = {10.1137/1.9781611974331.CH15},
  timestamp    = {Tue, 02 Feb 2021 17:07:56 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/CyganMSZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Mucha16,
  author       = {Marcin Mucha},
  title        = {Maximum Matching},
  booktitle    = {Encyclopedia of Algorithms},
  pages        = {1238--1240},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-1-4939-2864-4\_225},
  doi          = {10.1007/978-1-4939-2864-4\_225},
  timestamp    = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Mucha16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BienkowskiBM16,
  author       = {Marcin Bienkowski and
                  Jaroslaw Byrka and
                  Marcin Mucha},
  title        = {Dynamic beats fixed: on phase-based algorithms for file migration},
  journal      = {CoRR},
  volume       = {abs/1609.00831},
  year         = {2016},
  url          = {http://arxiv.org/abs/1609.00831},
  eprinttype    = {arXiv},
  eprint       = {1609.00831},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BienkowskiBM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Mucha14,
  author       = {Marcin Mucha},
  title        = {13/9 -Approximation for Graphic {TSP}},
  journal      = {Theory Comput. Syst.},
  volume       = {55},
  number       = {4},
  pages        = {640--657},
  year         = {2014},
  url          = {https://doi.org/10.1007/s00224-012-9439-7},
  doi          = {10.1007/S00224-012-9439-7},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Mucha14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KowalikM14,
  author       = {Lukasz Kowalik and
                  Marcin Mucha},
  title        = {A 9k kernel for nonseparating independent set in planar graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {516},
  pages        = {86--95},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2013.11.021},
  doi          = {10.1016/J.TCS.2013.11.021},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KowalikM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/EnglertMM14,
  author       = {Matthias Englert and
                  Nicolaos Matsakis and
                  Marcin Mucha},
  editor       = {Alberto Pardo and
                  Alfredo Viola},
  title        = {New Bounds for Online Packing LPs},
  booktitle    = {{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium,
                  Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8392},
  pages        = {318--329},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-642-54423-1\_28},
  doi          = {10.1007/978-3-642-54423-1\_28},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/EnglertMM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MuchaS13,
  author       = {Marcin Mucha and
                  Maxim Sviridenko},
  editor       = {Fedor V. Fomin and
                  Rusins Freivalds and
                  Marta Z. Kwiatkowska and
                  David Peleg},
  title        = {No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman
                  Problem},
  booktitle    = {Automata, Languages, and Programming - 40th International Colloquium,
                  {ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7965},
  pages        = {769--779},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-39206-1\_65},
  doi          = {10.1007/978-3-642-39206-1\_65},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/MuchaS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CyganEGMS13,
  author       = {Marek Cygan and
                  Matthias Englert and
                  Anupam Gupta and
                  Marcin Mucha and
                  Piotr Sankowski},
  editor       = {Robert D. Kleinberg},
  title        = {Catch them if you can: how to serve impatient users},
  booktitle    = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
                  CA, USA, January 9-12, 2013},
  pages        = {485--494},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2422436.2422489},
  doi          = {10.1145/2422436.2422489},
  timestamp    = {Wed, 18 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/innovations/CyganEGMS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Mucha13,
  author       = {Marcin Mucha},
  editor       = {Sanjeev Khanna},
  title        = {Lyndon Words and Short Superstrings},
  booktitle    = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
                  2013},
  pages        = {958--972},
  publisher    = {{SIAM}},
  year         = {2013},
  url          = {https://doi.org/10.1137/1.9781611973105.69},
  doi          = {10.1137/1.9781611973105.69},
  timestamp    = {Tue, 02 Feb 2021 17:07:29 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Mucha13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-2551,
  author       = {Marcin Mucha and
                  Maxim Sviridenko},
  title        = {No-Wait Flowshop Scheduling is as Hard as Asymmetric Traveling Salesman
                  Problem},
  journal      = {CoRR},
  volume       = {abs/1302.2551},
  year         = {2013},
  url          = {http://arxiv.org/abs/1302.2551},
  eprinttype    = {arXiv},
  eprint       = {1302.2551},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1302-2551.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Mucha12,
  author       = {Marcin Mucha},
  editor       = {Christoph D{\"{u}}rr and
                  Thomas Wilke},
  title        = {13/9-approximation for Graphic {TSP}},
  booktitle    = {29th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
  series       = {LIPIcs},
  volume       = {14},
  pages        = {30--41},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2012},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2012.30},
  doi          = {10.4230/LIPICS.STACS.2012.30},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/Mucha12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KowalikM12,
  author       = {Lukasz Kowalik and
                  Marcin Mucha},
  editor       = {Martin Charles Golumbic and
                  Michal Stern and
                  Avivit Levy and
                  Gila Morgenstern},
  title        = {A 9k Kernel for Nonseparating Independent Set in Planar Graphs},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 38th International
                  Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
                  Selcted Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {7551},
  pages        = {160--171},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-34611-8\_18},
  doi          = {10.1007/978-3-642-34611-8\_18},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/KowalikM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-6787,
  author       = {Marcin Mucha},
  title        = {Lyndon Words and Short Superstrings},
  journal      = {CoRR},
  volume       = {abs/1205.6787},
  year         = {2012},
  url          = {http://arxiv.org/abs/1205.6787},
  eprinttype    = {arXiv},
  eprint       = {1205.6787},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1205-6787.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-4666,
  author       = {Lukasz Kowalik and
                  Marcin Mucha},
  title        = {A 9k kernel for nonseparating independent set in planar graphs},
  journal      = {CoRR},
  volume       = {abs/1207.4666},
  year         = {2012},
  url          = {http://arxiv.org/abs/1207.4666},
  eprinttype    = {arXiv},
  eprint       = {1207.4666},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1207-4666.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KowalikM11,
  author       = {Lukasz Kowalik and
                  Marcin Mucha},
  title        = {35/44-approximation for Asymmetric Maximum {TSP} with Triangle Inequality},
  journal      = {Algorithmica},
  volume       = {59},
  number       = {2},
  pages        = {240--255},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00453-009-9306-3},
  doi          = {10.1007/S00453-009-9306-3},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/KowalikM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CyganGLMPS11,
  author       = {Marek Cygan and
                  Fabrizio Grandoni and
                  Stefano Leonardi and
                  Marcin Mucha and
                  Marcin Pilipczuk and
                  Piotr Sankowski},
  editor       = {Supratik Chakraborty and
                  Amit Kumar},
  title        = {Approximation Algorithms for Union and Intersection Covering Problems},
  booktitle    = {{IARCS} Annual Conference on Foundations of Software Technology and
                  Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
                  Mumbai, India},
  series       = {LIPIcs},
  volume       = {13},
  pages        = {28--40},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2011},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.28},
  doi          = {10.4230/LIPICS.FSTTCS.2011.28},
  timestamp    = {Tue, 27 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/CyganGLMPS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-5105,
  author       = {Marek Cygan and
                  Fabrizio Grandoni and
                  Stefano Leonardi and
                  Marcin Mucha and
                  Marcin Pilipczuk and
                  Piotr Sankowski},
  title        = {Approximation Algorithms for Union and Intersection Covering Problems},
  journal      = {CoRR},
  volume       = {abs/1102.5105},
  year         = {2011},
  url          = {http://arxiv.org/abs/1102.5105},
  eprinttype    = {arXiv},
  eprint       = {1102.5105},
  timestamp    = {Tue, 27 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1102-5105.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-1130,
  author       = {Marcin Mucha},
  title        = {Improved Analysis for Graphic {TSP} Approximation via Matchings},
  journal      = {CoRR},
  volume       = {abs/1108.1130},
  year         = {2011},
  url          = {http://arxiv.org/abs/1108.1130},
  eprinttype    = {arXiv},
  eprint       = {1108.1130},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1108-1130.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SankowskiM10,
  author       = {Piotr Sankowski and
                  Marcin Mucha},
  title        = {Fast Dynamic Transitive Closure with Lookahead},
  journal      = {Algorithmica},
  volume       = {56},
  number       = {2},
  pages        = {180--197},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00453-008-9166-2},
  doi          = {10.1007/S00453-008-9166-2},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/SankowskiM10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CyganKMPS10,
  author       = {Marek Cygan and
                  Lukasz Kowalik and
                  Marcin Mucha and
                  Marcin Pilipczuk and
                  Piotr Sankowski},
  editor       = {Mark de Berg and
                  Ulrich Meyer},
  title        = {Fast Approximation in Subspaces by Doubling Metric Decomposition},
  booktitle    = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
                  UK, September 6-8, 2010. Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {6346},
  pages        = {72--83},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-15775-2\_7},
  doi          = {10.1007/978-3-642-15775-2\_7},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/CyganKMPS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KowalikM09,
  author       = {Lukasz Kowalik and
                  Marcin Mucha},
  title        = {Deterministic 7/8-approximation for the metric maximum {TSP}},
  journal      = {Theor. Comput. Sci.},
  volume       = {410},
  number       = {47-49},
  pages        = {5000--5009},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.tcs.2009.07.051},
  doi          = {10.1016/J.TCS.2009.07.051},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KowalikM09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/PaluchMM09,
  author       = {Katarzyna E. Paluch and
                  Marcin Mucha and
                  Aleksander Madry},
  editor       = {Irit Dinur and
                  Klaus Jansen and
                  Joseph Naor and
                  Jos{\'{e}} D. P. Rolim},
  title        = {A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman
                  Problem},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
                  International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
                  2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5687},
  pages        = {298--311},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03685-9\_23},
  doi          = {10.1007/978-3-642-03685-9\_23},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/PaluchMM09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KowalikM09,
  author       = {Lukasz Kowalik and
                  Marcin Mucha},
  editor       = {Frank K. H. A. Dehne and
                  Marina L. Gavrilova and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Csaba D. T{\'{o}}th},
  title        = {Two Approximation Algorithms for {ATSP} with Strengthened Triangle
                  Inequality},
  booktitle    = {Algorithms and Data Structures, 11th International Symposium, {WADS}
                  2009, Banff, Canada, August 21-23, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5664},
  pages        = {471--482},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-03367-4\_41},
  doi          = {10.1007/978-3-642-03367-4\_41},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/KowalikM09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-1626,
  author       = {Marek Cygan and
                  Lukasz Kowalik and
                  Marcin Mucha and
                  Marcin Pilipczuk and
                  Piotr Sankowski},
  title        = {Fast Approximation in Subspaces by Doubling Metric Decomposition},
  journal      = {CoRR},
  volume       = {abs/0911.1626},
  year         = {2009},
  url          = {http://arxiv.org/abs/0911.1626},
  eprinttype    = {arXiv},
  eprint       = {0911.1626},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0911-1626.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KowalikM08,
  author       = {Lukasz Kowalik and
                  Marcin Mucha},
  editor       = {Ashish Goel and
                  Klaus Jansen and
                  Jos{\'{e}} D. P. Rolim and
                  Ronitt Rubinfeld},
  title        = {Deterministic 7/8-Approximation for the Metric Maximum {TSP}},
  booktitle    = {Approximation, Randomization and Combinatorial Optimization. Algorithms
                  and Techniques, 11th International Workshop, {APPROX} 2008, and 12th
                  International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27,
                  2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5171},
  pages        = {132--145},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-85363-3\_11},
  doi          = {10.1007/978-3-540-85363-3\_11},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/KowalikM08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Mucha08,
  author       = {Marcin Mucha},
  editor       = {Ming{-}Yang Kao},
  title        = {Maximum Matching},
  booktitle    = {Encyclopedia of Algorithms - 2008 Edition},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-0-387-30162-4\_225},
  doi          = {10.1007/978-0-387-30162-4\_225},
  timestamp    = {Thu, 27 Jun 2019 16:25:31 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Mucha08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-5101,
  author       = {Katarzyna E. Paluch and
                  Marcin Mucha and
                  Aleksander Madry},
  title        = {A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman
                  Problem},
  journal      = {CoRR},
  volume       = {abs/0812.5101},
  year         = {2008},
  url          = {http://arxiv.org/abs/0812.5101},
  eprinttype    = {arXiv},
  eprint       = {0812.5101},
  timestamp    = {Thu, 20 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0812-5101.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KowalikM07,
  author       = {Lukasz Kowalik and
                  Marcin Mucha},
  editor       = {Frank K. H. A. Dehne and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Norbert Zeh},
  title        = {35/44-Approximation for Asymmetric Maximum {TSP} with Triangle Inequality},
  booktitle    = {Algorithms and Data Structures, 10th International Workshop, {WADS}
                  2007, Halifax, Canada, August 15-17, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4619},
  pages        = {589--600},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-73951-7\_51},
  doi          = {10.1007/978-3-540-73951-7\_51},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/KowalikM07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MuchaS06,
  author       = {Marcin Mucha and
                  Piotr Sankowski},
  title        = {Maximum Matchings in Planar Graphs via Gaussian Elimination},
  journal      = {Algorithmica},
  volume       = {45},
  number       = {1},
  pages        = {3--20},
  year         = {2006},
  url          = {https://doi.org/10.1007/s00453-005-1187-5},
  doi          = {10.1007/S00453-005-1187-5},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MuchaS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MuchaS04,
  author       = {Marcin Mucha and
                  Piotr Sankowski},
  editor       = {Susanne Albers and
                  Tomasz Radzik},
  title        = {Maximum Matchings in Planar Graphs via Gaussian Elimination},
  booktitle    = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway,
                  September 14-17, 2004, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3221},
  pages        = {532--543},
  publisher    = {Springer},
  year         = {2004},
  url          = {https://doi.org/10.1007/978-3-540-30140-0\_48},
  doi          = {10.1007/978-3-540-30140-0\_48},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/MuchaS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MuchaS04,
  author       = {Marcin Mucha and
                  Piotr Sankowski},
  title        = {Maximum Matchings via Gaussian Elimination},
  booktitle    = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
                  October 2004, Rome, Italy, Proceedings},
  pages        = {248--255},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/FOCS.2004.40},
  doi          = {10.1109/FOCS.2004.40},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/MuchaS04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics