The following pages link to Jannik Matuschke (Q247926):
Displaying 37 items.
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- Adaptivity in network interdiction (Q1675445) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- Protection of flows under targeted attacks (Q1727948) (← links)
- Stable flows over time (Q1736580) (← links)
- Reference points and approximation algorithms in multicriteria discrete optimization (Q1753504) (← links)
- Single-machine scheduling with an external resource (Q2030286) (← links)
- Popular branchings and their dual certificates (Q2118146) (← links)
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds (Q2164700) (← links)
- Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
- Abstract flows over time: a first step towards solving dynamic packing problems (Q2250460) (← links)
- On index policies for stochastic minsum scheduling (Q2294301) (← links)
- The complexity of computing a robust flow (Q2294522) (← links)
- Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections (Q2849359) (← links)
- Lattices and Maximum Flow Algorithms in Planar Graphs (Q3057636) (← links)
- Many-to-one Matchings with Lower Quotas: Algorithms and Complexity (Q3459860) (← links)
- Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems (Q4909560) (← links)
- Degree-Constrained Orientations of Embedded Graphs (Q4909567) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- Pure Nash Equilibria in Resource Graph Games (Q5026179) (← links)
- Popular Branchings and Their Dual Certificates (Q5041748) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- (Q5091241) (← links)
- (Q5111420) (← links)
- Rerouting Flows when Links Fail (Q5128505) (← links)
- Robust Randomized Matchings (Q5219560) (← links)
- Robust randomized matchings (Q5363071) (← links)
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines (Q5419000) (← links)
- Fare Evasion in Transit Networks (Q5739119) (← links)
- (Q5875469) (← links)
- New and simple algorithms for stable flow problems (Q5915793) (← links)
- Degree-constrained orientations of embedded graphs (Q5963649) (← links)
- Malleable scheduling beyond identical machines (Q6090217) (← links)
- Malleable scheduling beyond identical machines (Q6316221) (← links)
- The TSP with drones: The benefits of retraversing the arcs (Q6404314) (← links)
- The popular assignment problem: when cardinality is more important than popularity (Q6575076) (← links)
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds (Q6589760) (← links)
