Publikacje

Marcin Mucha

Liczba publikacji: 40

2024

• Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha , Heather Newman, Sherry Sarkar, Matroid-based TSP rounding for half-integral solutions, MATHEMATICAL PROGRAMMING, 206 (1-2) 2024, s. 541-576. Zobacz w PBN

2022

• Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski , Marcin Mucha , Paweł Brach, Improving Ads-Profitability Using Traffic-Fingerprints, Communications in Computer and Information Science, 2022. Zobacz w PBN
• Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha , Heather Newman, Sherry Sarkar, Matroid-Based TSP Rounding for Half-Integral Solutions, Integer Programming and Combinatorial Optimization, Eindhoven, the Netherlands, 27 czerwca 2022 - 29 czerwca 2022, 13265 2022, s. 305--318. Zobacz w PBN

2020

• Marcin Mucha , Marcin Smulewicz, Improved approximation for Fractionally Subadditive Network Design, Information Processing Letters, 154 2020, s. 105861. Zobacz w PBN
• Łukasz Kowalik , Marcin Mucha , Wojciech Nadara , Marcin Pilipczuk , Manuel Sorge, Piotr Wygocki , The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China, 14 grudnia 2020 - 18 grudnia 2020. Zobacz w PBN

2019

• Marcin Mucha , Karol Węgrzycki, Michał Włodarczyk , A Subquadratic Approximation Scheme for Partition, 30th ACM-SIAM Symposium on Discrete Algorithms, San Diego, the United States of America, 6 stycznia 2019 - 9 stycznia 2019. Zobacz w PBN
• Robert Bogucki, Marek Cygan , Christin Khan, Maciej Klimek, Jan Kanty Milczek, Marcin Mucha , Applying deep learning to right whale photo identification, Conservation Biology, 33 (3) 2019, s. 676-684. Zobacz w PBN
• Jesper Nederlof, Karol Węgrzycki, Jakub Pawlewicz , Marcin Mucha , Equal-Subset-Sum Faster Than the Meet-in-the-Middle, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 września 2019 - 13 września 2019. Zobacz w PBN
• Marek Cygan , Marcin Mucha , Karol Węgrzycki, Michał Włodarczyk , On Problems Equivalent to (min,+)-Convolution, ACM Transactions on Algorithms, 15 (1) 2019, s. 1-25. Zobacz w PBN

2018

• Marek Cygan , Artur Czumaj, Marcin Mucha , Piotr Sankowski , Online Facility Location with Deletions, 26th Annual European Symposium on Algorithms, Helsinki, Finland, 20 sierpnia 2018 - 22 sierpnia 2018. Zobacz w PBN

2017

• Marcin Bieńkowski, Jarosław Byrka, Marcin Mucha , Dynamic beats fixed : on phase-based algorithms for file migration, 44th International Colloquium on Automata, Languages, and Programming, Warszawa, Poland, 10 lipca 2017 - 14 lipca 2017. Zobacz w PBN
• Marek Cygan , Marcin Mucha , Karol Węgrzycki, Michał Włodarczyk , On Problems Equivalent to (min, +)-Convolution, 44th International Colloquium on Automata, Languages, and Programming, Warszawa, Poland, 10 lipca 2017 - 14 lipca 2017. Zobacz w PBN

2016

• Marcin Mucha , Maximum Matching, 2016. Zobacz w PBN
• Marcin Mucha , Maxim Sviridenko, No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem, MATHEMATICS OF OPERATIONS RESEARCH, 2016. Zobacz w PBN
• Marek Cygan , Marcin Mucha , Piotr Sankowski , Qiang Zhang, Online Pricing with Impatient Bidders, Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, the United States of America, 10 stycznia 2016 - 12 stycznia 2016. Zobacz w PBN

2014

• Marcin Mucha , 13/9 -Approximation for Graphic TSP, Theory of Computing Systems, 2014. Zobacz w PBN
• Łukasz Kowalik , Marcin Mucha , A 9k kernel for nonseparating independent set in planar graphs, Theoretical Computer Science, 516 2014, s. 86-95. Zobacz w PBN
• Matthias Englert, Nicolaos Matsakis, Marcin Mucha , New Bounds for Online Packing LPs, LATIN 2014: Theoretical Informatics, Montevideo, Uruguay, 31 marca 2014 - 4 kwietnia 2014. Zobacz w PBN

2013

• Marek Cygan , Marcin Mucha , Piotr Sankowski , Matthias Englert, Anupam Gupta, Catch them if you can: how to serve impatient users, Innovations in Theoretical Computer Science, Berkeley, the United States of America, 2013. Zobacz w PBN
• Marcin Mucha , Lyndon Words and Short Superstrings, Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, the United States of America, 6 stycznia 2013 - 8 stycznia 2013. Zobacz w PBN
• Marcin Mucha , Maxim Sviridenko, No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem, Automata, Languages, and Programming - 40th International Colloquium, Riga, Latvia, 8 lipca 2013 - 12 lipca 2013. Zobacz w PBN

2012

• Marcin Mucha , 13/9-approximation for Graphic TSP, 2012. Zobacz w PBN
• Łukasz Kowalik , Marcin Mucha , A 9k Kernel for Nonseparating Independent Set in Planar Graphs, 2012. Zobacz w PBN

2011

• Łukasz Kowalik , Marcin Mucha , 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality, Algorithmica, 2011. Zobacz w PBN
• Marek Cygan , Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha , Marcin Pilipczuk , Piotr Sankowski , Approximation Algorithms for Union and Intersection Covering Problems, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Mumbai, India, 12 grudnia 2011 - 14 grudnia 2011. Zobacz w PBN

2010

• Marek Cygan, Łukasz Kowalik , Marcin Mucha , Marcin Pilipczuk, Piotr Sankowski , Fast Approximation in Subspaces by Doubling Metric Decomposition, Lecture Notes in Computer Science, 2010. Zobacz w PBN
• Marcin Mucha , Piotr Sankowski , Fast Dynamic Transitive Closure with Lookahead, Algorithmica, 2010. Zobacz w PBN

2009

• Aleksander Madry, Marcin Mucha , Katarzyna Paluch, A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem, Lecture Notes in Computer Science, 2009. Zobacz w PBN
• Łukasz Kowalik , Marcin Mucha , Deterministic 7/8-approximation for the Metric Maximum TSP, Theoretical Computer Science, 2009. Zobacz w PBN
• Łukasz Kowalik , Marcin Mucha , Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality, Lecture Notes in Computer Science, 2009. Zobacz w PBN

2008

• Łukasz Kowalik , Marcin Mucha , Deterministic 7/8-Approximation for the Metric Maximum TSP, 2008. Zobacz w PBN
• Marcin Mucha , Maximum Matching, 2008. Zobacz w PBN

2007

• Łukasz Kowalik , Marcin Mucha , 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality, Lecture Notes in Computer Science, 2007. Zobacz w PBN

2006

• Marcin Mucha , J. M. Olchowik, A. Zdyb, Dependence of GaAs and Si surface energy on the misorientation angle of crystal planes, MATERIALS SCIENCE-POLAND, 2006. Zobacz w PBN
• Marcin Mucha , Piotr Sankowski , Maximum Matchings in Planar Graphs via Gaussian Elimination, Algorithmica, 2006. Zobacz w PBN

2004

• Marcin Mucha , Piotr Sankowski , Maximum Matchings in Planar Graphs via Gaussian Elimination, Lecture Notes in Computer Science, 2004. Zobacz w PBN
• Marcin Mucha , Piotr Sankowski , Maximum Matchings via Gaussian Elimination, 2004. Zobacz w PBN

2001

• Wojciech Guzicki, Marcin Mucha , J. Wróblewski, Gorszy Goldbach, 2001. Zobacz w PBN
• Marcin Mucha , T Śmigielski, Mapa gęstości, 2001. Zobacz w PBN

2000

• J. Mucha, Marcin Mucha , J. M. Olchowik, W. Sadowski, D. Szymczuk, K. Zabielski, A. Zdyb, Analysis of crystallisation of GaAs/Si heterostructures, Opto-electronics Review, 2000. Zobacz w PBN