Detlef Seese

Matthes Elstermann, Detlef Seese, Albert Fleischmann: Using the Arbitrator Pattern for Dynamic Process-Instance Extension in a Work-Flow Management System. ABZ 2012: 323-326

Matthes Elstermann, Detlef Seese: A Proposal for Modeling Standards for Subject-Oriented Modeling with PASS - A Paper for the Interactive Education Material Track for Modeling Principles Based on the Usage of the Metasonic Build PASS-Editor and Their PASS-Engine. S-BPM ONE 2012: 16-32

Norbert Graef, Nils Tölle, Oliver Schöll, Detlef Seese: In or Out? A Student Project on the Enrollment Process - Developing a Reference Model for a Service-Oriented Portal through S-BPM Process Exploration. S-BPM ONE 2012: 77-90

Andreas Oberweis, Hartmut Schmeck, Detlef Seese, Wolffried Stucky, Stefan Tai: Semantic Web and Applied Informatics: Selected Research Activities in the Institute AIFB. Foundations for the Web of Information and Services 2011: 29-40

Albert Fleischmann, Werner Schmidt, Robert Singer, Detlef Seese (Eds.): Subject-Oriented Business Process Management - Second International Conference, S-BPM ONE 2010, Karlsruhe, Germany, October 14, 2010. Selected Papers. Communications in Computer and Information Science 138, Springer 2011, isbn 978-3-642-23134-6

Markus Kress, Sanaz Mostaghim, Detlef Seese: Intelligent Business Process Execution using Particle Swarm Optimization. Nature-Inspired Informatics for Intelligent Applications and Knowledge Discovery 2010: 49-66

Hagen Buchwald, Albert Fleischmann, Detlef Seese, Christian Stary (Eds.): S-BPM ONE - Setting the Stage for Subject-Oriented Business Process Management - First International Workshop, Karlsruhe, Germany, October 22, 2009. Revised Selected Papers. Communications in Computer and Information Science 85, Springer 2010, isbn 978-3-642-15914-5

Markus Kress, Detlef Seese: Autonomous Optimization of Business Processes. Business Process Management Workshops 2009: 116-127

Joachim Melcher, Jan Mendling, Hajo A. Reijers, Detlef Seese: On Measuring the Understandability of Process Models. Business Process Management Workshops 2009: 465-476

Joachim Melcher, Detlef Seese: Empirical Analysis of a Proposed Process Granularity Heuristic. Business Process Management Workshops 2009: 513-524

Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob: Width Parameters Beyond Tree-width and their Applications. Comput. J. 51(3): 326-362 (2008)

Jan Bernhardt, Detlef Seese: A Conceptual Framework for the Governance of Service-Oriented Architectures. ICSOC Workshops 2008: 327-338

Joachim Melcher, Detlef Seese: Towards Validating Prediction Systems for Process Understandability: Measuring Process Understandability. SYNASC 2008: 564-571

Joachim Melcher, Detlef Seese: Visualization and Clustering of Business Process Collections Based on Process Metric Values. SYNASC 2008: 572-575

Markus Kress, Detlef Seese: Flexibility Enhancements in BPM by applying Executable Product Models and Intelligent Agents. BPSC 2007: 93-104

Detlef Seese: Easy Problems for Grid-Structured Graphs. FAW 2007: 293-304

Markus Kress, Joachim Melcher, Detlef Seese: Introducing Executable Product Models for the Service Industry. HICSS 2007: 46

Markus Kress, Detlef Seese: Executable product models - The intelligent way. SMC 2007: 1987-1992

Petr Hlinený, Detlef Seese: Trees, grids, and MSO decidability: From graphs to matroids. Theor. Comput. Sci. 351(3): 372-393 (2006)

Detlef Seese: Trees, Grids and Matroids: Observations on Logical Ways to Avoid Complexity. ACiD 2006: 7

Ingo Oesterreicher, Andreas Mitschele, Frank Schlottmann, Detlef Seese: Comparison of multi-objective evolutionary algorithms in optimizing combinations of reinsurance contracts. GECCO 2006: 747-748

Christian Ullrich, Detlef Seese, Stephan K. Chalup: Foreign Exchange Trading with Support Vector Machines. GfKl 2006: 539-546

Andreas Mitschele, Ingo Oesterreicher, Frank Schlottmann, Detlef Seese: Heuristic Optimization of Reinsurance Programs and Implications for Reinsurance Buyers. OR 2006: 287-292

Frank Schlottmann, Andreas Mitschele, Detlef Seese: A Multi-objective Approach to Integrated Risk Management. EMO 2005: 692-706

Roland Küstermann, Dietmar Ratz, Detlef Seese: Effektive Java-Grundausbildung unter Einsatz eines Learning Management Szstems und spezieller Werkzeuge. INFOS 2005: 231-241

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)

Petr Hlinený, Detlef Seese: On Decidability of MSO Theories of Representable Matroids. IWPEC 2004: 96-107

Martin Kreidler, Detlef Seese: Monadic NP and Graph Minors. CSL 1998: 126-141

Ralf Herrmann, Martin Kreidler, Detlef Seese, Kai Zabel: A Fuzzy-Hybrid Approach to Stock Trading. ICONIP 1998: 1028-1032

Detlef Seese: Linear Time Computable Problems and First-Order Descriptions. Mathematical Structures in Computer Science 6(6): 505-526 (1996)

Martin Kreidler, Detlef Seese: Monadic NP and Built-in Trees. CSL 1996: 260-275

Detlef Seese: Linear time computable problems and logical descriptions. Electr. Notes Theor. Comput. Sci. 2: 246-259 (1995)

Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese: An Algebraic Theory of Graph Reduction. J. ACM 40(5): 1134-1164 (1993)

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

Detlef Seese: The Structure of Models of Decidable Monadic Theories of Graphs. Ann. Pure Appl. Logic 53(2): 169-195 (1991)

Stefan Arnborg, Jens Lagergren, Detlef Seese: Easy Problems for Tree-Decomposable Graphs. J. Algorithms 12(2): 308-340 (1991)

Stefan Arnborg, Andrzej Proskurowski, Detlef Seese: Monadic Second Order Logic, Tree Automata and Forbidden Minors. CSL 1990: 1-16

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

Detlef Seese, W. Wessel: Grids and their minors. J. Comb. Theory, Ser. B 47(3): 349-360 (1989)

Stefan Arnborg, Jens Lagergren, Detlef Seese: Problems Easy for Tree-Decomposable Graphs (Extended Abstract). ICALP 1988: 38-51

P. Scheffler, Detlef Seese: A combinatorial and logical approach to linear-time computability. EUROCAL 1987: 379-380

Detlef Seese: Tree-partite graphs and the complexity of algorithms. FCT 1985: 412-421

Detlef Seese: Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures. FCT 1981: 341-349

Detlef Seese: Decidability of omaega-Trees with Bounded Sets - A Survey. FCT 1977: 511-515