Follow
Kern, Walter
Kern, Walter
Universiteit Twente
Verified email at utwente.nl
Title
Cited by
Cited by
Year
The Shapley value for cooperative games under precedence constraints
U Faigle, W Kern
International Journal of Game Theory 21, 249-266, 1992
3331992
On the game chromatic number of some classes of graphs
U Faigle, W Kern, H Kierstead, WT Trotter
Ars combinatoria 35, 143-150, 1993
2411993
On the performance of on-line algorithms for partition problems
U Faigle, W Kern, G Turán
Acta cybernetica 9 (2), 107-119, 1989
2401989
Some convergence results for probabilistic tabu search
U Faigle, W Kern
ORSA Journal on Computing 4 (1), 32-37, 1992
1671992
Linear programming duality
A Bachem, W Kern
Linear Programming Duality, 216, 1992
1611992
Algorithmic principles of mathematical programming
U Faigle, W Kern, G Still
Springer Science & Business Media, 2013
1352013
An improved deterministic local search algorithm for 3-SAT
T Brueggemann, W Kern
Theoretical computer science 329 (1-3), 303-314, 2004
1202004
On the complexity of testing membership in the core of min-cost spanning tree games
U Faigle, W Kern, SP Fekete, W Hochstättler
International Journal of Game Theory 26, 361-366, 1997
1111997
Matching games: the least core and the nucleolus
W Kern, D Paulusma
Mathematics of operations research 28 (2), 294-308, 2003
1052003
Dynamic programming for minimum Steiner trees
B Fuchs, W Kern, D Molle, S Richter, P Rossmanith, X Wang
Theory of Computing Systems 41, 493-500, 2007
962007
The generalized minimum spanning tree problem
PC Pop
962002
On some approximately balanced combinatorial cooperative games
U Faigle, W Kern
Zeitschrift für Operations Research 38, 141-152, 1993
931993
On the computation of the nucleolus of a cooperative game
U Faigle, W Kern, J Kuipers
International Journal of Game Theory 30 (1), 79-98, 2001
862001
A robust PTAS for maximum weight independent sets in unit disk graphs
T Nieberg, J Hurink, W Kern
Graph-Theoretic Concepts in Computer Science: 30th International Workshop …, 2005
842005
Note: Computing the nucleolus of min-cost spanning tree games is NP-hard.
U Faigle, W Kern, J Kuipers
International Journal of Game Theory 27 (3), 1998
811998
On approximately fair cost allocation in Euclidean TSP games
U Faigle, SP Fekete, W Hochstättler, W Kern
Operations-Research-Spektrum 20, 29-37, 1998
731998
Online matching on a line
B Fuchs, W Hochstättler, W Kern
Theoretical Computer Science 332 (1-3), 251-264, 2005
682005
On the core of ordered submodular cost games
U Faigle, W Kern
Mathematical Programming 87, 483-499, 2000
672000
The nucleon of cooperative games and an algorithm for matching games
U Faigle, W Kern, SP Fekete, W Hochstättler
Mathematical Programming 83, 195-211, 1998
641998
A Lagrangian relaxation approach to the edge-weighted clique problem
M Hunting, U Faigle, W Kern
European Journal of Operational Research 131 (1), 119-131, 2001
602001
The system can't perform the operation now. Try again later.
Articles 1–20