Author Publications

Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type
Jump to: 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992
Number of items: 82.

2013

Bomhoff, Matthijs and Kern, Walter and Still, Georg (2013) A note on perfect partial elimination. Discrete mathematics, 313 (14). pp. 1558-1563. ISSN 0012-365X

Kern, W. and Paulus, J.J. (2013) A tight analysis of Brown-Baker-Katseff sequences for online strip packing. Journal of combinatorial optimization, 26 (2). pp. 333-344. ISSN 1382-6905

Kern, Walter and Qiu, Xian (2013) The 1/4-core of the uniform bin packing game is nonempty. In: 19th International Conference on Computing and Combinatorics, COCOON 2013, 21-23 June 2013, Hangzhou, China (pp. pp. 41-52).

Ohazulike, Anthony E. and Still, Georg and Kern, Walter and Berkum, Eric C. van (2013) An origin-destination based road pricing model for static and multi-period traffic assignment problems. Transportation research. Part E: Logistics and transportation review, 58 . pp. 1-27. ISSN 1366-5545

2012

Biró, Péter and Kern, Walter and Paulusma, Daniël (2012) Computing solutions for matching games. International journal of game theory, 41 (1). pp. 75-90. ISSN 0020-7276

Bomhoff, Matthijs and Kern, Walter and Still, Georg (2012) On bounded block decomposition problems for under-specified systems of equations. Journal of Computer and System Sciences, 78 (1). pp. 336-347. ISSN 0022-0000

Faigle, Ulrich and Kern, Walter and Peis, Britta (2012) A ranking model for the greedy algorithm and discrete convexity. Mathematical programming, 132 (1-2). pp. 393-407. ISSN 0025-5610

Harren, Rolf and Kern, Walter (2012) Improved lower bound for online strip packing. In: 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, 8-9 September 2011, Saarbrücken, Germany (pp. pp. 211-218).

Kern, W. and Qiu, X. (2012) Integrality gap analysis for bin packing games. Operations research letters, 40 (5). pp. 360-363. ISSN 0167-6377

Ohazulike, Anthony E. and Still, Georg and Kern, Walter and Berkum, Eric C. van (2012) Multi-stakeholder road pricing game: solution concepts. International Journal of Computational and Mathematical Sciences, 6 . pp. 1-12. ISSN 2070-3910

2011

Bomhoff, Matthijs and Kern, Walter and Still, Georg (2011) A note on perfect partial elimination. [Report]

Faigle, Ulrich and Kern, Walter and Peis, Britta (2011) On greedy and submodular matrices. In: First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011, 18-20 April 2011, Rome, Italy (pp. pp. 116-126).

Harren, Rolf and Kern, Walter (2011) Improved Lower Bound for Online Strip Packing (Extended Abstract). In: Approximation and Online Algorithms. Lecture Notes in Computer Science, 7164 . Springer, Berlin, Germany, pp. 211-218. ISBN 9783642291166

Kern, Walter and Qiu, Xian (2011) Improved taxation rate for bin packing games. In: First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011, 18-20 April 2011, Rome, Italy (pp. pp. 175-180).

2010

Biro, Peter and Kern, Walter and Paulusma, Daniël (2010) On solution concepts for matching games. In: 7th Annual Conference on Theory and Applications of Models of Computation, TAMC 2010, 7-11 June, 2010, Prague, Czech Republic (pp. pp. 117-127).

Bomhoff, Matthijs and Kern, Walter and Still, Georg (2010) On bounded block decomposition problems for under-specified systems of equations. [Report]

Kern, Walter (2010) Book review: Game theory: a multi-leveled approach / by Hans Peters. - Berlin : Springer-Verlag, 2008. - ISBN 978-3-540-69290-4. Operations research letters, 38 (5). p. 492. ISSN 0167-6377

Still, Georg and Kern, Walter and Koelewijn, Jaap and Bomhoff, Matthijs (2010) Consistency of a system of equations: What does that mean? [Report]

2009

Kern, W. and Paulus, J.J. (2009) A note on the lower bound for online strip packing. [Report]

Kern, Walter and Paulusma, Daniël (2009) On the core and f-nucleolus of flow games. Mathematics of Operations Research, 34 (4). pp. 981-991. ISSN 0364-765X

2008

Nieberg, T. and Hurink, J.L. and Kern, W. (2008) Approximation schemes for wireless networks. ACM Transactions on Algorithms, 4 (4). p. 49. ISSN 1549-6325

2007

Fuchs, B. and Kern, W. and Mölle, D. and Richter, S. and Rossmanith, P. and Wang, X. (2007) Dynamic programming for minimum steiner trees. Theory of Computing Systems, 41 (3). pp. 493-500. ISSN 1432-4350

Fuchs, Bernard and Kern, Walter and Wang, Xinhui (2007) Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees. Mathematical methods of operations research, 66 (1). pp. 117-125. ISSN 1432-2994

Fuchs, Bernard and Kern, Walter and Wang, Xinhui (2007) The Number of Tree Stars Is $O^*(1.357^k)$. Algorithmica, 49 (3). pp. 232-244. ISSN 0178-4617

Kern, Walter and Woeginger, Gerhard (2007) Quadratic programming and combinatorial minimum weight product problems. Mathematical programming, 110 (3). pp. 641-649. ISSN 0025-5610

2006

Brueggemann, Tobias and Hurink, Johann L. and Kern, Walter (2006) Quality of Move-optimal Schedules for Minimizing Total Weigted Completion Time. Operations Research Letters, 34 (5). pp. 583-590. ISSN 0167-6377

Brueggemann, Tobias and Hurink, Johann L. and Kern, Walter (2006) Quality of move-optimal schedules for minimizing total weighted completion time. Operations Research Letters, 34 (5). pp. 583-590. ISSN 0167-6377

Faigle, Ulrich and Kern, Walter and Kuipers, Jeroen (2006) Computing an element in the lexicographic kernel of a game. Mathematical methods of operations research, 63 (3). pp. 427-433. ISSN 1432-2994

Fuchs, Bernard and Kern, Walter and Wang, Xinhui (2006) The number of tree stars is O*(1.357k). Electronic Notes in Discrete Mathematics, 25 . pp. 183-185. ISSN 1571-0653

Kern, Walter and Woeginger, Gerhard (2006) Quadratic programming and combinatorial minimum weight product problems. In: 6th Italian Conference on Algorithms and Complexity, CIAC 2006, May 29-31, 2006, Rome, Italy (pp. pp. 42-49).

Pop, P.C. and Kern, W. and Still, G.J. (2006) A new relaxation method for the generalized minimum spanning tree problem. European Journal of Operational Research, 170 (3). pp. 900-908. ISSN 0377-2217

2005

Brueggemann, T. and Hurink, J.L. and Kern, W. (2005) Move-optimal schedules for parallel machines to minimize total weighted completion time. [Report]

Fuchs, Bernard and Hochstättler, Winfried and Kern, Walter (2005) Online matching on a line. Theoretical Computer Science, 332 (1-3). pp. 251-264. ISSN 0304-3975

2004

Brueggemann, T. and Kern, W. (2004) An improved local search algorithm for 3-SAT. [Report]

Brueggemann, Tobias and Kern, Walter (2004) An improved local search algorithm for 3-SAT. In: w. Electronic Notes in Discrete Mathematics, 17 . Elsevier, Workshop on Graphs and Combinatorial Optimization, pp. 69-73.

Brueggemann, Tobias and Kern, Walter (2004) An improved deterministic local search algorithm for 3-SAT. Theoretical Computer Science, 329 (1-3). pp. 303-313. ISSN 0304-3975

Erdös, Péter L. and Faigle, Ulrich and Hochstättler, Winfried and Kern, Walter (2004) Note on the game chromatic index of trees. Theoretical Computer Science, 313 (3). pp. 371-376. ISSN 0304-3975

Kern, Walter and Paulusma, Daniël (2004) The computational complexity of the elimination problem in generalized sports competitions. Discrete Optimization, 1 (2). pp. 205-214. ISSN 1572-5286

Nieberg, Tim and Hurink, Johann and Kern, Walter (2004) A robust PTAS for maximum independent sets in unit disk graphs. In: 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004, 21-23 June 2004, Bad Honnef, Germany (pp. pp. 214-221).

2003

Fuchs, Bernard and Hochstättler, Winfried and Kern, Walter (2003) Online matching on a line. [Report]

Fuchs, Bernard and Hochstättler, Winfried and Kern, Walter (2003) Online Matching On a Line. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Theoretical Computer Science (ENTCS), 13 . Elsevier, pp. 49-51.

Nieberg, Tim and Hurink, Johann and Kern, Walter (2003) A new PTAS for maximum independent sets in unit disk graphs. [Report]

2002

Erdös, P.L. and Faigle, U. and Hochstättler, W. and Kern, W. (2002) Note on the game chromatic index of trees. [Report]

Faigle, U. and Kern, W. and Kuipers, J. (2002) Computing an element in the lexicographic kernel of a game. [Report]

Kern, W. and Paulusma, D. (2002) The generalized sports competition problem. [Report]

2001

Bumb, A.F. and Kern, W. (2001) A simple dual ascent algorithm for the multilevel facility location problem. [Report]

Bumb, A.F. and Kern, W. (2001) A simple dual ascent algorithm for the multilevel facility location problem. In: 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 8 . Elsevier, pp. 14-17.

Bumb, Adriana and Kern, Walter (2001) A simple dual ascent algorithm for the multilevel facility location problem. In: Approximation, randomization, and combinatorial optimization: algorithms and techniques. Lecture notes in computer science, 2129 . Springer, Berlin, Germany, pp. 55-63. ISBN 9783540446668

Faigle, Ulrich and Kern, Walter and Kuipers, Jeroen (2001) On the computation of the nucleolus of a cooperative game. International journal of game theory, 30 (1). pp. 79-98. ISSN 0020-7276

Hunting, Marcel and Faigle, Ulrich and Kern, Walter (2001) A Lagrangian relaxation approach to the edge-weighted clique problem. European Journal of Operational Research, 131 (1). pp. 119-131. ISSN 0377-2217

Kern, Walter and Paulusma, Daniël (2001) The new FIFA rules are hard: complexity aspects of sports competitions. Discrete Applied Mathematics, 108 (3). pp. 317-323. ISSN 0166-218X

Pop, P.C. and Kern, W. and Still, G. and Faigle, U. (2001) Relaxation methods for the Generalized Minimum Spanning Tree Problem. In: 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 8 . Elsevier, pp. 76-79.

Pop, P.C. and Kern, W. and Still, G.J. (2001) An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size. [Report]

2000

Faigle, Ulrich and Kern, Walter (2000) On the core of ordered submodular cost games. Mathematical programming, 87 (3). pp. 483-499. ISSN 0025-5610

Faigle, Ulrich and Kern, Walter (2000) An order-theoretic framework for the greedy algorithm with applications to the core and Weber Set of cooperative games. Order, 17 (4). pp. 353-375. ISSN 0167-8094

Faigle, Ulrich and Kern, Walter and Paulusma, Daniël (2000) Note on the computational complexity of least core concepts for min-cost spanning tree games. Mathematical methods of operations research, 52 (18). pp. 23-38. ISSN 1432-2994

Grootjans, W.J. and Hochstenbach, M. and Hurink, J.L. and Kern, W. and Luczak, M. and Puite, Q. and Resing, J. and Spieksma, F. (2000) Cache as ca$h can. [math mode missing closing $] [Report]

Hurink, J.L. and Kern, W. and Nawijn, W.M. (2000) Scheduling split-jobs on parallel machines. [Report]

Kern, W. and Paulusma, D. (2000) Matching games: the least core and the nucleolus. [Report]

Pop, P.C. and Kern, W. and Still, G.J. (2000) The generalized minimum spanning tree problem. [Report]

1999

Faigle, U. and Kern, W. and Nawijn, W.M. (1999) A Greedy On-Line Algorithm for thek-Track Assignment Problem. Journal of Algorithms, 31 (1). pp. 196-210. ISSN 0196-6774

Faigle, U. and Kern, W. and Paulusma, D. (1999) Note on the computational complexity of least core concepts for min-cost spanning tree games. [Report]

Kern, W. and Paulusma, D. (1999) The new FIFA rules are hard: Complexity aspects of sports competitions. [Report]

1998

Faigle, U. and Kern, W. and Kuipers, J. (1998) An efficient algorithm for nucleolus and prekernel computation in some classes of TU-games. [Report]

Faigle, Ulrich and Kern, Walter (1998) An algebraic framework for the greedy algorithm with applications to the core and Weber set of cooperative games. [Report]

Faigle, Ulrich and Fekete, Sándor P. and Hochstättler, Winfried and Kern, Walter (1998) On approximately fair cost allocation in Euclidean TSP games. OR Spektrum, 20 (1). pp. 29-37. ISSN 0171-6468

Faigle, Ulrich and Kern, Walter and Fekete, Sándor P. and Hochstättler, Winfried (1998) The nucleon of cooperative games and an algorithm for matching games. Mathematical programming, 83 (1-3). pp. 195-211. ISSN 0025-5610

Faigle, Ulrich and Kern, Walter and Kuipers, Jeroen (1998) Computing the nucleolus of min-cost spanning tree games is NP-hard. International journal of game theory, 27 (3). pp. 443-450. ISSN 0020-7276

Hunting, Marcel and Faigle, Ulrich and Kern, Walter (1998) A Lagrangian relaxation approach to the edge-weighted clique problem. [Report]

1997

Faigle, U. and Hunting, M. and Kern, W. and Prakash, R. and Supowit, K.J. (1997) Simplices by point-sliding and the Yamnitsky-Levin algorithm. Mathematical methods of operations research, 46 (1). pp. 131-142. ISSN 1432-2994

Faigle, Ulrich and Kern, Walter and Fekete, Sándor P. and Hochstättler, Winfried (1997) On the complexity of testing membership in the core of min-cost spanning tree games. International journal of game theory, 26 (3). pp. 361-366. ISSN 0020-7276

1996

Faigle, U. and Kern, W. and Streng, M. (1996) Note on the computational complexity of j -radii of polytopes in ℝn. Mathematical programming, 73 (1). pp. 1-5. ISSN 0025-5610

Faigle, Ulrich and Kern, Walter (1996) Packing a bin online to maximize the total number of items. [Report]

Faigle, Ulrich and Kern, Walter (1996) Submodular linear programs on forests. Mathematical programming, 72 (2). pp. 195-206. ISSN 0025-5610

Faigle, Ulrich and Kern, Walter (1996) Packing a bin on-line to maximize the total number of items. In: Symposium on Operations Research, SOR 1996, September 3-6, 1996, Braunschweig, Germany (pp. pp. 61-65).

Faigle, Ulrich and Kern, Walter and Spieker, Boris (1996) On the communication complexity oft-intersection problems in generalized Boolean algebras. Mathematical methods of operations research, 43 (2). pp. 239-254. ISSN 1432-2994

1995

Erdös, Péter L. and Faigle, Ulrich and Kern, Walter (1995) On the average rank of LYM-sets. Discrete Mathematics, 144 (1-3). pp. 11-22. ISSN 0012-365X

Faigle, U. and Gademann, N. and Kern, W. (1995) A random polynomial time algorithm for well-rounding convex bodies. Discrete Applied Mathematics, 58 (2). pp. 117-144. ISSN 0166-218X

1994

Nawijn, W.M. and Kern, W. and Baas, S. (1994) Scheduling jobs with release times on a machine with finite storage. European Journal of Operational Research, 78 (1). pp. 120-127. ISSN 0377-2217

1993

Faigle, Ulrich and Kern, Walter (1993) On some approximately balanced combinatorial cooperative games. Zeitschrift fur Operations Research, 38 (2). pp. 141-152. ISSN 0341-3306

1992

Kern, W. (1992) Learning convex bodies under uniform distribution. Information Processing Letters, 43 (1). pp. 35-39. ISSN 0020-0190

Shawe-Taylor, John S. and Anthony, Martin H.G. and Kern, Walter (1992) Classes of feedforward neural networks and their circuit complexity. Neural Networks, 5 (6). pp. 971-977. ISSN 0893-6080

This list was generated on Wed Apr 23 05:35:06 2014 CEST.