default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcin Mucha
Person information
- affiliation: University of Warsaw
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Anupam Gupta, Euiwoong Lee
, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar:
Matroid-based TSP rounding for half-integral solutions. Math. Program. 206(1): 541-576 (2024)- 2023
- [c25]Marcin Bienkowski, Marcin Mucha:
An Improved Algorithm for Online Min-Sum Set Cover. AAAI 2023: 6815-6822 - 2022
- [c24]Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski, Marcin Mucha, Pawel Brach:
Improving Ads-Profitability Using Traffic-Fingerprints. AusDM 2022: 205-216 - [c23]Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar:
Matroid-Based TSP Rounding for Half-Integral Solutions. IPCO 2022: 305-318 - [i15]Adam Gabriel Dobrakowski, Andrzej Pacuk, Piotr Sankowski, Marcin Mucha, Pawel Brach:
Improving Ads-Profitability Using Traffic-Fingerprints. CoRR abs/2206.02630 (2022) - [i14]Marcin Bienkowski, Marcin Mucha:
An Improved Algorithm For Online Reranking. CoRR abs/2209.04870 (2022) - 2021
- [i13]Anupam Gupta, Euiwoong Lee, Jason Li, Marcin Mucha, Heather Newman, Sherry Sarkar:
Matroid-Based TSP Rounding for Half-Integral Solutions. CoRR abs/2111.09290 (2021) - 2020
- [j10]Marcin Mucha, Marcin Smulewicz:
Improved approximation for Fractionally Subadditive Network Design. Inf. Process. Lett. 154 (2020) - [c22]Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki:
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. IPEC 2020: 37:1-37:18
2010 – 2019
- 2019
- [j9]Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
On Problems Equivalent to (min, +)-Convolution. ACM Trans. Algorithms 15(1): 14:1-14:25 (2019) - [j8]Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha:
Dynamic Beats Fixed: On Phase-based Algorithms for File Migration. ACM Trans. Algorithms 15(4): 46:1-46:21 (2019) - [c21]Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki:
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. ESA 2019: 73:1-73:16 - [c20]Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
A Subquadratic Approximation Scheme for Partition. SODA 2019: 70-88 - [i12]Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki:
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. CoRR abs/1905.02424 (2019) - 2018
- [c19]Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski:
Online Facility Location with Deletions. ESA 2018: 21:1-21:15 - [i11]Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
Subquadratic Approximation Scheme for Partition. CoRR abs/1804.02269 (2018) - [i10]Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski:
Online Facility Location with Deletions. CoRR abs/1807.03839 (2018) - 2017
- [c18]Marcin Mucha:
Shortest Superstring. CPM 2017: 3:1-3:1 - [c17]Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha:
Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration. ICALP 2017: 13:1-13:14 - [c16]Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
On Problems Equivalent to (min, +)-Convolution. ICALP 2017: 22:1-22:15 - [i9]Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
On problems equivalent to (min, +)-convolution. CoRR abs/1702.07669 (2017) - 2016
- [j7]Marcin Mucha, Maxim Sviridenko:
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem. Math. Oper. Res. 41(1): 247-254 (2016) - [c15]Marek Cygan, Marcin Mucha, Piotr Sankowski, Qiang Zhang:
Online Pricing with Impatient Bidders. SODA 2016: 190-201 - [r2]Marcin Mucha:
Maximum Matching. Encyclopedia of Algorithms 2016: 1238-1240 - [i8]Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha:
Dynamic beats fixed: on phase-based algorithms for file migration. CoRR abs/1609.00831 (2016) - 2014
- [j6]Marcin Mucha:
13/9 -Approximation for Graphic TSP. Theory Comput. Syst. 55(4): 640-657 (2014) - [j5]Lukasz Kowalik, Marcin Mucha:
A 9k kernel for nonseparating independent set in planar graphs. Theor. Comput. Sci. 516: 86-95 (2014) - [c14]Matthias Englert, Nicolaos Matsakis, Marcin Mucha:
New Bounds for Online Packing LPs. LATIN 2014: 318-329 - 2013
- [c13]Marcin Mucha, Maxim Sviridenko:
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem. ICALP (1) 2013: 769-779 - [c12]Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski:
Catch them if you can: how to serve impatient users. ITCS 2013: 485-494 - [c11]Marcin Mucha:
Lyndon Words and Short Superstrings. SODA 2013: 958-972 - [i7]Marcin Mucha, Maxim Sviridenko:
No-Wait Flowshop Scheduling is as Hard as Asymmetric Traveling Salesman Problem. CoRR abs/1302.2551 (2013) - 2012
- [c10]Marcin Mucha:
13/9-approximation for Graphic TSP. STACS 2012: 30-41 - [c9]Lukasz Kowalik, Marcin Mucha:
A 9k Kernel for Nonseparating Independent Set in Planar Graphs. WG 2012: 160-171 - [i6]Marcin Mucha:
Lyndon Words and Short Superstrings. CoRR abs/1205.6787 (2012) - [i5]Lukasz Kowalik, Marcin Mucha:
A 9k kernel for nonseparating independent set in planar graphs. CoRR abs/1207.4666 (2012) - 2011
- [j4]Lukasz Kowalik, Marcin Mucha:
35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality. Algorithmica 59(2): 240-255 (2011) - [c8]Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski:
Approximation Algorithms for Union and Intersection Covering Problems. FSTTCS 2011: 28-40 - [i4]Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski:
Approximation Algorithms for Union and Intersection Covering Problems. CoRR abs/1102.5105 (2011) - [i3]Marcin Mucha:
Improved Analysis for Graphic TSP Approximation via Matchings. CoRR abs/1108.1130 (2011) - 2010
- [j3]Piotr Sankowski, Marcin Mucha:
Fast Dynamic Transitive Closure with Lookahead. Algorithmica 56(2): 180-197 (2010) - [c7]Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski:
Fast Approximation in Subspaces by Doubling Metric Decomposition. ESA (1) 2010: 72-83
2000 – 2009
- 2009
- [j2]Lukasz Kowalik, Marcin Mucha:
Deterministic 7/8-approximation for the metric maximum TSP. Theor. Comput. Sci. 410(47-49): 5000-5009 (2009) - [c6]Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry:
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. APPROX-RANDOM 2009: 298-311 - [c5]Lukasz Kowalik, Marcin Mucha:
Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality. WADS 2009: 471-482 - [i2]Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski:
Fast Approximation in Subspaces by Doubling Metric Decomposition. CoRR abs/0911.1626 (2009) - 2008
- [c4]Lukasz Kowalik, Marcin Mucha:
Deterministic 7/8-Approximation for the Metric Maximum TSP. APPROX-RANDOM 2008: 132-145 - [r1]Marcin Mucha:
Maximum Matching. Encyclopedia of Algorithms 2008 - [i1]Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry:
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. CoRR abs/0812.5101 (2008) - 2007
- [c3]Lukasz Kowalik, Marcin Mucha:
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality. WADS 2007: 589-600 - 2006
- [j1]Marcin Mucha, Piotr Sankowski:
Maximum Matchings in Planar Graphs via Gaussian Elimination. Algorithmica 45(1): 3-20 (2006) - 2004
- [c2]Marcin Mucha, Piotr Sankowski:
Maximum Matchings in Planar Graphs via Gaussian Elimination. ESA 2004: 532-543 - [c1]Marcin Mucha, Piotr Sankowski:
Maximum Matchings via Gaussian Elimination. FOCS 2004: 248-255
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
