The following pages link to Martin Groß (Q1628595):
Displayed 18 items.
- Scheduling maintenance jobs in networks (Q1628599) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- A tight bound on the speed-up through storage for quickest multi-commodity flows (Q1785329) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Maximizing the storage capacity of gas networks: a global MINLP approach (Q2331362) (← links)
- On the complexity of instationary gas flows (Q2417151) (← links)
- Generalized Maximum Flows over Time (Q2896394) (← links)
- Maximum Multicommodity Flows over Time without Intermediate Storage (Q2912872) (← links)
- Approximating Earliest Arrival Flows in Arbitrary Networks (Q2912873) (← links)
- Graph Orientation and Flows over Time (Q2942675) (← links)
- Many-to-one Matchings with Lower Quotas: Algorithms and Complexity (Q3459860) (← links)
- (Q4607935) (← links)
- Graph orientation and flows over time (Q4642437) (← links)
- (Q4993295) (← links)
- General Bounds for Incremental Maximization (Q5111374) (← links)
- Algorithmic results for potential‐based flows: Easy and hard cases (Q5226171) (← links)
- (Q5875470) (← links)
- On the Complexity of Instationary Gas Flows (Q6290629) (← links)