| 2008 |
|---|
| 56 | EE | Ulrich Faigle,
Britta Peis:
A Hierarchical Model for Cooperative Games.
SAGT 2008: 230-241 |
| 55 | EE | Ulrich Faigle,
Britta Peis:
Two-phase greedy algorithms for some classes of combinatorial linear programs.
SODA 2008: 161-166 |
| 54 | EE | Ulrich Faigle,
Bert Randerath,
Rainer Schrader:
Preface for CTW2005 special issue.
Discrete Applied Mathematics 156(17): 3155 (2008) |
| 53 | EE | Ulrich Faigle,
Britta Peis:
Note on pseudolattices, lattices and submodular linear programs.
Discrete Optimization 5(2): 489-500 (2008) |
| 52 | EE | Jutta Gebert,
Susanne Motameny,
Ulrich Faigle,
Christian V. Forst,
Rainer Schrader:
Identifying Genes of Gene Regulatory Networks Using Formal Concept Analysis.
Journal of Computational Biology 15(2): 185-194 (2008) |
| 2007 |
|---|
| 51 | | Ulrich Faigle,
Britta Peis:
A two-phase greedy algorithm for modular lattice polyhedra.
CTW 2007: 33-37 |
| 50 | EE | Ulrich Faigle,
Bernhard Fuchs,
Britta Peis:
Note on maximal split-stable subgraphs.
Discrete Applied Mathematics 155(15): 2031-2038 (2007) |
| 49 | EE | Ulrich Faigle,
Alexander Schönhuth:
Asymptotic Mean Stationarity of Sources With Finite Evolution Dimension.
IEEE Transactions on Information Theory 53(7): 2342-2348 (2007) |
| 2006 |
|---|
| 48 | EE | Lars Kaderali,
Thomas Zander,
Ulrich Faigle,
Jürgen Wolf,
Joachim L. Schultze,
Rainer Schrader:
CASPAR: a hierarchical bayesian approach to predict survival times in cancer from gene expression data.
Bioinformatics 22(12): 1495-1502 (2006) |
| 47 | EE | Ulrich Faigle,
Johann Hurink,
Stefan Wolfgang Pickl:
Preface.
Discrete Applied Mathematics 154(9): 1315 (2006) |
| 46 | EE | Ulrich Faigle,
Gereon Frahling:
A combinatorial algorithm for weighted stable sets in bipartite graphs.
Discrete Applied Mathematics 154(9): 1380-1391 (2006) |
| 45 | EE | Ulrich Faigle,
Leo Liberti,
Francesco Maffioli,
Stefan Pickl:
Graphs and combinatorial optimization.
Discrete Optimization 3(3): 179 (2006) |
| 44 | EE | Ulrich Faigle,
Alexander Schönhuth:
Quantum Predictor Models.
Electronic Notes in Discrete Mathematics 25: 149-155 (2006) |
| 2005 |
|---|
| 43 | EE | Ulrich Faigle,
Alexander Schönhuth:
Note on Negative Probabilities and Observable Processes.
Algorithms for Optimization with Incomplete Information 2005 |
| 2004 |
|---|
| 42 | EE | Ulrich Faigle,
Stefan Pickl,
Hajo Broersma,
Johann Hurink:
Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization.
Discrete Applied Mathematics 136(2-3): 159-160 (2004) |
| 41 | EE | Ulrich Faigle,
Bernhard Fuchs,
Britta Wienand:
Covering Graphs by Colored Stable Sets.
Electronic Notes in Discrete Mathematics 17: 145-149 (2004) |
| 40 | EE | Péter L. Erdös,
Ulrich Faigle,
Winfried Hochstättler,
Walter Kern:
Note on the game chromatic index of trees.
Theor. Comput. Sci. 303(3): 371-376 (2004) |
| 2003 |
|---|
| 39 | EE | Hajo Broersma,
Ulrich Faigle,
Johann Hurink,
Stefan Pickl,
Gerhard J. Woeginger:
Preface: Volume 13.
Electronic Notes in Discrete Mathematics 13: 128 (2003) |
| 2001 |
|---|
| 38 | EE | Hajo Broersma,
Ulrich Faigle,
Johann Hurink,
Stefan Pickl:
Preface: Volume 8.
Electronic Notes in Discrete Mathematics 8: 1 (2001) |
| 37 | EE | Petrica C. Pop,
Walter Kern,
Georg Still,
Ulrich Faigle:
Relaxation methods for the Generalized Minimum Spanning Tree Problem.
Electronic Notes in Discrete Mathematics 8: 76-79 (2001) |
| 2000 |
|---|
| 36 | EE | 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) |
| 1999 |
|---|
| 35 | | 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 |
|---|
| 34 | | 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) |
| 33 | EE | Ulrich Faigle,
Walter Kern:
Approximate Core Allocation for Binpacking Games.
SIAM J. Discrete Math. 11(3): 387-399 (1998) |
| 1997 |
|---|
| 32 | EE | Ulrich Faigle,
Kees Hoede:
Preface.
Discrete Applied Mathematics 79(1-3): 1 (1997) |
| 1996 |
|---|
| 31 | EE | Ulrich Faigle,
R. Garbe,
Walter Kern:
Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling.
Computing 56(2): 95-104 (1996) |
| 30 | | Ulrich Faigle,
Walter Kern:
Submodular linear programs on forests.
Math. Program. 72: 195-206 (1996) |
| 29 | | Ulrich Faigle,
Walter Kern,
M. Streng:
Note on the computational complexity of j-radii of polytopes in Realn.
Math. Program. 73: 1-5 (1996) |
| 1995 |
|---|
| 28 | EE | Ulrich Faigle,
Willem M. Nawijn:
Note on Scheduling Intervals on-line.
Discrete Applied Mathematics 58(1): 13-17 (1995) |
| 27 | EE | Ulrich Faigle,
Noud Gademann,
Walter Kern:
A Random Polynomial Time Algorithm for Well-rounding Convex Bodies.
Discrete Applied Mathematics 58(2): 117-144 (1995) |
| 26 | EE | Péter L. Erdös,
Ulrich Faigle,
Walter Kern:
On the average rank of LYM-sets.
Discrete Mathematics 144(1-3): 11-22 (1995) |
| 25 | EE | 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
Electronic Colloquium on Computational Complexity (ECCC) 2(12): (1995) |
| 24 | EE | Ulrich Faigle,
Walter Kern,
M. Streng:
Note On the Computational Complexity of j-Radii of Polytopes in Rn
Electronic Colloquium on Computational Complexity (ECCC) 2(14): (1995) |
| 23 | EE | Ulrich Faigle,
Sándor P. Fekete,
Winfried Hochstättler,
Walter Kern:
On Approximately Fair Cost Allocation in Euclidean TSP Games
Electronic Colloquium on Computational Complexity (ECCC) 2(16): (1995) |
| 22 | EE | Ulrich Faigle,
Sándor P. Fekete,
Winfried Hochstättler,
Walter Kern:
The Nucleon of Cooperative Games and an Algorithm for Matching Games
Electronic Colloquium on Computational Complexity (ECCC) 2(7): (1995) |
| 1994 |
|---|
| 21 | EE | Ulrich Faigle,
Kees Hoede:
Preface.
Discrete Applied Mathematics 51(1-2): 1 (1994) |
| 1992 |
|---|
| 20 | | Péter L. Erdös,
Ulrich Faigle,
Walter Kern:
A Group-Theoretic Setting for Some Intersecting Sperner Families.
Combinatorics, Probability & Computing 1: 323-334 (1992) |
| 19 | EE | Ulrich Faigle,
Rainer Schrader:
A greedy reduction algorithm for setup optimization.
Discrete Applied Mathematics 35(1): 73-79 (1992) |
| 18 | | Ulrich Faigle,
Rainer Schrader,
György Turán:
The Communication Complexity of Interval Orders.
Discrete Applied Mathematics 40(1): 19-28 (1992) |
| 1991 |
|---|
| 17 | | Ulrich Faigle,
Walter Kern:
Some Order Dimension Bounds for Communication Complexity Problems.
Acta Inf. 28(6): 593-601 (1991) |
| 1990 |
|---|
| 16 | EE | Annelie von Arnim,
Ulrich Faigle,
Rainer Schrader:
The permutahedron of series-parallel posets.
Discrete Applied Mathematics 28(1): 3-9 (1990) |
| 15 | EE | E. Andrew Boyd,
Ulrich Faigle:
An algorithmic characterization of antimatroids.
Discrete Applied Mathematics 28(3): 197-205 (1990) |
| 1989 |
|---|
| 14 | | 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) |
| 1988 |
|---|
| 13 | | Ulrich Faigle,
Rainer Schrader:
Simulted Annealing -Eine Fallstudie.
Angewandte Informatik 30(6): 259-263 (1988) |
| 12 | | Ulrich Faigle,
Rainer Schrader:
On the Convergence of Stationary Distributions in Simulated Annealing Algorithms.
Inf. Process. Lett. 27(4): 189-194 (1988) |
| 11 | | Ulrich Faigle,
György Turán:
Sorting and Recognition Problems for Ordered Sets.
SIAM J. Comput. 17(1): 100-113 (1988) |
| 1987 |
|---|
| 10 | EE | Ulrich Faigle,
György Turán:
On the complexity of interval orders and semiorders.
Discrete Mathematics 63(2-3): 131-141 (1987) |
| 1986 |
|---|
| 9 | | Ulrich Faigle:
The Bandwidth of Planar Distributive Lattices.
WG 1986: 94-105 |
| 8 | | Ulrich Faigle,
Bill Sands:
A size-width inequality for distributive lattices.
Combinatorica 6(1): 29-33 (1986) |
| 7 | EE | Ulrich Faigle,
Rainer Schrader:
A combinatorial bijection between linear extensions of equivalent orders.
Discrete Mathematics 58(3): 295-301 (1986) |
| 6 | | Ulrich Faigle,
László Lovász,
Rainer Schrader,
György Turán:
Searching in Trees, Series-Parallel and Interval Orders.
SIAM J. Comput. 15(4): 1075-1084 (1986) |
| 1985 |
|---|
| 5 | | Ulrich Faigle,
György Turán:
Sorting and Recognition Problems for Ordered Sets.
STACS 1985: 109-118 |
| 4 | EE | Ulrich Faigle:
On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms
J. ACM 32(4): 861-870 (1985) |
| 3 | | Ulrich Faigle,
Gerhard Gierz,
Rainer Schrader:
Algorithmic approaches to setup minimization.
SIAM J. Comput. 14(4): 954-965 (1985) |
| 1984 |
|---|
| 2 | | Ulrich Faigle,
Rainer Schrader:
Minimizing Completion Time for a Class of Scheduling Problems.
Inf. Process. Lett. 19(1): 27-29 (1984) |
| 1980 |
|---|
| 1 | EE | Ulrich Faigle:
Geometries on partially ordered sets.
J. Comb. Theory, Ser. B 28(1): 26-51 (1980) |
