Author Publications

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

2012

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

2011

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).

2010

Faigle, Ulrich and Hurink, Johann (2010) Cologne/Twente Workshop on Graphs and Combinatorial Optimization CTW 2007 : Editorial. Discrete Applied Mathematics, 158 (4). p. 239. ISSN 0166-218X

2009

Faigle, Ulrich and Fujishige, Saturo (2009) A general model for matroids and the greedy algorithm. Mathematical programming, 119 (2). pp. 353-369. ISSN 0025-5610

2006

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

2004

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

Faigle, Ulrich and Pickl, Stefan (2004) Preface. Discrete Applied Mathematics, 136 (2-3). pp. 159-160. ISSN 0166-218X

2003

Broersma, Hajo and Faigle, Ulrich and Hurink, Johann and Pickl, Stefan and Woeginger, Gerhard (2003) Preface. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 13 . Elsevier, p. 1.

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]

Faigle, Ulrich and Broersma, Hajo and Hurink, Johann (2002) Foreword. Discrete Applied Mathematics, 120 (1-3). p. 1. ISSN 0166-218X

2001

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

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.

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

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]

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 Fekete, Sándor P. and Hochstättler, Winfried and Kern, Walter (1998) On approximately fair cost allocation in Euclidean TSP games. OR Spectrum, 20 (1). pp. 29-37. ISSN 0171-6468

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

Faigle, Ulrich and Nawijn, Willem M. (1995) Note on scheduling intervals on-line. Discrete Applied Mathematics, 58 (1). pp. 13-17. ISSN 0166-218X

1994

Faigle, Ulrich (1994) Some recent results in the analysis of greedy algorithms for assignment problems. OR Spectrum, 15 (4). pp. 181-188. ISSN 0171-6468

1993

Dijkhuizen, G. van and Faigle, U. (1993) A cutting-plane approach to the edge-weighted maximal clique problem. European Journal of Operational Research, 69 (1). pp. 121-130. ISSN 0377-2217

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

1992

Faigle, Ulrich and Schrader, Rainer (1992) A greedy reduction algorithm for setup optimization. Discrete Applied Mathematics, 35 (1). pp. 73-79. ISSN 0166-218X

Faigle, Ulrich and Schrader, Rainer and Turan, Gyorgy (1992) The communication complexity of interval orders. Discrete Applied Mathematics, 40 (1). pp. 19-28. ISSN 0166-218X

1991

Faigle, U. (1991) Matroid theory and its applications. [Review of the book Matroid theory and its applications (1989), Recski, András, ed.] Zeitschrift für Operations Research, 35 (4) , Physica-Verlag, pp. 348-349. ISSN 0341-3306

1990

Arnim, Annelie von and Faigle, Ulrich and Schrader, Rainer (1990) The permutahedron of series-parallel posets. Discrete Applied Mathematics, 28 (1). pp. 3-9. ISSN 0166-218X

Boyd, E. Andrew and Faigle, Ulrich (1990) An algorithmic characterization of antimatroids. Discrete Applied Mathematics, 28 (3). pp. 197-205. ISSN 0166-218X

1989

Faigle, U. (1989) Cores of games with restricted cooperation. Zeitschrift für Operations Research, 33 (6). pp. 405-422. ISSN 0341-3306

This list was generated on Sat Nov 22 05:33:30 2014 CET.