Walter Kern

According to our database1, Walter Kern
  • authored at least 97 papers between 1965 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

2016
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

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

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

The Stable Fixtures Problem with Payments.
CoRR, 2015

The Stable Fixtures Problem with Payments.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

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

Note on non-uniform bin packing games.
Discrete Applied Mathematics, 2014

Improved Approximation Algorithms for a Bilevel Knapsack Problem.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

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

A note on perfect partial elimination.
Discrete Mathematics, 2013

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

2012
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

Solutions for the Stable Roommates Problem with Payments.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

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

Improved Taxation Rate for Bin Packing Games.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 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

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

A tight Analysis of Brown-Baker-Katseff Sequences for Online Strip Packing.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

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

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

2007
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. Meth. of OR, 2007

The Number of Tree Stars Is O *(1.357 k ).
Algorithmica, 2007

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

2006
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. Meth. of OR, 2006

A new relaxation method for the generalized minimum spanning tree problem.
European Journal of Operational Research, 2006

The number of tree stars is O*(1.357k).
Electronic Notes in Discrete Mathematics, 2006

Quadratic Programming and Combinatorial Minimum Weight Product Problems.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005
Online matching on a line.
Theor. Comput. Sci., 2005

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

2004
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.
Electronic Notes in Discrete Mathematics, 2004

The computational complexity of the elimination problem in generalized sports competitions.
Discrete Optimization, 2004

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

An Improved Local Search Algorithm for 3-SAT.
Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

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

Online Matching On a Line.
Electronic Notes in Discrete Mathematics, 2003

2001
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.
European Journal of Operational Research, 2001

Relaxation methods for the Generalized Minimum Spanning Tree Problem.
Electronic Notes in Discrete Mathematics, 2001

The new FIFA rules are hard: complexity aspects of sports competitions.
Discrete Applied Mathematics, 2001

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

2000
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. Meth. of OR, 2000

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

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

The nucleon of cooperative games and an algorithm for matching games.
Math. Program., 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

1997
Simplices by point-sliding and the Yamnitsky-Levin algorithm.
Math. Meth. of OR, 1997

On the complexity of testing membership in the core of min-cost spanning tree games.
Int. J. Game Theory, 1997

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

Note on the computational complexity of j-radii of polytopes in Realn.
Math. Program., 1996

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

On the communication complexity of t -intersection problems in generalized Boolean algebras.
Math. Meth. of OR, 1996

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

1995
On Approximately Fair Cost Allocation in Euclidean TSP Games
Electronic Colloquium on Computational Complexity (ECCC), 1995

Note On the Computational Complexity of j-Radii of Polytopes in Rn
Electronic Colloquium on Computational Complexity (ECCC), 1995

On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games
Electronic Colloquium on Computational Complexity (ECCC), 1995

The Nucleon of Cooperative Games and an Algorithm for Matching Games
Electronic Colloquium on Computational Complexity (ECCC), 1995

On the average rank of LYM-sets.
Discrete Mathematics, 1995

A Random Polynomial Time Algorithm for Well-rounding Convex Bodies.
Discrete Applied Mathematics, 1995

1994
Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints.
Operations Research, 1994

1993
On some approximately balanced combinatorial cooperative games.
ZOR - Meth. & Mod. of OR, 1993

On the Depth of Combinatorial Optimization Problems.
Discrete Applied Mathematics, 1993

1992
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 Journal on Computing, 1992

A Group-Theoretic Setting for Some Intersecting Sperner Families.
Combinatorics, Probability & Computing, 1992

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

1990
Optimization and optimality test for the Max-Cut Problem.
ZOR - Meth. & Mod. of OR, 1990

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

On a Problem About Covering Lines by Squares.
Discrete & Computational Geometry, 1990

1989
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.
Combinatorica, 1989

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

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

On sticky matroids.
Discrete Mathematics, 1988

1986
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.
Combinatorica, 1986

1978
The behaviour of parsing time under grammar morphisms.
ITA, 1978

1977
Speicheroptimale Formelübersetzung.
Acta Inf., 1977

1965
Buchbesprechung.
Unternehmensforschung, 1965


  Loading...