Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUlrich Faigle
- > Home > Persons > Ulrich Faigle
Publications
- 2018
[j90]Ulrich Faigle, Walter Kern, Britta Peis:
Greedy Oriented Flows. Algorithmica 80(4): 1298-1314 (2018)- 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
- [c10]Ulrich Faigle, Walter Kern, Britta Peis:
On Greedy and Submodular Matrices. TAPAS 2011: 116-126 - 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) - 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) - 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) - 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
- [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
- [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
- [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) - [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) - 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)
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-04-14 23:39 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:
