Citations per year, relative to Ulrich Faigle Ulrich Faigle (= 1×)
peers
Saket Saurabh
Countries citing papers authored by Ulrich Faigle
Since
Specialization
Citations
This map shows the geographic impact of Ulrich Faigle's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ulrich Faigle with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ulrich Faigle more than expected).
This network shows the impact of papers produced by Ulrich Faigle. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ulrich Faigle. The network helps show where Ulrich Faigle may publish in the future.
Co-authorship network of co-authors of Ulrich Faigle
This figure shows the co-authorship network connecting the top 25 collaborators of Ulrich Faigle.
A scholar is included among the top collaborators of Ulrich Faigle based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Ulrich Faigle. Ulrich Faigle is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Faigle, Ulrich & Britta Peis. (2008). Two-phase greedy algorithms for some classes of combinatorial linear programs. Symposium on Discrete Algorithms. 161–166.4 indexed citations
Faigle, Ulrich, Walter Kern, & Daniël Paulusma. (2000). . Durham Research Online (Durham University).13 indexed citations
6.
Broersma, Hajo, et al.. (1999). 6th Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics. 3.5 indexed citations
7.
Faigle, Ulrich & Walter Kern. (1998). An algebraic framework for the greedy algorithm with applications to the core and Weber set of cooperative games. University of Twente Research Information.
8.
Faigle, Ulrich, Walter Kern, & Jeroen Kuipers. (1998). An efficient algorithm for nucleolus and prekernel computation in some classes of TU-games. University of Twente Research Information.5 indexed citations
9.
Faigle, Ulrich, Walter Kern, & Jeroen Kuipers. (1998). Computing the Nucleolus of Min-cost Spanning Tree Games is NP-hard. SSRN Electronic Journal.6 indexed citations
Faigle, Ulrich & Walter Kern. (1995). Partition games and the core of hierarchically convex cost games. University of Twente Research Information.7 indexed citations
12.
Faigle, Ulrich, et al.. (1995). Note On the Computational Complexity of j-Radii of Polytopes in R n. Electronic colloquium on computational complexity. 2.5 indexed citations
Faigle, Ulrich, et al.. (1994). Randomized online algorithms for maximizing busy time interval scheduling. University of Twente Research Information.1 indexed citations
15.
Faigle, Ulrich & Walter Kern. (1993). Submodular linear programs on forests. University of Twente Research Information.2 indexed citations
16.
Faigle, Ulrich, Walter Kern, H. A. Kierstead, & W. T. Trotter. (1991). On the game chromatic number of some classes of graphs. Ars Combinatoria. 35(940). 143–150.95 indexed citations
Faigle, Ulrich. (1983). Optimal Matchings in Posets. European Journal of Combinatorics. 4(4). 295–303.1 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.