The following pages link to Marcin Mucha (Q385963):
Displaying 19 items.
- A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
- 35/44-approximation for asymmetric maximum TSP with triangle inequality (Q627544) (← links)
- Fast dynamic transitive closure with lookahead (Q848959) (← links)
- Deterministic 7/8-approximation for the metric maximum TSP (Q1034619) (← links)
- Improved approximation for fractionally subadditive network design (Q2011025) (← links)
- Matroid-based TSP rounding for half-integral solutions (Q2164710) (← links)
- \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507) (← links)
- Maximum matchings in planar graphs via Gaussian elimination (Q2369872) (← links)
- No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (Q2800373) (← links)
- (Q2904746) (← links)
- Approximation Algorithms for Union and Intersection Covering Problems (Q2911608) (← links)
- Catch them if you can (Q2986895) (← links)
- Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality (Q3183477) (← links)
- Online Pricing with Impatient Bidders (Q4575591) (← links)
- (Q5009578) (← links)
- (Q5075820) (← links)
- Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration (Q5111342) (← links)
- On Problems Equivalent to (min,+)-Convolution (Q5111352) (← links)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (Q6089686) (← links)
