default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDetlef Seese
Person information
- affiliation: Karlsruhe Institute of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j11]Benedikt Boecking
, Stephan K. Chalup, Detlef Seese, Aaron S. W. Wong:
Support vector clustering of time series data with alignment kernels. Pattern Recognit. Lett. 45: 129-135 (2014)- 2008
- [j10]Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob:
Width Parameters Beyond Tree-width and their Applications. Comput. J. 51(3): 326-362 (2008) - 2006
- [j9]Petr Hlinený, Detlef Seese:
Trees, grids, and MSO decidability: From graphs to matroids. Theor. Comput. Sci. 351(3): 372-393 (2006) - 2004
- [j8]Frank Schlottmann, Detlef Seese:
A hybrid heuristic approach to discrete multi-objective optimization of credit portfolios. Comput. Stat. Data Anal. 47(2): 373-399 (2004) - 1996
- [j7]Detlef Seese:
Linear Time Computable Problems and First-Order Descriptions. Math. Struct. Comput. Sci. 6(6): 505-526 (1996) - 1993
- [j6]Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese:
An Algebraic Theory of Graph Reduction. J. ACM 40(5): 1134-1164 (1993) - 1991
- [j5]Detlef Seese:
The Structure of Models of Decidable Monadic Theories of Graphs. Ann. Pure Appl. Log. 53(2): 169-195 (1991) - [j4]Stefan Arnborg, Jens Lagergren, Detlef Seese:
Easy Problems for Tree-Decomposable Graphs. J. Algorithms 12(2): 308-340 (1991) - 1989
- [j3]Detlef Seese, W. Wessel:
Grids and their minors. J. Comb. Theory B 47(3): 349-360 (1989) - 1982
- [j2]Detlef Seese, Martin Weese:
L(aa)-Elementary Types of Well-Orderings. Math. Log. Q. 28(33-38): 557-564 (1982) - 1978
- [j1]Detlef Seese:
Über Unentscheidbare Erweiterungen von SC. Math. Log. Q. 24(1-6): 63-71 (1978)
Conference and Workshop Papers
- 2012
- [c32]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 - [c31]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 - [c30]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
- [c29]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 - 2009
- [c28]Markus Kress, Detlef Seese:
Autonomous Optimization of Business Processes. Business Process Management Workshops 2009: 116-127 - [c27]Joachim Melcher, Jan Mendling, Hajo A. Reijers, Detlef Seese:
On Measuring the Understandability of Process Models. Business Process Management Workshops 2009: 465-476 - [c26]Joachim Melcher, Detlef Seese:
Empirical Analysis of a Proposed Process Granularity Heuristic. Business Process Management Workshops 2009: 513-524 - 2008
- [c25]Jan Bernhardt, Detlef Seese:
A Conceptual Framework for the Governance of Service-Oriented Architectures. ICSOC Workshops 2008: 327-338 - [c24]Joachim Melcher, Detlef Seese:
Towards Validating Prediction Systems for Process Understandability: Measuring Process Understandability. SYNASC 2008: 564-571 - [c23]Joachim Melcher, Detlef Seese:
Visualization and Clustering of Business Process Collections Based on Process Metric Values. SYNASC 2008: 572-575 - 2007
- [c22]Markus Kress, Detlef Seese:
Flexibility Enhancements in BPM by applying Executable Product Models and Intelligent Agents. BPSC 2007: 93-104 - [c21]Detlef Seese:
Easy Problems for Grid-Structured Graphs. FAW 2007: 293-304 - [c20]Markus Kress, Joachim Melcher, Detlef Seese:
Introducing Executable Product Models for the Service Industry. HICSS 2007: 46 - [c19]Markus Kress, Detlef Seese:
Executable product models - The intelligent way. SMC 2007: 1987-1992 - 2006
- [c18]Detlef Seese:
Trees, Grids and Matroids: Observations on Logical Ways to Avoid Complexity. ACiD 2006: 7 - [c17]Ingo Oesterreicher, Andreas Mitschele, Frank Schlottmann, Detlef Seese:
Comparison of multi-objective evolutionary algorithms in optimizing combinations of reinsurance contracts. GECCO 2006: 747-748 - [c16]Christian Ullrich, Detlef Seese, Stephan K. Chalup:
Foreign Exchange Trading with Support Vector Machines. GfKl 2006: 539-546 - [c15]Andreas Mitschele, Ingo Oesterreicher, Frank Schlottmann, Detlef Seese:
Heuristic Optimization of Reinsurance Programs and Implications for Reinsurance Buyers. OR 2006: 287-292 - 2005
- [c14]Frank Schlottmann, Andreas Mitschele, Detlef Seese:
A Multi-objective Approach to Integrated Risk Management. EMO 2005: 692-706 - [c13]Roland Küstermann, Dietmar Ratz, Detlef Seese:
Effektive Java-Grundausbildung unter Einsatz eines Learning Management Szstems und spezieller Werkzeuge. INFOS 2005: 231-241 - 2004
- [c12]Petr Hlinený, Detlef Seese:
On Decidability of MSO Theories of Representable Matroids. IWPEC 2004: 96-107 - 1998
- [c11]Martin Kreidler, Detlef Seese:
Monadic NP and Graph Minors. CSL 1998: 126-141 - [c10]Ralf Herrmann, Martin Kreidler, Detlef Seese, Kai Zabel:
A Fuzzy-Hybrid Approach to Stock Trading. ICONIP 1998: 1028-1032 - 1996
- [c9]Martin Kreidler, Detlef Seese:
Monadic NP and Built-in Trees. CSL 1996: 260-275 - 1995
- [c8]Detlef Seese:
Linear time computable problems and logical descriptions. SEGRAGRA 1995: 246-259 - 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 - 1988
- [c5]Stefan Arnborg, Jens Lagergren, Detlef Seese:
Problems Easy for Tree-Decomposable Graphs (Extended Abstract). ICALP 1988: 38-51 - 1987
- [c4]Petra Scheffler, Detlef Seese:
A combinatorial and logical approach to linear-time computability. EUROCAL 1987: 379-380 - 1985
- [c3]Detlef Seese:
Tree-partite graphs and the complexity of algorithms. FCT 1985: 412-421 - 1981
- [c2]Detlef Seese:
Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures. FCT 1981: 341-349 - 1977
- [c1]Detlef Seese:
Decidability of omaega-Trees with Bounded Sets - A Survey. FCT 1977: 511-515
Parts in Books or Collections
- 2011
- [p3]Caslav Bozic, Ryan Riordan, Detlef Seese, Christof Weinhardt:
Towards a Benchmarking Framework for Financial Text Mining. Information Management and Market Engineering Vol. II 2011: 21-36 - 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 - 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
Editorship
- 2011
- [e2]Albert Fleischmann, Werner Schmidt, Robert Singer, Detlef Seese:
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 [contents] - 2010
- [e1]Hagen Buchwald, Albert Fleischmann, Detlef Seese, Christian Stary:
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 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
