2026 Walter Kern: Mathematics Researcher – H-Index, Publications & Awards

Overview

Walter Kern was affiliated with the University of Twente in the Netherlands. Their research primarily contributed to the field of Computer Science, with a strong focus on Computational Theory and Mathematics.

The main areas of study covered in their work included:

Computational Theory and Mathematics
Economics and Econometrics
Artificial Intelligence
Public Health, Environmental and Occupational Health
Computer Networks and Communications

The research topics frequently addressed by Walter Kern comprised:

Advanced Graph Theory Research
Complexity and Algorithms in Graphs
Graph Labeling and Dimension Problems
Game Theory and Voting Systems
Privacy-Preserving Technologies in Data
Organ Donation and Transplantation
Optimization and Search Problems

Publications by Walter Kern appeared in several notable venues. These included:

arXiv (Cornell University)
Theoretical Computer Science
Mathematical Programming
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Among Walter Kern's recent papers were:

"Disjoint paths and connected subgraphs for H-free graphs," 2021, published in Theoretical Computer Science
"Contracting to a Longest Path in H-Free Graphs," 2020, published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
"Disjoint Paths and Connected Subgraphs for H-Free Graphs," 2021, published on arXiv (Cornell University)

Frequent collaborators that Walter Kern worked with included:

Daniël Paulusma
Barnaby Martin
Siani Smith
Erik Jan van Leeuwen
Márton Benedek

Best Publications

The Shapley value for cooperative games under precedence constraints

U. Faigle;Walter Kern

321
Citations
On the performance of on-line algorithms for partition problems

U. Faigle;W. Kern;G. Turan

233
Citations
On the game chromatic number of some classes of graphs

U. Faigle;Walter Kern;H. Kierstead;W.T. Trotter

220
Citations
Some convergence results on probabilistic Tabu Search

Ulrich Faigle;Walter Kern

160
Citations
Linear Programming Duality

Achim Bachem;Walter Kern

144
Citations
An improved deterministic local search algorithm for 3-SAT

Tobias Brueggemann;Walter Kern

120
Citations
Algorithmic principles of mathematical programming

Ulrich Faigle;Walter Kern;Georg Still

119
Citations
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

110
Citations
Matching games: the least core and the nucleolus

Walter Kern;Daniël Paulusma

106
Citations
On some approximately balanced combinatorial cooperative games

U. Faigle;Walter Kern

95
Citations
The generalized minimum spanning tree problem

P.C. Pop;Walter Kern;Georg J. Still

93
Citations
Dynamic Programming for Minimum Steiner Trees

B. Fuchs;W. Kern;D. Molle;S. Richter

89
Citations
On the computation of the nucleolus of a cooperative game

Ulrich Faigle;Walter Kern;Jeroen Kuipers

87
Citations
Computing the nucleolus of min-cost spanning tree games is NP -hard

Ulrich Faigle;Walter Kern;Jeroen Kuipers

85
Citations
A robust PTAS for maximum weight independent sets in unit disk graphs

Tim Nieberg;Johann Hurink;Walter Kern

77
Citations
On approximately fair cost allocation in Euclidean TSP games

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

74
Citations
On the core of ordered submodular cost games

Ulrich Faigle;Walter Kern

68
Citations
Approximation schemes for wireless networks

Tim Nieberg;Johann Hurink;Walter Kern

66
Citations
A Lagrangian relaxation approach to the edge-weighted clique problem

Marcel Hunting;Ulrich Faigle;Walter Kern

62
Citations
The nucleon of cooperative games and an algorithm for matching games

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

61
Citations

Frequent Co-Authors

Ulrich Faigle University of Cologne

Daniël Paulusma Durham University

Johann L. Hurink University of Twente

Sándor P. Fekete Technische Universität Braunschweig

Frits C. R. Spieksma Eindhoven University of Technology

Gerhard J. Woeginger RWTH Aachen University

William T. Trotter Georgia Institute of Technology

Luca Trevisan Bocconi University

Michiel C.J. Bliemer University of Sydney

Ravi Prakash The University of Texas at Dallas

External Links

Personal website of Walter Kern

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Pursuing a degree in Mathematics opens doors to various interdisciplinary fields and career options. Many students consider expanding their skill set by exploring programs like data analytics, an increasingly vital area that complements mathematical expertise. For those seeking specialization, you can find valuable insights on analytics masters programs that are designed to build strong data interpretation and problem-solving skills.

In addition to technical degrees, business-related programs are often a natural progression. Many math graduates look to enhance their leadership and management capabilities through online MBA options. Those interested can explore institutions offering mba transfer credits to ease their transition and leverage previous coursework.

For flexibility and accessibility, considering an easiest online mba program can be a strategic choice, especially for working professionals balancing education with other commitments. Similarly, if admission selectivity is a concern, reviewing the list of the easiest mba program options provides guidance on programs with more accessible entry requirements.

Overall, combining a solid foundation in Mathematics with these related online degrees can greatly enhance career prospects in business, data science, and beyond.