Marcin Mucha

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 24

Top Topics

Facility Location

Top Venues

Publications

Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
Matroid-based TSP rounding for half-integral solutions. Math. Program. 206 (1) (2024)
Marcin Bienkowski, Marcin Mucha
An Improved Algorithm for Online Min-Sum Set Cover. AAAI (2023)
Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski, Marcin Mucha, Pawel Brach
Improving Ads-Profitability Using Traffic-Fingerprints. AusDM (2022)
Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski, Marcin Mucha, Pawel Brach
Improving Ads-Profitability Using Traffic-Fingerprints. CoRR (2022)
Marcin Bienkowski, Marcin Mucha
An Improved Algorithm For Online Reranking. CoRR (2022)
Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
Matroid-Based TSP Rounding for Half-Integral Solutions. IPCO (2022)
Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar
Matroid-Based TSP Rounding for Half-Integral Solutions. CoRR (2021)
Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. IPEC (2020)
Marcin Mucha, Marcin Smulewicz
Improved approximation for Fractionally Subadditive Network Design. Inf. Process. Lett. 154 (2020)
Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. CoRR (2019)
Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
On Problems Equivalent to (min, +)-Convolution. ACM Trans. Algorithms 15 (1) (2019)
Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
A Subquadratic Approximation Scheme for Partition. SODA (2019)
Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha
Dynamic Beats Fixed: On Phase-based Algorithms for File Migration. ACM Trans. Algorithms 15 (4) (2019)
Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. ESA (2019)
Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski
Online Facility Location with Deletions. ESA (2018)
Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
Subquadratic Approximation Scheme for Partition. CoRR (2018)
Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski
Online Facility Location with Deletions. CoRR (2018)
Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
On problems equivalent to (min, +)-convolution. CoRR (2017)
Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
On Problems Equivalent to (min, +)-Convolution. ICALP (2017)
Marcin Mucha
Shortest Superstring. CPM (2017)
Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha
Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration. ICALP (2017)
Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha
Dynamic beats fixed: on phase-based algorithms for file migration. CoRR (2016)
Marek Cygan, Marcin Mucha, Piotr Sankowski, Qiang Zhang
Online Pricing with Impatient Bidders. SODA (2016)
Marcin Mucha, Maxim Sviridenko
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem. Math. Oper. Res. 41 (1) (2016)
Lukasz Kowalik, Marcin Mucha
A 9k kernel for nonseparating independent set in planar graphs. Theor. Comput. Sci. 516 (2014)
Marcin Mucha
13/9 -Approximation for Graphic TSP. Theory Comput. Syst. 55 (4) (2014)
Matthias Englert, Nicolaos Matsakis, Marcin Mucha
New Bounds for Online Packing LPs. LATIN (2014)
Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski
Catch them if you can: how to serve impatient users. ITCS (2013)
Marcin Mucha
Lyndon Words and Short Superstrings. SODA (2013)
Marcin Mucha, Maxim Sviridenko
No-Wait Flowshop Scheduling is as Hard as Asymmetric Traveling Salesman Problem CoRR (2013)
Marcin Mucha, Maxim Sviridenko
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem. ICALP (1) (2013)
Lukasz Kowalik, Marcin Mucha
A 9k kernel for nonseparating independent set in planar graphs CoRR (2012)
Marcin Mucha
13/9-approximation for Graphic TSP. STACS (2012)
Marcin Mucha
Lyndon Words and Short Superstrings CoRR (2012)
Lukasz Kowalik, Marcin Mucha
A 9k Kernel for Nonseparating Independent Set in Planar Graphs. WG (2012)
Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
Approximation Algorithms for Union and Intersection Covering Problems. FSTTCS (2011)
Lukasz Kowalik, Marcin Mucha
35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality. Algorithmica 59 (2) (2011)
Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
Approximation Algorithms for Union and Intersection Covering Problems CoRR (2011)
Marcin Mucha
Improved Analysis for Graphic TSP Approximation via Matchings CoRR (2011)
Piotr Sankowski, Marcin Mucha
Fast Dynamic Transitive Closure with Lookahead. Algorithmica 56 (2) (2010)
Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
Fast Approximation in Subspaces by Doubling Metric Decomposition. ESA (1) (2010)
Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski
Fast Approximation in Subspaces by Doubling Metric Decomposition CoRR (2009)
Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. APPROX-RANDOM (2009)
Lukasz Kowalik, Marcin Mucha
Deterministic 7/8-approximation for the metric maximum TSP. Theor. Comput. Sci. 410 (47-49) (2009)
Lukasz Kowalik, Marcin Mucha
Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality. WADS (2009)
Lukasz Kowalik, Marcin Mucha
Deterministic 7/8-Approximation for the Metric Maximum TSP. APPROX-RANDOM (2008)
Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem CoRR (2008)
Lukasz Kowalik, Marcin Mucha
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality. WADS (2007)
Marcin Mucha, Piotr Sankowski
Maximum Matchings in Planar Graphs via Gaussian Elimination. Algorithmica 45 (1) (2006)
Marcin Mucha, Piotr Sankowski
Maximum Matchings via Gaussian Elimination. FOCS (2004)
Marcin Mucha, Piotr Sankowski
Maximum Matchings in Planar Graphs via Gaussian Elimination. ESA (2004)