Marcin Mucha
According to our database^{1},
Marcin Mucha
authored at least 26 papers
between 2004 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2020
Improved approximation for Fractionally Subadditive Network Design.
Inf. Process. Lett., 2020
2019
On Problems Equivalent to (min, +)Convolution.
ACM Trans. Algorithms, 2019
Dynamic Beats Fixed: On Phasebased Algorithms for File Migration.
ACM Trans. Algorithms, 2019
A Subquadratic Approximation Scheme for Partition.
Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, 2019
EqualSubsetSum Faster Than the MeetintheMiddle.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
2018
Online Facility Location with Deletions.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
Shortest Superstring.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017
2016
Maximum Matching.
Encyclopedia of Algorithms, 2016
NoWait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem.
Math. Oper. Res., 2016
Online Pricing with Impatient Bidders.
Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, 2016
2014
A 9k kernel for nonseparating independent set in planar graphs.
Theor. Comput. Sci., 2014
13/9 Approximation for Graphic TSP.
Theory Comput. Syst., 2014
New Bounds for Online Packing LPs.
Proceedings of the LATIN 2014: Theoretical Informatics  11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
2013
Lyndon Words and Short Superstrings.
Proceedings of the TwentyFourth Annual ACMSIAM Symposium on Discrete Algorithms, 2013
Catch them if you can: how to serve impatient users.
Proceedings of the Innovations in Theoretical Computer Science, 2013
2011
Improved Analysis for Graphic TSP Approximation via Matchings
CoRR, 2011
35/44approximation for Asymmetric Maximum TSP with Triangle Inequality.
Algorithmica, 2011
Approximation Algorithms for Union and Intersection Covering Problems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011
2010
Fast Dynamic Transitive Closure with Lookahead.
Algorithmica, 2010
Fast Approximation in Subspaces by Doubling Metric Decomposition.
Proceedings of the Algorithms, 2010
2009
Deterministic 7/8approximation for the metric maximum TSP.
Theor. Comput. Sci., 2009
Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
A 7/9  Approximation Algorithm for the Maximum Traveling Salesman Problem.
Proceedings of the Approximation, 2009
2008
Maximum Matching.
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
2006
Maximum Matchings in Planar Graphs via Gaussian Elimination.
Algorithmica, 2006
2004
Maximum Matchings via Gaussian Elimination.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004