Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Detlef Seese
2010 – today
- 2012
[c31]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- [c30]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
- [c29]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
- 2011
- [c28]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
- [e2]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
- 2010
- [p2]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
- [e1]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
2000 – 2009
- 2009
- [c27]Markus Kress, Detlef Seese: Autonomous Optimization of Business Processes. Business Process Management Workshops 2009: 116-127
- [c26]Joachim Melcher, Jan Mendling, Hajo A. Reijers, Detlef Seese: On Measuring the Understandability of Process Models. Business Process Management Workshops 2009: 465-476
- [c25]Joachim Melcher, Detlef Seese: Empirical Analysis of a Proposed Process Granularity Heuristic. Business Process Management Workshops 2009: 513-524
- 2008
- [j9]Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob: Width Parameters Beyond Tree-width and their Applications. Comput. J. 51(3): 326-362 (2008)
- [c24]Jan Bernhardt, Detlef Seese: A Conceptual Framework for the Governance of Service-Oriented Architectures. ICSOC Workshops 2008: 327-338
- [c23]Joachim Melcher, Detlef Seese: Towards Validating Prediction Systems for Process Understandability: Measuring Process Understandability. SYNASC 2008: 564-571
- [c22]Joachim Melcher, Detlef Seese: Visualization and Clustering of Business Process Collections Based on Process Metric Values. SYNASC 2008: 572-575
- 2007
- [c21]Markus Kress, Detlef Seese: Flexibility Enhancements in BPM by applying Executable Product Models and Intelligent Agents. BPSC 2007: 93-104
- [c20]
- [c19]Markus Kress, Joachim Melcher, Detlef Seese: Introducing Executable Product Models for the Service Industry. HICSS 2007: 46
- [c18]
- 2006
- [j8]Petr Hlinený, Detlef Seese: Trees, grids, and MSO decidability: From graphs to matroids. Theor. Comput. Sci. 351(3): 372-393 (2006)
- [c17]Detlef Seese: Trees, Grids and Matroids: Observations on Logical Ways to Avoid Complexity. ACiD 2006: 7
- [c16]Ingo Oesterreicher, Andreas Mitschele, Frank Schlottmann, Detlef Seese: Comparison of multi-objective evolutionary algorithms in optimizing combinations of reinsurance contracts. GECCO 2006: 747-748
- [c15]Christian Ullrich, Detlef Seese, Stephan K. Chalup: Foreign Exchange Trading with Support Vector Machines. GfKl 2006: 539-546
- [c14]Andreas Mitschele, Ingo Oesterreicher, Frank Schlottmann, Detlef Seese: Heuristic Optimization of Reinsurance Programs and Implications for Reinsurance Buyers. OR 2006: 287-292
- 2005
- [c13]Frank Schlottmann, Andreas Mitschele, Detlef Seese: A Multi-objective Approach to Integrated Risk Management. EMO 2005: 692-706
- [c12]Roland Küstermann, Dietmar Ratz, Detlef Seese: Effektive Java-Grundausbildung unter Einsatz eines Learning Management Szstems und spezieller Werkzeuge. INFOS 2005: 231-241
- 2004
- [j7]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)
- [c11]Petr Hlinený, Detlef Seese: On Decidability of MSO Theories of Representable Matroids. IWPEC 2004: 96-107
1990 – 1999
- 1998
- [c10]
- [c9]Ralf Herrmann, Martin Kreidler, Detlef Seese, Kai Zabel: A Fuzzy-Hybrid Approach to Stock Trading. ICONIP 1998: 1028-1032
- 1996
- [j6]Detlef Seese: Linear Time Computable Problems and First-Order Descriptions. Mathematical Structures in Computer Science 6(6): 505-526 (1996)
- [c8]
- 1995
- [j5]Detlef Seese: Linear time computable problems and logical descriptions. Electr. Notes Theor. Comput. Sci. 2: 246-259 (1995)
- 1993
- [j4]Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese: An Algebraic Theory of Graph Reduction. J. ACM 40(5): 1134-1164 (1993)
- 1992
- [p1]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
- [j3]Detlef Seese: The Structure of Models of Decidable Monadic Theories of Graphs. Ann. Pure Appl. Logic 53(2): 169-195 (1991)
- [j2]Stefan Arnborg, Jens Lagergren, Detlef Seese: Easy Problems for Tree-Decomposable Graphs. J. Algorithms 12(2): 308-340 (1991)
- 1990
- [c7]Stefan Arnborg, Andrzej Proskurowski, Detlef Seese: Monadic Second Order Logic, Tree Automata and Forbidden Minors. CSL 1990: 1-16
- [c6]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
1980 – 1989
- 1989
- [j1]
- 1988
- [c5]Stefan Arnborg, Jens Lagergren, Detlef Seese: Problems Easy for Tree-Decomposable Graphs (Extended Abstract). ICALP 1988: 38-51
- 1987
- [c4]P. Scheffler, Detlef Seese: A combinatorial and logical approach to linear-time computability. EUROCAL 1987: 379-380
- 1985
- [c3]
- 1981
- [c2]Detlef Seese: Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures. FCT 1981: 341-349
1970 – 1979
- 1977
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:17 CEST by the dblp team