Jannik Matuschke

81 papers A* 5A 3B 11C 4Journal 56Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	B	`ed.`	Approximation and Online Algorithms - 23rd International Workshop, WAOA 2025, Warsaw, Poland, September 18-19, 2025, Proceedings WAOA Jannik Matuschke, José Verschae
2026	J	`jnl`	Condorcet Dimension and Pareto Optimality for Matchings and Beyond. CoRR Telikepalli Kavitha, Jannik Matuschke, Ulrike Schmidt-Kraepelin
2026	J	`jnl`	When to Identify Is to Control: On the Controllability of Combinatorial Optimization Problems. CoRR Max Klimm, Jannik Matuschke
2025	J	`jnl`	Assigning and Scheduling Generalized Malleable Jobs Under Subadditive or Submodular Processing Speeds. Oper. Res. Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
2025	J	`jnl`	Decomposition of probability marginals for security games in max-flow/min-cut systems. Math. Program. Jannik Matuschke
2025	J	`jnl`	Multi-Leader Congestion Games with an Adversary. J. Artif. Intell. Res. Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
2025	A	`conf`	On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem. ESA Umang Bhaskar, Katharina Eickhoff, Lennart Kauther, Jannik Matuschke, Britta Peis, Laura Vargas Koch
2025	J	`jnl`	On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem. CoRR Umang Bhaskar, Katharina Eickhoff, Lennart Kauther, Jannik Matuschke, Britta Peis, Laura Vargas Koch
2025	J	`jnl`	Simultaneous Network Design with Restricted Link Usage. CoRR Naonori Kakimura, Péter Madarasi, Jannik Matuschke, Kitti Varga
2025	J	`jnl`	Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction. CoRR Jannik Matuschke
2024	J	`jnl`	A constant-factor approximation for generalized malleable scheduling under $M ^{\natural }$-concave processing speeds. Math. Program. Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
2024	B	`conf`	Decomposing Probability Marginals Beyond Affine Requirements. IPCO Jannik Matuschke
2024	J	`jnl`	Robust Deterministic Policies for Markov Decision Processes under Budgeted Uncertainty. CoRR Fei Wu, Erik Demeulemeester, Jannik Matuschke
2023	J	`jnl`	Bifactor approximation for location routing with vehicle and facility capacities. Eur. J. Oper. Res. Felipe Carrasco Heine, Antonia Demleitner, Jannik Matuschke
2023	J	`jnl`	Decomposing Probability Marginals Beyond Affine Requirements. CoRR Jannik Matuschke
2023	B	`conf`	Decomposition of Probability Marginals for Security Games in Abstract Networks. IPCO Jannik Matuschke
2023	J	`jnl`	Malleable scheduling beyond identical machines. J. Sched. Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
2023	J	`jnl`	The Traveling Salesman Problem with Drones: The Benefits of Retraversing the Arcs. Transp. Sci. Nicola Morandi, Roel Leus, Jannik Matuschke, Hande Yaman
2022	B	`conf`	A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds. IPCO Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
2022	J	`jnl`	Decomposition of Probability Marginals for Security Games in Abstract Networks. CoRR Jannik Matuschke
2022	J	`jnl`	Exact and Approximation Algorithms for the Expanding Search Problem. INFORMS J. Comput. Ben Hermans, Roel Leus, Jannik Matuschke
2022	A*	`conf`	Multi-Leader Congestion Games with an Adversary. AAAI Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
2022	J	`jnl`	Popular branchings and their dual certificates. Math. Program. Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2022	A*	`conf`	The popular assignment problem: when cardinality is more important than popularity. SODA Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2021	J	`jnl`	A Constant-Factor Approximation for Generalized Malleable Scheduling under M CoRR Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
2021	J	`jnl`	Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds. CoRR Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
2021	J	`jnl`	Bifactor Approximation for Location Routing with Vehicle and Facility Capacities. CoRR Felipe Carrasco Heine, Antonia Demleitner, Jannik Matuschke
2021	J	`jnl`	Multi-Leader Congestion Games with an Adversary. CoRR Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
2021	J	`jnl`	Pure Nash Equilibria in Resource Graph Games. J. Artif. Intell. Res. Tobias Harks, Max Klimm, Jannik Matuschke
2021	J	`jnl`	Single-machine scheduling with an external resource. Eur. J. Oper. Res. Dirk Briskorn, Morteza Davari, Jannik Matuschke
2021	J	`jnl`	The popular assignment problem: when cardinality is more important than popularity. CoRR Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2020	B	`conf`	Popular Branchings and Their Dual Certificates. IPCO Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2020	J	`jnl`	Pure Nash Equilibria in Resource Graph Games. CoRR Tobias Harks, Max Klimm, Jannik Matuschke
2020	J	`jnl`	Rerouting Flows when Links Fail. SIAM J. Discret. Math. Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
2020	J	`jnl`	Single-machine scheduling with an external resource. CoRR Dirk Briskorn, Morteza Davari, Jannik Matuschke
2020	J	`jnl`	The complexity of computing a robust flow. Oper. Res. Lett. Yann Disser, Jannik Matuschke
2019	J	`jnl`	Exact and approximation algorithms for the expanding search problem. CoRR Ben Hermans, Roel Leus, Jannik Matuschke
2019	A*	`conf`	Maintaining Perfect Matchings at Low Cost. ICALP Jannik Matuschke, Ulrike Schmidt-Kraepelin, José Verschae
2019	—	`conf`	Malleable Scheduling Beyond Identical Machines. APPROX-RANDOM Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
2019	J	`jnl`	Malleable scheduling beyond identical machines. CoRR Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
2019	J	`jnl`	New and Simple Algorithms for Stable Flow Problems. Algorithmica Ágnes Cseh, Jannik Matuschke
2019	J	`jnl`	On index policies for stochastic minsum scheduling. Oper. Res. Lett. Franziska Eberle, Felix A. Fischer, Jannik Matuschke, Nicole Megow
2019	J	`jnl`	Popular Branchings and Their Dual Certificates. CoRR Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
2018	A	`conf`	A Local-Search Algorithm for Steiner Forest. ITCS Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
2018	J	`jnl`	Electric Vehicle Valet. CoRR Ali Khodabakhsh, Orestis Papadigenopoulos, Jannik Matuschke, Jimmy Horn, Evdokia Nikolova, Emmanouil Pountourakis
2018	J	`jnl`	Maintaining Perfect Matchings at Low Cost. CoRR Jannik Matuschke, Ulrike Schmidt-Kraepelin, José Verschae
2018	J	`jnl`	Matchings with Lower Quotas: Algorithms and Complexity. Algorithmica Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke
2018	J	`jnl`	Robust Randomized Matchings. Math. Oper. Res. Jannik Matuschke, Martin Skutella, José A. Soto
2017	J	`jnl`	A Local-Search Algorithm for Steiner Forest. CoRR Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
2017	—	`conf`	Adaptivity in Network Interdiction. GameSec Bastián Bahamondes, José Correa, Jannik Matuschke, Gianpaolo Oriolo
2017	J	`jnl`	Fare Evasion in Transit Networks. Oper. Res. José Correa, Tobias Harks, Vincent J. C. Kreuzen, Jannik Matuschke
2017	B	`conf`	New and Simple Algorithms for Stable Flow Problems. WG Ágnes Cseh, Jannik Matuschke
2017	J	`jnl`	Protection of flows under targeted attacks. Oper. Res. Lett. Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella
2017	J	`jnl`	Reference points and approximation algorithms in multicriteria discrete optimization. Eur. J. Oper. Res. Christina Büsing, Kai-Simon Goetzmann, Jannik Matuschke, Sebastian Stiller
2017	A*	`conf`	Rerouting Flows When Links Fail. ICALP Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
2017	J	`jnl`	Rerouting flows when links fail. CoRR Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo
2017	J	`jnl`	Robust randomized matchings. CoRR Jannik Matuschke, Martin Skutella, José A. Soto
2017	J	`jnl`	The Complexity of Computing a Robust Flow. CoRR Yann Disser, Jannik Matuschke
2016	J	`jnl`	An Integrated Approach to Tactical Transportation Planning in Logistics Networks. Transp. Sci. Tobias Harks, Felix G. König, Jannik Matuschke, Alexander T. Richter, Jens Schulz
2016	J	`jnl`	Degree-constrained orientations of embedded graphs. J. Comb. Optim. Yann Disser, Jannik Matuschke
2016	J	`jnl`	Protection of flows under targeted attacks. CoRR Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella
2015	B	`conf`	Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. ISAAC Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke
2015	A*	`conf`	Robust randomized matchings. SODA Jannik Matuschke, Martin Skutella, José A. Soto
2015	J	`jnl`	Strong LP formulations for scheduling splittable jobs on unrelated machines. Math. Program. José Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Víctor Verdugo, José Verschae
2014	J	`jnl`	Abstract flows over time: A first step towards solving dynamic packing problems. Theor. Comput. Sci. Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis
2014	J	`jnl`	Fare Evasion in Transit Networks. CoRR José R. Correa, Tobias Harks, Vincent J. C. Kreuzen, Jannik Matuschke
2014	B	`conf`	Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines. IPCO José R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Victor Verdugo, José Verschae
2014	J	`jnl`	The Student/Project Allocation problem with group projects. CoRR Ashwin Arulselvan, Ágnes Cseh, Jannik Matuschke
2013	J	`jnl`	Approximation Algorithms for Capacitated Location Routing. Transp. Sci. Tobias Harks, Felix G. König, Jannik Matuschke
2013	A	`conf`	Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections. ESA Jannik Matuschke, Andreas Bley, Benjamin Müller
2013	J	`jnl`	Stable Flows over Time. Algorithms Ágnes Cseh, Jannik Matuschke, Martin Skutella
2012	C	`conf`	Abstract Flows over Time. CTW Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis
2012	B	`conf`	Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems. ISAAC Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis
2012	J	`jnl`	Abstract flows over time: A first step towards solving dynamic packing problems CoRR Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis
2012	B	`conf`	Degree-Constrained Orientations of Embedded Graphs. ISAAC Yann Disser, Jannik Matuschke
2012	C	`conf`	Flows over Time with Negative Transit Times and Arc Release Dates. CTW Sandro Bosio, Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis, Martin Skutella
2012	J	`jnl`	Lattices and maximum flow algorithms in planar graphs CoRR Jannik Matuschke, Britta Peis
2012	C	`conf`	Multi-Dimensional Commodity Covering for Tariff Selection in Transportation. ATMOS Felix G. König, Jannik Matuschke, Alexander T. Richter
2012	J	`jnl`	The Power of Compromise CoRR Christina Büsing, Kai-Simon Goetzmann, Jannik Matuschke, Sebastian Stiller
2010	C	`conf`	Lattices and Maximum Flow Algorithms in Planar Graphs. CTW Jannik Matuschke
2010	B	`conf`	Lattices and Maximum Flow Algorithms in Planar Graphs. WG Jannik Matuschke, Britta Peis