The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Walter Kern: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  40. On Solution Concepts for Matching Games. [Citation Graph (, )][DBLP]


  41. On full components for Rectilinear Steiner tree. [Citation Graph (, )][DBLP]


  42. The Number of Tree Stars Is O *(1.357 k ). [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002