default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUlrich Faigle
Person information
- affiliation: University of Cologne, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[i12]Ulrich Faigle:
Mathematical Game Theory. CoRR abs/2012.01850 (2020)
2010 – 2019
- 2019
- [j91]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: 1 (2019) - 2018
- [j90]Ulrich Faigle, Walter Kern, Britta Peis:
Greedy Oriented Flows. Algorithmica 80(4): 1298-1314 (2018) - [j89]Ulrich Faigle, Gerhard Gierz:
Markovian statistics on evolving systems. Evol. Syst. 9(3): 213-225 (2018) - 2017
- [j88]Ulrich Faigle, Michel Grabisch:
Game Theoretic Interaction and Decision: A Quantum Analysis. Games 8(4): 48 (2017) - 2016
- [j87]Ulrich Faigle, Michel Grabisch, Andrés Jiménez-Losada, Manuel Ordóñez:
Games on concept lattices: Shapley value and core. Discret. Appl. Math. 198: 29-47 (2016) - [j86]Ulrich Faigle:
Weighted Graphs as Dynamical Interaction Systems. Electron. Notes Discret. Math. 55: 185-189 (2016) - [j85]Ulrich Faigle, Michel Grabisch:
Bases and linear transforms of TU-games and cooperation systems. Int. J. Game Theory 45(4): 875-892 (2016) - [i11]Ulrich Faigle, Michel Grabisch:
Least Square Approximations and Linear Values of Cooperative Games. CoRR abs/1601.02831 (2016) - [i10]Ulrich Faigle, Alexander Schönhuth:
On Hidden States in Quantum Random Walks. CoRR abs/1601.02882 (2016) - 2015
- [j84]Ulrich Faigle, Erik Kropat, Renato De Leone, Silja Meyer-Nieberg, Stefan Pickl:
Preface. Discret. Appl. Math. 192: 1 (2015) - 2014
- [j83]Ulrich Faigle, Gaia Nicosia, Andrea Pacifici:
Preface. Discret. Appl. Math. 165: 1 (2014) - 2013
- [j82]Ulrich Faigle, Rainer Schrader:
9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010). Discret. Appl. Math. 161(12): 1673 (2013) - [i9]Ulrich Faigle, Alexander Schönhuth:
Observation and evolution of finite-dimensional Markov systems. CTW 2013: 93-97 - 2012
- [j81]Ulrich Faigle, Walter Kern, Britta Peis:
A ranking model for the greedy algorithm and discrete convexity. Math. Program. 132(1-2): 393-407 (2012) - [i8]Ulrich Faigle, Walter Kern, Britta Peis:
Max-Flow on Regular Spaces. CoRR abs/1206.5167 (2012) - 2011
- [j80]Sonia Cafieri, Ulrich Faigle, Leo Liberti:
8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009). Discret. Appl. Math. 159(16): 1659 (2011) - [j79]Ulrich Faigle, Jan Voss:
A system-theoretic model for cooperation, interaction and allocation. Discret. Appl. Math. 159(16): 1736-1750 (2011) - [j78]Ulrich Faigle, Michel Grabisch:
A discrete Choquet integral for ordered systems. Fuzzy Sets Syst. 168(1): 3-17 (2011) - [j77]Ulrich Faigle, Alexander Schönhuth:
Efficient Tests for Equivalence of Hidden Markov Processes and Quantum Random Walks. IEEE Trans. Inf. Theory 57(3): 1746-1753 (2011) - [c12]Kirsten Albrecht, Ulrich Faigle:
Binary Betting Strategies with Optimal Logarithmic Growth. CTW 2011: 44-47 - [c11]Ulrich Faigle, Alexander Schönhuth:
Representations of Power Series over Word Algebras. CTW 2011: 154-157 - [c10]Ulrich Faigle, Walter Kern, Britta Peis:
On Greedy and Submodular Matrices. TAPAS 2011: 116-126 - [i7]Ulrich Faigle, Michel Grabisch:
A Discrete Choquet Integral for Ordered Systems. CoRR abs/1102.1340 (2011) - 2010
- [j76]Ulrich Faigle, Johann L. Hurink:
Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007. Discret. Appl. Math. 158(4): 239 (2010) - [j75]Ulrich Faigle, Michel Grabisch, M. Heyne:
Monge extensions of cooperation and communication structures. Eur. J. Oper. Res. 206(1): 104-110 (2010) - [j74]Ulrich Faigle, Britta Peis:
Two-phase greedy algorithms for some classes of combinatorial linear programs. ACM Trans. Algorithms 6(4): 65:1-65:13 (2010) - [c9]Ulrich Faigle, Michel Grabisch, M. Heyne:
Choquet Integration on Set Systems. IPMU 2010: 512-520 - [e1]Ulrich Faigle, Rainer Schrader, Daniel Herrmann:
9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Cologne, Germany, May 25-27, 2010. Extended Abstracts. 2010 [contents] - [i6]Ulrich Faigle, Alexander Schönhuth:
Discrete Quantum Markov Chains. CoRR abs/1011.1295 (2010)
2000 – 2009
- 2009
- [j73]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): 2232-2243 (2009) - [j72]Ulrich Faigle, Rainer Schrader, Rüdiger Schultz:
Preface on CTW 2006. Math. Methods Oper. Res. 69(2): 203-204 (2009) - [j71]Ulrich Faigle, Satoru Fujishige:
A general model for matroids and the greedy algorithm. Math. Program. 119(2): 353-369 (2009) - [c8]Ulrich Faigle, Jan Voss:
A System-Theoretic Model for Cooperation and Allocation Mechanisms. CTW 2009: 361-364 - [c7]Ulrich Faigle, Michel Grabisch:
A Monge Algorithm for Computing the Choquet Integral on Set Systems. IFSA/EUSFLAT Conf. 2009: 161-166 - 2008
- [j70]Ulrich Faigle, Bert Randerath, Rainer Schrader:
Preface for CTW2005 special issue. Discret. Appl. Math. 156(17): 3155 (2008) - [j69]Ulrich Faigle, Britta Peis:
Note on pseudolattices, lattices and submodular linear programs. Discret. Optim. 5(2): 489-500 (2008) - [j68]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): 185-194 (2008) - [c6]Ulrich Faigle, Britta Peis:
A Hierarchical Model for Cooperative Games. SAGT 2008: 230-241 - [c5]Ulrich Faigle, Britta Peis:
Two-phase greedy algorithms for some classes of combinatorial linear programs. SODA 2008: 161-166 - 2007
- [j67]Ulrich Faigle, Bernhard Fuchs, Britta Peis:
Note on maximal split-stable subgraphs. Discret. Appl. Math. 155(15): 2031-2038 (2007) - [j66]Ulrich Faigle, Alexander Schönhuth:
Asymptotic Mean Stationarity of Sources With Finite Evolution Dimension. IEEE Trans. Inf. Theory 53(7): 2342-2348 (2007) - [c4]Ulrich Faigle, Britta Peis:
A two-phase greedy algorithm for modular lattice polyhedra. CTW 2007: 33-37 - 2006
- [j65]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): 1495-1502 (2006) - [j64]Ulrich Faigle, Johann L. Hurink, Stefan Wolfgang Pickl:
Preface. Discret. Appl. Math. 154(9): 1315 (2006) - [j63]Ulrich Faigle, Gereon Frahling:
A combinatorial algorithm for weighted stable sets in bipartite graphs. Discret. Appl. Math. 154(9): 1380-1391 (2006) - [j62]Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl:
Graphs and combinatorial optimization. Discret. Optim. 3(3): 179 (2006) - [j61]Ulrich Faigle, Alexander Schönhuth:
Quantum Predictor Models. Electron. Notes Discret. Math. 25: 149-155 (2006) - [j60]Ulrich Faigle, Walter Kern, Jeroen Kuipers:
Computing an Element in the Lexicographic Kernel of a Game. Math. Methods Oper. Res. 63(3): 427-433 (2006) - 2005
- [i5]Ulrich Faigle, Alexander Schönhuth:
Note on Negative Probabilities and Observable Processes. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j59]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): 159-160 (2004) - [j58]Ulrich Faigle, Bernhard Fuchs, Britta Wienand:
Covering Graphs by Colored Stable Sets. Electron. Notes Discret. Math. 17: 145-149 (2004) - [j57]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): 371-376 (2004) - [c3]Ulrich Faigle, Bernhard Fuchs, Britta Wienand:
Covering Graphs by Colored Stable Sets. CTW 2004: 127-131 - 2003
- [j56]Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl, Gerhard J. Woeginger:
Preface: Volume 13. Electron. Notes Discret. Math. 13: 128 (2003) - 2001
- [j55]Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl:
Preface: Volume 8. Electron. Notes Discret. Math. 8: 1 (2001) - [j54]Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle:
Relaxation methods for the Generalized Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 8: 76-79 (2001) - [j53]Marcel Hunting, Ulrich Faigle, Walter Kern:
A Lagrangian relaxation approach to the edge-weighted clique problem. Eur. J. Oper. Res. 131(1): 119-131 (2001) - [j52]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
- [j51]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): 23-38 (2000) - [j50]Ulrich Faigle, Walter Kern:
On the core of ordered submodular cost games. Math. Program. 87(3): 483-499 (2000) - [j49]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
- [j48]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
- [j47]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) - [j46]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) - [j45]Ulrich Faigle, Walter Kern:
Approximate Core Allocation for Binpacking Games. SIAM J. Discret. Math. 11(3): 387-399 (1998) - 1997
- [j44]Ulrich Faigle, Kees Hoede:
Preface. Discret. Appl. Math. 79(1-3): 1 (1997) - [j43]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) - [j42]Ulrich Faigle, Marcel Hunting, Walter Kern, Ravi Prakash, K. J. Supowit:
Simplices by point-sliding and the Yamnitsky-Levin algorithm. Math. Methods Oper. Res. 46(1): 131-142 (1997) - 1996
- [j41]Ulrich Faigle, Renate Garbe, Walter Kern:
Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling. Computing 56(2): 95-104 (1996) - [j40]Ulrich Faigle, Walter Kern, Boris Spieker:
On the communication complexity of t -intersection problems in generalized Boolean algebras. Math. Methods Oper. Res. 43(2): 239-254 (1996) - [j39]Ulrich Faigle, Walter Kern:
Submodular linear programs on forests. Math. Program. 72: 195-206 (1996) - [j38]Ulrich Faigle, Walter Kern, Martin Streng:
Note on the computational complexity of j-radii of polytopes in Realn. Math. Program. 73: 1-5 (1996) - [j37]Ulrich Faigle, Alan J. Hoffman, Walter Kern:
A Characterization of Nonnegative Box-Greedy Matrices. SIAM J. Discret. Math. 9(1): 1-6 (1996) - 1995
- [j36]Ulrich Faigle, Willem M. Nawijn:
Note on Scheduling Intervals on-line. Discret. Appl. Math. 58(1): 13-17 (1995) - [j35]Ulrich Faigle, Noud Gademann, Walter Kern:
A Random Polynomial Time Algorithm for Well-rounding Convex Bodies. Discret. Appl. Math. 58(2): 117-144 (1995) - [j34]Péter L. Erdös, Ulrich Faigle, Walter Kern:
On the average rank of LYM-sets. Discret. Math. 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. Electron. Colloquium Comput. Complex. TR95 (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. Electron. Colloquium Comput. Complex. TR95 (1995) - [i2]Ulrich Faigle, Walter Kern, Martin Streng:
Note On the Computational Complexity of j-Radii of Polytopes in Rn. Electron. Colloquium Comput. Complex. TR95 (1995) - [i1]Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern:
On Approximately Fair Cost Allocation in Euclidean TSP Games. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j33]Ulrich Faigle, Kees Hoede:
Preface. Discret. Appl. Math. 51(1-2): 1 (1994) - [j32]Ulrich Faigle, Walter Kern:
Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints. Oper. Res. 42(4): 688-693 (1994) - 1993
- [j31]Ulrich Faigle, Walter Kern:
On some approximately balanced combinatorial cooperative games. ZOR Methods Model. Oper. Res. 38(2): 141-152 (1993) - 1992
- [j30]Péter L. Erdös, Ulrich Faigle, Walter Kern:
A Group-Theoretic Setting for Some Intersecting Sperner Families. Comb. Probab. Comput. 1: 323-334 (1992) - [j29]Ulrich Faigle, Rainer Schrader:
A greedy reduction algorithm for setup optimization. Discret. Appl. Math. 35(1): 73-79 (1992) - [j28]Ulrich Faigle, Rainer Schrader, György Turán:
The Communication Complexity of Interval Orders. Discret. Appl. Math. 40(1): 19-28 (1992) - [j27]Ulrich Faigle, Walter Kern:
Some Convergence Results for Probabilistic Tabu Search. INFORMS J. Comput. 4(1): 32-37 (1992) - 1991
- [j26]Ulrich Faigle, Walter Kern:
Some Order Dimension Bounds for Communication Complexity Problems. Acta Informatica 28(6): 593-601 (1991) - [j25]Rainer E. Burkard, Ulrich Faigle:
Book reviews. ZOR Methods Model. Oper. Res. 35(4): 346-349 (1991) - 1990
- [j24]Annelie von Arnim, Ulrich Faigle, Rainer Schrader:
The permutahedron of series-parallel posets. Discret. Appl. Math. 28(1): 3-9 (1990) - [j23]E. Andrew Boyd, Ulrich Faigle:
An algorithmic characterization of antimatroids. Discret. Appl. Math. 28(3): 197-205 (1990)
1980 – 1989
- 1989
- [j22]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) - [j21]Ulrich Faigle:
Cores of games with restricted cooperation. ZOR Methods Model. Oper. Res. 33(6): 405-422 (1989) - 1988
- [j20]Ulrich Faigle, Rainer Schrader:
On the Convergence of Stationary Distributions in Simulated Annealing Algorithms. Inf. Process. Lett. 27(4): 189-194 (1988) - [j19]Diethard Pallaschke, Ali Ridha Mahjoub, Ulrich Faigle, A. Rocinski, Jean-Pierre Crouzeix:
Book reviews. ZOR Methods Model. Oper. Res. 32(5): 346-351 (1988) - [j18]Ulrich Faigle, György Turán:
Sorting and Recognition Problems for Ordered Sets. SIAM J. Comput. 17(1): 100-113 (1988) - [j17]Ulrich Faigle, Rainer Schrader:
Simulted Annealing -Eine Fallstudie. Angew. Inform. 30(6): 259-263 (1988) - 1987
- [j16]Ulrich Faigle, Rainer Schrader:
Interval orders without odd crowns are defect optimal. Computing 38(1): 59-69 (1987) - [j15]Ulrich Faigle, György Turán:
On the complexity of interval orders and semiorders. Discret. Math. 63(2-3): 131-141 (1987) - 1986
- [j14]Ulrich Faigle, Bill Sands:
A size-width inequality for distributive lattices. Comb. 6(1): 29-33 (1986) - [j13]Ulrich Faigle:
Exchange properties of combinatorial closure spaces. Discret. Appl. Math. 15(2-3): 249-260 (1986) - [j12]Ulrich Faigle, Rainer Schrader:
On the computational complexity of the order polynomial. Discret. Appl. Math. 15(2-3): 261-269 (1986) - [j11]Ulrich Faigle, Rainer Schrader:
A combinatorial bijection between linear extensions of equivalent orders. Discret. Math. 58(3): 295-301 (1986) - [j10]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]Ulrich Faigle:
The Bandwidth of Planar Distributive Lattices. WG 1986: 94-105 - 1985
- [j9]Ulrich Faigle:
On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms. J. ACM 32(4): 861-870 (1985) - [j8]J. George Shanthikumar, Alfred Luhmer, H. Kremar, Ulrich Faigle, Martin Shubik, Hansjörg Wacker, Alexander Schrijver, Michael M. Richter:
Book reviews. Z. Oper. Research 29(3): 132-139 (1985) - [j7]Ulrich Faigle, Gerhard Gierz, Rainer Schrader:
Algorithmic approaches to setup minimization. SIAM J. Comput. 14(4): 954-965 (1985) - [c1]Ulrich Faigle, György Turán:
Sorting and Recognition Problems for Ordered Sets. STACS 1985: 109-118 - 1984
- [j6]Ulrich Faigle:
5th Bonn workshop on combinatorial optimization : June 11-16, 1984 at the University of Bonn, West Germany. Discret. Appl. Math. 7(3): 335 (1984) - [j5]Ulrich Faigle:
A vector exchange property of submodular systems. Discret. Appl. Math. 9(2): 209-211 (1984) - [j4]Ulrich Faigle, Rainer Schrader:
Minimizing Completion Time for a Class of Scheduling Problems. Inf. Process. Lett. 19(1): 27-29 (1984) - 1983
- [j3]Ulrich Faigle:
Optimal Matchings in Posets. Eur. J. Comb. 4(4): 295-303 (1983) - 1980
- [j2]Ulrich Faigle:
Geometries on partially ordered sets. J. Comb. Theory B 28(1): 26-51 (1980)
1970 – 1979
- 1979
- [j1]Ulrich Faigle:
The greedy algorithm for partially ordered sets. Discret. Math. 28(2): 153-159 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
