Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ulrich Faigle
2010 – today
- 2013
[j69]Ulrich Faigle, Rainer Schrader: 9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010). Discrete Applied Mathematics 161(12): 1673 (2013)- [c14]Ulrich Faigle, Alexander Schönhuth: Observation and evolution of finite-dimensional Markov systems. CTW 2013: 93-97
- 2012
- [j68]Ulrich Faigle, Walter Kern, Britta Peis: A ranking model for the greedy algorithm and discrete convexity. Math. Program. 132(1-2): 393-407 (2012)
- [i7]
- 2011
- [j67]Sonia Cafieri, Ulrich Faigle, Leo Liberti: 8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009). Discrete Applied Mathematics 159(16): 1659 (2011)
- [j66]Ulrich Faigle, Jan Voss: A system-theoretic model for cooperation, interaction and allocation. Discrete Applied Mathematics 159(16): 1736-1750 (2011)
- [j65]Ulrich Faigle, Michel Grabisch: A discrete Choquet integral for ordered systems. Fuzzy Sets and Systems 168(1): 3-17 (2011)
- [j64]Ulrich Faigle, Alexander Schönhuth: Efficient Tests for Equivalence of Hidden Markov Processes and Quantum Random Walks. IEEE Transactions on Information Theory 57(3): 1746-1753 (2011)
- [c13]Kirsten Albrecht, Ulrich Faigle: Binary Betting Strategies with Optimal Logarithmic Growth. CTW 2011: 44-47
- [c12]Ulrich Faigle, Alexander Schönhuth: Representations of Power Series over Word Algebras. CTW 2011: 154-157
- [c11]
- [i6]Ulrich Faigle, Michel Grabisch: A Discrete Choquet Integral for Ordered Systems. CoRR abs/1102.1340 (2011)
- 2010
- [j63]Ulrich Faigle, Johann Hurink: Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007. Discrete Applied Mathematics 158(4): 239 (2010)
- [j62]Ulrich Faigle, Michel Grabisch, M. Heyne: Monge extensions of cooperation and communication structures. European Journal of Operational Research 206(1): 104-110 (2010)
- [j61]Ulrich Faigle, Britta Peis: Two-phase greedy algorithms for some classes of combinatorial linear programs. ACM Transactions on Algorithms 6(4) (2010)
- [c10]
- [e1]Ulrich Faigle, Rainer Schrader, Daniel Herrmann (Eds.): 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Cologne, Germany, May 25-27, 2010. Extended Abstracts. 2010
- [i5]
2000 – 2009
- 2009
- [j60]Jutta Gebert, Nicole Radde, Ulrich Faigle, Julia Strösser, Andreas Burkovski: Modeling and simulation of nitrogen regulation in Corynebacterium glutamicum. Discrete Applied Mathematics 157(10): 2232-2243 (2009)
- [j59]Ulrich Faigle, Rainer Schrader, Rüdiger Schultz: Preface on CTW 2006. Math. Meth. of OR 69(2): 203-204 (2009)
- [j58]Ulrich Faigle, Satoru Fujishige: A general model for matroids and the greedy algorithm. Math. Program. 119(2): 353-369 (2009)
- [c9]
- [c8]Ulrich Faigle, Michel Grabisch: A Monge Algorithm for Computing the Choquet Integral on Set Systems. IFSA/EUSFLAT Conf. 2009: 161-166
- 2008
- [j57]Ulrich Faigle, Bert Randerath, Rainer Schrader: Preface for CTW2005 special issue. Discrete Applied Mathematics 156(17): 3155 (2008)
- [j56]Ulrich Faigle, Britta Peis: Note on pseudolattices, lattices and submodular linear programs. Discrete Optimization 5(2): 489-500 (2008)
- [j55]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)
- [c7]
- [c6]Ulrich Faigle, Britta Peis: Two-phase greedy algorithms for some classes of combinatorial linear programs. SODA 2008: 161-166
- 2007
- [j54]Ulrich Faigle, Bernhard Fuchs, Britta Peis: Note on maximal split-stable subgraphs. Discrete Applied Mathematics 155(15): 2031-2038 (2007)
- [j53]Ulrich Faigle, Alexander Schönhuth: Asymptotic Mean Stationarity of Sources With Finite Evolution Dimension. IEEE Transactions on Information Theory 53(7): 2342-2348 (2007)
- [c5]Ulrich Faigle, Britta Peis: A two-phase greedy algorithm for modular lattice polyhedra. CTW 2007: 33-37
- 2006
- [j52]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)
- [j51]Ulrich Faigle, Johann Hurink, Stefan Wolfgang Pickl: Preface. Discrete Applied Mathematics 154(9): 1315 (2006)
- [j50]Ulrich Faigle, Gereon Frahling: A combinatorial algorithm for weighted stable sets in bipartite graphs. Discrete Applied Mathematics 154(9): 1380-1391 (2006)
- [j49]Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl: Graphs and combinatorial optimization. Discrete Optimization 3(3): 179 (2006)
- [j48]Ulrich Faigle, Alexander Schönhuth: Quantum Predictor Models. Electronic Notes in Discrete Mathematics 25: 149-155 (2006)
- [j47]Ulrich Faigle, Walter Kern, Jeroen Kuipers: Computing an Element in the Lexicographic Kernel of a Game. Math. Meth. of OR 63(3): 427-433 (2006)
- 2005
- [c4]Ulrich Faigle, Alexander Schönhuth: Note on Negative Probabilities and Observable Processes. Algorithms for Optimization with Incomplete Information 2005
- 2004
- [j46]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)
- [j45]Ulrich Faigle, Bernhard Fuchs, Britta Wienand: Covering Graphs by Colored Stable Sets. Electronic Notes in Discrete Mathematics 17: 145-149 (2004)
- [j44]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)
- [c3]Ulrich Faigle, Bernhard Fuchs, Britta Wienand: Covering Graphs by Colored Stable Sets. CTW 2004: 127-131
- 2003
- [j43]Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl, Gerhard J. Woeginger: Preface: Volume 13. Electronic Notes in Discrete Mathematics 13: 128 (2003)
- 2001
- [j42]Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl: Preface: Volume 8. Electronic Notes in Discrete Mathematics 8: 1 (2001)
- [j41]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)
- [j40]Marcel Hunting, Ulrich Faigle, Walter Kern: A Lagrangian relaxation approach to the edge-weighted clique problem. European Journal of Operational Research 131(1): 119-131 (2001)
- [j39]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)
- 2000
- [j38]Ulrich Faigle, Walter Kern, Daniël Paulusma: Note on the computational complexity of least core concepts for min-cost spanning tree games. Math. Meth. of OR 52(1): 23-38 (2000)
- [j37]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
- [j36]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
- [j35]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)
- [j34]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)
- [j33]Ulrich Faigle, Walter Kern: Approximate Core Allocation for Binpacking Games. SIAM J. Discrete Math. 11(3): 387-399 (1998)
- 1997
- [j32]
- [j31]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)
- [j30]Ulrich Faigle, Marcel Hunting, Walter Kern, R. Prakash, K. J. Supowit: Simplices by point-sliding and the Yamnitsky-Levin algorithm. Math. Meth. of OR 46(1): 131-142 (1997)
- 1996
- [j29]Ulrich Faigle, R. Garbe, Walter Kern: Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling. Computing 56(2): 95-104 (1996)
- [j28]Ulrich Faigle, Walter Kern, Boris Spieker: On the communication complexity of t -intersection problems in generalized Boolean algebras. Math. Meth. of OR 43(2): 239-254 (1996)
- [j27]Ulrich Faigle, Walter Kern: Submodular linear programs on forests. Math. Program. 72: 195-206 (1996)
- [j26]Ulrich Faigle, Walter Kern, M. Streng: Note on the computational complexity of j-radii of polytopes in Realn. Math. Program. 73: 1-5 (1996)
- [j25]Ulrich Faigle, Alan J. Hoffman, Walter Kern: A Characterization of Nonnegative Box-Greedy Matrices. SIAM J. Discrete Math. 9(1): 1-6 (1996)
- 1995
- [j24]Ulrich Faigle, Willem M. Nawijn: Note on Scheduling Intervals on-line. Discrete Applied Mathematics 58(1): 13-17 (1995)
- [j23]Ulrich Faigle, Noud Gademann, Walter Kern: A Random Polynomial Time Algorithm for Well-rounding Convex Bodies. Discrete Applied Mathematics 58(2): 117-144 (1995)
- [j22]Péter L. Erdös, Ulrich Faigle, Walter Kern: On the average rank of LYM-sets. Discrete Mathematics 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. Electronic Colloquium on Computational Complexity (ECCC) 2(7) (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. Electronic Colloquium on Computational Complexity (ECCC) 2(12) (1995)
- [i2]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)
- [i1]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)
- 1994
- [j21]
- 1993
- [j20]Ulrich Faigle, Walter Kern: On some approximately balanced combinatorial cooperative games. Math. Meth. of OR 38(2): 141-152 (1993)
- 1992
- [j19]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)
- [j18]Ulrich Faigle, Rainer Schrader: A greedy reduction algorithm for setup optimization. Discrete Applied Mathematics 35(1): 73-79 (1992)
- [j17]Ulrich Faigle, Rainer Schrader, György Turán: The Communication Complexity of Interval Orders. Discrete Applied Mathematics 40(1): 19-28 (1992)
- [j16]Ulrich Faigle, Walter Kern: Some Convergence Results for Probabilistic Tabu Search. INFORMS Journal on Computing 4(1): 32-37 (1992)
- 1991
- [j15]Ulrich Faigle, Walter Kern: Some Order Dimension Bounds for Communication Complexity Problems. Acta Inf. 28(6): 593-601 (1991)
- 1990
- [j14]Annelie von Arnim, Ulrich Faigle, Rainer Schrader: The permutahedron of series-parallel posets. Discrete Applied Mathematics 28(1): 3-9 (1990)
- [j13]E. Andrew Boyd, Ulrich Faigle: An algorithmic characterization of antimatroids. Discrete Applied Mathematics 28(3): 197-205 (1990)
1980 – 1989
- 1989
- [j12]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
- [j11]Ulrich Faigle, Rainer Schrader: On the Convergence of Stationary Distributions in Simulated Annealing Algorithms. Inf. Process. Lett. 27(4): 189-194 (1988)
- [j10]Ulrich Faigle, György Turán: Sorting and Recognition Problems for Ordered Sets. SIAM J. Comput. 17(1): 100-113 (1988)
- [j9]Ulrich Faigle, Rainer Schrader: Simulted Annealing -Eine Fallstudie. Angewandte Informatik 30(6): 259-263 (1988)
- 1987
- [j8]Ulrich Faigle, György Turán: On the complexity of interval orders and semiorders. Discrete Mathematics 63(2-3): 131-141 (1987)
- 1986
- [j7]Ulrich Faigle, Bill Sands: A size-width inequality for distributive lattices. Combinatorica 6(1): 29-33 (1986)
- [j6]Ulrich Faigle, Rainer Schrader: A combinatorial bijection between linear extensions of equivalent orders. Discrete Mathematics 58(3): 295-301 (1986)
- [j5]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)
- [c2]
- 1985
- [j4]Ulrich Faigle: On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms. J. ACM 32(4): 861-870 (1985)
- [j3]Ulrich Faigle, Gerhard Gierz, Rainer Schrader: Algorithmic approaches to setup minimization. SIAM J. Comput. 14(4): 954-965 (1985)
- [c1]
- 1984
- [j2]Ulrich Faigle, Rainer Schrader: Minimizing Completion Time for a Class of Scheduling Problems. Inf. Process. Lett. 19(1): 27-29 (1984)
- 1980
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-17 21:56 CEST by the dblp team