Spremljaj
Joachim Schauer
Joachim Schauer
FH JOANNEUM - University of Applied Sciences
Preverjeni e-poštni naslov na fh-joanneum.at
Naslov
Navedeno
Navedeno
Leto
The knapsack problem with conflict graphs.
U Pferschy, J Schauer
J. Graph Algorithms Appl. 13 (2), 233-249, 2009
1262009
Paths, trees and matchings under disjunctive constraints
A Darmann, U Pferschy, J Schauer, GJ Woeginger
Discrete Applied Mathematics 159 (16), 1726-1735, 2011
992011
Group activity selection problem
A Darmann, E Elkind, S Kurz, J Lang, J Schauer, G Woeginger
International Workshop on Internet and Network Economics, 156-169, 2012
802012
Maximizing Nash product social welfare in allocating indivisible goods
A Darmann, J Schauer
European Journal of Operational Research 247 (2), 548-559, 2015
702015
The maximum flow problem with disjunctive constraints
U Pferschy, J Schauer
Journal of Combinatorial Optimization 26 (1), 109-119, 2013
542013
Resource allocation with time intervals
A Darmann, U Pferschy, J Schauer
Theoretical Computer Science 411 (49), 4217-4234, 2010
492010
Determining a minimum spanning tree with disjunctive constraints
A Darmann, U Pferschy, J Schauer
International Conference on Algorithmic Decision Theory, 414-423, 2009
362009
Approximation of knapsack problems with conflict and forcing graphs
U Pferschy, J Schauer
Journal of Combinatorial Optimization 33 (4), 1300-1323, 2017
322017
The subset sum game
A Darmann, G Nicosia, U Pferschy, J Schauer
European Journal of Operational Research 233 (3), 539-549, 2014
272014
Group activity selection problem with approval preferences
A Darmann, E Elkind, S Kurz, J Lang, J Schauer, G Woeginger
International Journal of Game Theory 47 (3), 767-796, 2018
242018
Order batching and routing in a non-standard warehouse
U Pferschy, J Schauer
Electronic Notes in Discrete Mathematics 69, 125-132, 2018
162018
The maximum flow problem with conflict and forcing conditions
U Pferschy, J Schauer
International conference on network optimization, 289-294, 2011
132011
On the Stackelberg knapsack game
U Pferschy, G Nicosia, A Pacifici, J Schauer
European Journal of Operational Research 291 (1), 18-31, 2021
112021
Approximation of the quadratic knapsack problem
U Pferschy, J Schauer
INFORMS Journal on Computing 28 (2), 308-318, 2016
112016
Asymptotic behavior of the quadratic knapsack problem
J Schauer
European Journal of Operational Research 255 (2), 357-363, 2016
82016
Minimal spanning trees with conflict graphs
A Darmann, U Pferschy, J Schauer
Optimization online, 2009
82009
The shortest path game: Complexity and algorithms
A Darmann, U Pferschy, J Schauer
IFIP International Conference on Theoretical Computer Science, 39-53, 2014
72014
Approximating the quadratic knapsack problem on special graph classes
U Pferschy, J Schauer
International Workshop on Approximation and Online Algorithms, 61-72, 2013
72013
Approximating the product knapsack problem
U Pferschy, J Schauer, C Thielen
Optimization Letters 15 (8), 2529-2540, 2021
62021
Fair packing of independent sets
N Chiarelli, M Krnc, M Milanič, U Pferschy, N Pivač, J Schauer
International Workshop on Combinatorial Algorithms, 154-165, 2020
62020
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20