Ulrich Faigle - RankMe

116 papers A* 1A 1B 2C 8Journal 101Unranked 3

Year	Rank	Type	Title / Venue / Authors
2020	J	`jnl`	Mathematical Game Theory. CoRR Ulrich Faigle
2019	J	`jnl`	Preface: 13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2015). Discret. Appl. Math. Ekrem Duman, Ali Fuat Alkaya, Stefan Pickl, Ulrich Faigle
2018	J	`jnl`	Greedy Oriented Flows. Algorithmica Ulrich Faigle, Walter Kern, Britta Peis
2018	J	`jnl`	Markovian statistics on evolving systems. Evol. Syst. Ulrich Faigle, Gerhard Gierz
2017	J	`jnl`	Game Theoretic Interaction and Decision: A Quantum Analysis. Games Ulrich Faigle, Michel Grabisch
2016	J	`jnl`	Bases and linear transforms of TU-games and cooperation systems. Int. J. Game Theory Ulrich Faigle, Michel Grabisch
2016	J	`jnl`	Games on concept lattices: Shapley value and core. Discret. Appl. Math. Ulrich Faigle, Michel Grabisch, Andrés Jiménez-Losada, Manuel Ordóñez
2016	J	`jnl`	Least Square Approximations and Linear Values of Cooperative Games. CoRR Ulrich Faigle, Michel Grabisch
2016	J	`jnl`	On Hidden States in Quantum Random Walks. CoRR Ulrich Faigle, Alexander Schönhuth
2016	J	`jnl`	Weighted Graphs as Dynamical Interaction Systems. Electron. Notes Discret. Math. Ulrich Faigle
2015	J	`jnl`	Preface. Discret. Appl. Math. Ulrich Faigle, Erik Kropat, Renato De Leone, Silja Meyer-Nieberg, Stefan Pickl
2014	J	`jnl`	Preface. Discret. Appl. Math. Ulrich Faigle, Gaia Nicosia, Andrea Pacifici
2013	J	`jnl`	9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010). Discret. Appl. Math. Ulrich Faigle, Rainer Schrader
2013	C	`conf`	Observation and evolution of finite-dimensional Markov systems. CTW Ulrich Faigle, Alexander Schönhuth
2012	J	`jnl`	A ranking model for the greedy algorithm and discrete convexity. Math. Program. Ulrich Faigle, Walter Kern, Britta Peis
2012	J	`jnl`	Max-Flow on Regular Spaces CoRR Ulrich Faigle, Walter Kern, Britta Peis
2011	J	`jnl`	8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009). Discret. Appl. Math. Sonia Cafieri, Ulrich Faigle, Leo Liberti
2011	J	`jnl`	A Discrete Choquet Integral for Ordered Systems CoRR Ulrich Faigle, Michel Grabisch
2011	J	`jnl`	A discrete Choquet integral for ordered systems. Fuzzy Sets Syst. Ulrich Faigle, Michel Grabisch
2011	J	`jnl`	A system-theoretic model for cooperation, interaction and allocation. Discret. Appl. Math. Ulrich Faigle, Jan Voss
2011	C	`conf`	Binary Betting Strategies with Optimal Logarithmic Growth. CTW Kirsten Albrecht, Ulrich Faigle
2011	J	`jnl`	Efficient Tests for Equivalence of Hidden Markov Processes and Quantum Random Walks. IEEE Trans. Inf. Theory Ulrich Faigle, Alexander Schönhuth
2011	—	`conf`	On Greedy and Submodular Matrices. TAPAS Ulrich Faigle, Walter Kern, Britta Peis
2011	C	`conf`	Representations of Power Series over Word Algebras. CTW Ulrich Faigle, Alexander Schönhuth
2010	C	`ed.`	9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Cologne, Germany, May 25-27, 2010. Extended Abstracts CTW Ulrich Faigle, Rainer Schrader, Daniel Herrmann
2010	C	`conf`	Choquet Integration on Set Systems. IPMU Ulrich Faigle, Michel Grabisch, M. Heyne
2010	J	`jnl`	Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007. Discret. Appl. Math. Ulrich Faigle, Johann L. Hurink
2010	J	`jnl`	Discrete Quantum Markov Chains CoRR Ulrich Faigle, Alexander Schönhuth
2010	J	`jnl`	Monge extensions of cooperation and communication structures. Eur. J. Oper. Res. Ulrich Faigle, Michel Grabisch, M. Heyne
2010	J	`jnl`	Two-phase greedy algorithms for some classes of combinatorial linear programs. ACM Trans. Algorithms Ulrich Faigle, Britta Peis
2009	—	`conf`	A Monge Algorithm for Computing the Choquet Integral on Set Systems. IFSA/EUSFLAT Conf. Ulrich Faigle, Michel Grabisch
2009	C	`conf`	A System-Theoretic Model for Cooperation and Allocation Mechanisms. CTW Ulrich Faigle, Jan Voss
2009	J	`jnl`	A general model for matroids and the greedy algorithm. Math. Program. Ulrich Faigle, Satoru Fujishige
2009	J	`jnl`	Modeling and simulation of nitrogen regulation in Corynebacterium glutamicum. Discret. Appl. Math. Jutta Gebert, Nicole Radde, Ulrich Faigle, Julia Strösser, Andreas Burkovski
2009	J	`jnl`	Preface on CTW 2006. Math. Methods Oper. Res. Ulrich Faigle, Rainer Schrader, Rüdiger Schultz
2008	B	`conf`	A Hierarchical Model for Cooperative Games. SAGT Ulrich Faigle, Britta Peis
2008	J	`jnl`	Identifying Genes of Gene Regulatory Networks Using Formal Concept Analysis. J. Comput. Biol. Jutta Gebert, Susanne Motameny, Ulrich Faigle, Christian V. Forst, Rainer Schrader
2008	J	`jnl`	Note on pseudolattices, lattices and submodular linear programs. Discret. Optim. Ulrich Faigle, Britta Peis
2008	J	`jnl`	Preface for CTW2005 special issue. Discret. Appl. Math. Ulrich Faigle, Bert Randerath, Rainer Schrader
2008	A*	`conf`	Two-phase greedy algorithms for some classes of combinatorial linear programs. SODA Ulrich Faigle, Britta Peis
2007	C	`conf`	A two-phase greedy algorithm for modular lattice polyhedra. CTW Ulrich Faigle, Britta Peis
2007	J	`jnl`	Asymptotic Mean Stationarity of Sources With Finite Evolution Dimension. IEEE Trans. Inf. Theory Ulrich Faigle, Alexander Schönhuth
2007	J	`jnl`	Note on maximal split-stable subgraphs. Discret. Appl. Math. Ulrich Faigle, Bernhard Fuchs, Britta Peis
2006	J	`jnl`	A combinatorial algorithm for weighted stable sets in bipartite graphs. Discret. Appl. Math. Ulrich Faigle, Gereon Frahling
2006	J	`jnl`	CASPAR: a hierarchical bayesian approach to predict survival times in cancer from gene expression data. Bioinform. Lars Kaderali, Thomas Zander, Ulrich Faigle, Jürgen Wolf, Joachim L. Schultze, Rainer Schrader
2006	J	`jnl`	Computing an Element in the Lexicographic Kernel of a Game. Math. Methods Oper. Res. Ulrich Faigle, Walter Kern, Jeroen Kuipers
2006	J	`jnl`	Graphs and combinatorial optimization. Discret. Optim. Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl
2006	J	`jnl`	Preface. Discret. Appl. Math. Ulrich Faigle, Johann L. Hurink, Stefan Wolfgang Pickl
2006	J	`jnl`	Quantum Predictor Models. Electron. Notes Discret. Math. Ulrich Faigle, Alexander Schönhuth
2005	—	`conf`	Note on Negative Probabilities and Observable Processes. Algorithms for Optimization with Incomplete Information Ulrich Faigle, Alexander Schönhuth
2004	C	`conf`	Covering Graphs by Colored Stable Sets. CTW Ulrich Faigle, Bernhard Fuchs, Britta Wienand
2004	J	`jnl`	Covering Graphs by Colored Stable Sets. Electron. Notes Discret. Math. Ulrich Faigle, Bernhard Fuchs, Britta Wienand
2004	J	`jnl`	Note on the game chromatic index of trees. Theor. Comput. Sci. Péter L. Erdös, Ulrich Faigle, Winfried Hochstättler, Walter Kern
2004	J	`jnl`	Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Discret. Appl. Math. Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann L. Hurink
2003	J	`jnl`	Preface: Volume 13. Electron. Notes Discret. Math. Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl, Gerhard J. Woeginger
2001	J	`jnl`	A Lagrangian relaxation approach to the edge-weighted clique problem. Eur. J. Oper. Res. Marcel Hunting, Ulrich Faigle, Walter Kern
2001	J	`jnl`	On the computation of the nucleolus of a cooperative game. Int. J. Game Theory Ulrich Faigle, Walter Kern, Jeroen Kuipers
2001	J	`jnl`	Preface: Volume 8. Electron. Notes Discret. Math. Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl
2001	J	`jnl`	Relaxation methods for the Generalized Minimum Spanning Tree Problem. Electron. Notes Discret. Math. Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle
2000	J	`jnl`	An Order-theoretic Framework for the Greedy Algorithm with Applications to the Core and Weber Set of Cooperative Games. Order Ulrich Faigle, Walter Kern
2000	J	`jnl`	Note on the computational complexity of least core concepts for min-cost spanning tree games. Math. Methods Oper. Res. Ulrich Faigle, Walter Kern, Daniël Paulusma
2000	J	`jnl`	On the core of ordered submodular cost games. Math. Program. Ulrich Faigle, Walter Kern
1999	J	`jnl`	A Greedy On-Line Algorithm for thek-Track Assignment Problem. J. Algorithms Ulrich Faigle, Walter Kern, Willem M. Nawijn
1998	J	`jnl`	Approximate Core Allocation for Binpacking Games. SIAM J. Discret. Math. Ulrich Faigle, Walter Kern
1998	J	`jnl`	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 Ulrich Faigle, Walter Kern, Jeroen Kuipers
1998	J	`jnl`	The nucleon of cooperative games and an algorithm for matching games. Math. Program. Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler
1997	J	`jnl`	On the complexity of testing membership in the core of min-cost spanning tree games. Int. J. Game Theory Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler
1997	J	`jnl`	Preface. Discret. Appl. Math. Ulrich Faigle, Kees Hoede
1997	J	`jnl`	Simplices by point-sliding and the Yamnitsky-Levin algorithm. Math. Methods Oper. Res. Ulrich Faigle, Marcel Hunting, Walter Kern, Ravi Prakash, K. J. Supowit
1996	J	`jnl`	A Characterization of Nonnegative Box-Greedy Matrices. SIAM J. Discret. Math. Ulrich Faigle, Alan J. Hoffman, Walter Kern
1996	J	`jnl`	Note on the computational complexity of j-radii of polytopes in Real Math. Program. Ulrich Faigle, Walter Kern, Martin Streng
1996	J	`jnl`	On the communication complexity of Math. Methods Oper. Res. Ulrich Faigle, Walter Kern, Boris Spieker
1996	J	`jnl`	Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling. Computing Ulrich Faigle, Renate Garbe, Walter Kern
1996	J	`jnl`	Submodular linear programs on forests. Math. Program. Ulrich Faigle, Walter Kern
1995	J	`jnl`	A Random Polynomial Time Algorithm for Well-rounding Convex Bodies. Discret. Appl. Math. Ulrich Faigle, Noud Gademann, Walter Kern
1995	J	`jnl`	Note On the Computational Complexity of j-Radii of Polytopes in R Electron. Colloquium Comput. Complex. Ulrich Faigle, Walter Kern, Martin Streng
1995	J	`jnl`	Note on Scheduling Intervals on-line. Discret. Appl. Math. Ulrich Faigle, Willem M. Nawijn
1995	J	`jnl`	On Approximately Fair Cost Allocation in Euclidean TSP Games Electron. Colloquium Comput. Complex. Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
1995	J	`jnl`	On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games Electron. Colloquium Comput. Complex. Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
1995	J	`jnl`	On the average rank of LYM-sets. Discret. Math. Péter L. Erdös, Ulrich Faigle, Walter Kern
1995	J	`jnl`	The Nucleon of Cooperative Games and an Algorithm for Matching Games Electron. Colloquium Comput. Complex. Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
1994	J	`jnl`	Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints. Oper. Res. Ulrich Faigle, Walter Kern
1994	J	`jnl`	Preface. Discret. Appl. Math. Ulrich Faigle, Kees Hoede
1993	J	`jnl`	On some approximately balanced combinatorial cooperative games. ZOR Methods Model. Oper. Res. Ulrich Faigle, Walter Kern
1992	J	`jnl`	A Group-Theoretic Setting for Some Intersecting Sperner Families. Comb. Probab. Comput. Péter L. Erdös, Ulrich Faigle, Walter Kern
1992	J	`jnl`	A greedy reduction algorithm for setup optimization. Discret. Appl. Math. Ulrich Faigle, Rainer Schrader
1992	J	`jnl`	Some Convergence Results for Probabilistic Tabu Search. INFORMS J. Comput. Ulrich Faigle, Walter Kern
1992	J	`jnl`	The Communication Complexity of Interval Orders. Discret. Appl. Math. Ulrich Faigle, Rainer Schrader, György Turán
1991	J	`jnl`	Book reviews. ZOR Methods Model. Oper. Res. Rainer E. Burkard, Ulrich Faigle
1991	J	`jnl`	Some Order Dimension Bounds for Communication Complexity Problems. Acta Informatica Ulrich Faigle, Walter Kern
1990	J	`jnl`	An algorithmic characterization of antimatroids. Discret. Appl. Math. E. Andrew Boyd, Ulrich Faigle
1990	J	`jnl`	The permutahedron of series-parallel posets. Discret. Appl. Math. Annelie von Arnim, Ulrich Faigle, Rainer Schrader
1989	J	`jnl`	Cores of games with restricted cooperation. ZOR Methods Model. Oper. Res. Ulrich Faigle
1989	J	`jnl`	On the performance of on-line algorithms for partition problems. Acta Cybern. Ulrich Faigle, Walter Kern, György Turán
1988	J	`jnl`	Book reviews. ZOR Methods Model. Oper. Res. Diethard Pallaschke, Ali Ridha Mahjoub, Ulrich Faigle, A. Rocinski, Jean-Pierre Crouzeix
1988	J	`jnl`	On the Convergence of Stationary Distributions in Simulated Annealing Algorithms. Inf. Process. Lett. Ulrich Faigle, Rainer Schrader
1988	J	`jnl`	Simulted Annealing -Eine Fallstudie. Angew. Inform. Ulrich Faigle, Rainer Schrader
1988	J	`jnl`	Sorting and Recognition Problems for Ordered Sets. SIAM J. Comput. Ulrich Faigle, György Turán
1987	J	`jnl`	Interval orders without odd crowns are defect optimal. Computing Ulrich Faigle, Rainer Schrader
1987	J	`jnl`	On the complexity of interval orders and semiorders. Discret. Math. Ulrich Faigle, György Turán
1986	J	`jnl`	A combinatorial bijection between linear extensions of equivalent orders. Discret. Math. Ulrich Faigle, Rainer Schrader
1986	J	`jnl`	A size-width inequality for distributive lattices. Comb. Ulrich Faigle, Bill Sands
1986	J	`jnl`	Exchange properties of combinatorial closure spaces. Discret. Appl. Math. Ulrich Faigle
1986	J	`jnl`	On the computational complexity of the order polynomial. Discret. Appl. Math. Ulrich Faigle, Rainer Schrader
1986	J	`jnl`	Searching in Trees, Series-Parallel and Interval Orders. SIAM J. Comput. Ulrich Faigle, László Lovász, Rainer Schrader, György Turán
1986	B	`conf`	The Bandwidth of Planar Distributive Lattices. WG Ulrich Faigle
1985	J	`jnl`	Algorithmic approaches to setup minimization. SIAM J. Comput. Ulrich Faigle, Gerhard Gierz, Rainer Schrader
1985	J	`jnl`	Book reviews. Z. Oper. Research J. George Shanthikumar, Alfred Luhmer, H. Kremar, Ulrich Faigle, Martin Shubik, Hansjörg Wacker, Alexander Schrijver, Michael M. Richter
1985	J	`jnl`	On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms J. ACM Ulrich Faigle
1985	A	`conf`	Sorting and Recognition Problems for Ordered Sets. STACS Ulrich Faigle, György Turán
1984	J	`jnl`	5th Bonn workshop on combinatorial optimization : June 11-16, 1984 at the University of Bonn, West Germany. Discret. Appl. Math. Ulrich Faigle
1984	J	`jnl`	A vector exchange property of submodular systems. Discret. Appl. Math. Ulrich Faigle
1984	J	`jnl`	Minimizing Completion Time for a Class of Scheduling Problems. Inf. Process. Lett. Ulrich Faigle, Rainer Schrader
1983	J	`jnl`	Optimal Matchings in Posets. Eur. J. Comb. Ulrich Faigle
1980	J	`jnl`	Geometries on partially ordered sets. J. Comb. Theory B Ulrich Faigle
1979	J	`jnl`	The greedy algorithm for partially ordered sets. Discret. Math. Ulrich Faigle