Jannik Matuschke

According to our database, Jannik Matuschke authored at least 42 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Malleable scheduling beyond identical machines.

Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos

J. Sched., October, 2023

The Traveling Salesman Problem with Drones: The Benefits of Retraversing the Arcs.

Nicola Morandi, Roel Leus, Jannik Matuschke, Hande Yaman

Transp. Sci., September, 2023

Bifactor approximation for location routing with vehicle and facility capacities.

Felipe Carrasco Heine, Antonia Demleitner, Jannik Matuschke

Eur. J. Oper. Res., 2023

Decomposing Probability Marginals Beyond Affine Requirements.

Jannik Matuschke

CoRR, 2023

Decomposition of Probability Marginals for Security Games in Abstract Networks.

Jannik Matuschke

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

Popular branchings and their dual certificates.

Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin

Math. Program., 2022

Exact and Approximation Algorithms for the Expanding Search Problem.

Ben Hermans, Roel Leus, Jannik Matuschke

INFORMS J. Comput., 2022

The popular assignment problem: when cardinality is more important than popularity.

Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds.

Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Multi-Leader Congestion Games with an Adversary.

Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Pure Nash Equilibria in Resource Graph Games.

Tobias Harks, Max Klimm, Jannik Matuschke

J. Artif. Intell. Res., 2021

Single-machine scheduling with an external resource.

Dirk Briskorn, Morteza Davari, Jannik Matuschke

Eur. J. Oper. Res., 2021

A Constant-Factor Approximation for Generalized Malleable Scheduling under M^♮-Concave Processing Speeds.

Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos

CoRR, 2021

Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds.

Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos

CoRR, 2021

2020

Rerouting Flows when Links Fail.

Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo

SIAM J. Discret. Math., 2020

The complexity of computing a robust flow.

Yann Disser, Jannik Matuschke

Oper. Res. Lett., 2020

2019

On index policies for stochastic minsum scheduling.

Franziska Eberle, Felix A. Fischer, Jannik Matuschke, Nicole Megow

Oper. Res. Lett., 2019

New and Simple Algorithms for Stable Flow Problems.

Ágnes Cseh, Jannik Matuschke

Algorithmica, 2019

Maintaining Perfect Matchings at Low Cost.

Jannik Matuschke, Ulrike Schmidt-Kraepelin, José Verschae

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Robust Randomized Matchings.

Jannik Matuschke, Martin Skutella, José A. Soto

Math. Oper. Res., 2018

Electric Vehicle Valet.

Ali Khodabakhsh, Orestis Papadigenopoulos, Jannik Matuschke, Jimmy Horn, Evdokia Nikolova, Emmanouil Pountourakis

CoRR, 2018

Matchings with Lower Quotas: Algorithms and Complexity.

Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke

Algorithmica, 2018

A Local-Search Algorithm for Steiner Forest.

Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017

Protection of flows under targeted attacks.

Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella

Oper. Res. Lett., 2017

Fare Evasion in Transit Networks.

José Correa, Tobias Harks, Vincent J. C. Kreuzen, Jannik Matuschke

Oper. Res., 2017

Reference points and approximation algorithms in multicriteria discrete optimization.

Christina Büsing, Kai-Simon Goetzmann, Jannik Matuschke, Sebastian Stiller

Eur. J. Oper. Res., 2017

Adaptivity in Network Interdiction.

Bastián Bahamondes, José Correa, Jannik Matuschke, Gianpaolo Oriolo

Proceedings of the Decision and Game Theory for Security - 8th International Conference, 2017

2016

An Integrated Approach to Tactical Transportation Planning in Logistics Networks.

Tobias Harks, Felix G. König, Jannik Matuschke, Alexander T. Richter, Jens Schulz

Transp. Sci., 2016

Degree-constrained orientations of embedded graphs.

Yann Disser, Jannik Matuschke

J. Comb. Optim., 2016

2015

Strong LP formulations for scheduling splittable jobs on unrelated machines.

José Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Víctor Verdugo, José Verschae

Math. Program., 2015

Many-to-one Matchings with Lower Quotas: Algorithms and Complexity.

Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Abstract flows over time: A first step towards solving dynamic packing problems.

Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis

Theor. Comput. Sci., 2014

The Student/Project Allocation problem with group projects.

Ashwin Arulselvan, Ágnes Cseh, Jannik Matuschke

CoRR, 2014

2013

Approximation Algorithms for Capacitated Location Routing.

Tobias Harks, Felix G. König, Jannik Matuschke

Transp. Sci., 2013

Stable Flows over Time.

Ágnes Cseh, Jannik Matuschke, Martin Skutella

Algorithms, 2013

Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections.

Jannik Matuschke, Andreas Bley, Benjamin Müller

Proceedings of the Algorithms - ESA 2013, 2013

2012

The Power of Compromise

Christina Büsing, Kai-Simon Goetzmann, Jannik Matuschke, Sebastian Stiller

CoRR, 2012

Abstract Flows over Time.

Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Flows over Time with Negative Transit Times and Arc Release Dates.

Sandro Bosio, Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis, Martin Skutella

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

Multi-Dimensional Commodity Covering for Tariff Selection in Transportation.

Felix G. König, Jannik Matuschke, Alexander T. Richter

Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, 2012

2010

Lattices and Maximum Flow Algorithms in Planar Graphs.

Jannik Matuschke, Britta Peis

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Lattices and Maximum Flow Algorithms in Planar Graphs.

Jannik Matuschke

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010