Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Walter Kern
2010 – today
- 2013
[j58]Matthijs Bomhoff, Walter Kern, Georg Still: A note on perfect partial elimination. Discrete Mathematics 313(14): 1558-1563 (2013)- [c14]
- 2012
- [j57]Péter Biró, Walter Kern, Daniël Paulusma: Computing solutions for matching games. Int. J. Game Theory 41(1): 75-90 (2012)
- [j56]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)
- [j55]Ulrich Faigle, Walter Kern, Britta Peis: A ranking model for the greedy algorithm and discrete convexity. Math. Program. 132(1-2): 393-407 (2012)
- [j54]Walter Kern, Xian Qiu: Integrality gap analysis for bin packing games. Oper. Res. Lett. 40(5): 360-363 (2012)
- [c13]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
- [i5]
- 2011
- [c12]
- [c11]
- [c10]
- [c9]Rolf Harren, Walter Kern: Improved Lower Bound for Online Strip Packing - (Extended Abstract). WAOA 2011: 211-218
- 2010
- [j53]
- [c8]Walter Kern, Jacob Jan Paulus: A tight Analysis of Brown-Baker-Katseff Sequences for Online Strip Packing. CTW 2010: 109-110
- [c7]Péter Biró, Walter Kern, Daniël Paulusma: On Solution Concepts for Matching Games. TAMC 2010: 117-127
2000 – 2009
- 2009
- [j52]Walter Kern, Daniël Paulusma: On the Core and f-Nucleolus of Flow Games. Math. Oper. Res. 34(4): 981-991 (2009)
- 2008
- [j51]Tim Nieberg, Johann Hurink, Walter Kern: Approximation schemes for wireless networks. ACM Transactions on Algorithms 4(4) (2008)
- 2007
- [j50]Bernhard Fuchs, Walter Kern, Xinhui Wang: The Number of Tree Stars Is O *(1.357 k ). Algorithmica 49(3): 232-244 (2007)
- [j49]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)
- [j48]Walter Kern, Gerhard J. Woeginger: Quadratic programming and combinatorial minimum weight product problems. Math. Program. 110(3): 641-649 (2007)
- [j47]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)
- [c6]
- [e1]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
- 2006
- [j46]Bernhard Fuchs, Walter Kern, Xinhui Wang: The number of tree stars is O*(1.357k). Electronic Notes in Discrete Mathematics 25: 183-185 (2006)
- [j45]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)
- [j44]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)
- [j43]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)
- [c5]Walter Kern, Gerhard J. Woeginger: Quadratic Programming and Combinatorial Minimum Weight Product Problems. CIAC 2006: 42-49
- 2005
- [j42]Bernhard Fuchs, Winfried Hochstättler, Walter Kern: Online matching on a line. Theor. Comput. Sci. 332(1-3): 251-264 (2005)
- [c4]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
- 2004
- [j41]Walter Kern, Daniël Paulusma: The computational complexity of the elimination problem in generalized sports competitions. Discrete Optimization 1(2): 205-214 (2004)
- [j40]Tobias Brüggemann, Walter Kern: An improved local search algorithm for 3-SAT. Electronic Notes in Discrete Mathematics 17: 69-73 (2004)
- [j39]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)
- [j38]Tobias Brüggemann, Walter Kern: An improved deterministic local search algorithm for 3-SAT. Theor. Comput. Sci. 329(1-3): 303-313 (2004)
- [c3]
- [c2]Tim Nieberg, Johann Hurink, Walter Kern: A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. WG 2004: 214-221
- 2003
- [j37]Bernhard Fuchs, Winfried Hochstättler, Walter Kern: Online Matching On a Line. Electronic Notes in Discrete Mathematics 13: 49-51 (2003)
- [j36]Walter Kern, Daniël Paulusma: Matching Games: The Least Core and the Nucleolus. Math. Oper. Res. 28(2): 294-308 (2003)
- 2001
- [j35]Walter Kern, Daniël Paulusma: The new FIFA rules are hard: complexity aspects of sports competitions. Discrete Applied Mathematics 108(3): 317-323 (2001)
- [j34]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)
- [j33]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)
- [j32]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)
- [c1]Adriana Felicia Bumb, Walter Kern: A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem. RANDOM-APPROX 2001: 55-62
- 2000
- [j31]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)
- [j30]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)
1990 – 1999
- 1999
- [j29]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
- [j28]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)
- [j27]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)
- [j26]Ulrich Faigle, Walter Kern: Approximate Core Allocation for Binpacking Games. SIAM J. Discrete Math. 11(3): 387-399 (1998)
- 1997
- [j25]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)
- [j24]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)
- 1996
- [j23]Ulrich Faigle, R. Garbe, Walter Kern: Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling. Computing 56(2): 95-104 (1996)
- [j22]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)
- [j21]Ulrich Faigle, Walter Kern: Submodular linear programs on forests. Math. Program. 72: 195-206 (1996)
- [j20]Ulrich Faigle, Walter Kern, M. Streng: Note on the computational complexity of j-radii of polytopes in Realn. Math. Program. 73: 1-5 (1996)
- [j19]Ulrich Faigle, Alan J. Hoffman, Walter Kern: A Characterization of Nonnegative Box-Greedy Matrices. SIAM J. Discrete Math. 9(1): 1-6 (1996)
- 1995
- [j18]Ulrich Faigle, Noud Gademann, Walter Kern: A Random Polynomial Time Algorithm for Well-rounding Convex Bodies. Discrete Applied Mathematics 58(2): 117-144 (1995)
- [j17]Péter L. Erdös, Ulrich Faigle, Walter Kern: On the average rank of LYM-sets. Discrete Mathematics 144(1-3): 11-22 (1995)
- [i4]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)
- [i3]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)
- [i2]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)
- [i1]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)
- 1993
- [j16]Walter Kern: On the Depth of Combinatorial Optimization Problems. Discrete Applied Mathematics 43(2): 115-129 (1993)
- [j15]Ulrich Faigle, Walter Kern: On some approximately balanced combinatorial cooperative games. Math. Meth. of OR 38(2): 141-152 (1993)
- 1992
- [j14]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)
- [j13]Ulrich Faigle, Walter Kern: Some Convergence Results for Probabilistic Tabu Search. INFORMS Journal on Computing 4(1): 32-37 (1992)
- [j12]Walter Kern: Learning Convex Bodies under Uniform Distribution. Inf. Process. Lett. 43(1): 35-39 (1992)
- [j11]John Shawe-Taylor, Martin Anthony, Walter Kern: Classes of feedforward neural networks and their circuit complexity. Neural Networks 5(6): 971-977 (1992)
- 1991
- [j10]Ulrich Faigle, Walter Kern: Some Order Dimension Bounds for Communication Complexity Problems. Acta Inf. 28(6): 593-601 (1991)
- 1990
- [j9]Walter Kern, Alfred Wanka: On a Problem About Covering Lines by Squares. Discrete & Computational Geometry 5: 77-82 (1990)
- [j8]Marion Alfter, Walter Kern, Alfred Wanka: On adjoints and dual matroids. J. Comb. Theory, Ser. B 50(2): 208-213 (1990)
1980 – 1989
- 1989
- [j7]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)
- [j6]Winfried Hochstättler, Walter Kern: Matroid matching in pseudomodular lattices. Combinatorica 9(2): 145-152 (1989)
- 1988
- [j5]
- [j4]Walter Kern: On finite locally projective planar spaces. J. Comb. Theory, Ser. A 48(2): 247-254 (1988)
- 1986
- [j3]
1970 – 1979
- 1978
- [j2]J. Keklikoglou, Hermann K.-G. Walter, Walter Kern: The behaviour of parsing time under grammar morphisms. ITA 12(2) (1978)
- 1977
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-23 22:16 CEST by the dblp team