ILP Models for a Nurse Scheduling Problem. - Bettina Klinz; Ulrich Pferschy; Joachim Schauer (OR, 2006)

Determining a Minimum Spanning Tree with Disjunctive Constraints. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (ADT, 2009)

Combinatorial Optimization Problems with Conflict Graphs. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer; Gerhard J. Woeginger (CTW, 2009)

The Knapsack Problem with Conflict Graphs. - Ulrich Pferschy; Joachim Schauer (J. Graph Algorithms Appl., 2009)

Resource allocation with time intervals. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (Theor. Comput. Sci., 2010)

The Maximum Flow Problem with Conflict and Forcing Conditions. - Ulrich Pferschy; Joachim Schauer (INOC, 2011)

Paths, trees and matchings under disjunctive constraints. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer; Gerhard J. Woeginger (Discret. Appl. Math., 2011)

Group Activity Selection Problem. - Andreas Darmann; Edith Elkind; Sascha Kurz; Jérôme Lang; Joachim Schauer; Gerhard J. Woeginger (WINE, 2012)

Approximating the Quadratic Knapsack Problem on Special Graph Classes. - Ulrich Pferschy; Joachim Schauer (WAOA, 2013)

The maximum flow problem with disjunctive constraints. - Ulrich Pferschy; Joachim Schauer (J. Comb. Optim., 2013)

Job-shop scheduling in a body shop. - Joachim Schauer; Cornelius Schwarz (J. Sched., 2013)

Media Mix Optimization - Applying a Quadratic Knapsack Model. - Ulrich Pferschy; Joachim Schauer; Gerhild Maier (ICORES, 2014)

A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign. - Ulrich Pferschy; Joachim Schauer; Gerhild Maier (ICORES (Selected Papers), 2014)

The Shortest Path Game: Complexity and Algorithms. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (IFIP TCS, 2014)

The Subset Sum game. - Andreas Darmann; Gaia Nicosia; Ulrich Pferschy; Joachim Schauer (Eur. J. Oper. Res., 2014)

Personnel Planning with Multi-tasking and Structured Qualifications. - Tobias Kreiter; Ulrich Pferschy; Joachim Schauer (OR, 2015)

On the shortest path game: extended version. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (CoRR, 2015)

Maximizing Nash product social welfare in allocating indivisible goods. - Andreas Darmann; Joachim Schauer (Eur. J. Oper. Res., 2015)

Asymptotic behavior of the quadratic knapsack problem. - Joachim Schauer (Eur. J. Oper. Res., 2016)

Approximation of the Quadratic Knapsack Problem. - Ulrich Pferschy; Joachim Schauer (INFORMS J. Comput., 2016)

On the Shortest Path Game. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (Discret. Appl. Math., 2017)

The shortest connection game. - Andreas Darmann; Ulrich Pferschy; Joachim Schauer (Discret. Appl. Math., 2017)

Approximation of knapsack problems with conflict and forcing graphs. - Ulrich Pferschy; Joachim Schauer (J. Comb. Optim., 2017)

Order Batching and Routing in a Non-Standard Warehouse. - Ulrich Pferschy; Joachim Schauer (Electron. Notes Discret. Math., 2018)

Group activity selection problem with approval preferences. - Andreas Darmann; Edith Elkind; Sascha Kurz; Jérôme Lang; Joachim Schauer; Gerhard J. Woeginger (Int. J. Game Theory, 2018)

The Product Knapsack Problem: Approximation and Complexity. - Ulrich Pferschy; Joachim Schauer; Clemens Thielen (CoRR, 2019)

Fair Packing of Independent Sets. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Nevena Pivac; Joachim Schauer (IWOCA, 2020)

On the Stackelberg knapsack game. - Ulrich Pferschy; Gaia Nicosia; Andrea Pacifici; Joachim Schauer (Eur. J. Oper. Res., 2021)

Approximating the product knapsack problem. - Ulrich Pferschy; Joachim Schauer; Clemens Thielen (Optim. Lett., 2021)

Poster: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints on IoT Devices. - Francesco Corti; Christopher Hinterer; Julian Rudolf; Balz Maag; Joachim Schauer; Olga Saukh (EWSN, 2023)

Poster Abstract: Anchor Placement Optimization for Area-Based Localization Using Tabu Search Algorithm. - Sayyidshahab Nabavi; Joachim Schauer (EWSN, 2023)

REDS: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints. - Francesco Corti; Balz Maag; Joachim Schauer; Ulrich Pferschy; Olga Saukh (CoRR, 2023)

Stackelberg packing games. - Toni Böhnlein; Oliver Schaudt; Joachim Schauer (Theor. Comput. Sci., 2023)

Fair Allocation of Indivisible Items with Conflict Graphs. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Nevena Pivac; Joachim Schauer (Algorithmica, 2023)

Fair allocation algorithms for indivisible items under structured conflict constraints. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Joachim Schauer (Comput. Appl. Math., 2023)

APOTSA: Anchor placement optimisation using discrete Tabu search algorithm for area-based localisation. - Sayyid Shahab Nabavi; Joachim Schauer; Carlo Alberto Boano; Kay Römer (IET Wirel. Sens. Syst., 2024)