Ulrich Faigle
About
In The Last Decade
Ulrich Faigle
99 papers receiving 1.5k citations
Peers
Comparison fields: 5 of 110
- Computational Theory and Mathematics 663
- Management Science and Operations Research 436
- Economics and Econometrics 433
- Computer Networks and Communications 307
- Industrial and Manufacturing Engineering 254
Countries citing papers authored by Ulrich Faigle
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).
Fields of papers citing papers by Ulrich Faigle
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.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 15 | |
| 2 | Two-phase greedy algorithms for some classes of combinatorial linear programs | 4 |
| 3 | 4 | |
| 4 | 11 | |
| 5 | 13 | |
| 6 | 6th Twente Workshop on Graphs and Combinatorial Optimization | 5 |
| 7 | An algebraic framework for the greedy algorithm with applications to the core and Weber set of cooperative games | 0 |
| 8 | An efficient algorithm for nucleolus and prekernel computation in some classes of TU-games | 5 |
| 9 | Computing the Nucleolus of Min-cost Spanning Tree Games is NP-hard | 6 |
| 10 | 1 | |
| 11 | Partition games and the core of hierarchically convex cost games | 7 |
| 12 | Note On the Computational Complexity of j-Radii of Polytopes in R n | 5 |
| 13 | 43 | |
| 14 | Randomized online algorithms for maximizing busy time interval scheduling | 1 |
| 15 | Submodular linear programs on forests | 2 |
| 16 | On the game chromatic number of some classes of graphs | 95 |
| 17 | 109 | |
| 18 | 70 | |
| 19 | 0 | |
| 20 | 1 |
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.