Detlef Seese

Affiliations:
  • Karlsruhe Institute of Technology, Germany


According to our database1, Detlef Seese authored at least 45 papers between 1977 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
Support vector clustering of time series data with alignment kernels.
Pattern Recognit. Lett., 2014

2012
In or Out? A Student Project on the Enrollment Process - Developing a Reference Model for a Service-Oriented Portal through S-BPM Process Exploration.
Proceedings of the S-BPM ONE - Education and Industrial Developments, 2012

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.
Proceedings of the S-BPM ONE - Education and Industrial Developments, 2012

Using the Arbitrator Pattern for Dynamic Process-Instance Extension in a Work-Flow Management System.
Proceedings of the Abstract State Machines, Alloy, B, VDM, and Z, 2012

2011
Semantic Web and Applied Informatics: Selected Research Activities in the Institute AIFB.
Proceedings of the Foundations for the Web of Information and Services, 2011

Towards a Benchmarking Framework for Financial Text Mining.
Proceedings of the Information Management and Market Engineering Vol. II, 2011

2010
Intelligent Business Process Execution using Particle Swarm Optimization.
Proceedings of the Nature-Inspired Informatics for Intelligent Applications and Knowledge Discovery: Implications in Business, 2010

2009
Empirical Analysis of a Proposed Process Granularity Heuristic.
Proceedings of the Business Process Management Workshops, 2009

On Measuring the Understandability of Process Models.
Proceedings of the Business Process Management Workshops, 2009

Autonomous Optimization of Business Processes.
Proceedings of the Business Process Management Workshops, 2009

2008
Width Parameters Beyond Tree-width and their Applications.
Comput. J., 2008

Visualization and Clustering of Business Process Collections Based on Process Metric Values.
Proceedings of the SYNASC 2008, 2008

Towards Validating Prediction Systems for Process Understandability: Measuring Process Understandability.
Proceedings of the SYNASC 2008, 2008

A Conceptual Framework for the Governance of Service-Oriented Architectures.
Proceedings of the Service-Oriented Computing - ICSOC 2008 Workshops, 2008

2007
Executable product models - The intelligent way.
Proceedings of the IEEE International Conference on Systems, 2007

Introducing Executable Product Models for the Service Industry.
Proceedings of the 40th Hawaii International International Conference on Systems Science (HICSS-40 2007), 2007

Easy Problems for Grid-Structured Graphs.
Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

Flexibility Enhancements in BPM by applying Executable Product Models and Intelligent Agents.
Proceedings of the Business Process and Services Computing: 1st International Working Conference on Business Process and Services Computing, 2007

2006
Trees, grids, and MSO decidability: From graphs to matroids.
Theor. Comput. Sci., 2006

Heuristic Optimization of Reinsurance Programs and Implications for Reinsurance Buyers.
Proceedings of the Operations Research, 2006

Foreign Exchange Trading with Support Vector Machines.
Proceedings of the Advances in Data Analysis, 2006

Comparison of multi-objective evolutionary algorithms in optimizing combinations of reinsurance contracts.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006

Trees, Grids and Matroids: Observations on Logical Ways to Avoid Complexity.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2005
Effektive Java-Grundausbildung unter Einsatz eines Learning Management Szstems und spezieller Werkzeuge.
Proceedings of the Unterrichtskonzepte für informatische Bildung, 2005

A Multi-objective Approach to Integrated Risk Management.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2005

2004
A hybrid heuristic approach to discrete multi-objective optimization of credit portfolios.
Comput. Stat. Data Anal., 2004

On Decidability of MSO Theories of Representable Matroids.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

1998
A Fuzzy-Hybrid Approach to Stock Trading.
Proceedings of the Fifth International Conference on Neural Information Processing, 1998

Monadic NP and Graph Minors.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1996
Linear Time Computable Problems and First-Order Descriptions.
Math. Struct. Comput. Sci., 1996

Monadic NP and Built-in Trees.
Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995
Linear time computable problems and logical descriptions.
Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, 1995

1993
An Algebraic Theory of Graph Reduction.
J. ACM, 1993

1992
Interpretability and tree automata: A simple way to solve algorithmic problems on graphs closely related to trees.
Proceedings of the Tree Automata and Languages., 1992

1991
Easy Problems for Tree-Decomposable Graphs.
J. Algorithms, 1991

The Structure of Models of Decidable Monadic Theories of Graphs.
Ann. Pure Appl. Log., 1991

1990
Monadic Second Order Logic, Tree Automata and Forbidden Minors.
Proceedings of the Computer Science Logic, 4th Workshop, 1990

1989
Grids and their minors.
J. Comb. Theory, Ser. B, 1989

1988
Problems Easy for Tree-Decomposable Graphs (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987
A combinatorial and logical approach to linear-time computability.
Proceedings of the EUROCAL '87, 1987

1985
Tree-partite graphs and the complexity of algorithms.
Proceedings of the Fundamentals of Computation Theory, 1985

1982
L(aa)-Elementary Types of Well-Orderings.
Math. Log. Q., 1982

1981
Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures.
Proceedings of the Fundamentals of Computation Theory, 1981

1978
Über Unentscheidbare Erweiterungen von SC.
Math. Log. Q., 1978

1977
Decidability of omaega-Trees with Bounded Sets - A Survey.
Proceedings of the Fundamentals of Computation Theory, 1977


  Loading...