Ulrich Faigle

Publication Activity (10 Years)

Years Active: 1979-2020
Publications (10 Years): 10

Top Venues

Discret. Appl. Math.

CoRR

Games

Evol. Syst.

Publications

Ulrich Faigle
Mathematical Game Theory. CoRR (2020)
Ekrem Duman, Ali Fuat Alkaya, Stefan Pickl, Ulrich Faigle
Preface: 13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2015). Discret. Appl. Math. 252 (2019)
Ulrich Faigle, Gerhard Gierz
Markovian statistics on evolving systems. Evol. Syst. 9 (3) (2018)
Ulrich Faigle, Walter Kern, Britta Peis
Greedy Oriented Flows. Algorithmica 80 (4) (2018)
Ulrich Faigle, Michel Grabisch
Game Theoretic Interaction and Decision: A Quantum Analysis. Games 8 (4) (2017)
Ulrich Faigle, Michel Grabisch
Bases and linear transforms of TU-games and cooperation systems. Int. J. Game Theory 45 (4) (2016)
Ulrich Faigle, Michel Grabisch, Andrés Jiménez-Losada, Manuel Ordóñez
Games on concept lattices: Shapley value and core. Discret. Appl. Math. 198 (2016)
Ulrich Faigle, Michel Grabisch
Least Square Approximations and Linear Values of Cooperative Games. CoRR (2016)
Ulrich Faigle
Weighted Graphs as Dynamical Interaction Systems. Electron. Notes Discret. Math. 55 (2016)
Ulrich Faigle, Alexander Schönhuth
On Hidden States in Quantum Random Walks. CoRR (2016)
Ulrich Faigle, Erik Kropat, Renato De Leone, Silja Meyer-Nieberg, Stefan Pickl
Preface. Discret. Appl. Math. 192 (2015)
Ulrich Faigle, Gaia Nicosia, Andrea Pacifici
Preface. Discret. Appl. Math. 165 (2014)
Ulrich Faigle, Rainer Schrader
9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010). Discret. Appl. Math. 161 (12) (2013)
Ulrich Faigle, Alexander Schönhuth
Observation and evolution of finite-dimensional Markov systems. CTW (2013)
Ulrich Faigle, Walter Kern, Britta Peis
A ranking model for the greedy algorithm and discrete convexity. Math. Program. 132 (1-2) (2012)
Ulrich Faigle, Walter Kern, Britta Peis
Max-Flow on Regular Spaces CoRR (2012)
Ulrich Faigle, Alexander Schönhuth
Representations of Power Series over Word Algebras. CTW (2011)
Ulrich Faigle, Michel Grabisch
A discrete Choquet integral for ordered systems. Fuzzy Sets Syst. 168 (1) (2011)
Kirsten Albrecht, Ulrich Faigle
Binary Betting Strategies with Optimal Logarithmic Growth. CTW (2011)
Sonia Cafieri, Ulrich Faigle, Leo Liberti
8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009). Discret. Appl. Math. 159 (16) (2011)
Ulrich Faigle, Walter Kern, Britta Peis
On Greedy and Submodular Matrices. TAPAS (2011)
Ulrich Faigle, Michel Grabisch
A Discrete Choquet Integral for Ordered Systems CoRR (2011)
Ulrich Faigle, Jan Voss
A system-theoretic model for cooperation, interaction and allocation. Discret. Appl. Math. 159 (16) (2011)
Ulrich Faigle, Alexander Schönhuth
Efficient Tests for Equivalence of Hidden Markov Processes and Quantum Random Walks. IEEE Trans. Inf. Theory 57 (3) (2011)
Ulrich Faigle, Michel Grabisch, M. Heyne
Monge extensions of cooperation and communication structures. Eur. J. Oper. Res. 206 (1) (2010)
Ulrich Faigle, Britta Peis
Two-phase greedy algorithms for some classes of combinatorial linear programs. ACM Trans. Algorithms 6 (4) (2010)
Ulrich Faigle, Johann L. Hurink
Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007. Discret. Appl. Math. 158 (4) (2010)
Ulrich Faigle, Alexander Schönhuth
Discrete Quantum Markov Chains CoRR (2010)
Ulrich Faigle, Michel Grabisch, M. Heyne
Choquet Integration on Set Systems. IPMU (2010)
Jutta Gebert, Nicole Radde, Ulrich Faigle, Julia Strösser, Andreas Burkovski
Modeling and simulation of nitrogen regulation in Corynebacterium glutamicum. Discret. Appl. Math. 157 (10) (2009)
Ulrich Faigle, Satoru Fujishige
A general model for matroids and the greedy algorithm. Math. Program. 119 (2) (2009)
Ulrich Faigle, Rainer Schrader, Rüdiger Schultz
Preface on CTW 2006. Math. Methods Oper. Res. 69 (2) (2009)
Ulrich Faigle, Michel Grabisch
A Monge Algorithm for Computing the Choquet Integral on Set Systems. IFSA/EUSFLAT Conf. (2009)
Ulrich Faigle, Jan Voss
A System-Theoretic Model for Cooperation and Allocation Mechanisms. CTW (2009)
Ulrich Faigle, Bert Randerath, Rainer Schrader
Preface for CTW2005 special issue. Discret. Appl. Math. 156 (17) (2008)
Ulrich Faigle, Britta Peis
Note on pseudolattices, lattices and submodular linear programs. Discret. Optim. 5 (2) (2008)
Ulrich Faigle, Britta Peis
A Hierarchical Model for Cooperative Games. SAGT (2008)
Ulrich Faigle, Britta Peis
Two-phase greedy algorithms for some classes of combinatorial linear programs. SODA (2008)
Jutta Gebert, Susanne Motameny, Ulrich Faigle, Christian V. Forst, Rainer Schrader
Identifying Genes of Gene Regulatory Networks Using Formal Concept Analysis. J. Comput. Biol. 15 (2) (2008)
Ulrich Faigle, Alexander Schönhuth
Asymptotic Mean Stationarity of Sources With Finite Evolution Dimension. IEEE Trans. Inf. Theory 53 (7) (2007)
Ulrich Faigle, Bernhard Fuchs, Britta Peis
Note on maximal split-stable subgraphs. Discret. Appl. Math. 155 (15) (2007)
Ulrich Faigle, Britta Peis
A two-phase greedy algorithm for modular lattice polyhedra. CTW (2007)
Ulrich Faigle, Gereon Frahling
A combinatorial algorithm for weighted stable sets in bipartite graphs. Discret. Appl. Math. 154 (9) (2006)
Ulrich Faigle, Walter Kern, Jeroen Kuipers
Computing an Element in the Lexicographic Kernel of a Game. Math. Methods Oper. Res. 63 (3) (2006)
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. Bioinform. 22 (12) (2006)
Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl
Graphs and combinatorial optimization. Discret. Optim. 3 (3) (2006)
Ulrich Faigle, Johann L. Hurink, Stefan Wolfgang Pickl
Preface. Discret. Appl. Math. 154 (9) (2006)
Ulrich Faigle, Alexander Schönhuth
Quantum Predictor Models. Electron. Notes Discret. Math. 25 (2006)
Ulrich Faigle, Alexander Schönhuth
Note on Negative Probabilities and Observable Processes. Algorithms for Optimization with Incomplete Information (2005)
Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern
Note on the game chromatic index of trees. Theor. Comput. Sci. 313 (3) (2004)
Ulrich Faigle, Bernhard Fuchs, Britta Wienand
Covering Graphs by Colored Stable Sets. CTW (2004)
Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann L. Hurink
Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Discret. Appl. Math. 136 (2-3) (2004)
Ulrich Faigle, Bernhard Fuchs, Britta Wienand
Covering Graphs by Colored Stable Sets. Electron. Notes Discret. Math. 17 (2004)
Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl, Gerhard J. Woeginger
Preface: Volume 13. Electron. Notes Discret. Math. 13 (2003)
Ulrich Faigle, Walter Kern, Jeroen Kuipers
On the computation of the nucleolus of a cooperative game. Int. J. Game Theory 30 (1) (2001)
Marcel Hunting, Ulrich Faigle, Walter Kern
A Lagrangian relaxation approach to the edge-weighted clique problem. Eur. J. Oper. Res. 131 (1) (2001)
Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl
Preface: Volume 8. Electron. Notes Discret. Math. 8 (2001)
Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle
Relaxation methods for the Generalized Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 8 (2001)
Ulrich Faigle, Walter Kern
On the core of ordered submodular cost games. Math. Program. 87 (3) (2000)
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) (2000)
Ulrich Faigle, Walter Kern, Daniël Paulusma
Note on the computational complexity of least core concepts for min-cost spanning tree games. Math. Methods Oper. Res. 52 (1) (2000)
Ulrich Faigle, Walter Kern, Willem M. Nawijn
A Greedy On-Line Algorithm for thek-Track Assignment Problem. J. Algorithms 31 (1) (1999)
Ulrich Faigle, Walter Kern
Approximate Core Allocation for Binpacking Games. SIAM J. Discret. Math. 11 (3) (1998)
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) (1998)
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 (1998)
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) (1997)
Ulrich Faigle, Kees Hoede
Preface. Discret. Appl. Math. 79 (1-3) (1997)
Ulrich Faigle, Marcel Hunting, Walter Kern, R. Prakash, K. J. Supowit
Simplices by point-sliding and the Yamnitsky-Levin algorithm. Math. Methods Oper. Res. 46 (1) (1997)
Ulrich Faigle, Walter Kern, Martin Streng
. Math. Program. 73 (1996)
Ulrich Faigle, Walter Kern
Submodular linear programs on forests. Math. Program. 72 (1996)
Ulrich Faigle, Walter Kern, Boris Spieker
-intersection problems in generalized Boolean algebras. Math. Methods Oper. Res. 43 (2) (1996)
Ulrich Faigle, Alan J. Hoffman, Walter Kern
A Characterization of Nonnegative Box-Greedy Matrices. SIAM J. Discret. Math. 9 (1) (1996)
Ulrich Faigle, Renate Garbe, Walter Kern
Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling. Computing 56 (2) (1996)
Ulrich Faigle, Noud Gademann, Walter Kern
A Random Polynomial Time Algorithm for Well-rounding Convex Bodies. Discret. Appl. Math. 58 (2) (1995)
Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
On Approximately Fair Cost Allocation in Euclidean TSP Games Electron. Colloquium Comput. Complex. 2 (16) (1995)
Péter L. Erdös, Ulrich Faigle, Walter Kern
On the average rank of LYM-sets. Discret. Math. 144 (1-3) (1995)
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 Electron. Colloquium Comput. Complex. 2 (12) (1995)
Ulrich Faigle, Willem M. Nawijn
Note on Scheduling Intervals on-line. Discret. Appl. Math. 58 (1) (1995)
Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
The Nucleon of Cooperative Games and an Algorithm for Matching Games Electron. Colloquium Comput. Complex. 2 (7) (1995)
Ulrich Faigle, Walter Kern, Martin Streng
Electron. Colloquium Comput. Complex. 2 (14) (1995)
Ulrich Faigle, Walter Kern
Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints. Oper. Res. 42 (4) (1994)
Ulrich Faigle, Kees Hoede
Preface. Discret. Appl. Math. 51 (1-2) (1994)
Ulrich Faigle, Walter Kern
On some approximately balanced combinatorial cooperative games. ZOR Methods Model. Oper. Res. 38 (2) (1993)
Ulrich Faigle, Rainer Schrader, György Turán
The Communication Complexity of Interval Orders. Discret. Appl. Math. 40 (1) (1992)
Ulrich Faigle, Walter Kern
Some Convergence Results for Probabilistic Tabu Search. INFORMS J. Comput. 4 (1) (1992)
Péter L. Erdös, Ulrich Faigle, Walter Kern
A Group-Theoretic Setting for Some Intersecting Sperner Families. Comb. Probab. Comput. 1 (1992)
Ulrich Faigle, Rainer Schrader
A greedy reduction algorithm for setup optimization. Discret. Appl. Math. 35 (1) (1992)
Rainer E. Burkard, Ulrich Faigle
Book reviews. ZOR Methods Model. Oper. Res. 35 (4) (1991)
Ulrich Faigle, Walter Kern
Some Order Dimension Bounds for Communication Complexity Problems. Acta Informatica 28 (6) (1991)
E. Andrew Boyd, Ulrich Faigle
An algorithmic characterization of antimatroids. Discret. Appl. Math. 28 (3) (1990)
Annelie von Arnim, Ulrich Faigle, Rainer Schrader
The permutahedron of series-parallel posets. Discret. Appl. Math. 28 (1) (1990)
Ulrich Faigle
Cores of games with restricted cooperation. ZOR Methods Model. Oper. Res. 33 (6) (1989)
Ulrich Faigle, Walter Kern, György Turán
On the performance of on-line algorithms for partition problems. Acta Cybern. 9 (2) (1989)
Ulrich Faigle, Rainer Schrader
On the Convergence of Stationary Distributions in Simulated Annealing Algorithms. Inf. Process. Lett. 27 (4) (1988)
Ulrich Faigle, Rainer Schrader
Simulted Annealing -Eine Fallstudie. Angew. Inform. 30 (6) (1988)
Diethard Pallaschke, Ali Ridha Mahjoub, Ulrich Faigle, A. Rocinski, Jean-Pierre Crouzeix
Book reviews. ZOR Methods Model. Oper. Res. 32 (5) (1988)
Ulrich Faigle, György Turán
Sorting and Recognition Problems for Ordered Sets. SIAM J. Comput. 17 (1) (1988)
Ulrich Faigle, György Turán
On the complexity of interval orders and semiorders. Discret. Math. 63 (2-3) (1987)
Ulrich Faigle, Rainer Schrader
Interval orders without odd crowns are defect optimal. Computing 38 (1) (1987)
Ulrich Faigle
The Bandwidth of Planar Distributive Lattices. WG (1986)

Ulrich Faigle.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ulrich Faigle