Ulrich Faigle
University of Cologne, Germany
http://www.zpr.uni-koeln.de/~faigle/
Ulrich Faigle
Mathematical Game Theory.
2020
abs/2012.01850
CoRR
https://arxiv.org/abs/2012.01850
db/journals/corr/corr2012.html#abs-2012-01850
Ekrem Duman
Ali Fuat Alkaya
Stefan Pickl
Ulrich Faigle
Preface: 13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2015).
1
2019
252
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2018.10.020
db/journals/dam/dam252.html#DumanAPF19
Ulrich Faigle
Walter Kern
Britta Peis
Greedy Oriented Flows.
1298-1314
2018
80
Algorithmica
4
https://doi.org/10.1007/s00453-017-0306-4
https://www.wikidata.org/entity/Q59529252
db/journals/algorithmica/algorithmica80.html#FaigleKP18
Ulrich Faigle
Gerhard Gierz
Markovian statistics on evolving systems.
213-225
2018
9
Evol. Syst.
3
https://doi.org/10.1007/s12530-017-9186-8
db/journals/evs/evs9.html#FaigleG18
Ulrich Faigle
Michel Grabisch
Game Theoretic Interaction and Decision: A Quantum Analysis.
48
2017
8
Games
4
https://doi.org/10.3390/g8040048
db/journals/games/games8.html#FaigleG17
Ulrich Faigle
Michel Grabisch
Andrés Jiménez-Losada
Manuel Ordóñez
Games on concept lattices: Shapley value and core.
29-47
2016
198
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2015.08.004
db/journals/dam/dam198.html#FaigleGJO16
Ulrich Faigle
Weighted Graphs as Dynamical Interaction Systems.
185-189
2016
55
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2016.10.046
db/journals/endm/endm55.html#Faigle16
Ulrich Faigle
Michel Grabisch
Bases and linear transforms of TU-games and cooperation systems.
875-892
2016
45
Int. J. Game Theory
4
https://doi.org/10.1007/s00182-015-0490-x
db/journals/ijgt/ijgt45.html#FaigleG16
Ulrich Faigle
Michel Grabisch
Least Square Approximations and Linear Values of Cooperative Games.
2016
abs/1601.02831
CoRR
http://arxiv.org/abs/1601.02831
db/journals/corr/corr1601.html#FaigleG16
Ulrich Faigle
Alexander Schönhuth
On Hidden States in Quantum Random Walks.
2016
abs/1601.02882
CoRR
http://arxiv.org/abs/1601.02882
db/journals/corr/corr1601.html#FaigleS16
Ulrich Faigle
Erik Kropat
Renato De Leone
Silja Meyer-Nieberg
Stefan Pickl
Preface.
1
2015
192
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2015.05.017
db/journals/dam/dam192.html#FaigleKLMP15
Ulrich Faigle
Gaia Nicosia
Andrea Pacifici
Preface.
1
2014
165
Discret. Appl. Math.
https://doi.org/10.1016/j.dam.2013.12.022
db/journals/dam/dam165.html#FaigleNP14
Ulrich Faigle
Rainer Schrader
9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010).
1673
2013
161
Discret. Appl. Math.
12
https://doi.org/10.1016/j.dam.2013.02.018
db/journals/dam/dam161.html#FaigleS13
Ulrich Faigle
Alexander Schönhuth
Observation and evolution of finite-dimensional Markov systems.
93-97
2013
CTW
conf/colognetwente/2013
db/conf/colognetwente/colognetwente2013.html#FaigleS13
Ulrich Faigle
Walter Kern
Britta Peis
A ranking model for the greedy algorithm and discrete convexity.
393-407
2012
132
Math. Program.
1-2
https://doi.org/10.1007/s10107-010-0406-2
db/journals/mp/mp132.html#FaigleKP12
Ulrich Faigle
Walter Kern
Britta Peis
Max-Flow on Regular Spaces
http://arxiv.org/abs/1206.5167
2012
CoRR
abs/1206.5167
db/journals/corr/corr1206.html#abs-1206-5167
Sonia Cafieri
Ulrich Faigle
Leo Liberti
8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009).
1659
2011
159
Discret. Appl. Math.
16
https://doi.org/10.1016/j.dam.2011.06.029
db/journals/dam/dam159.html#CafieriFL11
Ulrich Faigle
Jan Voss
A system-theoretic model for cooperation, interaction and allocation.
1736-1750
2011
159
Discret. Appl. Math.
16
https://doi.org/10.1016/j.dam.2010.07.007
db/journals/dam/dam159.html#FaigleV11
Ulrich Faigle
Michel Grabisch
A discrete Choquet integral for ordered systems.
3-17
2011
168
Fuzzy Sets Syst.
1
https://doi.org/10.1016/j.fss.2010.10.003
db/journals/fss/fss168.html#FaigleG11
Ulrich Faigle
Alexander Schönhuth
Efficient Tests for Equivalence of Hidden Markov Processes and Quantum Random Walks.
1746-1753
2011
57
IEEE Trans. Inf. Theory
3
https://doi.org/10.1109/TIT.2011.2104511
db/journals/tit/tit57.html#FaigleS11
Kirsten Albrecht
Ulrich Faigle
Binary Betting Strategies with Optimal Logarithmic Growth.
44-47
2011
CTW
http://ctw2011.dia.uniroma3.it/ctw_proceedings.pdf#page=56
conf/colognetwente/2011
db/conf/colognetwente/colognetwente2011.html#AlbrechtF11
Ulrich Faigle
Alexander Schönhuth
Representations of Power Series over Word Algebras.
154-157
2011
CTW
http://ctw2011.dia.uniroma3.it/ctw_proceedings.pdf#page=166
conf/colognetwente/2011
db/conf/colognetwente/colognetwente2011.html#FaigleS11
Ulrich Faigle
Walter Kern
Britta Peis
On Greedy and Submodular Matrices.
116-126
2011
TAPAS
https://doi.org/10.1007/978-3-642-19754-3_13
conf/tapas/2011
db/conf/tapas/tapas2011.html#FaigleKP11
Ulrich Faigle
Michel Grabisch
A Discrete Choquet Integral for Ordered Systems
http://arxiv.org/abs/1102.1340
2011
CoRR
abs/1102.1340
db/journals/corr/corr1102.html#abs-1102-1340
Ulrich Faigle
Johann L. Hurink
Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007.
239
2010
158
Discret. Appl. Math.
4
https://doi.org/10.1016/j.dam.2009.09.011
db/journals/dam/dam158.html#FaigleH10
Ulrich Faigle
Michel Grabisch
M. Heyne
Monge extensions of cooperation and communication structures.
104-110
2010
206
Eur. J. Oper. Res.
1
https://doi.org/10.1016/j.ejor.2010.01.043
db/journals/eor/eor206.html#FaigleGH10
Ulrich Faigle
Britta Peis
Two-phase greedy algorithms for some classes of combinatorial linear programs.
2010
6
ACM Trans. Algorithms
4
https://doi.org/10.1145/1824777.1824785
db/journals/talg/talg6.html#FaigleP10
65:1-65:13
Ulrich Faigle
Michel Grabisch
M. Heyne
Choquet Integration on Set Systems.
512-520
2010
IPMU
https://doi.org/10.1007/978-3-642-14049-5_53
conf/ipmu/2010
db/conf/ipmu/ipmu2010.html#FaigleGH10
Ulrich Faigle
Rainer Schrader
Daniel Herrmann
9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Cologne, Germany, May 25-27, 2010. Extended Abstracts
CTW
2010
db/conf/colognetwente/colognetwente2010.html
http://ctw.uni-koeln.de/CTW2010.pdf
Ulrich Faigle
Alexander Schönhuth
Discrete Quantum Markov Chains
http://arxiv.org/abs/1011.1295
2010
CoRR
abs/1011.1295
db/journals/corr/corr1011.html#abs-1011-1295
Jutta Gebert
Nicole Radde
Ulrich Faigle
Julia Strösser
Andreas Burkovski
Modeling and simulation of nitrogen regulation in Corynebacterium glutamicum.
2232-2243
2009
157
Discret. Appl. Math.
10
https://doi.org/10.1016/j.dam.2008.06.055
https://www.wikidata.org/entity/Q58007000
db/journals/dam/dam157.html#GebertRFSB09
Ulrich Faigle
Rainer Schrader
Rüdiger Schultz
Preface on CTW 2006.
203-204
2009
69
Math. Methods Oper. Res.
2
https://doi.org/10.1007/s00186-008-0254-5
db/journals/mmor/mmor69.html#FaigleSS09
Ulrich Faigle
Satoru Fujishige
A general model for matroids and the greedy algorithm.
353-369
2009
119
Math. Program.
2
https://doi.org/10.1007/s10107-008-0213-1
db/journals/mp/mp119.html#FaigleF09
Ulrich Faigle
Jan Voss
A System-Theoretic Model for Cooperation and Allocation Mechanisms.
361-364
2009
CTW
http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf#page=373
conf/colognetwente/2009
db/conf/colognetwente/colognetwente2009.html#FaigleV09
Ulrich Faigle
Michel Grabisch
A Monge Algorithm for Computing the Choquet Integral on Set Systems.
161-166
2009
IFSA/EUSFLAT Conf.
http://www.eusflat.org/proceedings/IFSA-EUSFLAT_2009/pdf/tema_0161.pdf
conf/eusflat/2009
db/conf/eusflat/eusflat2009.html#FaigleG09
Ulrich Faigle
Bert Randerath
Rainer Schrader
Preface for CTW2005 special issue.
3155
2008
156
Discret. Appl. Math.
17
https://doi.org/10.1016/j.dam.2008.06.011
db/journals/dam/dam156.html#FaigleRS08
Ulrich Faigle
Britta Peis
Note on pseudolattices, lattices and submodular linear programs.
489-500
2008
5
Discret. Optim.
2
https://doi.org/10.1016/j.disopt.2007.03.001
db/journals/disopt/disopt5.html#FaigleP08
Jutta Gebert
Susanne Motameny
Ulrich Faigle
Christian V. Forst
Rainer Schrader
Identifying Genes of Gene Regulatory Networks Using Formal Concept Analysis.
185-194
2008
15
J. Comput. Biol.
2
https://doi.org/10.1089/cmb.2007.0107
https://www.wikidata.org/entity/Q80801595
db/journals/jcb/jcb15.html#GebertMFFS08
Ulrich Faigle
Britta Peis
A Hierarchical Model for Cooperative Games.
230-241
2008
SAGT
https://doi.org/10.1007/978-3-540-79309-0_21
conf/sagt/2008
db/conf/sagt/sagt2008.html#FaigleP08
Ulrich Faigle
Britta Peis
Two-phase greedy algorithms for some classes of combinatorial linear programs.
161-166
2008
SODA
http://dl.acm.org/citation.cfm?id=1347082.1347100
conf/soda/2008
db/conf/soda/soda2008.html#FaigleP08
Ulrich Faigle
Bernhard Fuchs
Britta Peis
Note on maximal split-stable subgraphs.
2031-2038
2007
155
Discret. Appl. Math.
15
https://doi.org/10.1016/j.dam.2007.04.009
db/journals/dam/dam155.html#FaigleFP07
Ulrich Faigle
Alexander Schönhuth
Asymptotic Mean Stationarity of Sources With Finite Evolution Dimension.
2342-2348
2007
53
IEEE Trans. Inf. Theory
7
https://doi.org/10.1109/TIT.2007.899514
db/journals/tit/tit53.html#FaigleS07
Ulrich Faigle
Britta Peis
A two-phase greedy algorithm for modular lattice polyhedra.
33-37
2007
CTW
conf/colognetwente/2007
db/conf/colognetwente/colognetwente2007.html#FaigleP07
Lars Kaderali
Thomas Zander
Ulrich Faigle
Jürgen Wolf
Joachim L. Schultze
Rainer Schrader
CASPAR: a hierarchical bayesian approach to predict survival times in cancer from gene expression data.
1495-1502
2006
22
Bioinform.
12
https://doi.org/10.1093/bioinformatics/btl103
https://www.wikidata.org/entity/Q31034872
db/journals/bioinformatics/bioinformatics22.html#KaderaliZFWSS06
Ulrich Faigle
Johann L. Hurink
Stefan Wolfgang Pickl
Preface.
1315
2006
154
Discret. Appl. Math.
9
https://doi.org/10.1016/j.dam.2005.12.003
db/journals/dam/dam154.html#FaigleHP06
Ulrich Faigle
Gereon Frahling
A combinatorial algorithm for weighted stable sets in bipartite graphs.
1380-1391
2006
154
Discret. Appl. Math.
9
https://doi.org/10.1016/j.dam.2005.05.037
db/journals/dam/dam154.html#FaigleF06
Ulrich Faigle
Leo Liberti
Francesco Maffioli
Stefan Pickl
Graphs and combinatorial optimization.
179
2006
3
Discret. Optim.
3
https://doi.org/10.1016/j.disopt.2006.05.001
db/journals/disopt/disopt3.html#FaigleLMP06
Ulrich Faigle
Alexander Schönhuth
Quantum Predictor Models.
149-155
2006
25
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2006.06.075
db/journals/endm/endm25.html#FaigleS06
Ulrich Faigle
Walter Kern
Jeroen Kuipers
Computing an Element in the Lexicographic Kernel of a Game.
427-433
2006
63
Math. Methods Oper. Res.
3
https://doi.org/10.1007/s00186-006-0065-5
db/journals/mmor/mmor63.html#FaigleKK06
Ulrich Faigle
Alexander Schönhuth
Note on Negative Probabilities and Observable Processes.
2005
conf/dagstuhl/2005P5031
Algorithms for Optimization with Incomplete Information
http://drops.dagstuhl.de/opus/volltexte/2005/108
db/conf/dagstuhl/P5031.html#FaigleS05
Ulrich Faigle
Stefan Pickl
Hajo Broersma
Johann L. Hurink
Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization.
159-160
2004
136
Discret. Appl. Math.
2-3
https://doi.org/10.1016/S0166-218X(03)00437-2
db/journals/dam/dam136.html#FaiglePBH04
Ulrich Faigle
Bernhard Fuchs
Britta Wienand
Covering Graphs by Colored Stable Sets.
145-149
2004
17
Electron. Notes Discret. Math.
https://doi.org/10.1016/j.endm.2004.03.029
db/journals/endm/endm17.html#FaigleFW04
Péter L. Erdös
Ulrich Faigle
Winfried Hochstättler
Walter Kern
Note on the game chromatic index of trees.
371-376
2004
313
Theor. Comput. Sci.
3
https://doi.org/10.1016/j.tcs.2002.10.002
db/journals/tcs/tcs313.html#ErdosFHK04
Ulrich Faigle
Bernhard Fuchs
Britta Wienand
Covering Graphs by Colored Stable Sets.
127-131
2004
CTW
conf/colognetwente/2004
db/conf/colognetwente/colognetwente2004.html#FaigleFW04
Hajo Broersma
Ulrich Faigle
Johann L. Hurink
Stefan Pickl
Gerhard J. Woeginger
Preface: Volume 13.
128
2003
13
Electron. Notes Discret. Math.
https://doi.org/10.1016/S1571-0653(05)80008-3
db/journals/endm/endm13.html#BroersmaFHPW03
Hajo Broersma
Ulrich Faigle
Johann L. Hurink
Stefan Pickl
Preface: Volume 8.
1
2001
8
Electron. Notes Discret. Math.
https://doi.org/10.1016/S1571-0653(05)80063-0
db/journals/endm/endm8.html#BroersmaFHP01
Petrica C. Pop
Walter Kern
Georg Still
Ulrich Faigle
Relaxation methods for the Generalized Minimum Spanning Tree Problem.
76-79
2001
8
Electron. Notes Discret. Math.
https://doi.org/10.1016/S1571-0653(05)80085-X
db/journals/endm/endm8.html#PopKSF01
Marcel Hunting
Ulrich Faigle
Walter Kern
A Lagrangian relaxation approach to the edge-weighted clique problem.
119-131
2001
131
Eur. J. Oper. Res.
1
https://doi.org/10.1016/S0377-2217(99)00449-X
db/journals/eor/eor131.html#HuntingFK01
Ulrich Faigle
Walter Kern
Jeroen Kuipers
On the computation of the nucleolus of a cooperative game.
79-98
2001
30
Int. J. Game Theory
1
https://doi.org/10.1007/s001820100065
db/journals/ijgt/ijgt30.html#FaigleKK01
Ulrich Faigle
Walter Kern
Daniël Paulusma
Note on the computational complexity of least core concepts for min-cost spanning tree games.
23-38
2000
52
Math. Methods Oper. Res.
1
https://doi.org/10.1007/s001860000059
db/journals/mmor/mmor52.html#FaigleKP00
Ulrich Faigle
Walter Kern
On the core of ordered submodular cost games.
483-499
2000
87
Math. Program.
3
https://doi.org/10.1007/s101070050008
db/journals/mp/mp87.html#FaigleK00
Ulrich Faigle
Walter Kern
An Order-theoretic Framework for the Greedy Algorithm with Applications to the Core and Weber Set of Cooperative Games.
353-375
2000
17
Order
4
https://doi.org/10.1023/A:1006406424957
db/journals/order/order17.html#FaigleK00
Ulrich Faigle
Walter Kern
Willem M. Nawijn
A Greedy On-Line Algorithm for thek-Track Assignment Problem.
196-210
1999
31
J. Algorithms
1
db/journals/jal/jal31.html#FaigleKN99
https://doi.org/10.1006/jagm.1998.1001
Ulrich Faigle
Walter Kern
Jeroen Kuipers
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.
443-450
1998
27
Int. J. Game Theory
3
https://doi.org/10.1007/s001820050083
db/journals/ijgt/ijgt27.html#FaigleKK98
Ulrich Faigle
Walter Kern
Sándor P. Fekete
Winfried Hochstättler
The nucleon of cooperative games and an algorithm for matching games.
195-211
1998
83
Math. Program.
db/journals/mp/mp83.html#FaigleKFH98
https://doi.org/10.1007/BF02680558
Ulrich Faigle
Walter Kern
Approximate Core Allocation for Binpacking Games.
387-399
1998
11
SIAM J. Discret. Math.
3
https://doi.org/10.1137/S0895480296308074
db/journals/siamdm/siamdm11.html#FaigleK98
Ulrich Faigle
Kees Hoede
Preface.
1
1997
79
Discret. Appl. Math.
1-3
https://doi.org/10.1016/S0166-218X(97)00028-0
db/journals/dam/dam79.html#FaigleH97
Ulrich Faigle
Walter Kern
Sándor P. Fekete
Winfried Hochstättler
On the complexity of testing membership in the core of min-cost spanning tree games.
361-366
1997
26
Int. J. Game Theory
3
https://doi.org/10.1007/BF01263277
db/journals/ijgt/ijgt26.html#FaigleKFH97
Ulrich Faigle
Marcel Hunting
Walter Kern
R. Prakash
K. J. Supowit
Simplices by point-sliding and the Yamnitsky-Levin algorithm.
131-142
1997
46
Math. Methods Oper. Res.
1
https://doi.org/10.1007/BF01199467
db/journals/mmor/mmor46.html#FaigleHKPS97
Ulrich Faigle
Renate Garbe
Walter Kern
Randomized Online Algorithms for Maximizing Busy Time Interval Scheduling.
95-104
1996
56
Computing
2
https://doi.org/10.1007/BF02309339
db/journals/computing/computing56.html#FaigleGK96
Ulrich Faigle
Walter Kern
Boris Spieker
On the communication complexity of t -intersection problems in generalized Boolean algebras.
239-254
1996
43
Math. Methods Oper. Res.
2
https://doi.org/10.1007/BF01680375
db/journals/mmor/mmor43.html#FaigleKS96
Ulrich Faigle
Walter Kern
Submodular linear programs on forests.
195-206
1996
72
Math. Program.
db/journals/mp/mp72.html#FaigleK96
https://doi.org/10.1007/BF02592089
Ulrich Faigle
Walter Kern
Martin Streng
Note on the computational complexity of j-radii of polytopes in Realn.
1-5
1996
73
Math. Program.
db/journals/mp/mp73.html#FaigleKS96
https://doi.org/10.1007/BF02592095
Ulrich Faigle
Alan J. Hoffman
Walter Kern
A Characterization of Nonnegative Box-Greedy Matrices.
1-6
1996
9
SIAM J. Discret. Math.
1
https://doi.org/10.1137/0409001
db/journals/siamdm/siamdm9.html#FaigleHK96
Ulrich Faigle
Willem M. Nawijn
Note on Scheduling Intervals on-line.
13-17
1995
58
Discret. Appl. Math.
1
https://doi.org/10.1016/0166-218X(95)00112-5
db/journals/dam/dam58.html#FaigleN95
Ulrich Faigle
Noud Gademann
Walter Kern
A Random Polynomial Time Algorithm for Well-rounding Convex Bodies.
117-144
1995
58
Discret. Appl. Math.
2
https://doi.org/10.1016/0166-218X(93)E0123-G
db/journals/dam/dam58.html#FaigleGK95
Péter L. Erdös
Ulrich Faigle
Walter Kern
On the average rank of LYM-sets.
11-22
1995
144
Discret. Math.
1-3
https://doi.org/10.1016/0012-365X(94)00282-N
db/journals/dm/dm144.html#ErdosFK95
Ulrich Faigle
Sándor P. Fekete
Winfried Hochstättler
Walter Kern
The Nucleon of Cooperative Games and an Algorithm for Matching Games
Electron. Colloquium Comput. Complex.
1995
TR95-007
TR95
db/journals/eccc/eccc2.html#ECCC-TR95-007
https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-007/index.html
Ulrich Faigle
Sándor P. Fekete
Winfried Hochstättler
Walter Kern
On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games
Electron. Colloquium Comput. Complex.
1995
TR95-012
TR95
db/journals/eccc/eccc2.html#ECCC-TR95-012
https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-012/index.html
Ulrich Faigle
Walter Kern
Martin Streng
Note On the Computational Complexity of j-Radii of Polytopes in Rn
Electron. Colloquium Comput. Complex.
1995
TR95-014
TR95
db/journals/eccc/eccc2.html#ECCC-TR95-014
https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-014/index.html
Ulrich Faigle
Sándor P. Fekete
Winfried Hochstättler
Walter Kern
On Approximately Fair Cost Allocation in Euclidean TSP Games
Electron. Colloquium Comput. Complex.
1995
TR95-016
TR95
db/journals/eccc/eccc2.html#ECCC-TR95-016
https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-016/index.html
Ulrich Faigle
Kees Hoede
Preface.
1
1994
51
Discret. Appl. Math.
1-2
https://doi.org/10.1016/0166-218X(94)90089-2
db/journals/dam/dam51.html#FaigleH94
Ulrich Faigle
Walter Kern
Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints.
688-693
1994
42
Oper. Res.
4
https://doi.org/10.1287/opre.42.4.688
db/journals/ior/ior42.html#FaigleK94
Ulrich Faigle
Walter Kern
On some approximately balanced combinatorial cooperative games.
141-152
1993
38
ZOR Methods Model. Oper. Res.
2
https://doi.org/10.1007/BF01414210
db/journals/mmor/mmor38.html#FaigleK93
Péter L. Erdös
Ulrich Faigle
Walter Kern
A Group-Theoretic Setting for Some Intersecting Sperner Families.
323-334
1992
1
Comb. Probab. Comput.
db/journals/cpc/cpc1.html#ErdosFK92
https://doi.org/10.1017/S0963548300000377
Ulrich Faigle
Rainer Schrader
A greedy reduction algorithm for setup optimization.
73-79
1992
35
Discret. Appl. Math.
1
https://doi.org/10.1016/0166-218X(92)90297-N
db/journals/dam/dam35.html#FaigleS92
Ulrich Faigle
Rainer Schrader
György Turán
The Communication Complexity of Interval Orders.
19-28
1992
40
Discret. Appl. Math.
1
db/journals/dam/dam40.html#FaigleST92
https://doi.org/10.1016/0166-218X(92)90019-7
Ulrich Faigle
Walter Kern
Some Convergence Results for Probabilistic Tabu Search.
32-37
1992
4
INFORMS J. Comput.
1
https://doi.org/10.1287/ijoc.4.1.32
db/journals/informs/informs4.html#FaigleK92
Ulrich Faigle
Walter Kern
Some Order Dimension Bounds for Communication Complexity Problems.
593-601
1991
28
Acta Informatica
6
db/journals/acta/acta28.html#FaigleK91
https://doi.org/10.1007/BF01463947
Rainer E. Burkard
Ulrich Faigle
Book reviews.
346-349
1991
35
ZOR Methods Model. Oper. Res.
4
https://doi.org/10.1007/BF01417522
db/journals/mmor/mmor35.html#BurkardF91
Annelie von Arnim
Ulrich Faigle
Rainer Schrader
The permutahedron of series-parallel posets.
3-9
1990
28
Discret. Appl. Math.
1
https://doi.org/10.1016/0166-218X(90)90089-U
db/journals/dam/dam28.html#ArnimFS90
E. Andrew Boyd
Ulrich Faigle
An algorithmic characterization of antimatroids.
197-205
1990
28
Discret. Appl. Math.
3
https://doi.org/10.1016/0166-218X(90)90002-T
https://www.wikidata.org/entity/Q56387982
db/journals/dam/dam28.html#BoydF90
Ulrich Faigle
Walter Kern
György Turán
On the performance of on-line algorithms for partition problems.
107-119
1989
9
Acta Cybern.
2
db/journals/actaC/actaC9.html#FaigleKT89
https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3359
Ulrich Faigle
Cores of games with restricted cooperation.
405-422
1989
33
ZOR Methods Model. Oper. Res.
6
https://doi.org/10.1007/BF01415939
db/journals/mmor/mmor33.html#Faigle89
Ulrich Faigle
Rainer Schrader
On the Convergence of Stationary Distributions in Simulated Annealing Algorithms.
189-194
1988
27
Inf. Process. Lett.
4
db/journals/ipl/ipl27.html#FaigleS88
https://doi.org/10.1016/0020-0190(88)90024-5
Diethard Pallaschke
Ali Ridha Mahjoub
Ulrich Faigle
A. Rocinski
Jean-Pierre Crouzeix
Book reviews.
346-351
1988
32
ZOR Methods Model. Oper. Res.
5
https://doi.org/10.1007/BF01920303
db/journals/mmor/mmor32.html#PallaschkeMFRC88
Ulrich Faigle
György Turán
Sorting and Recognition Problems for Ordered Sets.
100-113
1988
17
SIAM J. Comput.
1
db/journals/siamcomp/siamcomp17.html#FaigleT88
https://doi.org/10.1137/0217007
Ulrich Faigle
Rainer Schrader
Simulted Annealing -Eine Fallstudie.
259-263
1988
30
Angew. Inform.
6
db/journals/wi/wi30.html#FaigleS88
Ulrich Faigle
Rainer Schrader
Interval orders without odd crowns are defect optimal.
59-69
1987
38
Computing
1
https://doi.org/10.1007/BF02253744
db/journals/computing/computing38.html#FaigleS87
Ulrich Faigle
György Turán
On the complexity of interval orders and semiorders.
131-141
1987
63
Discret. Math.
2-3
https://doi.org/10.1016/0012-365X(87)90003-3
db/journals/dm/dm63.html#FaigleT87
Ulrich Faigle
Bill Sands
A size-width inequality for distributive lattices.
29-33
1986
6
Comb.
1
db/journals/combinatorica/combinatorica6.html#FaigleS86
https://doi.org/10.1007/BF02579406
Ulrich Faigle
Exchange properties of combinatorial closure spaces.
249-260
1986
15
Discret. Appl. Math.
2-3
https://doi.org/10.1016/0166-218X(86)90046-6
db/journals/dam/dam15.html#Faigle86
Ulrich Faigle
Rainer Schrader
On the computational complexity of the order polynomial.
261-269
1986
15
Discret. Appl. Math.
2-3
https://doi.org/10.1016/0166-218X(86)90047-8
db/journals/dam/dam15.html#FaigleS86
Ulrich Faigle
Rainer Schrader
A combinatorial bijection between linear extensions of equivalent orders.
295-301
1986
58
Discret. Math.
3
https://doi.org/10.1016/0012-365X(86)90147-0
db/journals/dm/dm58.html#FaigleS86
Ulrich Faigle
László Lovász 0001
Rainer Schrader
György Turán
Searching in Trees, Series-Parallel and Interval Orders.
1075-1084
1986
15
SIAM J. Comput.
4
db/journals/siamcomp/siamcomp15.html#FaigleLST86
https://doi.org/10.1137/0215077
https://www.wikidata.org/entity/Q116185938
Ulrich Faigle
The Bandwidth of Planar Distributive Lattices.
94-105
1986
conf/wg/1986
WG
db/conf/wg/wg86.html#Faigle86
https://doi.org/10.1007/3-540-17218-1_52
On Ordered Languages and the Optimization of Linear Functions by Greedy Algorithms
Ulrich Faigle
861-870
J. ACM
October
1985
32
4
db/journals/jacm/jacm32.html#Faigle85
https://doi.org/10.1145/4221.4998
J. George Shanthikumar
Alfred Luhmer
H. Kremar
Ulrich Faigle
Martin Shubik
Hansjörg Wacker
Alexander Schrijver
Michael M. Richter
Book reviews.
132-139
1985
29
Z. Oper. Research
3
https://doi.org/10.1007/BF01918202
db/journals/mmor/mmor29.html#ShanthikumarLKF85
Ulrich Faigle
Gerhard Gierz
Rainer Schrader
Algorithmic approaches to setup minimization.
954-965
1985
14
SIAM J. Comput.
4
db/journals/siamcomp/siamcomp14.html#FaigleGS85
https://doi.org/10.1137/0214068
Ulrich Faigle
György Turán
Sorting and Recognition Problems for Ordered Sets.
109-118
1985
conf/stacs/1985
STACS
db/conf/stacs/stacs85.html#FaigleT85
https://doi.org/10.1007/BFb0024000
Ulrich Faigle
5th Bonn workshop on combinatorial optimization : June 11-16, 1984 at the University of Bonn, West Germany.
335
1984
7
Discret. Appl. Math.
3
https://doi.org/10.1016/0166-218X(84)90010-6
db/journals/dam/dam7.html#Faigle84
Ulrich Faigle
A vector exchange property of submodular systems.
209-211
1984
9
Discret. Appl. Math.
2
https://doi.org/10.1016/0166-218X(84)90020-9
db/journals/dam/dam9.html#Faigle84a
Ulrich Faigle
Rainer Schrader
Minimizing Completion Time for a Class of Scheduling Problems.
27-29
1984
19
Inf. Process. Lett.
1
db/journals/ipl/ipl19.html#FaigleS84
https://doi.org/10.1016/0020-0190(84)90124-8
Ulrich Faigle
Optimal Matchings in Posets.
295-303
1983
4
Eur. J. Comb.
4
https://doi.org/10.1016/S0195-6698(83)80025-0
db/journals/ejc/ejc4.html#Faigle83
Ulrich Faigle
Geometries on partially ordered sets.
26-51
1980
28
J. Comb. Theory, Ser. B
1
https://doi.org/10.1016/0095-8956(80)90054-4
db/journals/jct/jctb28.html#Faigle80
Ulrich Faigle
The greedy algorithm for partially ordered sets.
153-159
1979
28
Discret. Math.
2
https://doi.org/10.1016/0012-365X(79)90092-X
db/journals/dm/dm28.html#Faigle79
Kirsten Albrecht
Ali Fuat Alkaya
Annelie von Arnim
E. Andrew Boyd
Hajo Broersma
Rainer E. Burkard
Andreas Burkovski
Sonia Cafieri
Jean-Pierre Crouzeix
Ekrem Duman
Péter L. Erdös
Sándor P. Fekete
Christian V. Forst
Gereon Frahling
Bernhard Fuchs
Satoru Fujishige
A. J. R. M. GademannNoud Gademann
Renate Garbe
Jutta Gebert
Gerhard Gierz
Michel Grabisch
Daniel Herrmann
M. Heyne
Winfried Hochstättler
Kees Hoede
Alan J. Hoffman
Marcel Hunting
Johann L. Hurink
Andrés Jiménez-Losada
Lars Kaderali
Walter Kern
H. Kremar
Erik Kropat
Jeroen Kuipers
Renato De Leone
Leo Liberti
László Lovász 0001
Alfred Luhmer
Francesco Maffioli
Ali Ridha Mahjoub
Silja Meyer-Nieberg
Susanne Motameny
Willem M. Nawijn
Gaia Nicosia
Manuel Ordóñez
Andrea Pacifici
Diethard Pallaschke
Daniël Paulusma
Britta Peis
Stefan PicklStefan Wolfgang Pickl
Petrica C. Pop
R. Prakash
Nicole Radde
Bert Randerath
Michael M. Richter
A. Rocinski
Bill Sands
Alexander Schönhuth
Rainer Schrader
Alexander Schrijver
Rüdiger Schultz
Joachim L. Schultze
J. George Shanthikumar
Martin Shubik
Boris Spieker
Georg Still
Martin Streng
Julia Strösser
K. J. Supowit
György Turán
Jan Voss
Hansjörg Wacker
Britta Wienand
Gerhard J. Woeginger
Jürgen Wolf
Thomas Zander