Walter Kern - Citegraph

Author Info

Name	Affiliation	Papers
WALTER KERN	University of Twente, Faculty of Electrical Engineering, Mathematics and Computer ScienceP.O. Box 217AE Enschede7500The Netherlands	20
Collaborators	Citations	PageRank
33	169	24.26
Referers	Referees	References
345	205	103

Search Limit

100345

Publications (20 rows)

Collaborators (33 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Generalized Matching Games for International Kidney Exchange	0	0.34	2019
On the Factor Revealing LP Approach for Facility Location with Penalties.	0	0.34	2016
Note on VCG vs. Price Raising for Matching Markets.	1	0.40	2016
A note on perfect partial elimination.	0	0.34	2013
Approximation schemes for wireless networks	19	0.88	2008
Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, The Netherlands, 29-31 May, 2007	32	7.29	2007
Dynamic Programming for Minimum Steiner Trees	23	1.13	2007
An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size	9	0.72	2005
A Lagrangian relaxation approach to the edge-weighted clique problem	18	1.08	2001
Note on the computational complexity of least core concepts for min-cost spanning tree games	10	0.76	2000
An Order-theoretic Framework for the Greedy Algorithm with Applications to the Core and Weber Set of Cooperative Games	8	0.62	2000
A Greedy On-Line Algorithm for thek-Track Assignment Problem	2	0.42	1999
Simplices by point-sliding and the Yamnitsky-Levin algorithm	0	0.34	1997
A characterization of nonnegative box-greedy matrices	4	1.11	1996
On the average rank of LYM-sets	2	0.45	1995
Classes of feedforward neural networks and their circuit complexity	6	0.49	1992
Learning convex bodies under uniform distribution	0	0.34	1992
Some Convergence Results for Probabilistic Tabu Search	18	5.39	1992
A Group-Theoretic Setting for Some Intersecting Sperner Families	13	1.31	1992
Matroid Matching In Pseudomodular Lattices	4	0.52	1989