The following pages link to Ulrich Faigle (Q185691):
Displaying 50 items.
- Weighted graphs as dynamical interaction systems (Q510988) (← links)
- Bases and linear transforms of TU-games and cooperation systems (Q524965) (← links)
- A discrete Choquet integral for ordered systems (Q533162) (← links)
- A system-theoretic model for cooperation, interaction and allocation (Q643011) (← links)
- A vector exchange property of submodular systems (Q760438) (← links)
- Optimal matchings in posets (Q792355) (← links)
- Minimizing completion time for a class of scheduling problems (Q794156) (← links)
- Geometric exchange properties in lattices of finite length (Q799703) (← links)
- Games on concept lattices: Shapley value and core (Q897583) (← links)
- (Q921908) (redirect page) (← links)
- Some order dimension bounds for communication complexity problems (Q921909) (← links)
- Note on pseudolattices, lattices and submodular linear programs (Q951121) (← links)
- Monge extensions of cooperation and communication structures (Q976406) (← links)
- A general model for matroids and the greedy algorithm (Q1013980) (← links)
- Modeling and simulation of nitrogen regulation in corynebacterium glutamicum (Q1026177) (← links)
- A setup heuristic for interval orders (Q1064975) (← links)
- A combinatorial bijection between linear extensions of equivalent orders (Q1078213) (← links)
- Interval orders without odd crowns are defect optimal (Q1079584) (← links)
- Exchange properties of combinatorial closure spaces (Q1083458) (← links)
- On the computational complexity of the order polynomial (Q1086595) (← links)
- On the complexity of interval orders and semiorders (Q1088407) (← links)
- Setup optimization problems with matroid structure (Q1092934) (← links)
- On the convergence of stationary distributions in simulated annealing algorithms (Q1099589) (← links)
- Extensions and duality of finite geometric closure operators (Q1139610) (← links)
- The greedy algorithm for partially ordered sets (Q1140103) (← links)
- Frink's theorem for modular lattices (Q1141669) (← links)
- Über Morphismen halbmodularer Verbände (Q1144055) (← links)
- A greedy reduction algorithm for setup optimization (Q1183348) (← links)
- The communication complexity of interval orders (Q1201817) (← links)
- The Shapley value for cooperative games under precedence constraints (Q1202565) (← links)
- Geometries on partially ordered sets (Q1238815) (← links)
- The nucleon of cooperative games and an algorithm for matching games (Q1290660) (← links)
- A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
- Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← links)
- On the complexity of testing membership in the core of min-cost spanning tree games (Q1365002) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- Note on the computational complexity of least core concepts for min-cost spanning tree games. (Q1403160) (← links)
- On the computation of the nucleolus of a cooperative game (Q1414387) (← links)
- On the core of ordered submodular cost games (Q1575071) (← links)
- Game theoretic interaction and decision: a quantum analysis (Q1656985) (← links)
- Greedy oriented flows (Q1751094) (← links)
- Values for Markovian coalition processes (Q1762417) (← links)
- Modeling feedback loops in the H-NS-mediated regulation of the \textit{Escherichia coli bgl} operon (Q1788356) (← links)
- A random polynomial time algorithm for well-routing convex bodies (Q1805452) (← links)
- Note on scheduling intervals on-line (Q1805461) (← links)
- Note on the game chromatic index of trees (Q1884997) (← links)
- On the average rank of LYM-sets (Q1898339) (← links)
- Randomized online algorithms for maximizing busy time interval scheduling (Q1909593) (← links)
- Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\) (Q1915805) (← links)
- Submodular linear programs on forests (Q1919093) (← links)
