- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| 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 | | |
| i7 | | Marcin Mucha, Maxim Sviridenko: No-Wait Flowshop Scheduling is as Hard as Asymmetric Traveling Salesman Problem. CoRR abs/1302.2551 (2013) |
| 2012 | ||
| c10 | | |
| c9 | | Lukasz Kowalik, Marcin Mucha: A 9k Kernel for Nonseparating Independent Set in Planar Graphs. WG 2012: 160-171 |
| i6 | | |
| 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 |
| 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 | | |
| 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 | | |
| 1 | Marek Cygan | |
| 2 | Matthias Englert | |
| 3 | Fabrizio Grandoni | |
| 4 | Anupam Gupta | |
| 5 | Lukasz Kowalik | |
| 6 | Stefano Leonardi | |
| 7 | Aleksander Madry | |
| 8 | Katarzyna E. Paluch | |
| 9 | Marcin Pilipczuk | |
| 10 | Piotr Sankowski | |
| 11 | Maxim Sviridenko |
Colors in the list of coauthors
Last update Wed May 22 06:15:06 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page