Walter Kern

Publication Activity (10 Years)

Years Active: 1965-2023
Publications (10 Years): 19

Top Venues

CoRR

Theor. Comput. Sci.

COCOON

AAMAS

University of Regensburg, Germany (PHD)

Education History

University of Regensburg, Germany

PHD

Publications

Márton Benedek, Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma
Partitioned Matching Games for International Kidney Exchange. CoRR (2023)
Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma
Computing Balanced Solutions for Large International Kidney Exchange Schemes. AAMAS (2022)
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
-free graphs. Theor. Comput. Sci. 898 (2022)
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR (2021)
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Disjoint Paths and Connected Subgraphs for H-Free Graphs. IWOCA (2021)
Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma
Computing Balanced Solutions for Large International Kidney Exchange Schemes. CoRR (2021)
Walter Kern, Daniël Paulusma
Contracting to a Longest Path in H-Free Graphs. ISAAC (2020)
Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma
Simple games versus weighted voting games: bounding the critical threshold value. Soc. Choice Welf. 54 (4) (2020)
Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma
Generalized Matching Games for International Kidney Exchange. AAMAS (2019)
Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma
Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value. CoRR (2018)
Ulrich Faigle, Walter Kern, Britta Peis
Greedy Oriented Flows. Algorithmica 80 (4) (2018)
Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma
Simple Games versus Weighted Voting Games. CoRR (2018)
Walter Kern, Daniël Paulusma
Contracting to a Longest Path in H-Free Graphs. CoRR (2018)
Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky
The stable fixtures problem with payments. Games Econ. Behav. 108 (2018)
Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma
Simple Games Versus Weighted Voting Games. SAGT (2018)
Jasper de Jong, Walter Kern, Berend Steenhuisen, Marc Uetz
The Asymptotic Price of Anarchy for k-uniform Congestion Games. WAOA (2017)
Walter Kern, Bodo Manthey
Approximating bounded-degree spanning trees and connected factors with leaves. Oper. Res. Lett. 45 (2) (2017)
Walter Kern, Bodo Manthey, Marc Uetz
Note on VCG vs. Price Raising for Matching Markets. CoRR (2016)
Xian Qiu, Walter Kern
Approximate core allocations and integrality gap for the bin packing game. Theor. Comput. Sci. 627 (2016)
Xian Qiu, Walter Kern
Improved approximation algorithms for a bilevel knapsack problem. Theor. Comput. Sci. 595 (2015)
Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky
The Stable Fixtures Problem with Payments. WG (2015)
Rolf Harren, Walter Kern
Improved Lower Bound for Online Strip Packing. Theory Comput. Syst. 56 (1) (2015)
Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky
The Stable Fixtures Problem with Payments. CoRR (2015)
Xian Qiu, Walter Kern
Improved Approximation Algorithms for a Bilevel Knapsack Problem. COCOON (2014)
Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
Solutions for the stable roommates problem with payments. Theor. Comput. Sci. 540 (2014)
Walter Kern, Xian Qiu
Note on non-uniform bin packing games. Discret. Appl. Math. 165 (2014)
Matthijs Bomhoff, Walter Kern, Georg Still
A note on perfect partial elimination. Discret. Math. 313 (14) (2013)
Walter Kern, Jacob Jan Paulus
A tight analysis of Brown-Baker-Katseff sequences for online strip packing. J. Comb. Optim. 26 (2) (2013)
Walter Kern, Xian Qiu
The 1/4-Core of the Uniform Bin Packing Game Is Nonempty. COCOON (2013)
Walter Kern, Xian Qiu
Integrality gap analysis for bin packing games. Oper. Res. Lett. 40 (5) (2012)
Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma
Solutions for the Stable Roommates Problem with Payments. WG (2012)
Ulrich Faigle, Walter Kern, Britta Peis
A ranking model for the greedy algorithm and discrete convexity. Math. Program. 132 (1-2) (2012)
Ulrich Faigle, Walter Kern, Britta Peis
Max-Flow on Regular Spaces CoRR (2012)
Matthijs Bomhoff, Walter Kern, Georg Still
On bounded block decomposition problems for under-specified systems of equations. J. Comput. Syst. Sci. 78 (1) (2012)
Péter Biró, Walter Kern, Daniël Paulusma
Computing solutions for matching games. Int. J. Game Theory 41 (1) (2012)
Walter Kern, Xian Qiu
Improved Taxation Rate for Bin Packing Games. TAPAS (2011)
Walter Kern, Xian Qiu
Improved Taxation Rate for Bin Packing Games. CTW (2011)
Ulrich Faigle, Walter Kern, Britta Peis
On Greedy and Submodular Matrices. TAPAS (2011)
Rolf Harren, Walter Kern
Improved Lower Bound for Online Strip Packing - (Extended Abstract). WAOA (2011)
Péter Biró, Walter Kern, Daniël Paulusma
On Solution Concepts for Matching Games. TAMC (2010)
Walter Kern
Book review. Oper. Res. Lett. 38 (5) (2010)
Walter Kern, Jacob Jan Paulus
A tight Analysis of Brown-Baker-Katseff Sequences for Online Strip Packing. CTW (2010)
Walter Kern, Christian Silberbauer, Christian Wolff
The Dimension Architecture: A New Approach to Resource Access. IEEE Softw. 27 (5) (2010)
Walter Kern, Daniël Paulusma
-Nucleolus of Flow Games. Math. Oper. Res. 34 (4) (2009)
Tim Nieberg, Johann L. Hurink, Walter Kern
Approximation schemes for wireless networks. ACM Trans. Algorithms 4 (4) (2008)
Bernhard Fuchs, Walter Kern, Xinhui Wang
Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees. Math. Methods Oper. Res. 66 (1) (2007)
Walter Kern, Xinhui Wang
On full components for Rectilinear Steiner tree. CTW (2007)
Walter Kern, Gerhard J. Woeginger
Quadratic programming and combinatorial minimum weight product problems. Math. Program. 110 (3) (2007)
Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang
Dynamic Programming for Minimum Steiner Trees. Theory Comput. Syst. 41 (3) (2007)
Bernhard Fuchs, Walter Kern, Xinhui Wang
). Algorithmica 49 (3) (2007)
Ulrich Faigle, Walter Kern, Jeroen Kuipers
Computing an Element in the Lexicographic Kernel of a Game. Math. Methods Oper. Res. 63 (3) (2006)
Walter Kern, Gerhard J. Woeginger
Quadratic Programming and Combinatorial Minimum Weight Product Problems. CIAC (2006)
Tobias Brüggemann, Johann L. Hurink, Walter Kern
Quality of move-optimal schedules for minimizing total weighted completion time. Oper. Res. Lett. 34 (5) (2006)
Bernhard Fuchs, Walter Kern, Xinhui Wang
). Electron. Notes Discret. Math. 25 (2006)
Petrica C. Pop, Walter Kern, Georg Still
A new relaxation method for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 170 (3) (2006)
Bernhard Fuchs, Winfried Hochstättler, Walter Kern
Online matching on a line. Theor. Comput. Sci. 332 (1-3) (2005)
Petrica C. Pop, Georg Still, Walter Kern
An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size. ACiD (2005)
Tobias Brüggemann, Walter Kern
An improved deterministic local search algorithm for 3-SAT. Theor. Comput. Sci. 329 (1-3) (2004)
Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern
Note on the game chromatic index of trees. Theor. Comput. Sci. 313 (3) (2004)
Tobias Brüggemann, Walter Kern
An Improved Local Search Algorithm for 3-SAT. CTW (2004)
Tobias Brüggemann, Walter Kern
An improved local search algorithm for 3-SAT. Electron. Notes Discret. Math. 17 (2004)
Walter Kern, Daniël Paulusma
The computational complexity of the elimination problem in generalized sports competitions. Discret. Optim. 1 (2) (2004)
Tim Nieberg, Johann L. Hurink, Walter Kern
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. WG (2004)
Bernhard Fuchs, Winfried Hochstättler, Walter Kern
Online Matching On a Line. Electron. Notes Discret. Math. 13 (2003)
Walter Kern, Daniël Paulusma
Matching Games: The Least Core and the Nucleolus. Math. Oper. Res. 28 (2) (2003)
Ulrich Faigle, Walter Kern, Jeroen Kuipers
On the computation of the nucleolus of a cooperative game. Int. J. Game Theory 30 (1) (2001)
Marcel Hunting, Ulrich Faigle, Walter Kern
A Lagrangian relaxation approach to the edge-weighted clique problem. Eur. J. Oper. Res. 131 (1) (2001)
A. F. Dumb, Walter Kern
A simple dual ascent algorithm for the multilevel facility location problem. Electron. Notes Discret. Math. 8 (2001)
Walter Kern, Daniël Paulusma
The new FIFA rules are hard: complexity aspects of sports competitions. Discret. Appl. Math. 108 (3) (2001)
Adriana Felicia Bumb, Walter Kern
A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem. RANDOM-APPROX (2001)
Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle
Relaxation methods for the Generalized Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 8 (2001)
Ulrich Faigle, Walter Kern
On the core of ordered submodular cost games. Math. Program. 87 (3) (2000)
Ulrich Faigle, Walter Kern
An Order-theoretic Framework for the Greedy Algorithm with Applications to the Core and Weber Set of Cooperative Games. Order 17 (4) (2000)
Ulrich Faigle, Walter Kern, Daniël Paulusma
Note on the computational complexity of least core concepts for min-cost spanning tree games. Math. Methods Oper. Res. 52 (1) (2000)
Ulrich Faigle, Walter Kern, Willem M. Nawijn
A Greedy On-Line Algorithm for thek-Track Assignment Problem. J. Algorithms 31 (1) (1999)
Ulrich Faigle, Walter Kern
Approximate Core Allocation for Binpacking Games. SIAM J. Discret. Math. 11 (3) (1998)
Ulrich Faigle, Walter Kern, Jeroen Kuipers
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 27 (3) (1998)
Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler
The nucleon of cooperative games and an algorithm for matching games. Math. Program. 83 (1998)
Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler
On the complexity of testing membership in the core of min-cost spanning tree games. Int. J. Game Theory 26 (3) (1997)
Ulrich Faigle, Marcel Hunting, Walter Kern, R. Prakash, K. J. Supowit
Simplices by point-sliding and the Yamnitsky-Levin algorithm. Math. Methods Oper. Res. 46 (1) (1997)
Ulrich Faigle, Walter Kern, Martin Streng
. Math. Program. 73 (1996)
Ulrich Faigle, Walter Kern
Submodular linear programs on forests. Math. Program. 72 (1996)
Ulrich Faigle, Walter Kern, Boris Spieker
-intersection problems in generalized Boolean algebras. Math. Methods Oper. Res. 43 (2) (1996)
Ulrich Faigle, Alan J. Hoffman, Walter Kern
A Characterization of Nonnegative Box-Greedy Matrices. SIAM J. Discret. Math. 9 (1) (1996)
Ulrich Faigle, Renate Garbe, Walter Kern
Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling. Computing 56 (2) (1996)
Ulrich Faigle, Noud Gademann, Walter Kern
A Random Polynomial Time Algorithm for Well-rounding Convex Bodies. Discret. Appl. Math. 58 (2) (1995)
Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
On Approximately Fair Cost Allocation in Euclidean TSP Games Electron. Colloquium Comput. Complex. 2 (16) (1995)
Péter L. Erdös, Ulrich Faigle, Walter Kern
On the average rank of LYM-sets. Discret. Math. 144 (1-3) (1995)
Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games Electron. Colloquium Comput. Complex. 2 (12) (1995)
Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
The Nucleon of Cooperative Games and an Algorithm for Matching Games Electron. Colloquium Comput. Complex. 2 (7) (1995)
Ulrich Faigle, Walter Kern, Martin Streng
Electron. Colloquium Comput. Complex. 2 (14) (1995)
Ulrich Faigle, Walter Kern
Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints. Oper. Res. 42 (4) (1994)
Walter Kern
On the Depth of Combinatorial Optimization Problems. Discret. Appl. Math. 43 (2) (1993)
Ulrich Faigle, Walter Kern
On some approximately balanced combinatorial cooperative games. ZOR Methods Model. Oper. Res. 38 (2) (1993)
Walter Kern
Learning Convex Bodies under Uniform Distribution. Inf. Process. Lett. 43 (1) (1992)
Ulrich Faigle, Walter Kern
Some Convergence Results for Probabilistic Tabu Search. INFORMS J. Comput. 4 (1) (1992)
John Shawe-Taylor, Martin Anthony, Walter Kern
Classes of feedforward neural networks and their circuit complexity. Neural Networks 5 (6) (1992)
Péter L. Erdös, Ulrich Faigle, Walter Kern
A Group-Theoretic Setting for Some Intersecting Sperner Families. Comb. Probab. Comput. 1 (1992)
Ulrich Faigle, Walter Kern
Some Order Dimension Bounds for Communication Complexity Problems. Acta Informatica 28 (6) (1991)
Walter Kern
Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing (Emile Aarts and Jan Korst). SIAM Rev. 33 (2) (1991)

Walter Kern.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Walter Kern