Walter Kern

119 papers A 2B 7C 8Misc 2Journal 95Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
Partitioned matching games for international kidney exchange.
Math. Program.
Márton Benedek, Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma
2023 J jnl
Partitioned Matching Games for International Kidney Exchange.
CoRR
Márton Benedek, Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma
2022 A conf
Computing Balanced Solutions for Large International Kidney Exchange Schemes.
AAMAS
Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma
2022 J jnl
Disjoint paths and connected subgraphs for
Theor. Comput. Sci.
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2021 J jnl
Computing Balanced Solutions for Large International Kidney Exchange Schemes.
CoRR
Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma
2021 C conf
Disjoint Paths and Connected Subgraphs for H-Free Graphs.
IWOCA
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2021 J jnl
Disjoint Paths and Connected Subgraphs for H-Free Graphs.
CoRR
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2020 B conf
Contracting to a Longest Path in H-Free Graphs.
ISAAC
Walter Kern, Daniël Paulusma
2020 J jnl
Simple games versus weighted voting games: bounding the critical threshold value.
Soc. Choice Welf.
Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma
2019 A conf
Generalized Matching Games for International Kidney Exchange.
AAMAS
Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma
2018 J jnl
Contracting to a Longest Path in H-Free Graphs.
CoRR
Walter Kern, Daniël Paulusma
2018 J jnl
Greedy Oriented Flows.
Algorithmica
Ulrich Faigle, Walter Kern, Britta Peis
2018 B conf
Simple Games Versus Weighted Voting Games.
SAGT
Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma
2018 J jnl
Simple Games versus Weighted Voting Games.
CoRR
Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma
2018 J jnl
Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value.
CoRR
Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma
2018 J jnl
The stable fixtures problem with payments.
Games Econ. Behav.
Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky
2017 J jnl
Approximating bounded-degree spanning trees and connected factors with leaves.
Oper. Res. Lett.
Walter Kern, Bodo Manthey
2017 B conf
The Asymptotic Price of Anarchy for k-uniform Congestion Games.
WAOA
Jasper de Jong, Walter Kern, Berend Steenhuisen, Marc Uetz
2016 J jnl
Approximate core allocations and integrality gap for the bin packing game.
Theor. Comput. Sci.
Xian Qiu, Walter Kern
2016 J jnl
Note on VCG vs. Price Raising for Matching Markets.
CoRR
Walter Kern, Bodo Manthey, Marc Uetz
2016 — —
Patternbasierte Abbildung von Rich-Client-Aspekten auf webbasierte Systeme im Kontext der Barrierefreiheitsanforderungen im Bereich E-Governement.
Walter Kern
2015 J jnl
Improved Lower Bound for Online Strip Packing.
Theory Comput. Syst.
Rolf Harren, Walter Kern
2015 J jnl
Improved approximation algorithms for a bilevel knapsack problem.
Theor. Comput. Sci.
Xian Qiu, Walter Kern
2015 B conf
The Stable Fixtures Problem with Payments.
WG
Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky
2015 J jnl
The Stable Fixtures Problem with Payments.
CoRR
Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky
2014 Misc conf
Improved Approximation Algorithms for a Bilevel Knapsack Problem.
COCOON
Xian Qiu, Walter Kern
2014 J jnl
Note on non-uniform bin packing games.
Discret. Appl. Math.
Walter Kern, Xian Qiu
2014 J jnl
Solutions for the stable roommates problem with payments.
Theor. Comput. Sci.
Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
2013 J jnl
A note on perfect partial elimination.
Discret. Math.
Matthijs Bomhoff, Walter Kern, Georg Still
2013 J jnl
A tight analysis of Brown-Baker-Katseff sequences for online strip packing.
J. Comb. Optim.
Walter Kern, Jacob Jan Paulus
2013 Misc conf
The 1/4-Core of the Uniform Bin Packing Game Is Nonempty.
COCOON
Walter Kern, Xian Qiu
2012 J jnl
A ranking model for the greedy algorithm and discrete convexity.
Math. Program.
Ulrich Faigle, Walter Kern, Britta Peis
2012 J jnl
Computing solutions for matching games.
Int. J. Game Theory
Péter Biró, Walter Kern, Daniël Paulusma
2012 J jnl
Integrality gap analysis for bin packing games.
Oper. Res. Lett.
Walter Kern, Xian Qiu
2012 J jnl
Max-Flow on Regular Spaces
CoRR
Ulrich Faigle, Walter Kern, Britta Peis
2012 J jnl
On bounded block decomposition problems for under-specified systems of equations.
J. Comput. Syst. Sci.
Matthijs Bomhoff, Walter Kern, Georg Still
2012 B conf
Solutions for the Stable Roommates Problem with Payments.
WG
Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
2011 B conf
Improved Lower Bound for Online Strip Packing - (Extended Abstract).
WAOA
Rolf Harren, Walter Kern
2011 C conf
Improved Taxation Rate for Bin Packing Games.
CTW
Walter Kern, Xian Qiu
2011 — conf
Improved Taxation Rate for Bin Packing Games.
TAPAS
Walter Kern, Xian Qiu
2011 — conf
On Greedy and Submodular Matrices.
TAPAS
Ulrich Faigle, Walter Kern, Britta Peis
2010 C conf
A tight Analysis of Brown-Baker-Katseff Sequences for Online Strip Packing.
CTW
Walter Kern, Jacob Jan Paulus
2010 J jnl
Book review.
Oper. Res. Lett.
Walter Kern
2010 C conf
On Solution Concepts for Matching Games.
TAMC
Péter Biró, Walter Kern, Daniël Paulusma
2010 J jnl
The Dimension Architecture: A New Approach to Resource Access.
IEEE Softw.
Walter Kern, Christian Silberbauer, Christian Wolff
2009 J jnl
On the Core and
Math. Oper. Res.
Walter Kern, Daniël Paulusma
2008 J jnl
Approximation schemes for wireless networks.
ACM Trans. Algorithms
Tim Nieberg, Johann L. Hurink, Walter Kern
2007 J jnl
Dynamic Programming for Minimum Steiner Trees.
Theory Comput. Syst.
Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang
2007 C conf
On full components for Rectilinear Steiner tree.
CTW
Walter Kern, Xinhui Wang
2007 J jnl
Quadratic programming and combinatorial minimum weight product problems.
Math. Program.
Walter Kern, Gerhard J. Woeginger
2007 C ed.
Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, The Netherlands, 29-31 May, 2007
CTW
Johann L. Hurink, Walter Kern, Gerhard F. Post, Georg Still
2007 J jnl
Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees.
Math. Methods Oper. Res.
Bernhard Fuchs, Walter Kern, Xinhui Wang
2007 J jnl
The Number of Tree Stars Is
Algorithmica
Bernhard Fuchs, Walter Kern, Xinhui Wang
2006 J jnl
A new relaxation method for the generalized minimum spanning tree problem.
Eur. J. Oper. Res.
Petrica C. Pop, Walter Kern, Georg Still
2006 J jnl
Computing an Element in the Lexicographic Kernel of a Game.
Math. Methods Oper. Res.
Ulrich Faigle, Walter Kern, Jeroen Kuipers
2006 C conf
Quadratic Programming and Combinatorial Minimum Weight Product Problems.
CIAC
Walter Kern, Gerhard J. Woeginger
2006 J jnl
Quality of move-optimal schedules for minimizing total weighted completion time.
Oper. Res. Lett.
Tobias Brüggemann, Johann L. Hurink, Walter Kern
2006 J jnl
The number of tree stars is O
Electron. Notes Discret. Math.
Bernhard Fuchs, Walter Kern, Xinhui Wang
2005 — conf
An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size.
ACiD
Petrica C. Pop, Georg Still, Walter Kern
2005 J jnl
Online matching on a line.
Theor. Comput. Sci.
Bernhard Fuchs, Winfried Hochstättler, Walter Kern
2004 B conf
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs.
WG
Tim Nieberg, Johann L. Hurink, Walter Kern
2004 C conf
An Improved Local Search Algorithm for 3-SAT.
CTW
Tobias Brüggemann, Walter Kern
2004 J jnl
An improved deterministic local search algorithm for 3-SAT.
Theor. Comput. Sci.
Tobias Brüggemann, Walter Kern
2004 J jnl
An improved local search algorithm for 3-SAT.
Electron. Notes Discret. Math.
Tobias Brüggemann, Walter Kern
2004 J jnl
Note on the game chromatic index of trees.
Theor. Comput. Sci.
Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern
2004 J jnl
The computational complexity of the elimination problem in generalized sports competitions.
Discret. Optim.
Walter Kern, Daniël Paulusma
2003 J jnl
Matching Games: The Least Core and the Nucleolus.
Math. Oper. Res.
Walter Kern, Daniël Paulusma
2003 J jnl
Online Matching On a Line.
Electron. Notes Discret. Math.
Bernhard Fuchs, Winfried Hochstättler, Walter Kern
2001 J jnl
A Lagrangian relaxation approach to the edge-weighted clique problem.
Eur. J. Oper. Res.
Marcel Hunting, Ulrich Faigle, Walter Kern
2001 — conf
A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem.
RANDOM-APPROX
Adriana Felicia Bumb, Walter Kern
2001 J jnl
A simple dual ascent algorithm for the multilevel facility location problem.
Electron. Notes Discret. Math.
A. F. Dumb, Walter Kern
2001 J jnl
On the computation of the nucleolus of a cooperative game.
Int. J. Game Theory
Ulrich Faigle, Walter Kern, Jeroen Kuipers
2001 J jnl
Relaxation methods for the Generalized Minimum Spanning Tree Problem.
Electron. Notes Discret. Math.
Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle
2001 J jnl
The new FIFA rules are hard: complexity aspects of sports competitions.
Discret. Appl. Math.
Walter Kern, Daniël Paulusma
2000 J jnl
An Order-theoretic Framework for the Greedy Algorithm with Applications to the Core and Weber Set of Cooperative Games.
Order
Ulrich Faigle, Walter Kern
2000 J jnl
Note on the computational complexity of least core concepts for min-cost spanning tree games.
Math. Methods Oper. Res.
Ulrich Faigle, Walter Kern, Daniël Paulusma
2000 J jnl
On the core of ordered submodular cost games.
Math. Program.
Ulrich Faigle, Walter Kern
1999 J jnl
A Greedy On-Line Algorithm for thek-Track Assignment Problem.
J. Algorithms
Ulrich Faigle, Walter Kern, Willem M. Nawijn
1998 J jnl
Approximate Core Allocation for Binpacking Games.
SIAM J. Discret. Math.
Ulrich Faigle, Walter Kern
1998 J jnl
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
Ulrich Faigle, Walter Kern, Jeroen Kuipers
1998 J jnl
The nucleon of cooperative games and an algorithm for matching games.
Math. Program.
Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler
1997 J jnl
On the complexity of testing membership in the core of min-cost spanning tree games.
Int. J. Game Theory
Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler
1997 J jnl
Simplices by point-sliding and the Yamnitsky-Levin algorithm.
Math. Methods Oper. Res.
Ulrich Faigle, Marcel Hunting, Walter Kern, Ravi Prakash, K. J. Supowit
1996 J jnl
A Characterization of Nonnegative Box-Greedy Matrices.
SIAM J. Discret. Math.
Ulrich Faigle, Alan J. Hoffman, Walter Kern
1996 J jnl
Note on the computational complexity of j-radii of polytopes in Real
Math. Program.
Ulrich Faigle, Walter Kern, Martin Streng
1996 J jnl
On the communication complexity of
Math. Methods Oper. Res.
Ulrich Faigle, Walter Kern, Boris Spieker
1996 J jnl
Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling.
Computing
Ulrich Faigle, Renate Garbe, Walter Kern
1996 J jnl
Submodular linear programs on forests.
Math. Program.
Ulrich Faigle, Walter Kern
1995 J jnl
A Random Polynomial Time Algorithm for Well-rounding Convex Bodies.
Discret. Appl. Math.
Ulrich Faigle, Noud Gademann, Walter Kern
1995 J jnl
Note On the Computational Complexity of j-Radii of Polytopes in R
Electron. Colloquium Comput. Complex.
Ulrich Faigle, Walter Kern, Martin Streng
1995 J jnl
On Approximately Fair Cost Allocation in Euclidean TSP Games
Electron. Colloquium Comput. Complex.
Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
1995 J jnl
On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games
Electron. Colloquium Comput. Complex.
Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
1995 J jnl
On the average rank of LYM-sets.
Discret. Math.
Péter L. Erdös, Ulrich Faigle, Walter Kern
1995 J jnl
The Nucleon of Cooperative Games and an Algorithm for Matching Games
Electron. Colloquium Comput. Complex.
Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
1994 J jnl
Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints.
Oper. Res.
Ulrich Faigle, Walter Kern
1993 J jnl
On some approximately balanced combinatorial cooperative games.
ZOR Methods Model. Oper. Res.
Ulrich Faigle, Walter Kern
1993 J jnl
On the Depth of Combinatorial Optimization Problems.
Discret. Appl. Math.
Walter Kern
1992 J jnl
A Group-Theoretic Setting for Some Intersecting Sperner Families.
Comb. Probab. Comput.
Péter L. Erdös, Ulrich Faigle, Walter Kern
1992 J jnl
Classes of feedforward neural networks and their circuit complexity.
Neural Networks
John Shawe-Taylor, Martin Anthony, Walter Kern
1992 J jnl
Learning Convex Bodies under Uniform Distribution.
Inf. Process. Lett.
Walter Kern
1992 J jnl
Some Convergence Results for Probabilistic Tabu Search.
INFORMS J. Comput.
Ulrich Faigle, Walter Kern
1991 J jnl
Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing (Emile Aarts and Jan Korst).
SIAM Rev.
Walter Kern
1991 J jnl
Some Order Dimension Bounds for Communication Complexity Problems.
Acta Informatica
Ulrich Faigle, Walter Kern
1990 J jnl
On a Problem About Covering Lines by Squares.
Discret. Comput. Geom.
Walter Kern, Alfred Wanka
1990 J jnl
On adjoints and dual matroids.
J. Comb. Theory B
Marion Alfter, Walter Kern, Alfred Wanka
1990 J jnl
Optimization and optimality test for the Max-Cut Problem.
ZOR Methods Model. Oper. Res.
Christoph Hohmann, Walter Kern
1989 J jnl
A probabilistic analysis of the switching algorithm for the euclidean TSP.
Math. Program.
Walter Kern
1989 J jnl
Matroid matching in pseudomodular lattices.
Comb.
Winfried Hochstättler, Walter Kern
1989 J jnl
On the Rate of Convergence of Some Stochastic Processes.
Math. Oper. Res.
Walter Kern
1989 J jnl
On the performance of on-line algorithms for partition problems.
Acta Cybern.
Ulrich Faigle, Walter Kern, György Turán
1988 J jnl
On finite locally projective planar spaces.
J. Comb. Theory A
Walter Kern
1988 J jnl
On sticky matroids.
Discret. Math.
Achim Bachem, Walter Kern
1986 J jnl
Adjoints of oriented matroids.
Comb.
Achim Bachem, Walter Kern
1986 J jnl
An efficient algorithm for solving a special class of LP's.
Computing
Walter Kern
1986 J jnl
Extension Equivalence of Oriented Matroids.
Eur. J. Comb.
Achim Bachem, Walter Kern
1978 J jnl
The behaviour of parsing time under grammar morphisms.
RAIRO Theor. Informatics Appl.
J. Keklikoglou, Hermann K.-G. Walter, Walter Kern
1977 J jnl
Speicheroptimale Formelübersetzung.
Acta Informatica
Walter Kern
1966 J jnl
Buchbesprechungen.
Unternehmensforschung
Hasso von Falkenhausen, Hans Peter Amann, K. Dietz, H. Rüst, P. Roos, Walter Kern, D. Schneider, K. Neumann, G. Dahmen
1965 J jnl
Buchbesprechung.
Unternehmensforschung
Walter Kern