Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Marcin Mucha
2019
- Marcin Ireneusz Mucha, Karol Zbigniew Węgrzycki and Michał Włodarczyk, A Subquadratic Approximation Scheme for Partition, in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, SIAM, 2019, p. 70–88.see in PBN
2018
- Marek Adam Cygan, Artur Czumaj, Marcin Ireneusz Mucha and Piotr Sankowski, Online Facility Location with Deletions, in: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, 2018, r. 21, p. 1–15.see in PBN
2017
- Marek Adam Cygan, Marcin Ireneusz Mucha, Karol Zbigniew Węgrzycki and Michał Włodarczyk, On Problems Equivalent to (min, +)-Convolution, in: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, r. 22, p. 1–15.see in PBN
- Marcin Bieńkowski, Jarosław Byrka and Marcin Ireneusz Mucha, Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration, in: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017, r. 13, p. 1–14.see in PBN
2016
- Marcin Ireneusz Mucha and Maxim Sviridenko, No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem, Mathematics Of Operations Research 41 (1) 2016, p. 247–254.see in PBN
- Marek Adam Cygan, Marcin Ireneusz Mucha, Piotr Sankowski and Qiang Zhang, Online Pricing with Impatient Bidders, in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, SIAM, 2016, p. 190–201.see in PBN
- Marcin Ireneusz Mucha and Piotr Sankowski, Maximum Matching, in: Encyclopedia of Algorithms, Springer, 2016, p. 1238–1240.see in PBN
2014
- Łukasz Kowalik and Marcin Ireneusz Mucha, A 9k kernel for nonseparating independent set in planar graphs, Theoretical Computer Science 2014.see in PBN
- Marcin Ireneusz Mucha, 13/9 -Approximation for Graphic TSP, Theory Of Computing Systems 55 (4) 2014, p. 640–657.see in PBN
- Marcin Ireneusz Mucha, Matthias Englert and Nicolaos Matsakis, New Bounds for Online Packing LPs, in: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 2014, p. 318–329.see in PBN
2013
- Marcin Ireneusz Mucha, Lyndon Words and Short Superstrings, in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 2013, p. 958–972.see in PBN
- Marek Adam Cygan, Marcin Ireneusz Mucha, Piotr Sankowski, Matthias Englert and Anupam Gupta, Catch them if you can: how to serve impatient users, in: Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013, ACM, 2013.see in PBN
- Marcin Ireneusz Mucha and Maxim Sviridenko, No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem, in: Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Part I, 2013.see in PBN
2011
- Łukasz Kowalik and Marcin Mucha, 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality, Algorithmica 59 (2) 2011, p. 240–255.see in PBN
- Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk and Piotr Sankowski, Approximation Algorithms for Union and Intersection Covering Problems, in: Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 2011, Leibniz-Zentrum fuer Informatik, Dagstuhl 2011, p. 28–40.see in PBN
2009
- Katarzyna Paluch, Marcin Mucha and Aleksander Madry, A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem, Lecture Notes In Computer Science 5687 2009, p. 298–311.see in PBN
- Łukasz Kowalik and Marcin Mucha, Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality, Lecture Notes In Computer Science 5664 2009, p. 471–482.see in PBN
- Łukasz Kowalik and Marcin Mucha, Deterministic 7/8-approximation for the Metric Maximum TSP, Theoretical Computer Science 410 2009, p. 5000–5009.see in PBN
2001
- Wojciech Guzicki, J. Wróblewski and Marcin Mucha, Gorszy Goldbach, in: VIII Olimpiada Informatyczna 2000/2001, Komitet Główny Olimpiady Informatycznej, Warszawa 2001.see in PBN
- T Śmigielski and Marcin Mucha, Mapa gęstości, in: VIII Olimpiada Informatyczna 2000/2001, Komitet Główny Olimpiady Informatycznej, Warszawa 2001.see in PBN
2000
- J. M. Olchowik, A. Zdyb, D. Szymczuk, J. Mucha, K. Zabielski, W. Sadowski and M. Mucha, Analysis of crystallisation of GaAs/Si heterostructures, Opto-electronics Review Vol. 8, nr 4 2000, p. 393–397.see in PBN
You are not logged in | log in
