| 2008 |
|---|
| 31 | EE | Jan Bernhardt,
Detlef Seese:
A Conceptual Framework for the Governance of Service-Oriented Architectures.
ICSOC Workshops 2008: 327-338 |
| 30 | EE | Petr Hlinený,
Sang-il Oum,
Detlef Seese,
Georg Gottlob:
Width Parameters Beyond Tree-width and their Applications.
Comput. J. 51(3): 326-362 (2008) |
| 2007 |
|---|
| 29 | | Markus Kress,
Detlef Seese:
Flexibility Enhancements in BPM by applying Executable Product Models and Intelligent Agents.
BPSC 2007: 93-104 |
| 28 | EE | Detlef Seese:
Easy Problems for Grid-Structured Graphs.
FAW 2007: 293-304 |
| 27 | EE | Markus Kress,
Joachim Melcher,
Detlef Seese:
Introducing Executable Product Models for the Service Industry.
HICSS 2007: 46 |
| 26 | EE | Markus Kress,
Detlef Seese:
Executable product models - The intelligent way.
SMC 2007: 1987-1992 |
| 2006 |
|---|
| 25 | | Detlef Seese:
Trees, Grids and Matroids: Observations on Logical Ways to Avoid Complexity.
ACiD 2006: 7 |
| 24 | EE | Ingo Oesterreicher,
Andreas Mitschele,
Frank Schlottmann,
Detlef Seese:
Comparison of multi-objective evolutionary algorithms in optimizing combinations of reinsurance contracts.
GECCO 2006: 747-748 |
| 23 | EE | Andreas Mitschele,
Ingo Oesterreicher,
Frank Schlottmann,
Detlef Seese:
Heuristic Optimization of Reinsurance Programs and Implications for Reinsurance Buyers.
OR 2006: 287-292 |
| 22 | EE | Petr Hlinený,
Detlef Seese:
Trees, grids, and MSO decidability: From graphs to matroids.
Theor. Comput. Sci. 351(3): 372-393 (2006) |
| 2005 |
|---|
| 21 | EE | Frank Schlottmann,
Andreas Mitschele,
Detlef Seese:
A Multi-objective Approach to Integrated Risk Management.
EMO 2005: 692-706 |
| 20 | | Roland Küstermann,
Dietmar Ratz,
Detlef Seese:
Effektive Java-Grundausbildung unter Einsatz eines Learning Management Szstems und spezieller Werkzeuge.
INFOS 2005: 231-241 |
| 2004 |
|---|
| 19 | EE | Petr Hlinený,
Detlef Seese:
On Decidability of MSO Theories of Representable Matroids.
IWPEC 2004: 96-107 |
| 18 | EE | Frank Schlottmann,
Detlef Seese:
A hybrid heuristic approach to discrete multi-objective optimization of credit portfolios.
Computational Statistics & Data Analysis 47(2): 373-399 (2004) |
| 1998 |
|---|
| 17 | | Martin Kreidler,
Detlef Seese:
Monadic NP and Graph Minors.
CSL 1998: 126-141 |
| 16 | | Ralf Herrmann,
Martin Kreidler,
Detlef Seese,
Kai Zabel:
A Fuzzy-Hybrid Approach to Stock Trading.
ICONIP 1998: 1028-1032 |
| 1996 |
|---|
| 15 | | Martin Kreidler,
Detlef Seese:
Monadic NP and Built-in Trees.
CSL 1996: 260-275 |
| 14 | | Detlef Seese:
Linear Time Computable Problems and First-Order Descriptions.
Mathematical Structures in Computer Science 6(6): 505-526 (1996) |
| 1995 |
|---|
| 13 | EE | Detlef Seese:
Linear time computable problems and logical descriptions.
Electr. Notes Theor. Comput. Sci. 2: (1995) |
| 1993 |
|---|
| 12 | EE | Stefan Arnborg,
Bruno Courcelle,
Andrzej Proskurowski,
Detlef Seese:
An Algebraic Theory of Graph Reduction.
J. ACM 40(5): 1134-1164 (1993) |
| 1992 |
|---|
| 11 | | Detlef Seese:
Interpretability and tree automata: A simple way to solve algorithmic problems on graphs closely related to trees.
Tree Automata and Languages 1992: 83-114 |
| 1991 |
|---|
| 10 | | Detlef Seese:
The Structure of Models of Decidable Monadic Theories of Graphs.
Ann. Pure Appl. Logic 53(2): 169-195 (1991) |
| 9 | | Stefan Arnborg,
Jens Lagergren,
Detlef Seese:
Easy Problems for Tree-Decomposable Graphs.
J. Algorithms 12(2): 308-340 (1991) |
| 1990 |
|---|
| 8 | | Stefan Arnborg,
Andrzej Proskurowski,
Detlef Seese:
Monadic Second Order Logic, Tree Automata and Forbidden Minors.
CSL 1990: 1-16 |
| 7 | | Stefan Arnborg,
Bruno Courcelle,
Andrzej Proskurowski,
Detlef Seese:
An Algebraic Theory of Graph Reduction.
Graph-Grammars and Their Application to Computer Science 1990: 70-83 |
| 1989 |
|---|
| 6 | EE | Detlef Seese,
W. Wessel:
Grids and their minors.
J. Comb. Theory, Ser. B 47(3): 349-360 (1989) |
| 1988 |
|---|
| 5 | | Stefan Arnborg,
Jens Lagergren,
Detlef Seese:
Problems Easy for Tree-Decomposable Graphs (Extended Abstract).
ICALP 1988: 38-51 |
| 1987 |
|---|
| 4 | | P. Scheffler,
Detlef Seese:
A combinatorial and logical approach to linear-time computability.
EUROCAL 1987: 379-380 |
| 1985 |
|---|
| 3 | | Detlef Seese:
Tree-partite graphs and the complexity of algorithms.
FCT 1985: 412-421 |
| 1981 |
|---|
| 2 | | Detlef Seese:
Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures.
FCT 1981: 341-349 |
| 1977 |
|---|
| 1 | | Detlef Seese:
Decidability of omaega-Trees with Bounded Sets - A Survey.
FCT 1977: 511-515 |
