Walter Kern

According to our database, Walter Kern authored at least 101 papers between 1965 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Partitioned Matching Games for International Kidney Exchange.

Márton Benedek, Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma

CoRR, 2023

2022

Disjoint paths and connected subgraphs for <i>H</i>-free graphs.

Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Theor. Comput. Sci., 2022

Computing Balanced Solutions for Large International Kidney Exchange Schemes.

Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Disjoint Paths and Connected Subgraphs for H-Free Graphs.

Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

Simple games versus weighted voting games: bounding the critical threshold value.

Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma

Soc. Choice Welf., 2020

Contracting to a Longest Path in H-Free Graphs.

Walter Kern, Daniël Paulusma

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

Generalized Matching Games for International Kidney Exchange.

Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

The stable fixtures problem with payments.

Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky

Games Econ. Behav., 2018

Greedy Oriented Flows.

Ulrich Faigle, Walter Kern, Britta Peis

Algorithmica, 2018

Simple Games Versus Weighted Voting Games.

Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017

Approximating bounded-degree spanning trees and connected factors with leaves.

Walter Kern, Bodo Manthey

Oper. Res. Lett., 2017

The Asymptotic Price of Anarchy for k-uniform Congestion Games.

Jasper de Jong, Walter Kern, Berend Steenhuisen, Marc Uetz

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

2016

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

Walter Kern

PhD thesis, 2016

Approximate core allocations and integrality gap for the bin packing game.

Xian Qiu, Walter Kern

Theor. Comput. Sci., 2016

Note on VCG vs. Price Raising for Matching Markets.

Walter Kern, Bodo Manthey, Marc Uetz

CoRR, 2016

2015

Improved approximation algorithms for a bilevel knapsack problem.

Xian Qiu, Walter Kern

Theor. Comput. Sci., 2015

Improved Lower Bound for Online Strip Packing.

Rolf Harren, Walter Kern

Theory Comput. Syst., 2015

2014

Solutions for the stable roommates problem with payments.

Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma

Theor. Comput. Sci., 2014

Note on non-uniform bin packing games.

Walter Kern, Xian Qiu

Discret. Appl. Math., 2014

2013

A tight analysis of Brown-Baker-Katseff sequences for online strip packing.

Walter Kern, Jacob Jan Paulus

J. Comb. Optim., 2013

A note on perfect partial elimination.

Matthijs Bomhoff, Walter Kern, Georg Still

Discret. Math., 2013

The 1/4-Core of the Uniform Bin Packing Game Is Nonempty.

Walter Kern, Xian Qiu

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Integrality gap analysis for bin packing games.

Walter Kern, Xian Qiu

Oper. Res. Lett., 2012

A ranking model for the greedy algorithm and discrete convexity.

Ulrich Faigle, Walter Kern, Britta Peis

Math. Program., 2012

On bounded block decomposition problems for under-specified systems of equations.

Matthijs Bomhoff, Walter Kern, Georg Still

J. Comput. Syst. Sci., 2012

Computing solutions for matching games.

Péter Biró, Walter Kern, Daniël Paulusma

Int. J. Game Theory, 2012

Max-Flow on Regular Spaces

Ulrich Faigle, Walter Kern, Britta Peis

CoRR, 2012

2011

Improved Lower Bound for Online Strip Packing - (Extended Abstract).

Rolf Harren, Walter Kern

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

On Greedy and Submodular Matrices.

Ulrich Faigle, Walter Kern, Britta Peis

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Improved Taxation Rate for Bin Packing Games.

Walter Kern, Xian Qiu

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

The Dimension Architecture: A New Approach to Resource Access.

Walter Kern, Christian Silberbauer, Christian Wolff

IEEE Softw., 2010

Book review.

Walter Kern

Oper. Res. Lett., 2010

On Solution Concepts for Matching Games.

Péter Biró, Walter Kern, Daniël Paulusma

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

2009

On the Core and <i>f</i>-Nucleolus of Flow Games.

Walter Kern, Daniël Paulusma

Math. Oper. Res., 2009

2008

Approximation schemes for wireless networks.

Tim Nieberg, Johann L. Hurink, Walter Kern

ACM Trans. Algorithms, 2008

2007

Dynamic Programming for Minimum Steiner Trees.

Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang

Theory Comput. Syst., 2007

Quadratic programming and combinatorial minimum weight product problems.

Walter Kern, Gerhard J. Woeginger

Math. Program., 2007

Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees.

Bernhard Fuchs, Walter Kern, Xinhui Wang

Math. Methods Oper. Res., 2007

The Number of Tree Stars Is <i>O</i> ^*(1.357^<i>k</i>).

Bernhard Fuchs, Walter Kern, Xinhui Wang

Algorithmica, 2007

On full components for Rectilinear Steiner tree.

Walter Kern, Xinhui Wang

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.

Tobias Brüggemann, Johann L. Hurink, Walter Kern

Oper. Res. Lett., 2006

Computing an Element in the Lexicographic Kernel of a Game.

Ulrich Faigle, Walter Kern, Jeroen Kuipers

Math. Methods Oper. Res., 2006

A new relaxation method for the generalized minimum spanning tree problem.

Petrica C. Pop, Walter Kern, Georg Still

Eur. J. Oper. Res., 2006

The number of tree stars is O^*(1.357^k).

Bernhard Fuchs, Walter Kern, Xinhui Wang

Electron. Notes Discret. Math., 2006

2005

Online matching on a line.

Bernhard Fuchs, Winfried Hochstättler, Walter Kern

Theor. Comput. Sci., 2005

An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size.

Petrica C. Pop, Georg Still, Walter Kern

Proceedings of the Algorithms and Complexity in Durham 2005, 2005

2004

Note on the game chromatic index of trees.

Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern

Theor. Comput. Sci., 2004

An improved deterministic local search algorithm for 3-SAT.

Tobias Brüggemann, Walter Kern

Theor. Comput. Sci., 2004

An improved local search algorithm for 3-SAT.

Tobias Brüggemann, Walter Kern

Electron. Notes Discret. Math., 2004

The computational complexity of the elimination problem in generalized sports competitions.

Walter Kern, Daniël Paulusma

Discret. Optim., 2004

A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs.

Tim Nieberg, Johann L. Hurink, Walter Kern

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003

Matching Games: The Least Core and the Nucleolus.

Walter Kern, Daniël Paulusma

Math. Oper. Res., 2003

2001

On the computation of the nucleolus of a cooperative game.

Ulrich Faigle, Walter Kern, Jeroen Kuipers

Int. J. Game Theory, 2001

A Lagrangian relaxation approach to the edge-weighted clique problem.

Marcel Hunting, Ulrich Faigle, Walter Kern

Eur. J. Oper. Res., 2001

Relaxation methods for the Generalized Minimum Spanning Tree Problem.

Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle

Electron. Notes Discret. Math., 2001

A simple dual ascent algorithm for the multilevel facility location problem.

A. F. Dumb, Walter Kern

Electron. Notes Discret. Math., 2001

The new FIFA rules are hard: complexity aspects of sports competitions.

Walter Kern, Daniël Paulusma

Discret. Appl. Math., 2001

A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem.

Adriana Felicia Bumb, Walter Kern

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.

Ulrich Faigle, Walter Kern

Order, 2000

On the core of ordered submodular cost games.

Ulrich Faigle, Walter Kern

Math. Program., 2000

Note on the computational complexity of least core concepts for min-cost spanning tree games.

Ulrich Faigle, Walter Kern, Daniël Paulusma

Math. Methods Oper. Res., 2000

1999

A Greedy On-Line Algorithm for thek-Track Assignment Problem.

Ulrich Faigle, Walter Kern, Willem M. Nawijn

J. Algorithms, 1999

1998

Approximate Core Allocation for Binpacking Games.

Ulrich Faigle, Walter Kern

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.

Ulrich Faigle, Walter Kern, Jeroen Kuipers

Int. J. Game Theory, 1998

1997

Simplices by point-sliding and the Yamnitsky-Levin algorithm.

Ulrich Faigle, Marcel Hunting, Walter Kern, Ravi Prakash, K. J. Supowit

Math. Methods Oper. Res., 1997

On the complexity of testing membership in the core of min-cost spanning tree games.

Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler

Int. J. Game Theory, 1997

1996

A Characterization of Nonnegative Box-Greedy Matrices.

Ulrich Faigle, Alan J. Hoffman, Walter Kern

SIAM J. Discret. Math., 1996

Note on the computational complexity of j-radii of polytopes in Realⁿ.

Ulrich Faigle, Walter Kern, Martin Streng

Math. Program., 1996

Submodular linear programs on forests.

Ulrich Faigle, Walter Kern

Math. Program., 1996

On the communication complexity of <i>t</i> -intersection problems in generalized Boolean algebras.

Ulrich Faigle, Walter Kern, Boris Spieker

Math. Methods Oper. Res., 1996

Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling.

Ulrich Faigle, Renate Garbe, Walter Kern

Computing, 1996

1995

On Approximately Fair Cost Allocation in Euclidean TSP Games

Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern

Electron. Colloquium Comput. Complex., 1995

Note On the Computational Complexity of j-Radii of Polytopes in Rⁿ

Ulrich Faigle, Walter Kern, Martin Streng

Electron. Colloquium Comput. Complex., 1995

The Nucleon of Cooperative Games and an Algorithm for Matching Games

Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern

Electron. Colloquium Comput. Complex., 1995

On the average rank of LYM-sets.

Péter L. Erdös, Ulrich Faigle, Walter Kern

Discret. Math., 1995

A Random Polynomial Time Algorithm for Well-rounding Convex Bodies.

Ulrich Faigle, Noud Gademann, Walter Kern

Discret. Appl. Math., 1995

1994

Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints.

Ulrich Faigle, Walter Kern

Oper. Res., 1994

1993

On some approximately balanced combinatorial cooperative games.

Ulrich Faigle, Walter Kern

ZOR Methods Model. Oper. Res., 1993

On the Depth of Combinatorial Optimization Problems.

Walter Kern

Discret. Appl. Math., 1993

1992

Classes of feedforward neural networks and their circuit complexity.

John Shawe-Taylor, Martin Anthony, Walter Kern

Neural Networks, 1992

Learning Convex Bodies under Uniform Distribution.

Walter Kern

Inf. Process. Lett., 1992

Some Convergence Results for Probabilistic Tabu Search.

Ulrich Faigle, Walter Kern

INFORMS J. Comput., 1992

A Group-Theoretic Setting for Some Intersecting Sperner Families.

Péter L. Erdös, Ulrich Faigle, Walter Kern

Comb. Probab. Comput., 1992

1991

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

Walter Kern

SIAM Rev., 1991

Some Order Dimension Bounds for Communication Complexity Problems.

Ulrich Faigle, Walter Kern

Acta Informatica, 1991

1990

Optimization and optimality test for the Max-Cut Problem.

Christoph Hohmann, Walter Kern

ZOR Methods Model. Oper. Res., 1990

On adjoints and dual matroids.

Marion Alfter, Walter Kern, Alfred Wanka

J. Comb. Theory B, 1990

On a Problem About Covering Lines by Squares.

Walter Kern, Alfred Wanka

Discret. Comput. Geom., 1990

1989

A probabilistic analysis of the switching algorithm for the euclidean TSP.

Walter Kern

Math. Program., 1989

On the Rate of Convergence of Some Stochastic Processes.

Walter Kern

Math. Oper. Res., 1989

Matroid matching in pseudomodular lattices.

Winfried Hochstättler, Walter Kern

Comb., 1989

On the performance of on-line algorithms for partition problems.

Ulrich Faigle, Walter Kern, György Turán

Acta Cybern., 1989

1988

On finite locally projective planar spaces.

Walter Kern

J. Comb. Theory A, 1988

On sticky matroids.

Achim Bachem, Walter Kern

Discret. Math., 1988

1986

Extension Equivalence of Oriented Matroids.

Achim Bachem, Walter Kern

Eur. J. Comb., 1986

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

Walter Kern

Computing, 1986

Adjoints of oriented matroids.

Achim Bachem, Walter Kern

Comb., 1986

1978

The behaviour of parsing time under grammar morphisms.

J. Keklikoglou, Hermann K.-G. Walter, Walter Kern

RAIRO Theor. Informatics Appl., 1978

1977

Speicheroptimale Formelübersetzung.

Walter Kern

Acta Informatica, 1977

1966

Buchbesprechungen.

Hasso von Falkenhausen, Hans Peter Amann, K. Dietz, H. Rüst, P. Roos, Walter Kern, D. Schneider, K. Neumann, G. Dahmen

Unternehmensforschung, 1966

1965

Buchbesprechung.

Walter Kern

Unternehmensforschung, 1965