Ulrich Faigle

According to our database1, Ulrich Faigle authored at least 107 papers between 1979 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 



On csauthors.net:


Preface: 13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2015).
Discret. Appl. Math., 2019

Markovian statistics on evolving systems.
Evol. Syst., 2018

Greedy Oriented Flows.
Algorithmica, 2018

Game Theoretic Interaction and Decision: A Quantum Analysis.
Games, 2017

Bases and linear transforms of TU-games and cooperation systems.
Int. J. Game Theory, 2016

Weighted Graphs as Dynamical Interaction Systems.
Electron. Notes Discret. Math., 2016

Games on concept lattices: Shapley value and core.
Discret. Appl. Math., 2016

On Hidden States in Quantum Random Walks.
CoRR, 2016

Least Square Approximations and Linear Values of Cooperative Games.
CoRR, 2016

Discret. Appl. Math., 2015

Discret. Appl. Math., 2014

9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010).
Discret. Appl. Math., 2013

Observation and evolution of finite-dimensional Markov systems.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

A ranking model for the greedy algorithm and discrete convexity.
Math. Program., 2012

Max-Flow on Regular Spaces
CoRR, 2012

Efficient Tests for Equivalence of Hidden Markov Processes and Quantum Random Walks.
IEEE Trans. Inf. Theory, 2011

A discrete Choquet integral for ordered systems.
Fuzzy Sets Syst., 2011

A system-theoretic model for cooperation, interaction and allocation.
Discret. Appl. Math., 2011

8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009).
Discret. Appl. Math., 2011

On Greedy and Submodular Matrices.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Representations of Power Series over Word Algebras.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Binary Betting Strategies with Optimal Logarithmic Growth.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Two-phase greedy algorithms for some classes of combinatorial linear programs.
ACM Trans. Algorithms, 2010

Monge extensions of cooperation and communication structures.
Eur. J. Oper. Res., 2010

Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007.
Discret. Appl. Math., 2010

Discrete Quantum Markov Chains
CoRR, 2010

Choquet Integration on Set Systems.
Proceedings of the Computational Intelligence for Knowledge-Based Systems Design, 2010

A general model for matroids and the greedy algorithm.
Math. Program., 2009

Preface on CTW 2006.
Math. Methods Oper. Res., 2009

Modeling and simulation of nitrogen regulation in Corynebacterium glutamicum.
Discret. Appl. Math., 2009

A Monge Algorithm for Computing the Choquet Integral on Set Systems.
Proceedings of the Joint 2009 International Fuzzy Systems Association World Congress and 2009 European Society of Fuzzy Logic and Technology Conference, 2009

A System-Theoretic Model for Cooperation and Allocation Mechanisms.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Identifying Genes of Gene Regulatory Networks Using Formal Concept Analysis.
J. Comput. Biol., 2008

Note on pseudolattices, lattices and submodular linear programs.
Discret. Optim., 2008

Preface for CTW2005 special issue.
Discret. Appl. Math., 2008

A Hierarchical Model for Cooperative Games.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

Asymptotic Mean Stationarity of Sources With Finite Evolution Dimension.
IEEE Trans. Inf. Theory, 2007

Note on maximal split-stable subgraphs.
Discret. Appl. Math., 2007

A two-phase greedy algorithm for modular lattice polyhedra.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

Computing an Element in the Lexicographic Kernel of a Game.
Math. Methods Oper. Res., 2006

Quantum Predictor Models.
Electron. Notes Discret. Math., 2006

Graphs and combinatorial optimization.
Discret. Optim., 2006

Discret. Appl. Math., 2006

A combinatorial algorithm for weighted stable sets in bipartite graphs.
Discret. Appl. Math., 2006

CASPAR: a hierarchical bayesian approach to predict survival times in cancer from gene expression data.
Bioinform., 2006

Note on Negative Probabilities and Observable Processes.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

Note on the game chromatic index of trees.
Theor. Comput. Sci., 2004

Covering Graphs by Colored Stable Sets.
Electron. Notes Discret. Math., 2004

Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization.
Discret. Appl. Math., 2004

Preface: Volume 13.
Electron. Notes Discret. Math., 2003

On the computation of the nucleolus of a cooperative game.
Int. J. Game Theory, 2001

A Lagrangian relaxation approach to the edge-weighted clique problem.
Eur. J. Oper. Res., 2001

Relaxation methods for the Generalized Minimum Spanning Tree Problem.
Electron. Notes Discret. Math., 2001

Preface: Volume 8.
Electron. Notes Discret. Math., 2001

An Order-theoretic Framework for the Greedy Algorithm with Applications to the Core and Weber Set of Cooperative Games.
Order, 2000

On the core of ordered submodular cost games.
Math. Program., 2000

Note on the computational complexity of least core concepts for min-cost spanning tree games.
Math. Methods Oper. Res., 2000

A Greedy On-Line Algorithm for thek-Track Assignment Problem.
J. Algorithms, 1999

Approximate Core Allocation for Binpacking Games.
SIAM J. Discret. Math., 1998

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, 1998

Simplices by point-sliding and the Yamnitsky-Levin algorithm.
Math. Methods Oper. Res., 1997

A Characterization of Nonnegative Box-Greedy Matrices.
SIAM J. Discret. Math., 1996

Note on the computational complexity of j-radii of polytopes in Real<sup>n</sup>.
Math. Program., 1996

Submodular linear programs on forests.
Math. Program., 1996

On the communication complexity of <i>t</i> -intersection problems in generalized Boolean algebras.
Math. Methods Oper. Res., 1996

Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling.
Computing, 1996

On Approximately Fair Cost Allocation in Euclidean TSP Games
Electron. Colloquium Comput. Complex., 1995

Note On the Computational Complexity of j-Radii of Polytopes in R<sup>n</sup>
Electron. Colloquium Comput. Complex., 1995

On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games
Electron. Colloquium Comput. Complex., 1995

The Nucleon of Cooperative Games and an Algorithm for Matching Games
Electron. Colloquium Comput. Complex., 1995

On the average rank of LYM-sets.
Discret. Math., 1995

Note on Scheduling Intervals on-line.
Discret. Appl. Math., 1995

A Random Polynomial Time Algorithm for Well-rounding Convex Bodies.
Discret. Appl. Math., 1995

Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints.
Oper. Res., 1994

Discret. Appl. Math., 1994

On some approximately balanced combinatorial cooperative games.
ZOR Methods Model. Oper. Res., 1993

Some Convergence Results for Probabilistic Tabu Search.
INFORMS J. Comput., 1992

The Communication Complexity of Interval Orders.
Discret. Appl. Math., 1992

A greedy reduction algorithm for setup optimization.
Discret. Appl. Math., 1992

A Group-Theoretic Setting for Some Intersecting Sperner Families.
Comb. Probab. Comput., 1992

Book reviews.
ZOR Methods Model. Oper. Res., 1991

Some Order Dimension Bounds for Communication Complexity Problems.
Acta Informatica, 1991

An algorithmic characterization of antimatroids.
Discret. Appl. Math., 1990

The permutahedron of series-parallel posets.
Discret. Appl. Math., 1990

Cores of games with restricted cooperation.
ZOR Methods Model. Oper. Res., 1989

On the performance of on-line algorithms for partition problems.
Acta Cybern., 1989

Simulted Annealing -Eine Fallstudie.
Angew. Inform., 1988

Sorting and Recognition Problems for Ordered Sets.
SIAM J. Comput., 1988

Book reviews.
ZOR Methods Model. Oper. Res., 1988

On the Convergence of Stationary Distributions in Simulated Annealing Algorithms.
Inf. Process. Lett., 1988

On the complexity of interval orders and semiorders.
Discret. Math., 1987

Interval orders without odd crowns are defect optimal.
Computing, 1987

Searching in Trees, Series-Parallel and Interval Orders.
SIAM J. Comput., 1986

A combinatorial bijection between linear extensions of equivalent orders.
Discret. Math., 1986

On the computational complexity of the order polynomial.
Discret. Appl. Math., 1986

Exchange properties of combinatorial closure spaces.
Discret. Appl. Math., 1986

A size-width inequality for distributive lattices.
Comb., 1986

The Bandwidth of Planar Distributive Lattices.
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms
J. ACM, October, 1985

Algorithmic approaches to setup minimization.
SIAM J. Comput., 1985

Book reviews.
Z. Oper. Research, 1985

Minimizing Completion Time for a Class of Scheduling Problems.
Inf. Process. Lett., 1984

A vector exchange property of submodular systems.
Discret. Appl. Math., 1984

5th Bonn workshop on combinatorial optimization : June 11-16, 1984 at the University of Bonn, West Germany.
Discret. Appl. Math., 1984

Optimal Matchings in Posets.
Eur. J. Comb., 1983

Geometries on partially ordered sets.
J. Comb. Theory, Ser. B, 1980

The greedy algorithm for partially ordered sets.
Discret. Math., 1979