 | 2008 |
|---|
| 50 |       | Tim Nieberg,
Johann Hurink,
Walter Kern:
Approximation schemes for wireless networks.
ACM Transactions on Algorithms 4(4): (2008) |
| 2007 |
|---|
| 49 |  | Johann Hurink,
Walter Kern,
Gerhard F. Post,
Georg Still:
Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, The Netherlands, 29-31 May, 2007
University of Twente 2007 |
| 48 | | Walter Kern,
Xinhui Wang:
On full components for Rectilinear Steiner tree.
CTW 2007: 85-88 |
| 47 | | Bernhard Fuchs,
Walter Kern,
Xinhui Wang:
The Number of Tree Stars Is O *(1.357 k ).
Algorithmica 49(3): 232-244 (2007) |
| 46 | | Walter Kern,
Gerhard J. Woeginger:
Quadratic programming and combinatorial minimum weight product problems.
Math. Program. 110(3): 641-649 (2007) |
| 45 | | Bernhard Fuchs,
Walter Kern,
Daniel Mölle,
Stefan Richter,
Peter Rossmanith,
Xinhui Wang:
Dynamic Programming for Minimum Steiner Trees.
Theory Comput. Syst. 41(3): 493-500 (2007) |
| 2006 |
|---|
| 44 | | Walter Kern,
Gerhard J. Woeginger:
Quadratic Programming and Combinatorial Minimum Weight Product Problems.
CIAC 2006: 42-49 |
| 43 | | Bernhard Fuchs,
Walter Kern,
Xinhui Wang:
The number of tree stars is O*(1.357k).
Electronic Notes in Discrete Mathematics 25: 183-185 (2006) |
| 42 | | Petrica C. Pop,
Walter Kern,
Georg Still:
A new relaxation method for the generalized minimum spanning tree problem.
European Journal of Operational Research 170(3): 900-908 (2006) |
| 41 | | Tobias Brüggemann,
Johann Hurink,
Walter Kern:
Quality of move-optimal schedules for minimizing total weighted completion time.
Oper. Res. Lett. 34(5): 583-590 (2006) |
| 2005 |
|---|
| 40 | | Petrica C. Pop,
Georg Still,
Walter Kern:
An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size.
ACiD 2005: 115-121 |
| 39 | | Bernhard Fuchs,
Winfried Hochstättler,
Walter Kern:
Online matching on a line.
Theor. Comput. Sci. 332(1-3): 251-264 (2005) |
| 2004 |
|---|
| 38 | | Tim Nieberg,
Johann Hurink,
Walter Kern:
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs.
WG 2004: 214-221 |
| 37 | | Walter Kern,
Daniël Paulusma:
The computational complexity of the elimination problem in generalized sports competitions.
Discrete Optimization 1(2): 205-214 (2004) |
| 36 | | Tobias Brüggemann,
Walter Kern:
An improved local search algorithm for 3-SAT.
Electronic Notes in Discrete Mathematics 17: 69-73 (2004) |
| 35 | | Péter L. Erdös,
Ulrich Faigle,
Winfried Hochstättler,
Walter Kern:
Note on the game chromatic index of trees.
Theor. Comput. Sci. 303(3): 371-376 (2004) |
| 34 | | Tobias Brüggemann,
Walter Kern:
An improved deterministic local search algorithm for 3-SAT.
Theor. Comput. Sci. 329(1-3): 303-313 (2004) |
| 2003 |
|---|
| 33 | | Bernhard Fuchs,
Winfried Hochstättler,
Walter Kern:
Online Matching On a Line.
Electronic Notes in Discrete Mathematics 13: 49-51 (2003) |
| 32 | | Walter Kern,
Daniël Paulusma:
Matching Games: The Least Core and the Nucleolus.
Math. Oper. Res. 28(2): 294-308 (2003) |
| 2001 |
|---|
| 31 | | Adriana Felicia Bumb,
Walter Kern:
A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem.
RANDOM-APPROX 2001: 55-62 |
| 30 | | Walter Kern,
Daniël Paulusma:
The new FIFA rules are hard: complexity aspects of sports competitions.
Discrete Applied Mathematics 108(3): 317-323 (2001) |
| 29 | | Petrica C. Pop,
Walter Kern,
Georg Still,
Ulrich Faigle:
Relaxation methods for the Generalized Minimum Spanning Tree Problem.
Electronic Notes in Discrete Mathematics 8: 76-79 (2001) |
| 2000 |
|---|
| 28 | | Ulrich Faigle,
Walter Kern:
An Order-theoretic Framework for the Greedy Algorithm with Applications to the Core and Weber Set of Cooperative Games.
Order 17(4): 353-375 (2000) |
| 1999 |
|---|
| 27 | | Ulrich Faigle,
Walter Kern,
Willem M. Nawijn:
A Greedy On-Line Algorithm for thek-Track Assignment Problem.
J. Algorithms 31(1): 196-210 (1999) |
| 1998 |
|---|
| 26 | | Ulrich Faigle,
Walter Kern,
Sándor P. Fekete,
Winfried Hochstättler:
The nucleon of cooperative games and an algorithm for matching games.
Math. Program. 83: 195-211 (1998) |
| 25 | | Ulrich Faigle,
Walter Kern:
Approximate Core Allocation for Binpacking Games.
SIAM J. Discrete Math. 11(3): 387-399 (1998) |
| 1996 |
|---|
| 24 | | Ulrich Faigle,
R. Garbe,
Walter Kern:
Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling.
Computing 56(2): 95-104 (1996) |
| 23 | | Ulrich Faigle,
Walter Kern:
Submodular linear programs on forests.
Math. Program. 72: 195-206 (1996) |
| 22 | | Ulrich Faigle,
Walter Kern,
M. Streng:
Note on the computational complexity of j-radii of polytopes in Realn.
Math. Program. 73: 1-5 (1996) |
| 1995 |
|---|
| 21 | | Ulrich Faigle,
Noud Gademann,
Walter Kern:
A Random Polynomial Time Algorithm for Well-rounding Convex Bodies.
Discrete Applied Mathematics 58(2): 117-144 (1995) |
| 20 | | Péter L. Erdös,
Ulrich Faigle,
Walter Kern:
On the average rank of LYM-sets.
Discrete Mathematics 144(1-3): 11-22 (1995) |
| 19 | | Ulrich Faigle,
Sándor P. Fekete,
Winfried Hochstättler,
Walter Kern:
On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games
Electronic Colloquium on Computational Complexity (ECCC) 2(12): (1995) |
| 18 | | Ulrich Faigle,
Walter Kern,
M. Streng:
Note On the Computational Complexity of j-Radii of Polytopes in Rn
Electronic Colloquium on Computational Complexity (ECCC) 2(14): (1995) |
| 17 | | Ulrich Faigle,
Sándor P. Fekete,
Winfried Hochstättler,
Walter Kern:
On Approximately Fair Cost Allocation in Euclidean TSP Games
Electronic Colloquium on Computational Complexity (ECCC) 2(16): (1995) |
| 16 | | Ulrich Faigle,
Sándor P. Fekete,
Winfried Hochstättler,
Walter Kern:
The Nucleon of Cooperative Games and an Algorithm for Matching Games
Electronic Colloquium on Computational Complexity (ECCC) 2(7): (1995) |
| 1993 |
|---|
| 15 | | Walter Kern:
On the Depth of Combinatorial Optimization Problems.
Discrete Applied Mathematics 43(2): 115-129 (1993) |
| 1992 |
|---|
| 14 | | Péter L. Erdös,
Ulrich Faigle,
Walter Kern:
A Group-Theoretic Setting for Some Intersecting Sperner Families.
Combinatorics, Probability & Computing 1: 323-334 (1992) |
| 13 | | Ulrich Faigle,
Walter Kern:
Some Convergence Results for Probabilistic Tabu Search.
INFORMS Journal on Computing 4(1): 32-37 (1992) |
| 12 | | Walter Kern:
Learning Convex Bodies under Uniform Distribution.
Inf. Process. Lett. 43(1): 35-39 (1992) |
| 11 | | John Shawe-Taylor,
Martin Anthony,
Walter Kern:
Classes of feedforward neural networks and their circuit complexity.
Neural Networks 5(6): 971-977 (1992) |
| 1991 |
|---|
| 10 | | Ulrich Faigle,
Walter Kern:
Some Order Dimension Bounds for Communication Complexity Problems.
Acta Inf. 28(6): 593-601 (1991) |
| 1990 |
|---|
| 9 | | Walter Kern,
Alfred Wanka:
On a Problem About Covering Lines by Squares.
Discrete & Computational Geometry 5: 77-82 (1990) |
| 8 | | Marion Alfter,
Walter Kern,
Alfred Wanka:
On adjoints and dual matroids.
J. Comb. Theory, Ser. B 50(2): 208-213 (1990) |
| 1989 |
|---|
| 7 | | Ulrich Faigle,
Walter Kern,
György Turán:
On the performance of on-line algorithms for partition problems.
Acta Cybern. 9(2): 107-119 (1989) |
| 6 | | Winfried Hochstättler,
Walter Kern:
Matroid matching in pseudomodular lattices.
Combinatorica 9(2): 145-152 (1989) |
| 1988 |
|---|
| 5 | | Achim Bachem,
Walter Kern:
On sticky matroids.
Discrete Mathematics 69(1): 11-18 (1988) |
| 4 | | Walter Kern:
On finite locally projective planar spaces.
J. Comb. Theory, Ser. A 48(2): 247-254 (1988) |
| 1986 |
|---|
| 3 | | Achim Bachem,
Walter Kern:
Adjoints of oriented matroids.
Combinatorica 6(4): 299-308 (1986) |
| 1978 |
|---|
| 2 | | J. Keklikoglou,
Hermann K.-G. Walter,
Walter Kern:
The behaviour of parsing time under grammar morphisms.
ITA 12(2): (1978) |
| 1977 |
|---|
| 1 | | Walter Kern:
Speicheroptimale Formelübersetzung
Acta Inf. 7: 269-287 (1977) |
