default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWalter Kern
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[i13]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 abs/2301.13181 (2023)- 2022
- [j81]Walter Kern, Barnaby Martin, Daniël Paulusma
, Siani Smith, Erik Jan van Leeuwen:
Disjoint paths and connected subgraphs for H-free graphs. Theor. Comput. Sci. 898: 59-68 (2022) - [c22]Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma:
Computing Balanced Solutions for Large International Kidney Exchange Schemes. AAMAS 2022: 82-90 - 2021
- [c21]Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Disjoint Paths and Connected Subgraphs for H-Free Graphs. IWOCA 2021: 414-427 - [i12]Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR abs/2105.06349 (2021) - [i11]Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma:
Computing Balanced Solutions for Large International Kidney Exchange Schemes. CoRR abs/2109.06788 (2021) - 2020
- [j80]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): 609-621 (2020) - [c20]Walter Kern, Daniël Paulusma:
Contracting to a Longest Path in H-Free Graphs. ISAAC 2020: 22:1-22:18
2010 – 2019
- 2019
- [c19]Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma:
Generalized Matching Games for International Kidney Exchange. AAMAS 2019: 413-421 - 2018
- [j79]Ulrich Faigle, Walter Kern, Britta Peis:
Greedy Oriented Flows. Algorithmica 80(4): 1298-1314 (2018) - [j78]Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky:
The stable fixtures problem with payments. Games Econ. Behav. 108: 245-268 (2018) - [c18]Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma:
Simple Games Versus Weighted Voting Games. SAGT 2018: 69-81 - [i10]Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma:
Simple Games versus Weighted Voting Games. CoRR abs/1805.02192 (2018) - [i9]Walter Kern, Daniël Paulusma:
Contracting to a Longest Path in H-Free Graphs. CoRR abs/1810.01542 (2018) - [i8]Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma:
Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value. CoRR abs/1810.08841 (2018) - 2017
- [j77]Walter Kern, Bodo Manthey:
Approximating bounded-degree spanning trees and connected factors with leaves. Oper. Res. Lett. 45(2): 115-118 (2017) - [c17]Jasper de Jong, Walter Kern, Berend Steenhuisen, Marc Uetz:
The Asymptotic Price of Anarchy for k-uniform Congestion Games. WAOA 2017: 317-328 - 2016
- [b1]Walter Kern:
Patternbasierte Abbildung von Rich-Client-Aspekten auf webbasierte Systeme im Kontext der Barrierefreiheitsanforderungen im Bereich E-Governement. University of Regensburg, Germany, 2016 - [j76]Xian Qiu, Walter Kern:
Approximate core allocations and integrality gap for the bin packing game. Theor. Comput. Sci. 627: 26-35 (2016) - [i7]Walter Kern, Bodo Manthey, Marc Uetz:
Note on VCG vs. Price Raising for Matching Markets. CoRR abs/1604.04157 (2016) - 2015
- [j75]Rolf Harren, Walter Kern:
Improved Lower Bound for Online Strip Packing. Theory Comput. Syst. 56(1): 41-72 (2015) - [j74]Xian Qiu, Walter Kern:
Improved approximation algorithms for a bilevel knapsack problem. Theor. Comput. Sci. 595: 120-129 (2015) - [c16]Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky:
The Stable Fixtures Problem with Payments. WG 2015: 49-63 - [i6]Péter Biró, Walter Kern, Daniël Paulusma, Péter Wojuteczky:
The Stable Fixtures Problem with Payments. CoRR abs/1508.06420 (2015) - 2014
- [j73]Walter Kern, Xian Qiu:
Note on non-uniform bin packing games. Discret. Appl. Math. 165: 175-184 (2014) - [j72]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: 53-61 (2014) - [c15]Xian Qiu, Walter Kern:
Improved Approximation Algorithms for a Bilevel Knapsack Problem. COCOON 2014: 312-323 - 2013
- [j71]Matthijs Bomhoff, Walter Kern, Georg Still:
A note on perfect partial elimination. Discret. Math. 313(14): 1558-1563 (2013) - [j70]Walter Kern, Jacob Jan Paulus:
A tight analysis of Brown-Baker-Katseff sequences for online strip packing. J. Comb. Optim. 26(2): 333-344 (2013) - [c14]Walter Kern, Xian Qiu:
The 1/4-Core of the Uniform Bin Packing Game Is Nonempty. COCOON 2013: 41-52 - 2012
- [j69]Péter Biró, Walter Kern, Daniël Paulusma:
Computing solutions for matching games. Int. J. Game Theory 41(1): 75-90 (2012) - [j68]Matthijs Bomhoff, Walter Kern, Georg Still:
On bounded block decomposition problems for under-specified systems of equations. J. Comput. Syst. Sci. 78(1): 336-347 (2012) - [j67]Ulrich Faigle, Walter Kern, Britta Peis:
A ranking model for the greedy algorithm and discrete convexity. Math. Program. 132(1-2): 393-407 (2012) - [j66]Walter Kern, Xian Qiu:
Integrality gap analysis for bin packing games. Oper. Res. Lett. 40(5): 360-363 (2012) - [c13]Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma:
Solutions for the Stable Roommates Problem with Payments. WG 2012: 69-80 - [i5]Ulrich Faigle, Walter Kern, Britta Peis:
Max-Flow on Regular Spaces. CoRR abs/1206.5167 (2012) - 2011
- [c12]Walter Kern, Xian Qiu:
Improved Taxation Rate for Bin Packing Games. CTW 2011: 173-176 - [c11]Ulrich Faigle, Walter Kern, Britta Peis:
On Greedy and Submodular Matrices. TAPAS 2011: 116-126 - [c10]Walter Kern, Xian Qiu:
Improved Taxation Rate for Bin Packing Games. TAPAS 2011: 175-180 - [c9]Rolf Harren, Walter Kern:
Improved Lower Bound for Online Strip Packing - (Extended Abstract). WAOA 2011: 211-218 - 2010
- [j65]Walter Kern:
Book review. Oper. Res. Lett. 38(5): 492 (2010) - [j64]Walter Kern, Christian Silberbauer, Christian Wolff:
The Dimension Architecture: A New Approach to Resource Access. IEEE Softw. 27(5): 74-81 (2010) - [c8]Walter Kern, Jacob Jan Paulus:
A tight Analysis of Brown-Baker-Katseff Sequences for Online Strip Packing. CTW 2010: 109-110 - [c7]Péter Biró, Walter Kern, Daniël Paulusma:
On Solution Concepts for Matching Games. TAMC 2010: 117-127
2000 – 2009
- 2009
- [j63]Walter Kern, Daniël Paulusma:
On the Core and f-Nucleolus of Flow Games. Math. Oper. Res. 34(4): 981-991 (2009) - 2008
- [j62]Tim Nieberg, Johann L. Hurink, Walter Kern:
Approximation schemes for wireless networks. ACM Trans. Algorithms 4(4): 49:1-49:17 (2008) - 2007
- [j61]Bernhard Fuchs, Walter Kern, Xinhui Wang:
The Number of Tree Stars Is O *(1.357 k ). Algorithmica 49(3): 232-244 (2007) - [j60]Bernhard Fuchs, Walter Kern, Xinhui Wang:
Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees. Math. Methods Oper. Res. 66(1): 117-125 (2007) - [j59]Walter Kern, Gerhard J. Woeginger:
Quadratic programming and combinatorial minimum weight product problems. Math. Program. 110(3): 641-649 (2007) - [j58]Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang:
Dynamic Programming for Minimum Steiner Trees. Theory Comput. Syst. 41(3): 493-500 (2007) - [c6]Walter Kern, Xinhui Wang:
On full components for Rectilinear Steiner tree. CTW 2007: 85-88 - [e1]Johann L. Hurink, Walter Kern, Gerhard F. Post, Georg Still:
Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, The Netherlands, 29-31 May, 2007. University of Twente 2007 [contents] - 2006
- [j57]Bernhard Fuchs, Walter Kern, Xinhui Wang:
The number of tree stars is O*(1.357k). Electron. Notes Discret. Math. 25: 183-185 (2006) - [j56]Petrica C. Pop, Walter Kern, Georg Still:
A new relaxation method for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 170(3): 900-908 (2006) - [j55]Ulrich Faigle, Walter Kern, Jeroen Kuipers:
Computing an Element in the Lexicographic Kernel of a Game. Math. Methods Oper. Res. 63(3): 427-433 (2006) - [j54]Tobias Brüggemann, Johann L. Hurink, Walter Kern:
Quality of move-optimal schedules for minimizing total weighted completion time. Oper. Res. Lett. 34(5): 583-590 (2006) - [c5]Walter Kern, Gerhard J. Woeginger:
Quadratic Programming and Combinatorial Minimum Weight Product Problems. CIAC 2006: 42-49 - 2005
- [j53]Bernhard Fuchs, Winfried Hochstättler, Walter Kern:
Online matching on a line. Theor. Comput. Sci. 332(1-3): 251-264 (2005) - [c4]Petrica C. Pop, Georg Still, Walter Kern:
An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size. ACiD 2005: 115-121 - 2004
- [j52]Walter Kern, Daniël Paulusma:
The computational complexity of the elimination problem in generalized sports competitions. Discret. Optim. 1(2): 205-214 (2004) - [j51]Tobias Brüggemann, Walter Kern:
An improved local search algorithm for 3-SAT. Electron. Notes Discret. Math. 17: 69-73 (2004) - [j50]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): 371-376 (2004) - [j49]Tobias Brüggemann, Walter Kern:
An improved deterministic local search algorithm for 3-SAT. Theor. Comput. Sci. 329(1-3): 303-313 (2004) - [c3]Tobias Brüggemann, Walter Kern:
An Improved Local Search Algorithm for 3-SAT. CTW 2004: 66-70 - [c2]Tim Nieberg, Johann L. Hurink, Walter Kern:
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. WG 2004: 214-221 - 2003
- [j48]Bernhard Fuchs, Winfried Hochstättler, Walter Kern:
Online Matching On a Line. Electron. Notes Discret. Math. 13: 49-51 (2003) - [j47]Walter Kern, Daniël Paulusma:
Matching Games: The Least Core and the Nucleolus. Math. Oper. Res. 28(2): 294-308 (2003) - 2001
- [j46]Walter Kern, Daniël Paulusma:
The new FIFA rules are hard: complexity aspects of sports competitions. Discret. Appl. Math. 108(3): 317-323 (2001) - [j45]A. F. Dumb, Walter Kern:
A simple dual ascent algorithm for the multilevel facility location problem. Electron. Notes Discret. Math. 8: 14-17 (2001) - [j44]Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle:
Relaxation methods for the Generalized Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 8: 76-79 (2001) - [j43]Marcel Hunting, Ulrich Faigle, Walter Kern:
A Lagrangian relaxation approach to the edge-weighted clique problem. Eur. J. Oper. Res. 131(1): 119-131 (2001) - [j42]Ulrich Faigle, Walter Kern, Jeroen Kuipers:
On the computation of the nucleolus of a cooperative game. Int. J. Game Theory 30(1): 79-98 (2001) - [c1]Adriana Felicia Bumb, Walter Kern:
A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem. RANDOM-APPROX 2001: 55-62 - 2000
- [j41]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): 23-38 (2000) - [j40]Ulrich Faigle, Walter Kern:
On the core of ordered submodular cost games. Math. Program. 87(3): 483-499 (2000) - [j39]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): 353-375 (2000)
1990 – 1999
- 1999
- [j38]Ulrich Faigle, Walter Kern, Willem M. Nawijn:
A Greedy On-Line Algorithm for thek-Track Assignment Problem. J. Algorithms 31(1): 196-210 (1999) - 1998
- [j37]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): 443-450 (1998) - [j36]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: 195-211 (1998) - [j35]Ulrich Faigle, Walter Kern:
Approximate Core Allocation for Binpacking Games. SIAM J. Discret. Math. 11(3): 387-399 (1998) - 1997
- [j34]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): 361-366 (1997) - [j33]Ulrich Faigle, Marcel Hunting, Walter Kern, Ravi Prakash, K. J. Supowit:
Simplices by point-sliding and the Yamnitsky-Levin algorithm. Math. Methods Oper. Res. 46(1): 131-142 (1997) - 1996
- [j32]Ulrich Faigle, Renate Garbe, Walter Kern:
Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling. Computing 56(2): 95-104 (1996) - [j31]Ulrich Faigle, Walter Kern, Boris Spieker:
On the communication complexity of t -intersection problems in generalized Boolean algebras. Math. Methods Oper. Res. 43(2): 239-254 (1996) - [j30]Ulrich Faigle, Walter Kern:
Submodular linear programs on forests. Math. Program. 72: 195-206 (1996) - [j29]Ulrich Faigle, Walter Kern, Martin Streng:
Note on the computational complexity of j-radii of polytopes in Realn. Math. Program. 73: 1-5 (1996) - [j28]Ulrich Faigle, Alan J. Hoffman, Walter Kern:
A Characterization of Nonnegative Box-Greedy Matrices. SIAM J. Discret. Math. 9(1): 1-6 (1996) - 1995
- [j27]Ulrich Faigle, Noud Gademann, Walter Kern:
A Random Polynomial Time Algorithm for Well-rounding Convex Bodies. Discret. Appl. Math. 58(2): 117-144 (1995) - [j26]Péter L. Erdös, Ulrich Faigle, Walter Kern:
On the average rank of LYM-sets. Discret. Math. 144(1-3): 11-22 (1995) - [i4]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. TR95 (1995) - [i3]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. TR95 (1995) - [i2]Ulrich Faigle, Walter Kern, Martin Streng:
Note On the Computational Complexity of j-Radii of Polytopes in Rn. Electron. Colloquium Comput. Complex. TR95 (1995) - [i1]Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern:
On Approximately Fair Cost Allocation in Euclidean TSP Games. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j25]Ulrich Faigle, Walter Kern:
Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints. Oper. Res. 42(4): 688-693 (1994) - 1993
- [j24]Walter Kern:
On the Depth of Combinatorial Optimization Problems. Discret. Appl. Math. 43(2): 115-129 (1993) - [j23]Ulrich Faigle, Walter Kern:
On some approximately balanced combinatorial cooperative games. ZOR Methods Model. Oper. Res. 38(2): 141-152 (1993) - 1992
- [j22]Péter L. Erdös, Ulrich Faigle, Walter Kern:
A Group-Theoretic Setting for Some Intersecting Sperner Families. Comb. Probab. Comput. 1: 323-334 (1992) - [j21]Ulrich Faigle, Walter Kern:
Some Convergence Results for Probabilistic Tabu Search. INFORMS J. Comput. 4(1): 32-37 (1992) - [j20]Walter Kern:
Learning Convex Bodies under Uniform Distribution. Inf. Process. Lett. 43(1): 35-39 (1992) - [j19]John Shawe-Taylor, Martin Anthony, Walter Kern:
Classes of feedforward neural networks and their circuit complexity. Neural Networks 5(6): 971-977 (1992) - 1991
- [j18]Ulrich Faigle, Walter Kern:
Some Order Dimension Bounds for Communication Complexity Problems. Acta Informatica 28(6): 593-601 (1991) - [j17]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): 323 (1991) - 1990
- [j16]Walter Kern, Alfred Wanka:
On a Problem About Covering Lines by Squares. Discret. Comput. Geom. 5: 77-82 (1990) - [j15]Marion Alfter, Walter Kern, Alfred Wanka:
On adjoints and dual matroids. J. Comb. Theory B 50(2): 208-213 (1990) - [j14]Christoph Hohmann, Walter Kern:
Optimization and optimality test for the Max-Cut Problem. ZOR Methods Model. Oper. Res. 34(3): 195-206 (1990)
1980 – 1989
- 1989
- [j13]Ulrich Faigle, Walter Kern, György Turán:
On the performance of on-line algorithms for partition problems. Acta Cybern. 9(2): 107-119 (1989) - [j12]Winfried Hochstättler, Walter Kern:
Matroid matching in pseudomodular lattices. Comb. 9(2): 145-152 (1989) - [j11]Walter Kern:
On the Rate of Convergence of Some Stochastic Processes. Math. Oper. Res. 14(2): 275-280 (1989) - [j10]Walter Kern:
A probabilistic analysis of the switching algorithm for the euclidean TSP. Math. Program. 44(1-3): 213-219 (1989) - 1988
- [j9]Achim Bachem, Walter Kern:
On sticky matroids. Discret. Math. 69(1): 11-18 (1988) - [j8]Walter Kern:
On finite locally projective planar spaces. J. Comb. Theory A 48(2): 247-254 (1988) - 1986
- [j7]Achim Bachem, Walter Kern:
Adjoints of oriented matroids. Comb. 6(4): 299-308 (1986) - [j6]Walter Kern:
An efficient algorithm for solving a special class of LP's. Computing 37(3): 219-226 (1986) - [j5]Achim Bachem, Walter Kern:
Extension Equivalence of Oriented Matroids. Eur. J. Comb. 7(3): 193-197 (1986)
1970 – 1979
- 1978
- [j4]J. Keklikoglou, Hermann K.-G. Walter, Walter Kern:
The behaviour of parsing time under grammar morphisms. RAIRO Theor. Informatics Appl. 12(2): 83-97 (1978) - 1977
- [j3]Walter Kern:
Speicheroptimale Formelübersetzung. Acta Informatica 7: 269-287 (1977)
1960 – 1969
- 1966
- [j2]Hasso von Falkenhausen, Hans Peter Amann, K. Dietz, H. Rüst, P. Roos, Walter Kern, D. Schneider, K. Neumann, G. Dahmen:
Buchbesprechungen. Unternehmensforschung 10(1): 58-64 (1966) - 1965
- [j1]Walter Kern:
Buchbesprechung. Unternehmensforschung 9(1): 55-56 (1965)
Coauthor Index