Kern, Walter, 1957-....
Kern, W. (Walter)
Kern, Walter 1957-2021
Walter Kern Dr. rer. nat. Universität zu Köln 1985
VIAF ID: 112560079 (Personal)
Permalink: http://viaf.org/viaf/112560079
Preferred Forms
-
-
-
- 100 1 _ ‡a Kern, Walter ‡d 1957-...
- 100 1 _ ‡a Kern, Walter ‡d 1957-2021
- 100 1 _ ‡a Kern, Walter, ‡d 1957-
- 100 1 0 ‡a Kern, Walter, ‡d 1957-
-
-
- 100 1 _ ‡a Kern, Walter, ‡d 1957-....
- 100 0 _ ‡a Walter Kern ‡c Dr. rer. nat. Universität zu Köln 1985
4xx's: Alternate Name Forms (1)
5xx's: Related Names (7)
- 510 2 _ ‡a Discrete Mathematics and Mathematical Progr.(DMMP)
- 510 2 _ ‡a Institut für Ökonometrie und Operations-Research
- 551 _ _ ‡a Nürnberg ‡4 ortg ‡4 https://d-nb.info/standards/elementset/gnd#placeOfBirth
- 510 2 _ ‡a Rheinische Friedrich-Wilhelms-Universität Bonn ‡b Institut für Ökonometrie und Operations-Research ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Springer-Verlag (Berlin)
- 510 2 _ ‡a Universiteit Twente
- 510 2 _ ‡a Universiteit Twente ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
Works
Title | Sources |
---|---|
Algorithmic principles of mathematical programming | |
Approximate core allocation for binpacking games | |
A characterization of non-negative greedy matrices | |
Classes of feedforward neural networks and their circuit complexity | |
Computational complexity of some maximum average weight problems with precendence constraints | |
efficient algorithm for solving a special class of LP's | |
The game chromatic number of trees is 4 | |
The generalized minimum spanning tree problem | |
A greedy on-line algorithm for the k-track assignment problem | |
A group-theoretical setting for some intersecting Sperner families | |
guided tour through oriented matroid axioms | |
A Lagrangian relaxation approach to the edge-weighted clique problem | |
Linear programming duality an introduction to oriented matroids | |
Matching games: the least core and the nucleolus | |
Minimum loss scheduling | |
Modular substructures in pseudomodular lattices | |
The new FIFA rules are hard : complexity aspects of sports competitions | |
Note on the average rank of Lym-sets | |
A note on the communication complexity of totally unimodular matrices | |
Note on the computational complexity of least core concepts for min-cost spanning tree games | |
Note on the convergence of simulated annealing algorithms | |
The nucleon of cooperative games and an algorithm for matching games | |
On a problem about covering lines by squares | |
On adjoints and dual matroids | |
On finite locally projective planar spaces | |
On learnability of monotone DNF functions under uniform distribution | |
On modular embeddings of geometric lattices (extended abstract) | |
On some approximately balanced combinatorial cooperative games | |
On sticky matroids | |
On the communication complexity of t-intersection problems in generalized Boolean algebras | |
On the core of ordered submodular cost games | |
On the depth of combinatorial optimization problems | |
On the performance of on-line algorithms for partition problems | |
On the rate of convergence of some stochastic processes | |
Optimization and optimality test for the maw-cut problem | |
Packing a bin online to maximize the total number of items | |
Partition games and the core of hierarchically convex cost games | |
Planar regular graphs with prescribed diameter | |
Polyhedral theory in oriented matroids | |
probabilistic analysis of the switching algorithm for the Euclidean TSP | |
A random polynomial time algorithm for well-rounding convex bodies | |
Randomized online algorithms for maximizing busy time interval scheduling | |
Scheduling jobs on parallel machines, each with a unit-capacity buffer | |
The shapley value for cooperative games under precedence constraints | |
A simple dual ascent algorithm for the multilevel facility location problem | |
Some convergence results for probabilistic tabu search | |
Some order dimension bounds for communication complexity problems | |
Submodular linear programs on forests | |
Verbandstheoretische Dualität in kombinatorischen Geometrien und orientierten Matroiden | |
Verfahren der kombinatorischen Optimierung und ihre Gültigkeitsbereiche |