Jannik Matuschke

Orcid: 0000-0002-7463-3279

Affiliations:
  • KU Leuven, Belgium


According to our database1, Jannik Matuschke authored at least 42 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A constant-factor approximation for generalized malleable scheduling under $M ^{\natural }$-concave processing speeds.
Math. Program., July, 2024

Decomposing Probability Marginals Beyond Affine Requirements.
Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023
Malleable scheduling beyond identical machines.
J. Sched., October, 2023

The Traveling Salesman Problem with Drones: The Benefits of Retraversing the Arcs.
Transp. Sci., September, 2023

Bifactor approximation for location routing with vehicle and facility capacities.
Eur. J. Oper. Res., 2023

Decomposition of Probability Marginals for Security Games in Abstract Networks.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
Popular branchings and their dual certificates.
Math. Program., 2022

Exact and Approximation Algorithms for the Expanding Search Problem.
INFORMS J. Comput., 2022

The popular assignment problem: when cardinality is more important than popularity.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Multi-Leader Congestion Games with an Adversary.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Pure Nash Equilibria in Resource Graph Games.
J. Artif. Intell. Res., 2021

Single-machine scheduling with an external resource.
Eur. J. Oper. Res., 2021

A Constant-Factor Approximation for Generalized Malleable Scheduling under M<sup>♮</sup>-Concave Processing Speeds.
CoRR, 2021

Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds.
CoRR, 2021

2020
Rerouting Flows when Links Fail.
SIAM J. Discret. Math., 2020

The complexity of computing a robust flow.
Oper. Res. Lett., 2020

2019
On index policies for stochastic minsum scheduling.
Oper. Res. Lett., 2019

New and Simple Algorithms for Stable Flow Problems.
Algorithmica, 2019

Maintaining Perfect Matchings at Low Cost.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Robust Randomized Matchings.
Math. Oper. Res., 2018

Electric Vehicle Valet.
CoRR, 2018

Matchings with Lower Quotas: Algorithms and Complexity.
Algorithmica, 2018

A Local-Search Algorithm for Steiner Forest.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
Protection of flows under targeted attacks.
Oper. Res. Lett., 2017

Fare Evasion in Transit Networks.
Oper. Res., 2017

Reference points and approximation algorithms in multicriteria discrete optimization.
Eur. J. Oper. Res., 2017

Adaptivity in Network Interdiction.
Proceedings of the Decision and Game Theory for Security - 8th International Conference, 2017

2016
An Integrated Approach to Tactical Transportation Planning in Logistics Networks.
Transp. Sci., 2016

Degree-constrained orientations of embedded graphs.
J. Comb. Optim., 2016

2015
Strong LP formulations for scheduling splittable jobs on unrelated machines.
Math. Program., 2015

Many-to-one Matchings with Lower Quotas: Algorithms and Complexity.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
Abstract flows over time: A first step towards solving dynamic packing problems.
Theor. Comput. Sci., 2014

The Student/Project Allocation problem with group projects.
CoRR, 2014

2013
Approximation Algorithms for Capacitated Location Routing.
Transp. Sci., 2013

Stable Flows over Time.
Algorithms, 2013

Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections.
Proceedings of the Algorithms - ESA 2013, 2013

2012
The Power of Compromise
CoRR, 2012

Abstract Flows over Time.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Flows over Time with Negative Transit Times and Arc Release Dates.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Multi-Dimensional Commodity Covering for Tariff Selection in Transportation.
Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, 2012

2010
Lattices and Maximum Flow Algorithms in Planar Graphs.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Lattices and Maximum Flow Algorithms in Planar Graphs.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010


  Loading...