dblp.uni-trier.dewww.uni-trier.de

Detlef Seese Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2008
32EEJan Bernhardt, Detlef Seese: A Conceptual Framework for the Governance of Service-Oriented Architectures. ICSOC Workshops 2008: 327-338
31EEPetr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob: Width Parameters Beyond Tree-width and their Applications. Comput. J. 51(3): 326-362 (2008)
2007
30 Markus Kress, Detlef Seese: Flexibility Enhancements in BPM by applying Executable Product Models and Intelligent Agents. BPSC 2007: 93-104
29EEDetlef Seese: Easy Problems for Grid-Structured Graphs. FAW 2007: 293-304
28EEMarkus Kress, Joachim Melcher, Detlef Seese: Introducing Executable Product Models for the Service Industry. HICSS 2007: 46
27EEMarkus Kress, Detlef Seese: Executable product models - The intelligent way. SMC 2007: 1987-1992
2006
26 Detlef Seese: Trees, Grids and Matroids: Observations on Logical Ways to Avoid Complexity. ACiD 2006: 7
25EEIngo Oesterreicher, Andreas Mitschele, Frank Schlottmann, Detlef Seese: Comparison of multi-objective evolutionary algorithms in optimizing combinations of reinsurance contracts. GECCO 2006: 747-748
24EEChristian Ullrich, Detlef Seese, Stephan K. Chalup: Foreign Exchange Trading with Support Vector Machines. GfKl 2006: 539-546
23EEAndreas Mitschele, Ingo Oesterreicher, Frank Schlottmann, Detlef Seese: Heuristic Optimization of Reinsurance Programs and Implications for Reinsurance Buyers. OR 2006: 287-292
22EEPetr Hlinený, Detlef Seese: Trees, grids, and MSO decidability: From graphs to matroids. Theor. Comput. Sci. 351(3): 372-393 (2006)
2005
21EEFrank 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
19EEPetr Hlinený, Detlef Seese: On Decidability of MSO Theories of Representable Matroids. IWPEC 2004: 96-107
18EEFrank 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
17EEMartin 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
15EEMartin 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
13EEDetlef Seese: Linear time computable problems and logical descriptions. Electr. Notes Theor. Comput. Sci. 2: (1995)
1993
12EEStefan 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
8EEStefan 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
6EEDetlef Seese, W. Wessel: Grids and their minors. J. Comb. Theory, Ser. B 47(3): 349-360 (1989)
1988
5EEStefan 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

Coauthor Index

1Stefan Arnborg [5] [7] [8] [9] [12]
2Jan Bernhardt [32]
3Stephan K. Chalup [24]
4Bruno Courcelle [7] [12]
5Georg Gottlob [31]
6Ralf Herrmann [16]
7Petr Hlinený [19] [22] [31]
8Martin Kreidler [15] [16] [17]
9Markus Kress [27] [28] [30]
10Roland Küstermann [20]
11Jens Lagergren [5] [9]
12Joachim Melcher [28]
13Andreas Mitschele [21] [23] [25]
14Ingo Oesterreicher [23] [25]
15Sang-il Oum [31]
16Andrzej Proskurowski [7] [8] [12]
17Dietmar Ratz [20]
18P. Scheffler [4]
19Frank Schlottmann [18] [21] [23] [25]
20Christian Ullrich [24]
21W. Wessel [6]
22Kai Zabel [16]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)