Ulrich Faigle

According to our database, Ulrich Faigle authored at least 108 papers between 1979 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2020

Mathematical Game Theory.

Ulrich Faigle

CoRR, 2020

2019

Preface: 13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2015).

Ekrem Duman, Ali Fuat Alkaya, Stefan Pickl, Ulrich Faigle

Discret. Appl. Math., 2019

2018

Markovian statistics on evolving systems.

Ulrich Faigle, Gerhard Gierz

Evol. Syst., 2018

Greedy Oriented Flows.

Ulrich Faigle, Walter Kern, Britta Peis

Algorithmica, 2018

2017

Game Theoretic Interaction and Decision: A Quantum Analysis.

Ulrich Faigle, Michel Grabisch

Games, 2017

2016

Bases and linear transforms of TU-games and cooperation systems.

Ulrich Faigle, Michel Grabisch

Int. J. Game Theory, 2016

Weighted Graphs as Dynamical Interaction Systems.

Ulrich Faigle

Electron. Notes Discret. Math., 2016

Games on concept lattices: Shapley value and core.

Ulrich Faigle, Michel Grabisch, Andrés Jiménez-Losada, Manuel Ordóñez

Discret. Appl. Math., 2016

On Hidden States in Quantum Random Walks.

Ulrich Faigle, Alexander Schönhuth

CoRR, 2016

Least Square Approximations and Linear Values of Cooperative Games.

Ulrich Faigle, Michel Grabisch

CoRR, 2016

2015

Preface.

Ulrich Faigle, Erik Kropat, Renato De Leone, Silja Meyer-Nieberg, Stefan Pickl

Discret. Appl. Math., 2015

2014

Preface.

Ulrich Faigle, Gaia Nicosia, Andrea Pacifici

Discret. Appl. Math., 2014

2013

9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010).

Ulrich Faigle, Rainer Schrader

Discret. Appl. Math., 2013

Observation and evolution of finite-dimensional Markov systems.

Ulrich Faigle, Alexander Schönhuth

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

A ranking model for the greedy algorithm and discrete convexity.

Ulrich Faigle, Walter Kern, Britta Peis

Math. Program., 2012

Max-Flow on Regular Spaces

Ulrich Faigle, Walter Kern, Britta Peis

CoRR, 2012

2011

Efficient Tests for Equivalence of Hidden Markov Processes and Quantum Random Walks.

Ulrich Faigle, Alexander Schönhuth

IEEE Trans. Inf. Theory, 2011

A discrete Choquet integral for ordered systems.

Ulrich Faigle, Michel Grabisch

Fuzzy Sets Syst., 2011

A system-theoretic model for cooperation, interaction and allocation.

Ulrich Faigle, Jan Voss

Discret. Appl. Math., 2011

8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009).

Sonia Cafieri, Ulrich Faigle, Leo Liberti

Discret. Appl. Math., 2011

On Greedy and Submodular Matrices.

Ulrich Faigle, Walter Kern, Britta Peis

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Representations of Power Series over Word Algebras.

Ulrich Faigle, Alexander Schönhuth

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Binary Betting Strategies with Optimal Logarithmic Growth.

Kirsten Albrecht, Ulrich Faigle

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.

Ulrich Faigle, Britta Peis

ACM Trans. Algorithms, 2010

Monge extensions of cooperation and communication structures.

Ulrich Faigle, Michel Grabisch, M. Heyne

Eur. J. Oper. Res., 2010

Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007.

Ulrich Faigle, Johann L. Hurink

Discret. Appl. Math., 2010

Discrete Quantum Markov Chains

Ulrich Faigle, Alexander Schönhuth

CoRR, 2010

Choquet Integration on Set Systems.

Ulrich Faigle, Michel Grabisch, M. Heyne

Proceedings of the Computational Intelligence for Knowledge-Based Systems Design, 2010

2009

A general model for matroids and the greedy algorithm.

Ulrich Faigle, Satoru Fujishige

Math. Program., 2009

Preface on CTW 2006.

Ulrich Faigle, Rainer Schrader, Rüdiger Schultz

Math. Methods Oper. Res., 2009

Modeling and simulation of nitrogen regulation in Corynebacterium glutamicum.

Jutta Gebert, Nicole Radde, Ulrich Faigle, Julia Strösser, Andreas Burkovski

Discret. Appl. Math., 2009

A Monge Algorithm for Computing the Choquet Integral on Set Systems.

Ulrich Faigle, Michel Grabisch

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.

Ulrich Faigle, Jan Voss

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Identifying Genes of Gene Regulatory Networks Using Formal Concept Analysis.

Jutta Gebert, Susanne Motameny, Ulrich Faigle, Christian V. Forst, Rainer Schrader

J. Comput. Biol., 2008

Note on pseudolattices, lattices and submodular linear programs.

Ulrich Faigle, Britta Peis

Discret. Optim., 2008

Preface for CTW2005 special issue.

Ulrich Faigle, Bert Randerath, Rainer Schrader

Discret. Appl. Math., 2008

A Hierarchical Model for Cooperative Games.

Ulrich Faigle, Britta Peis

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007

Asymptotic Mean Stationarity of Sources With Finite Evolution Dimension.

Ulrich Faigle, Alexander Schönhuth

IEEE Trans. Inf. Theory, 2007

Note on maximal split-stable subgraphs.

Ulrich Faigle, Bernhard Fuchs, Britta Peis

Discret. Appl. Math., 2007

A two-phase greedy algorithm for modular lattice polyhedra.

Ulrich Faigle, Britta Peis

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006

Computing an Element in the Lexicographic Kernel of a Game.

Ulrich Faigle, Walter Kern, Jeroen Kuipers

Math. Methods Oper. Res., 2006

Quantum Predictor Models.

Ulrich Faigle, Alexander Schönhuth

Electron. Notes Discret. Math., 2006

Graphs and combinatorial optimization.

Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl

Discret. Optim., 2006

Preface.

Ulrich Faigle, Johann L. Hurink, Stefan Wolfgang Pickl

Discret. Appl. Math., 2006

A combinatorial algorithm for weighted stable sets in bipartite graphs.

Ulrich Faigle, Gereon Frahling

Discret. Appl. Math., 2006

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

Lars Kaderali, Thomas Zander, Ulrich Faigle, Jürgen Wolf, Joachim L. Schultze, Rainer Schrader

Bioinform., 2006

2005

Note on Negative Probabilities and Observable Processes.

Ulrich Faigle, Alexander Schönhuth

Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004

Note on the game chromatic index of trees.

Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern

Theor. Comput. Sci., 2004

Covering Graphs by Colored Stable Sets.

Ulrich Faigle, Bernhard Fuchs, Britta Wienand

Electron. Notes Discret. Math., 2004

Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization.

Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann L. Hurink

Discret. Appl. Math., 2004

2003

Preface: Volume 13.

Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl, Gerhard J. Woeginger

Electron. Notes Discret. Math., 2003

2001

On the computation of the nucleolus of a cooperative game.

Ulrich Faigle, Walter Kern, Jeroen Kuipers

Int. J. Game Theory, 2001

A Lagrangian relaxation approach to the edge-weighted clique problem.

Marcel Hunting, Ulrich Faigle, Walter Kern

Eur. J. Oper. Res., 2001

Relaxation methods for the Generalized Minimum Spanning Tree Problem.

Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle

Electron. Notes Discret. Math., 2001

Preface: Volume 8.

Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl

Electron. Notes Discret. Math., 2001

2000

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

Ulrich Faigle, Walter Kern

Order, 2000

On the core of ordered submodular cost games.

Ulrich Faigle, Walter Kern

Math. Program., 2000

Note on the computational complexity of least core concepts for min-cost spanning tree games.

Ulrich Faigle, Walter Kern, Daniël Paulusma

Math. Methods Oper. Res., 2000

1999

A Greedy On-Line Algorithm for thek-Track Assignment Problem.

Ulrich Faigle, Walter Kern, Willem M. Nawijn

J. Algorithms, 1999

1998

Approximate Core Allocation for Binpacking Games.

Ulrich Faigle, Walter Kern

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.

Ulrich Faigle, Walter Kern, Jeroen Kuipers

Int. J. Game Theory, 1998

1997

Simplices by point-sliding and the Yamnitsky-Levin algorithm.

Ulrich Faigle, Marcel Hunting, Walter Kern, Ravi Prakash, K. J. Supowit

Math. Methods Oper. Res., 1997

1996

A Characterization of Nonnegative Box-Greedy Matrices.

Ulrich Faigle, Alan J. Hoffman, Walter Kern

SIAM J. Discret. Math., 1996

Note on the computational complexity of j-radii of polytopes in Realⁿ.

Ulrich Faigle, Walter Kern, Martin Streng

Math. Program., 1996

Submodular linear programs on forests.

Ulrich Faigle, Walter Kern

Math. Program., 1996

On the communication complexity of <i>t</i> -intersection problems in generalized Boolean algebras.

Ulrich Faigle, Walter Kern, Boris Spieker

Math. Methods Oper. Res., 1996

Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling.

Ulrich Faigle, Renate Garbe, Walter Kern

Computing, 1996

1995

On Approximately Fair Cost Allocation in Euclidean TSP Games

Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern

Electron. Colloquium Comput. Complex., 1995

Note On the Computational Complexity of j-Radii of Polytopes in Rⁿ

Ulrich Faigle, Walter Kern, Martin Streng

Electron. Colloquium Comput. Complex., 1995

On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games

Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern

Electron. Colloquium Comput. Complex., 1995

The Nucleon of Cooperative Games and an Algorithm for Matching Games

Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern

Electron. Colloquium Comput. Complex., 1995

On the average rank of LYM-sets.

Péter L. Erdös, Ulrich Faigle, Walter Kern

Discret. Math., 1995

Note on Scheduling Intervals on-line.

Ulrich Faigle, Willem M. Nawijn

Discret. Appl. Math., 1995

A Random Polynomial Time Algorithm for Well-rounding Convex Bodies.

Ulrich Faigle, Noud Gademann, Walter Kern

Discret. Appl. Math., 1995

1994

Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints.

Ulrich Faigle, Walter Kern

Oper. Res., 1994

Preface.

Ulrich Faigle, Kees Hoede

Discret. Appl. Math., 1994

1993

On some approximately balanced combinatorial cooperative games.

Ulrich Faigle, Walter Kern

ZOR Methods Model. Oper. Res., 1993

1992

Some Convergence Results for Probabilistic Tabu Search.

Ulrich Faigle, Walter Kern

INFORMS J. Comput., 1992

The Communication Complexity of Interval Orders.

Ulrich Faigle, Rainer Schrader, György Turán

Discret. Appl. Math., 1992

A greedy reduction algorithm for setup optimization.

Ulrich Faigle, Rainer Schrader

Discret. Appl. Math., 1992

A Group-Theoretic Setting for Some Intersecting Sperner Families.

Péter L. Erdös, Ulrich Faigle, Walter Kern

Comb. Probab. Comput., 1992

1991

Book reviews.

Rainer E. Burkard, Ulrich Faigle

ZOR Methods Model. Oper. Res., 1991

Some Order Dimension Bounds for Communication Complexity Problems.

Ulrich Faigle, Walter Kern

Acta Informatica, 1991

1990

An algorithmic characterization of antimatroids.

E. Andrew Boyd, Ulrich Faigle

Discret. Appl. Math., 1990

The permutahedron of series-parallel posets.

Annelie von Arnim, Ulrich Faigle, Rainer Schrader

Discret. Appl. Math., 1990

1989

Cores of games with restricted cooperation.

Ulrich Faigle

ZOR Methods Model. Oper. Res., 1989

On the performance of on-line algorithms for partition problems.

Ulrich Faigle, Walter Kern, György Turán

Acta Cybern., 1989

1988

Simulted Annealing -Eine Fallstudie.

Ulrich Faigle, Rainer Schrader

Angew. Inform., 1988

Sorting and Recognition Problems for Ordered Sets.

Ulrich Faigle, György Turán

SIAM J. Comput., 1988

Book reviews.

Diethard Pallaschke, Ali Ridha Mahjoub, Ulrich Faigle, A. Rocinski, Jean-Pierre Crouzeix

ZOR Methods Model. Oper. Res., 1988

On the Convergence of Stationary Distributions in Simulated Annealing Algorithms.

Ulrich Faigle, Rainer Schrader

Inf. Process. Lett., 1988

1987

On the complexity of interval orders and semiorders.

Ulrich Faigle, György Turán

Discret. Math., 1987

Interval orders without odd crowns are defect optimal.

Ulrich Faigle, Rainer Schrader

Computing, 1987

1986

Searching in Trees, Series-Parallel and Interval Orders.

Ulrich Faigle, László Lovász, Rainer Schrader, György Turán

SIAM J. Comput., 1986

A combinatorial bijection between linear extensions of equivalent orders.

Ulrich Faigle, Rainer Schrader

Discret. Math., 1986

On the computational complexity of the order polynomial.

Ulrich Faigle, Rainer Schrader

Discret. Appl. Math., 1986

Exchange properties of combinatorial closure spaces.

Ulrich Faigle

Discret. Appl. Math., 1986

A size-width inequality for distributive lattices.

Ulrich Faigle, Bill Sands

Comb., 1986

The Bandwidth of Planar Distributive Lattices.

Ulrich Faigle

Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

1985

On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms

Ulrich Faigle

J. ACM, October, 1985

Algorithmic approaches to setup minimization.

Ulrich Faigle, Gerhard Gierz, Rainer Schrader

SIAM J. Comput., 1985

Book reviews.

J. George Shanthikumar, Alfred Luhmer, H. Kremar, Ulrich Faigle, Martin Shubik, Hansjörg Wacker, Alexander Schrijver, Michael M. Richter

Z. Oper. Research, 1985

1984

Minimizing Completion Time for a Class of Scheduling Problems.

Ulrich Faigle, Rainer Schrader

Inf. Process. Lett., 1984

A vector exchange property of submodular systems.

Ulrich Faigle

Discret. Appl. Math., 1984

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

Ulrich Faigle

Discret. Appl. Math., 1984

1983

Optimal Matchings in Posets.

Ulrich Faigle

Eur. J. Comb., 1983

1980

Geometries on partially ordered sets.

Ulrich Faigle

J. Comb. Theory, Ser. B, 1980

1979

The greedy algorithm for partially ordered sets.

Ulrich Faigle

Discret. Math., 1979