The following pages link to Matthias Mnich (Q295635):
Displaying 22 items.
- New Approximation Algorithms for (1,2)-TSP (Q5002675) (← links)
- Reachability Switching Games (Q5002810) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- (Q5089171) (← links)
- Dynamic Parameterized Problems and Algorithms (Q5111372) (← links)
- (Q5111743) (← links)
- Engineering Kernelization for Maximum Cut (Q5147491) (← links)
- Bisections above Tight Lower Bounds (Q5200505) (← links)
- A time- and space-optimal algorithm for the many-visits TSP (Q5236290) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- Linear-Time Recognition of Map Graphs with Outerplanar Witness (Q5369507) (← links)
- On Routing Disjoint Paths in Bounded Treewidth Graphs (Q5369517) (← links)
- Scheduling and Fixed-Parameter Tractability (Q5419011) (← links)
- (Q5875550) (← links)
- Dynamic Parameterized Problems and Algorithms (Q5888936) (← links)
- Parameterized algorithms for generalizations of directed feedback vertex set (Q5919403) (← links)
- Parameterized algorithms for generalizations of directed feedback vertex set (Q5925617) (← links)
- High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
- Hitting Weighted Even Cycles in Planar Graphs (Q6090900) (← links)
- Space-efficient parameterized algorithms on graphs of low shrubdepth (Q6656958) (← links)
- A \((3/2+\varepsilon)\)-approximation for multiple TSP with a variable number of depots (Q6656986) (← links)
- Serial batching to minimize the weighted number of tardy jobs (Q6657883) (← links)
