Joachim Schauer

43 papers B 4C 4Journal 28Unranked 7
YearRankTypeTitle / Venue / Authors
2026 J jnl
REDS: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints.
IEEE Trans. Mob. Comput.
Francesco Corti, Balz Maag, Joachim Schauer, Ulrich Pferschy, Olga Saukh
2025 — conf
Outlier detection and classification in inhomogeneous voltage curves using functional depth.
ICMLT
Müslüm Atas, Fatima Jammoul, Jürgen Klarner, David Raese, Thomas Reisl, Joachim Schauer, Thomas Strametz, Wilhelm Zugaj
2024 J jnl
APOTSA: Anchor placement optimisation using discrete Tabu search algorithm for area-based localisation.
IET Wirel. Sens. Syst.
Sayyid Shahab Nabavi, Joachim Schauer, Carlo Alberto Boano, Kay Römer
2023 J jnl
Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints.
CoRR
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
2023 J jnl
Fair Allocation of Indivisible Items with Conflict Graphs.
Algorithmica
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2023 J jnl
Fair allocation algorithms for indivisible items under structured conflict constraints.
Comput. Appl. Math.
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
2023 B conf
Poster Abstract: Anchor Placement Optimization for Area-Based Localization Using Tabu Search Algorithm.
EWSN
Sayyidshahab Nabavi, Joachim Schauer
2023 B conf
Poster: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints on IoT Devices.
EWSN
Francesco Corti, Christopher Hinterer, Julian Rudolf, Balz Maag, Joachim Schauer, Olga Saukh
2023 J jnl
REDS: Resource-Efficient Deep Subnetworks for Dynamic Resource Constraints.
CoRR
Francesco Corti, Balz Maag, Joachim Schauer, Ulrich Pferschy, Olga Saukh
2023 J jnl
Stackelberg packing games.
Theor. Comput. Sci.
Toni Böhnlein, Oliver Schaudt, Joachim Schauer
2021 J jnl
Approximating the product knapsack problem.
Optim. Lett.
Ulrich Pferschy, Joachim Schauer, Clemens Thielen
2021 J jnl
On the Stackelberg knapsack game.
Eur. J. Oper. Res.
Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici, Joachim Schauer
2020 C conf
Fair Packing of Independent Sets.
IWOCA
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2020 J jnl
Fair packing of independent sets.
CoRR
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2019 B conf
Stackelberg Packing Games.
WADS
Toni Böhnlein, Oliver Schaudt, Joachim Schauer
2019 J jnl
The Product Knapsack Problem: Approximation and Complexity.
CoRR
Ulrich Pferschy, Joachim Schauer, Clemens Thielen
2018 J jnl
Group activity selection problem with approval preferences.
Int. J. Game Theory
Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
2018 J jnl
Order Batching and Routing in a Non-Standard Warehouse.
Electron. Notes Discret. Math.
Ulrich Pferschy, Joachim Schauer
2017 J jnl
Approximation of knapsack problems with conflict and forcing graphs.
J. Comb. Optim.
Ulrich Pferschy, Joachim Schauer
2017 J jnl
On the Shortest Path Game.
Discret. Appl. Math.
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2017 J jnl
The shortest connection game.
Discret. Appl. Math.
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2016 J jnl
Approximation of the Quadratic Knapsack Problem.
INFORMS J. Comput.
Ulrich Pferschy, Joachim Schauer
2016 J jnl
Asymptotic behavior of the quadratic knapsack problem.
Eur. J. Oper. Res.
Joachim Schauer
2015 J jnl
Maximizing Nash product social welfare in allocating indivisible goods.
Eur. J. Oper. Res.
Andreas Darmann, Joachim Schauer
2015 J jnl
On the shortest path game: extended version.
CoRR
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2015 — conf
Personnel Planning with Multi-tasking and Structured Qualifications.
OR
Tobias Kreiter, Ulrich Pferschy, Joachim Schauer
2015 J jnl
The Shortest Connection Game.
CoRR
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2014 — conf
A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign.
ICORES (Selected Papers)
Ulrich Pferschy, Joachim Schauer, Gerhild Maier
2014 J jnl
Group Activity Selection Problem.
CoRR
Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
2014 C conf
Media Mix Optimization - Applying a Quadratic Knapsack Model.
ICORES
Ulrich Pferschy, Joachim Schauer, Gerhild Maier
2014 — conf
The Shortest Path Game: Complexity and Algorithms.
IFIP TCS
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2014 J jnl
The Subset Sum game.
Eur. J. Oper. Res.
Andreas Darmann, Gaia Nicosia, Ulrich Pferschy, Joachim Schauer
2013 B conf
Approximating the Quadratic Knapsack Problem on Special Graph Classes.
WAOA
Ulrich Pferschy, Joachim Schauer
2013 J jnl
Job-shop scheduling in a body shop.
J. Sched.
Joachim Schauer, Cornelius Schwarz
2013 J jnl
The maximum flow problem with disjunctive constraints.
J. Comb. Optim.
Ulrich Pferschy, Joachim Schauer
2012 — conf
Group Activity Selection Problem.
WINE
Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
2011 J jnl
Paths, trees and matchings under disjunctive constraints.
Discret. Appl. Math.
Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
2011 C conf
The Maximum Flow Problem with Conflict and Forcing Conditions.
INOC
Ulrich Pferschy, Joachim Schauer
2010 J jnl
Resource allocation with time intervals.
Theor. Comput. Sci.
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2009 C conf
Combinatorial Optimization Problems with Conflict Graphs.
CTW
Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
2009 — conf
Determining a Minimum Spanning Tree with Disjunctive Constraints.
ADT
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
2009 J jnl
The Knapsack Problem with Conflict Graphs.
J. Graph Algorithms Appl.
Ulrich Pferschy, Joachim Schauer
2006 — conf
ILP Models for a Nurse Scheduling Problem.
OR
Bettina Klinz, Ulrich Pferschy, Joachim Schauer