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