Walter Kern

According to our database1, Walter Kern authored at least 97 papers between 1965 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



Simple games versus weighted voting games: bounding the critical threshold value.
Soc. Choice Welf., 2020

Contracting to a Longest Path in H-Free Graphs.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Generalized Matching Games for International Kidney Exchange.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

The stable fixtures problem with payments.
Games Econ. Behav., 2018

Greedy Oriented Flows.
Algorithmica, 2018

Simple Games Versus Weighted Voting Games.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Approximating bounded-degree spanning trees and connected factors with leaves.
Oper. Res. Lett., 2017

The Asymptotic Price of Anarchy for k-uniform Congestion Games.
Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Patternbasierte Abbildung von Rich-Client-Aspekten auf webbasierte Systeme im Kontext der Barrierefreiheitsanforderungen im Bereich E-Governement.
PhD thesis, 2016

Approximate core allocations and integrality gap for the bin packing game.
Theor. Comput. Sci., 2016

Note on VCG vs. Price Raising for Matching Markets.
CoRR, 2016

Improved approximation algorithms for a bilevel knapsack problem.
Theor. Comput. Sci., 2015

Improved Lower Bound for Online Strip Packing.
Theory Comput. Syst., 2015

Solutions for the stable roommates problem with payments.
Theor. Comput. Sci., 2014

Note on non-uniform bin packing games.
Discret. Appl. Math., 2014

A tight analysis of Brown-Baker-Katseff sequences for online strip packing.
J. Comb. Optim., 2013

A note on perfect partial elimination.
Discret. Math., 2013

The 1/4-Core of the Uniform Bin Packing Game Is Nonempty.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Integrality gap analysis for bin packing games.
Oper. Res. Lett., 2012

A ranking model for the greedy algorithm and discrete convexity.
Math. Program., 2012

On bounded block decomposition problems for under-specified systems of equations.
J. Comput. Syst. Sci., 2012

Computing solutions for matching games.
Int. J. Game Theory, 2012

Max-Flow on Regular Spaces
CoRR, 2012

Improved Lower Bound for Online Strip Packing - (Extended Abstract).
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

On Greedy and Submodular Matrices.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Improved Taxation Rate for Bin Packing Games.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

The Dimension Architecture: A New Approach to Resource Access.
IEEE Softw., 2010

Book review.
Oper. Res. Lett., 2010

On Solution Concepts for Matching Games.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

On the Core and <i>f</i>-Nucleolus of Flow Games.
Math. Oper. Res., 2009

Approximation schemes for wireless networks.
ACM Trans. Algorithms, 2008

Dynamic Programming for Minimum Steiner Trees.
Theory Comput. Syst., 2007

Quadratic programming and combinatorial minimum weight product problems.
Math. Program., 2007

Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees.
Math. Methods Oper. Res., 2007

The Number of Tree Stars Is <i>O</i> <sup>*</sup>(1.357<sup> <i>k</i> </sup>).
Algorithmica, 2007

On full components for Rectilinear Steiner tree.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

Quality of move-optimal schedules for minimizing total weighted completion time.
Oper. Res. Lett., 2006

Computing an Element in the Lexicographic Kernel of a Game.
Math. Methods Oper. Res., 2006

A new relaxation method for the generalized minimum spanning tree problem.
Eur. J. Oper. Res., 2006

The number of tree stars is O<sup>*</sup>(1.357<sup>k</sup>).
Electron. Notes Discret. Math., 2006

An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005

Note on the game chromatic index of trees.
Theor. Comput. Sci., 2004

An improved deterministic local search algorithm for 3-SAT.
Theor. Comput. Sci., 2004

An improved local search algorithm for 3-SAT.
Electron. Notes Discret. Math., 2004

The computational complexity of the elimination problem in generalized sports competitions.
Discret. Optim., 2004

A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Matching Games: The Least Core and the Nucleolus.
Math. Oper. Res., 2003

Online Matching On a Line.
Electron. Notes Discret. Math., 2003

On the computation of the nucleolus of a cooperative game.
Int. J. Game Theory, 2001

A Lagrangian relaxation approach to the edge-weighted clique problem.
Eur. J. Oper. Res., 2001

Relaxation methods for the Generalized Minimum Spanning Tree Problem.
Electron. Notes Discret. Math., 2001

A simple dual ascent algorithm for the multilevel facility location problem.
Electron. Notes Discret. Math., 2001

The new FIFA rules are hard: complexity aspects of sports competitions.
Discret. Appl. Math., 2001

A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem.
Proceedings of the Approximation, 2001

An Order-theoretic Framework for the Greedy Algorithm with Applications to the Core and Weber Set of Cooperative Games.
Order, 2000

On the core of ordered submodular cost games.
Math. Program., 2000

Note on the computational complexity of least core concepts for min-cost spanning tree games.
Math. Methods Oper. Res., 2000

A Greedy On-Line Algorithm for thek-Track Assignment Problem.
J. Algorithms, 1999

Approximate Core Allocation for Binpacking Games.
SIAM J. Discret. Math., 1998

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, 1998

Simplices by point-sliding and the Yamnitsky-Levin algorithm.
Math. Methods Oper. Res., 1997

A Characterization of Nonnegative Box-Greedy Matrices.
SIAM J. Discret. Math., 1996

Note on the computational complexity of j-radii of polytopes in Real<sup>n</sup>.
Math. Program., 1996

Submodular linear programs on forests.
Math. Program., 1996

On the communication complexity of <i>t</i> -intersection problems in generalized Boolean algebras.
Math. Methods Oper. Res., 1996

Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling.
Computing, 1996

On Approximately Fair Cost Allocation in Euclidean TSP Games
Electron. Colloquium Comput. Complex., 1995

Note On the Computational Complexity of j-Radii of Polytopes in R<sup>n</sup>
Electron. Colloquium Comput. Complex., 1995

On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games
Electron. Colloquium Comput. Complex., 1995

The Nucleon of Cooperative Games and an Algorithm for Matching Games
Electron. Colloquium Comput. Complex., 1995

On the average rank of LYM-sets.
Discret. Math., 1995

A Random Polynomial Time Algorithm for Well-rounding Convex Bodies.
Discret. Appl. Math., 1995

Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints.
Oper. Res., 1994

On some approximately balanced combinatorial cooperative games.
ZOR Methods Model. Oper. Res., 1993

On the Depth of Combinatorial Optimization Problems.
Discret. Appl. Math., 1993

Classes of feedforward neural networks and their circuit complexity.
Neural Networks, 1992

Learning Convex Bodies under Uniform Distribution.
Inf. Process. Lett., 1992

Some Convergence Results for Probabilistic Tabu Search.
INFORMS J. Comput., 1992

A Group-Theoretic Setting for Some Intersecting Sperner Families.
Comb. Probab. Comput., 1992

Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing (Emile Aarts and Jan Korst).
SIAM Rev., 1991

Some Order Dimension Bounds for Communication Complexity Problems.
Acta Informatica, 1991

Optimization and optimality test for the Max-Cut Problem.
ZOR Methods Model. Oper. Res., 1990

On adjoints and dual matroids.
J. Comb. Theory, Ser. B, 1990

On a Problem About Covering Lines by Squares.
Discret. Comput. Geom., 1990

A probabilistic analysis of the switching algorithm for the euclidean TSP.
Math. Program., 1989

On the Rate of Convergence of Some Stochastic Processes.
Math. Oper. Res., 1989

Matroid matching in pseudomodular lattices.
Comb., 1989

On the performance of on-line algorithms for partition problems.
Acta Cybern., 1989

On finite locally projective planar spaces.
J. Comb. Theory, Ser. A, 1988

On sticky matroids.
Discret. Math., 1988

Extension Equivalence of Oriented Matroids.
Eur. J. Comb., 1986

An efficient algorithm for solving a special class of LP's.
Computing, 1986

Adjoints of oriented matroids.
Comb., 1986

The behaviour of parsing time under grammar morphisms.
RAIRO Theor. Informatics Appl., 1978

Speicheroptimale Formelübersetzung.
Acta Informatica, 1977

Unternehmensforschung, 1966

Unternehmensforschung, 1965