Walter Kern

Matthijs Bomhoff, Walter Kern, Georg Still: A note on perfect partial elimination. Discrete Mathematics 313(14): 1558-1563 (2013)

Walter Kern, Xian Qiu: The 1/4-Core of the Uniform Bin Packing Game Is Nonempty. COCOON 2013: 41-52

Péter Biró, Walter Kern, Daniël Paulusma: Computing solutions for matching games. Int. J. Game Theory 41(1): 75-90 (2012)

Matthijs Bomhoff, Walter Kern, Georg Still: On bounded block decomposition problems for under-specified systems of equations. J. Comput. Syst. Sci. 78(1): 336-347 (2012)

Ulrich Faigle, Walter Kern, Britta Peis: A ranking model for the greedy algorithm and discrete convexity. Math. Program. 132(1-2): 393-407 (2012)

Walter Kern, Xian Qiu: Integrality gap analysis for bin packing games. Oper. Res. Lett. 40(5): 360-363 (2012)

Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma: Solutions for the Stable Roommates Problem with Payments. WG 2012: 69-80

Ulrich Faigle, Walter Kern, Britta Peis: Max-Flow on Regular Spaces. CoRR abs/1206.5167 (2012)

Walter Kern, Xian Qiu: Improved Taxation Rate for Bin Packing Games. CTW 2011: 173-176

Ulrich Faigle, Walter Kern, Britta Peis: On Greedy and Submodular Matrices. TAPAS 2011: 116-126

Walter Kern, Xian Qiu: Improved Taxation Rate for Bin Packing Games. TAPAS 2011: 175-180

Rolf Harren, Walter Kern: Improved Lower Bound for Online Strip Packing - (Extended Abstract). WAOA 2011: 211-218

Walter Kern: Book review. Oper. Res. Lett. 38(5): 492 (2010)

Walter Kern, Jacob Jan Paulus: A tight Analysis of Brown-Baker-Katseff Sequences for Online Strip Packing. CTW 2010: 109-110

Péter Biró, Walter Kern, Daniël Paulusma: On Solution Concepts for Matching Games. TAMC 2010: 117-127

Walter Kern, Daniël Paulusma: On the Core and f-Nucleolus of Flow Games. Math. Oper. Res. 34(4): 981-991 (2009)

Tim Nieberg, Johann Hurink, Walter Kern: Approximation schemes for wireless networks. ACM Transactions on Algorithms 4(4) (2008)

Bernhard Fuchs, Walter Kern, Xinhui Wang: The Number of Tree Stars Is O ^*(1.357 ^k ). Algorithmica 49(3): 232-244 (2007)

Bernhard Fuchs, Walter Kern, Xinhui Wang: Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees. Math. Meth. of OR 66(1): 117-125 (2007)

Walter Kern, Gerhard J. Woeginger: Quadratic programming and combinatorial minimum weight product problems. Math. Program. 110(3): 641-649 (2007)

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)

Walter Kern, Xinhui Wang: On full components for Rectilinear Steiner tree. CTW 2007: 85-88

Johann Hurink, Walter Kern, Gerhard F. Post, Georg Still (Eds.): Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, The Netherlands, 29-31 May, 2007. University of Twente 2007

Bernhard Fuchs, Walter Kern, Xinhui Wang: The number of tree stars is O^*(1.357^k). Electronic Notes in Discrete Mathematics 25: 183-185 (2006)

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)

Ulrich Faigle, Walter Kern, Jeroen Kuipers: Computing an Element in the Lexicographic Kernel of a Game. Math. Meth. of OR 63(3): 427-433 (2006)

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)

Walter Kern, Gerhard J. Woeginger: Quadratic Programming and Combinatorial Minimum Weight Product Problems. CIAC 2006: 42-49

Bernhard Fuchs, Winfried Hochstättler, Walter Kern: Online matching on a line. Theor. Comput. Sci. 332(1-3): 251-264 (2005)

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

Walter Kern, Daniël Paulusma: The computational complexity of the elimination problem in generalized sports competitions. Discrete Optimization 1(2): 205-214 (2004)

Tobias Brüggemann, Walter Kern: An improved local search algorithm for 3-SAT. Electronic Notes in Discrete Mathematics 17: 69-73 (2004)

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)

Tobias Brüggemann, Walter Kern: An improved deterministic local search algorithm for 3-SAT. Theor. Comput. Sci. 329(1-3): 303-313 (2004)

Tobias Brüggemann, Walter Kern: An Improved Local Search Algorithm for 3-SAT. CTW 2004: 66-70

Tim Nieberg, Johann Hurink, Walter Kern: A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. WG 2004: 214-221

Bernhard Fuchs, Winfried Hochstättler, Walter Kern: Online Matching On a Line. Electronic Notes in Discrete Mathematics 13: 49-51 (2003)

Walter Kern, Daniël Paulusma: Matching Games: The Least Core and the Nucleolus. Math. Oper. Res. 28(2): 294-308 (2003)

Walter Kern, Daniël Paulusma: The new FIFA rules are hard: complexity aspects of sports competitions. Discrete Applied Mathematics 108(3): 317-323 (2001)

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)

Marcel Hunting, Ulrich Faigle, Walter Kern: A Lagrangian relaxation approach to the edge-weighted clique problem. European Journal of Operational Research 131(1): 119-131 (2001)

Ulrich Faigle, Walter Kern, Jeroen Kuipers: On the computation of the nucleolus of a cooperative game. Int. J. Game Theory 30(1): 79-98 (2001)

Adriana Felicia Bumb, Walter Kern: A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem. RANDOM-APPROX 2001: 55-62

Ulrich Faigle, Walter Kern, Daniël Paulusma: Note on the computational complexity of least core concepts for min-cost spanning tree games. Math. Meth. of OR 52(1): 23-38 (2000)

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)

Ulrich Faigle, Walter Kern, Willem M. Nawijn: A Greedy On-Line Algorithm for thek-Track Assignment Problem. J. Algorithms 31(1): 196-210 (1999)

Ulrich Faigle, Walter Kern, Jeroen Kuipers: Note Computing the nucleolus of min-cost spanning tree games is NP-hard - Computing the nucleolus of min-cost spanning tree games is NP-hard. Int. J. Game Theory 27(3): 443-450 (1998)

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)

Ulrich Faigle, Walter Kern: Approximate Core Allocation for Binpacking Games. SIAM J. Discrete Math. 11(3): 387-399 (1998)

Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler: On the complexity of testing membership in the core of min-cost spanning tree games. Int. J. Game Theory 26(3): 361-366 (1997)

Ulrich Faigle, Marcel Hunting, Walter Kern, R. Prakash, K. J. Supowit: Simplices by point-sliding and the Yamnitsky-Levin algorithm. Math. Meth. of OR 46(1): 131-142 (1997)

Ulrich Faigle, R. Garbe, Walter Kern: Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling. Computing 56(2): 95-104 (1996)

Ulrich Faigle, Walter Kern, Boris Spieker: On the communication complexity of t -intersection problems in generalized Boolean algebras. Math. Meth. of OR 43(2): 239-254 (1996)

Ulrich Faigle, Walter Kern: Submodular linear programs on forests. Math. Program. 72: 195-206 (1996)

Ulrich Faigle, Walter Kern, M. Streng: Note on the computational complexity of j-radii of polytopes in Realⁿ. Math. Program. 73: 1-5 (1996)

Ulrich Faigle, Alan J. Hoffman, Walter Kern: A Characterization of Nonnegative Box-Greedy Matrices. SIAM J. Discrete Math. 9(1): 1-6 (1996)

Ulrich Faigle, Noud Gademann, Walter Kern: A Random Polynomial Time Algorithm for Well-rounding Convex Bodies. Discrete Applied Mathematics 58(2): 117-144 (1995)

Péter L. Erdös, Ulrich Faigle, Walter Kern: On the average rank of LYM-sets. Discrete Mathematics 144(1-3): 11-22 (1995)

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)

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)

Ulrich Faigle, Walter Kern, M. Streng: Note On the Computational Complexity of j-Radii of Polytopes in Rⁿ. Electronic Colloquium on Computational Complexity (ECCC) 2(14) (1995)

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)

Walter Kern: On the Depth of Combinatorial Optimization Problems. Discrete Applied Mathematics 43(2): 115-129 (1993)

Ulrich Faigle, Walter Kern: On some approximately balanced combinatorial cooperative games. Math. Meth. of OR 38(2): 141-152 (1993)

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)

Ulrich Faigle, Walter Kern: Some Convergence Results for Probabilistic Tabu Search. INFORMS Journal on Computing 4(1): 32-37 (1992)

Walter Kern: Learning Convex Bodies under Uniform Distribution. Inf. Process. Lett. 43(1): 35-39 (1992)

John Shawe-Taylor, Martin Anthony, Walter Kern: Classes of feedforward neural networks and their circuit complexity. Neural Networks 5(6): 971-977 (1992)

Ulrich Faigle, Walter Kern: Some Order Dimension Bounds for Communication Complexity Problems. Acta Inf. 28(6): 593-601 (1991)

Walter Kern, Alfred Wanka: On a Problem About Covering Lines by Squares. Discrete & Computational Geometry 5: 77-82 (1990)

Marion Alfter, Walter Kern, Alfred Wanka: On adjoints and dual matroids. J. Comb. Theory, Ser. B 50(2): 208-213 (1990)

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)

Winfried Hochstättler, Walter Kern: Matroid matching in pseudomodular lattices. Combinatorica 9(2): 145-152 (1989)

Achim Bachem, Walter Kern: On sticky matroids. Discrete Mathematics 69(1): 11-18 (1988)

Walter Kern: On finite locally projective planar spaces. J. Comb. Theory, Ser. A 48(2): 247-254 (1988)

Achim Bachem, Walter Kern: Adjoints of oriented matroids. Combinatorica 6(4): 299-308 (1986)

J. Keklikoglou, Hermann K.-G. Walter, Walter Kern: The behaviour of parsing time under grammar morphisms. ITA 12(2) (1978)

Walter Kern: Speicheroptimale Formelübersetzung. Acta Inf. 7: 269-287 (1977)