Marcin Mucha

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