default search action
Jannik Matuschke
Person information
- affiliation: KU Leuven, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Dimitris Fotakis, Jannik Matuschke
, Orestis Papadigenopoulos:
A constant-factor approximation for generalized malleable scheduling under $M ^{\natural }$-concave processing speeds. Math. Program. 206(1): 515-539 (2024) - [c23]Jannik Matuschke:
Decomposing Probability Marginals Beyond Affine Requirements. IPCO 2024: 309-322 - 2023
- [j22]Felipe Carrasco Heine, Antonia Demleitner, Jannik Matuschke
Bifactor approximation for location routing with vehicle and facility capacities. Eur. J. Oper. Res. 304(2): 429-442 (2023) - [j21]Dimitris Fotakis
Malleable scheduling beyond identical machines. J. Sched. 26(5): 425-442 (2023) - [j20]Nicola Morandi
The Traveling Salesman Problem with Drones: The Benefits of Retraversing the Arcs. Transp. Sci. 57(5): 1340-1358 (2023) - [c22]Jannik Matuschke
Decomposition of Probability Marginals for Security Games in Abstract Networks. IPCO 2023: 306-318 - [i24]Jannik Matuschke:
Decomposing Probability Marginals Beyond Affine Requirements. CoRR abs/2311.03346 (2023) - 2022
- [j19]Ben Hermans
Exact and Approximation Algorithms for the Expanding Search Problem. INFORMS J. Comput. 34(1): 281-296 (2022) - [j18]Telikepalli Kavitha, Tamás Király, Jannik Matuschke
Popular branchings and their dual certificates. Math. Program. 192(1): 567-595 (2022) - [c21]Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke
Multi-Leader Congestion Games with an Adversary. AAAI 2022: 5068-5075 - [c20]Dimitris Fotakis
A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds. IPCO 2022: 237-250 - [c19]Telikepalli Kavitha, Tamás Király, Jannik Matuschke
The popular assignment problem: when cardinality is more important than popularity. SODA 2022: 103-123 - [i23]Jannik Matuschke:
Decomposition of Probability Marginals for Security Games in Abstract Networks. CoRR abs/2211.04922 (2022) - 2021
- [j17]Dirk Briskorn
Single-machine scheduling with an external resource. Eur. J. Oper. Res. 293(2): 457-468 (2021) - [j16]Tobias Harks, Max Klimm, Jannik Matuschke:
Pure Nash Equilibria in Resource Graph Games. J. Artif. Intell. Res. 72: 185-213 (2021) - [i22]Felipe Carrasco Heine, Antonia Demleitner, Jannik Matuschke:
Bifactor Approximation for Location Routing with Vehicle and Facility Capacities. CoRR abs/2108.02480 (2021) - [i21]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
The popular assignment problem: when cardinality is more important than popularity. CoRR abs/2110.10984 (2021) - [i20]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds. CoRR abs/2111.06225 (2021) - [i19]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
A Constant-Factor Approximation for Generalized Malleable Scheduling under M♮-Concave Processing Speeds. CoRR abs/2111.06733 (2021) - [i18]Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel:
Multi-Leader Congestion Games with an Adversary. CoRR abs/2112.07435 (2021) - 2020
- [j15]Yann Disser, Jannik Matuschke
The complexity of computing a robust flow. Oper. Res. Lett. 48(1): 18-23 (2020) - [j14]Jannik Matuschke
Rerouting Flows when Links Fail. SIAM J. Discret. Math. 34(4): 2082-2107 (2020) - [c18]Telikepalli Kavitha, Tamás Király, Jannik Matuschke
Popular Branchings and Their Dual Certificates. IPCO 2020: 223-237 - [i17]Dirk Briskorn, Morteza Davari, Jannik Matuschke:
Single-machine scheduling with an external resource. CoRR abs/2006.03399 (2020) - [i16]Tobias Harks, Max Klimm, Jannik Matuschke:
Pure Nash Equilibria in Resource Graph Games. CoRR abs/2007.09017 (2020)
2010 – 2019
- 2019
- [j13]Ágnes Cseh
New and Simple Algorithms for Stable Flow Problems. Algorithmica 81(6): 2557-2591 (2019) - [j12]Franziska Eberle, Felix A. Fischer, Jannik Matuschke
On index policies for stochastic minsum scheduling. Oper. Res. Lett. 47(3): 213-218 (2019) - [c17]Dimitris Fotakis
Malleable Scheduling Beyond Identical Machines. APPROX-RANDOM 2019: 17:1-17:14 - [c16]Jannik Matuschke, Ulrike Schmidt-Kraepelin, José Verschae:
Maintaining Perfect Matchings at Low Cost. ICALP 2019: 82:1-82:14 - [i15]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
Malleable scheduling beyond identical machines. CoRR abs/1903.11016 (2019) - [i14]Ben Hermans, Roel Leus, Jannik Matuschke:
Exact and approximation algorithms for the expanding search problem. CoRR abs/1911.08959 (2019) - [i13]Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
Popular Branchings and Their Dual Certificates. CoRR abs/1912.01854 (2019) - 2018
- [j11]Ashwin Arulselvan, Ágnes Cseh
Matchings with Lower Quotas: Algorithms and Complexity. Algorithmica 80(1): 185-208 (2018) - [j10]Jannik Matuschke
Robust Randomized Matchings. Math. Oper. Res. 43(2): 675-692 (2018) - [c15]Martin Groß, Anupam Gupta, Amit Kumar
A Local-Search Algorithm for Steiner Forest. ITCS 2018: 31:1-31:17 - [i12]Ali Khodabakhsh, Orestis Papadigenopoulos, Jannik Matuschke, Jimmy Horn, Evdokia Nikolova, Emmanouil Pountourakis:
Electric Vehicle Valet. CoRR abs/1811.06184 (2018) - [i11]Jannik Matuschke, Ulrike Schmidt-Kraepelin, José Verschae:
Maintaining Perfect Matchings at Low Cost. CoRR abs/1811.10580 (2018) - 2017
- [j9]Christina Büsing, Kai-Simon Goetzmann, Jannik Matuschke
Reference points and approximation algorithms in multicriteria discrete optimization. Eur. J. Oper. Res. 260(3): 829-840 (2017) - [j8]José Correa, Tobias Harks, Vincent J. C. Kreuzen, Jannik Matuschke
Fare Evasion in Transit Networks. Oper. Res. 65(1): 165-183 (2017) - [j7]Jannik Matuschke
Protection of flows under targeted attacks. Oper. Res. Lett. 45(1): 53-59 (2017) - [c14]Bastián Bahamondes, José Correa, Jannik Matuschke, Gianpaolo Oriolo:
Adaptivity in Network Interdiction. GameSec 2017: 40-52 - [c13]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo:
Rerouting Flows When Links Fail. ICALP 2017: 89:1-89:13 - [c12]Ágnes Cseh, Jannik Matuschke
New and Simple Algorithms for Stable Flow Problems. WG 2017: 206-219 - [i10]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo:
Rerouting flows when links fail. CoRR abs/1704.07067 (2017) - [i9]Yann Disser, Jannik Matuschke:
The Complexity of Computing a Robust Flow. CoRR abs/1704.08241 (2017) - [i8]Jannik Matuschke, Martin Skutella, José A. Soto:
Robust randomized matchings. CoRR abs/1705.06631 (2017) - [i7]Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae:
A Local-Search Algorithm for Steiner Forest. CoRR abs/1707.02753 (2017) - 2016
- [j6]Yann Disser, Jannik Matuschke
Degree-constrained orientations of embedded graphs. J. Comb. Optim. 31(2): 758-773 (2016) - [j5]Tobias Harks, Felix G. König, Jannik Matuschke
An Integrated Approach to Tactical Transportation Planning in Logistics Networks. Transp. Sci. 50(2): 439-460 (2016) - [i6]Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo, Britta Peis, Martin Skutella:
Protection of flows under targeted attacks. CoRR abs/1601.03603 (2016) - 2015
- [j4]José Correa, Alberto Marchetti-Spaccamela
Strong LP formulations for scheduling splittable jobs on unrelated machines. Math. Program. 154(1-2): 305-328 (2015) - [c11]Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove
Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. ISAAC 2015: 176-187 - [c10]Jannik Matuschke, Martin Skutella, José A. Soto:
Robust randomized matchings. SODA 2015: 1904-1915 - 2014
- [j3]Jan-Philipp W. Kappmeier, Jannik Matuschke
Abstract flows over time: A first step towards solving dynamic packing problems. Theor. Comput. Sci. 544: 74-83 (2014) - [c9]José R. Correa, Alberto Marchetti-Spaccamela
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines. IPCO 2014: 249-260 - [i5]José R. Correa, Tobias Harks, Vincent J. C. Kreuzen, Jannik Matuschke:
Fare Evasion in Transit Networks. CoRR abs/1405.2826 (2014) - [i4]Ashwin Arulselvan, Ágnes Cseh, Jannik Matuschke:
The Student/Project Allocation problem with group projects. CoRR abs/1412.0325 (2014) - 2013
- [j2]Ágnes Cseh, Jannik Matuschke
Stable Flows over Time. Algorithms 6(3): 532-545 (2013) - [j1]Tobias Harks, Felix G. König, Jannik Matuschke
Approximation Algorithms for Capacitated Location Routing. Transp. Sci. 47(1): 3-22 (2013) - [c8]Jannik Matuschke, Andreas Bley
Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections. ESA 2013: 707-718 - 2012
- [c7]Felix G. König, Jannik Matuschke, Alexander T. Richter:
Multi-Dimensional Commodity Covering for Tariff Selection in Transportation. ATMOS 2012: 58-70 - [c6]Sandro Bosio, Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis, Martin Skutella:
Flows over Time with Negative Transit Times and Arc Release Dates. CTW 2012: 30-33 - [c5]Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis:
Abstract Flows over Time. CTW 2012: 157-161 - [c4]Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis:
Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems. ISAAC 2012: 433-443 - [c3]Yann Disser, Jannik Matuschke:
Degree-Constrained Orientations of Embedded Graphs. ISAAC 2012: 506-516 - [i3]Christina Büsing, Kai-Simon Goetzmann, Jannik Matuschke, Sebastian Stiller:
The Power of Compromise. CoRR abs/1207.3165 (2012) - [i2]Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis:
Abstract flows over time: A first step towards solving dynamic packing problems. CoRR abs/1211.2177 (2012) - [i1]Jannik Matuschke, Britta Peis:
Lattices and maximum flow algorithms in planar graphs. CoRR abs/1211.2189 (2012) - 2010
- [c2]Jannik Matuschke:
Lattices and Maximum Flow Algorithms in Planar Graphs. CTW 2010: 123-127 - [c1]Jannik Matuschke, Britta Peis:
Lattices and Maximum Flow Algorithms in Planar Graphs. WG 2010: 324-335
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: