Matuschke, Jannik

1. The popular assignment problem: when cardinality is more important than popularity
   2021/10/21 by Kavitha, Telikepalli, Király, Tamás, Matuschke, Jannik +2 · 2 citations
   #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
2. Exact and approximation algorithms for the expanding search problem
   2019/11/20 by Hermans, Ben, Leus, Roel, Matuschke, Jannik · 1 citation
   #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
3. Popular Branchings and Their Dual Certificates
   2019/12/04 by Kavitha, Telikepalli, Király, Tamás, Matuschke, Jannik +2 · 1 citation
   #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
4. Assigning and Scheduling Generalized Malleable Jobs under Subadditive or Submodular Processing Speeds
   2021/11/11 by Dimitris Fotakis, Fotakis, Dimitris, Jannik Matuschke +3 · 1 citation
   Computer Science · Engineering · #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Optimization and Packing Problems #Optimization and Search Problems #Scheduling and Optimization Algorithms
5. A Local-Search Algorithm for Steiner Forest
   2017/07/10 by Groß, Martin, Gupta, Anupam, Kumar, Amit +4 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences