Ulrich Faigle

From MaRDI portal
Revision as of 19:49, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Ulrich Faigle to Ulrich Faigle: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:185691

Available identifiers

zbMath Open faigle.ulrichWikidataQ102189995 ScholiaQ102189995MaRDI QIDQ185691

List of research outcomes





PublicationDate of PublicationType
Bell's Inequality and Heisenberg Measurements on Relativistic Quantum Systems2023-04-25Paper
Mathematical Game Theory2022-04-04Paper
Modeling feedback loops in the H-NS-mediated regulation of the \textit{Escherichia coli bgl} operon2018-10-08Paper
Game theoretic interaction and decision: a quantum analysis2018-08-13Paper
Greedy oriented flows2018-05-23Paper
Efficient Tests for Equivalence of Hidden Markov Processes and Quantum Random Walks2017-07-27Paper
Bases and linear transforms of TU-games and cooperation systems2017-04-27Paper
Weighted graphs as dynamical interaction systems2017-02-14Paper
Markovian Statistics on Evolving Systems2017-01-22Paper
Least Square Approximations and Linear Values of Cooperative Games2016-01-12Paper
Games on concept lattices: Shapley value and core2015-12-07Paper
Two-phase greedy algorithms for some classes of combinatorial linear programs2014-11-18Paper
Preface2014-05-05Paper
Values for Markovian coalition processes2012-11-26Paper
A ranking model for the greedy algorithm and discrete convexity2012-04-27Paper
A system-theoretic model for cooperation, interaction and allocation2011-10-27Paper
On Greedy and Submodular Matrices2011-05-12Paper
A discrete Choquet integral for ordered systems2011-05-02Paper
https://portal.mardi4nfdi.de/entity/Q35794412010-08-06Paper
Monge extensions of cooperation and communication structures2010-06-11Paper
Modeling and simulation of nitrogen regulation in corynebacterium glutamicum2009-06-24Paper
A general model for matroids and the greedy algorithm2009-04-24Paper
Asymptotic Mean Stationarity of Sources With Finite Evolution Dimension2008-12-21Paper
Note on pseudolattices, lattices and submodular linear programs2008-10-29Paper
A Hierarchical Model for Cooperative Games2008-05-02Paper
Computing an element in the lexicographic kernel of a game2008-03-06Paper
Note on maximal split-stable subgraphs2007-09-19Paper
Covering Graphs by Colored Stable Sets2007-05-29Paper
Quantum Predictor Models2007-05-29Paper
A combinatorial algorithm for weighted stable sets in bipartite graphs2006-06-09Paper
Note on the game chromatic index of trees2004-10-27Paper
On the computation of the nucleolus of a cooperative game2003-11-23Paper
https://portal.mardi4nfdi.de/entity/Q47864392002-12-16Paper
The greedy algorithm as a combinatorial principle2001-11-08Paper
A Lagrangian relaxation approach to the edge-weighted clique problem2001-01-01Paper
On the core of ordered submodular cost games2000-08-14Paper
Computing the nucleolus of min-cost spanning tree games is NP-hard.2000-04-11Paper
A Greedy On-Line Algorithm for thek-Track Assignment Problem2000-01-12Paper
An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games2000-01-01Paper
Note on the computational complexity of least core concepts for min-cost spanning tree games.2000-01-01Paper
The nucleon of cooperative games and an algorithm for matching games1999-06-03Paper
https://portal.mardi4nfdi.de/entity/Q42333351999-04-27Paper
Approximate Core Allocation for Binpacking Games1998-09-21Paper
On the complexity of testing membership in the core of min-cost spanning tree games1998-04-22Paper
On approximately fair cost allocation in Euclidean TSP games1998-04-13Paper
Submodular linear programs on forests1997-02-23Paper
https://portal.mardi4nfdi.de/entity/Q48829981996-10-09Paper
Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\)1996-07-28Paper
A Characterization of Nonnegative Box-Greedy Matrices1996-04-24Paper
On the average rank of LYM-sets1996-03-19Paper
Randomized online algorithms for maximizing busy time interval scheduling1996-03-17Paper
Note on scheduling intervals on-line1995-10-09Paper
A random polynomial time algorithm for well-routing convex bodies1995-08-20Paper
Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints1995-01-12Paper
A Group-Theoretic Setting for Some Intersecting Sperner Families1994-08-10Paper
Some recent results in the analysis of greedy algorithms for assignment problems1994-03-17Paper
A cutting-plane approach to the edge-weighted maximal clique problem1993-12-20Paper
On some approximately balanced combinatorial cooperative games1993-12-06Paper
https://portal.mardi4nfdi.de/entity/Q42015681993-08-25Paper
The Shapley value for cooperative games under precedence constraints1993-02-14Paper
The communication complexity of interval orders1993-01-17Paper
Some Convergence Results for Probabilistic Tabu Search1992-08-13Paper
A greedy reduction algorithm for setup optimization1992-06-28Paper
Note on the Convergence of Simulated Annealing Algorithms1992-06-25Paper
Some order dimension bounds for communication complexity problems1991-01-01Paper
The permutahedron of series-parallel posets1990-01-01Paper
An algorithmic characterization of antimatroids1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34702571990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34779571990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52030521990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30319241989-01-01Paper
Cores of games with restricted cooperation1989-01-01Paper
On the convergence of stationary distributions in simulated annealing algorithms1988-01-01Paper
Sorting and Recognition Problems for Ordered Sets1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37981581988-01-01Paper
Interval orders without odd crowns are defect optimal1987-01-01Paper
On the complexity of interval orders and semiorders1987-01-01Paper
Setup optimization problems with matroid structure1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37538261987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37689181987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37896211987-01-01Paper
A combinatorial bijection between linear extensions of equivalent orders1986-01-01Paper
Exchange properties of combinatorial closure spaces1986-01-01Paper
On the computational complexity of the order polynomial1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37140931986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37316191986-01-01Paper
Searching in Trees, Series-Parallel and Interval Orders1986-01-01Paper
A setup heuristic for interval orders1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36841311985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36852071985-01-01Paper
Algorithmic Approaches to Setup Minimization1985-01-01Paper
On ordered languages and the optimization of linear functions by greedy algorithms1985-01-01Paper
A vector exchange property of submodular systems1984-01-01Paper
Minimizing completion time for a class of scheduling problems1984-01-01Paper
Geometric exchange properties in lattices of finite length1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33292271984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36824971984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36860521984-01-01Paper
Optimal matchings in posets1983-01-01Paper
Linear growth: a unifying approach to linear systems of difference and differential equations1983-01-01Paper
Incidence-Geometric Aspects of Finite Abelian Groups1982-01-01Paper
Frink's theorem for modular lattices1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39105741981-01-01Paper
Projective Geometry on Partially Ordered Sets1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39490701981-01-01Paper
Extensions and duality of finite geometric closure operators1980-01-01Paper
Über Morphismen halbmodularer Verbände1980-01-01Paper
Geometries on partially ordered sets1980-01-01Paper
The greedy algorithm for partially ordered sets1979-01-01Paper
Is there a ‘correct’ solution to Bertrand's paradox1979-01-01Paper
Polynomial representation of TU-gamesN/APaper
Algebras of Interaction and CooperationN/APaper

Research outcomes over time

This page was built for person: Ulrich Faigle