Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Joachim Schauer
Observed names:
Schauer, J.,
Schauer, Joachim
Institution:
FH JOANNEUM University of Applied Sciences
Observed institutions:
FH JOANNEUM University of Applied Sciences,
University of Graz,
Graz University of Technology,
University of Klagenfurt
ORCID:
0000-0002-2268-0612
Observed ORCID:
0000-0002-2268-0612
OpenAlex ID:
A5061614451
The Knapsack Problem with Conflict Graphs
2009
·
Ulrich Pferschy
, Joachim Schauer
·
Journal of Graph Algorithms and Applications
·
150
Paths, trees and matchings under disjunctive constraints
2011
·
Andreas Darmann
, Ulrich Pferschy
, et al.
·
Discrete Applied Mathematics
·
99
PDF
Group Activity Selection Problem
2012
·
Andreas Darmann
, Edith Elkind
, et al.
·
Lecture notes in computer science
·
79
Maximizing Nash product social welfare in allocating indivisible goods
2015
·
Andreas Darmann
, Joachim Schauer
·
European Journal of Operational Research
·
74
The maximum flow problem with disjunctive constraints
2011
·
Ulrich Pferschy
, Joachim Schauer
·
Journal of Combinatorial Optimization
·
70
Approximation of knapsack problems with conflict and forcing graphs
2016
·
Ulrich Pferschy
, Joachim Schauer
·
Journal of Combinatorial Optimization
·
49
PDF
Resource allocation with time intervals
2010
·
Andreas Darmann
, Ulrich Pferschy
, et al.
·
Theoretical Computer Science
·
48
Determining a Minimum Spanning Tree with Disjunctive Constraints
2009
·
Andreas Darmann
, Ulrich Pferschy
, et al.
·
Lecture notes in computer science
·
34
The Subset Sum game
2013
·
Andreas Darmann
, Gaia Nicosia
, et al.
·
European Journal of Operational Research
·
31
PDF
On the Stackelberg knapsack game
2020
·
Ulrich Pferschy
, Gaia Nicosia
, et al.
·
European Journal of Operational Research
·
27
Group activity selection problem with approval preferences
2017
·
Andreas Darmann
, Edith Elkind
, et al.
·
International Journal of Game Theory
·
27
PDF
Order Batching and Routing in a Non-Standard Warehouse
2018
·
Ulrich Pferschy
, Joachim Schauer
·
Electronic Notes in Discrete Mathematics
·
21
Asymptotic behavior of the quadratic knapsack problem
2016
·
Joachim Schauer
·
European Journal of Operational Research
·
17
Approximation of the Quadratic Knapsack Problem
2016
·
Ulrich Pferschy
, Joachim Schauer
·
INFORMS journal on computing
·
17
Assessing the potential of forecast-based optimization in renewable energy communities with flexible electricity, heat and mobility resources
2025
·
Nathalie Frieß
, Ulrich Pferschy
, et al.
·
Applied Energy
·
12
Approximating the product knapsack problem
2021
·
Ulrich Pferschy
, Joachim Schauer
, et al.
·
Optimization Letters
·
12
PDF
The Maximum Flow Problem with Conflict and Forcing Conditions
2011
·
Ulrich Pferschy
, Joachim Schauer
·
Lecture notes in computer science
·
11
Fair Allocation of Indivisible Items with Conflict Graphs
2022
·
Nina Chiarelli
, Matjaž Krnc
, et al.
·
Algorithmica
·
9
PDF
Fair Packing of Independent Sets
2020
·
Nina Chiarelli
, Matjaž Krnc
, et al.
·
Lecture notes in computer science
·
8
PDF
A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign
2015
·
Ulrich Pferschy
, Joachim Schauer
, et al.
·
Communications in computer and information science
·
6
The Shortest Path Game: Complexity and Algorithms
2014
·
Andreas Darmann
, Ulrich Pferschy
, et al.
·
Lecture notes in computer science
·
6
PDF
Approximating the Quadratic Knapsack Problem on Special Graph Classes
2014
·
Ulrich Pferschy
, Joachim Schauer
·
Lecture notes in computer science
·
6
Stackelberg packing games
2022
·
Toni Böhnlein
, Oliver Schaudt
, et al.
·
Theoretical Computer Science
·
5
On the Shortest Path Game
2015
·
Andreas Darmann
, Ulrich Pferschy
, et al.
·
Discrete Applied Mathematics
·
5
PDF
ILP Models for a Nurse Scheduling Problem
2007
·
Bettina Klinz
, Ulrich Pferschy
, et al.
·
Springer eBooks
·
5
Show more works
View as search
Works count:
46
Citation count:
851
H-index:
14
I10-index:
17
Year
Topic
Type