Ulrich Faigle

According to our database1, Ulrich Faigle
  • authored at least 110 papers between 1979 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

Weighted Graphs as Dynamical Interaction Systems.
Electronic Notes in Discrete Mathematics, 2016

Games on concept lattices: Shapley value and core.
Discrete Applied Mathematics, 2016

On Hidden States in Quantum Random Walks.
CoRR, 2016

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

2015
Preface.
Discrete Applied Mathematics, 2015

2014
Preface.
Discrete Applied Mathematics, 2014

2013
9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010).
Discrete Applied Mathematics, 2013

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

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

Max-Flow on Regular Spaces
CoRR, 2012

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

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

A system-theoretic model for cooperation, interaction and allocation.
Discrete Applied Mathematics, 2011

8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009).
Discrete Applied Mathematics, 2011

A Discrete Choquet Integral for Ordered Systems
CoRR, 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

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

Monge extensions of cooperation and communication structures.
European Journal of Operational Research, 2010

Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007.
Discrete Applied Mathematics, 2010

Discrete Quantum Markov Chains
CoRR, 2010

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

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

Preface on CTW 2006.
Math. Meth. of OR, 2009

Modeling and simulation of nitrogen regulation in Corynebacterium glutamicum.
Discrete Applied Mathematics, 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

2008
Identifying Genes of Gene Regulatory Networks Using Formal Concept Analysis.
Journal of Computational Biology, 2008

Note on pseudolattices, lattices and submodular linear programs.
Discrete Optimization, 2008

Preface for CTW2005 special issue.
Discrete Applied Mathematics, 2008

Two-phase greedy algorithms for some classes of combinatorial linear programs.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

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

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

Note on maximal split-stable subgraphs.
Discrete Applied Mathematics, 2007

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

2006
Computing an Element in the Lexicographic Kernel of a Game.
Math. Meth. of OR, 2006

Quantum Predictor Models.
Electronic Notes in Discrete Mathematics, 2006

Graphs and combinatorial optimization.
Discrete Optimization, 2006

Preface.
Discrete Applied Mathematics, 2006

A combinatorial algorithm for weighted stable sets in bipartite graphs.
Discrete Applied Mathematics, 2006

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

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

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

Covering Graphs by Colored Stable Sets.
Electronic Notes in Discrete Mathematics, 2004

Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization.
Discrete Applied Mathematics, 2004

Covering Graphs by Colored Stable Sets.
Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003
Preface: Volume 13.
Electronic Notes in Discrete Mathematics, 2003

2001
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.
European Journal of Operational Research, 2001

Relaxation methods for the Generalized Minimum Spanning Tree Problem.
Electronic Notes in Discrete Mathematics, 2001

Preface: Volume 8.
Electronic Notes in Discrete Mathematics, 2001

2000
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. Meth. of OR, 2000

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

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

The nucleon of cooperative games and an algorithm for matching games.
Math. Program., 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

1997
Simplices by point-sliding and the Yamnitsky-Levin algorithm.
Math. Meth. of OR, 1997

On the complexity of testing membership in the core of min-cost spanning tree games.
Int. J. Game Theory, 1997

Preface.
Discrete Applied Mathematics, 1997

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

Note on the computational complexity of j-radii of polytopes in Realn.
Math. Program., 1996

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

On the communication complexity of t -intersection problems in generalized Boolean algebras.
Math. Meth. of OR, 1996

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

1995
On Approximately Fair Cost Allocation in Euclidean TSP Games
Electronic Colloquium on Computational Complexity (ECCC), 1995

Note On the Computational Complexity of j-Radii of Polytopes in Rn
Electronic Colloquium on Computational Complexity (ECCC), 1995

On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games
Electronic Colloquium on Computational Complexity (ECCC), 1995

The Nucleon of Cooperative Games and an Algorithm for Matching Games
Electronic Colloquium on Computational Complexity (ECCC), 1995

On the average rank of LYM-sets.
Discrete Mathematics, 1995

Note on Scheduling Intervals on-line.
Discrete Applied Mathematics, 1995

A Random Polynomial Time Algorithm for Well-rounding Convex Bodies.
Discrete Applied Mathematics, 1995

1994
Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints.
Operations Research, 1994

Preface.
Discrete Applied Mathematics, 1994

1993
On some approximately balanced combinatorial cooperative games.
ZOR - Meth. & Mod. of OR, 1993

1992
Some Convergence Results for Probabilistic Tabu Search.
INFORMS Journal on Computing, 1992

The Communication Complexity of Interval Orders.
Discrete Applied Mathematics, 1992

A greedy reduction algorithm for setup optimization.
Discrete Applied Mathematics, 1992

A Group-Theoretic Setting for Some Intersecting Sperner Families.
Combinatorics, Probability & Computing, 1992

1991
Book reviews.
ZOR - Meth. & Mod. of OR, 1991

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

1990
An algorithmic characterization of antimatroids.
Discrete Applied Mathematics, 1990

The permutahedron of series-parallel posets.
Discrete Applied Mathematics, 1990

1989
Cores of games with restricted cooperation.
ZOR - Meth. & Mod. of OR, 1989

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

1988
Simulted Annealing -Eine Fallstudie.
Angewandte Informatik, 1988

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

Book reviews.
ZOR - Meth. & Mod. of OR, 1988

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

1987
On the complexity of interval orders and semiorders.
Discrete Mathematics, 1987

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

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

A combinatorial bijection between linear extensions of equivalent orders.
Discrete Mathematics, 1986

On the computational complexity of the order polynomial.
Discrete Applied Mathematics, 1986

Exchange properties of combinatorial closure spaces.
Discrete Applied Mathematics, 1986

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

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

1985
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.
Zeitschr. für OR, 1985

Sorting and Recognition Problems for Ordered Sets.
Proceedings of the STACS 85, 1985

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

A vector exchange property of submodular systems.
Discrete Applied Mathematics, 1984

5th Bonn workshop on combinatorial optimization : June 11-16, 1984 at the University of Bonn, West Germany.
Discrete Applied Mathematics, 1984

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

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

1979
The greedy algorithm for partially ordered sets.
Discrete Mathematics, 1979


  Loading...