The SCEAS System
Navigation Menu

Search the dblp DataBase


Detlef Seese: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stefan Arnborg, Jens Lagergren, Detlef Seese
    Easy Problems for Tree-Decomposable Graphs. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:2, pp:308-340 [Journal]
  2. Detlef Seese
    Trees, Grids and Matroids: Observations on Logical Ways to Avoid Complexity. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:7- [Conf]
  3. Stefan Arnborg, Andrzej Proskurowski, Detlef Seese
    Monadic Second Order Logic, Tree Automata and Forbidden Minors. [Citation Graph (0, 0)][DBLP]
    CSL, 1990, pp:1-16 [Conf]
  4. Martin Kreidler, Detlef Seese
    Monadic NP and Built-in Trees. [Citation Graph (0, 0)][DBLP]
    CSL, 1996, pp:260-275 [Conf]
  5. Martin Kreidler, Detlef Seese
    Monadic NP and Graph Minors. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:126-141 [Conf]
  6. Frank Schlottmann, Andreas Mitschele, Detlef Seese
    A Multi-objective Approach to Integrated Risk Management. [Citation Graph (0, 0)][DBLP]
    EMO, 2005, pp:692-706 [Conf]
  7. P. Scheffler, Detlef Seese
    A combinatorial and logical approach to linear-time computability. [Citation Graph (0, 0)][DBLP]
    EUROCAL, 1987, pp:379-380 [Conf]
  8. Detlef Seese
    Decidability of omaega-Trees with Bounded Sets - A Survey. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:511-515 [Conf]
  9. Detlef Seese
    Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:341-349 [Conf]
  10. Detlef Seese
    Tree-partite graphs and the complexity of algorithms. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:412-421 [Conf]
  11. Ingo Oesterreicher, Andreas Mitschele, Frank Schlottmann, Detlef Seese
    Comparison of multi-objective evolutionary algorithms in optimizing combinations of reinsurance contracts. [Citation Graph (0, 0)][DBLP]
    GECCO, 2006, pp:747-748 [Conf]
  12. Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
    An Algebraic Theory of Graph Reduction. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1990, pp:70-83 [Conf]
  13. Markus Kress, Joachim Melcher, Detlef Seese
    Introducing Executable Product Models for the Service Industry. [Citation Graph (0, 0)][DBLP]
    HICSS, 2007, pp:46- [Conf]
  14. Stefan Arnborg, Jens Lagergren, Detlef Seese
    Problems Easy for Tree-Decomposable Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:38-51 [Conf]
  15. Ralf Herrmann, Martin Kreidler, Detlef Seese, Kai Zabel
    A Fuzzy-Hybrid Approach to Stock Trading. [Citation Graph (0, 0)][DBLP]
    ICONIP, 1998, pp:1028-1032 [Conf]
  16. Petr Hlinený, Detlef Seese
    On Decidability of MSO Theories of Representable Matroids. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:96-107 [Conf]
  17. Roland Küstermann, Dietmar Ratz, Detlef Seese
    Effektive Java-Grundausbildung unter Einsatz eines Learning Management Szstems und spezieller Werkzeuge. [Citation Graph (0, 0)][DBLP]
    INFOS, 2005, pp:231-241 [Conf]
  18. Detlef Seese
    The Structure of Models of Decidable Monadic Theories of Graphs. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1991, v:53, n:2, pp:169-195 [Journal]
  19. Detlef Seese
    Linear time computable problems and logical descriptions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  20. Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese
    An Algebraic Theory of Graph Reduction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:5, pp:1134-1164 [Journal]
  21. Detlef Seese, W. Wessel
    Grids and their minors. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:3, pp:349-360 [Journal]
  22. Detlef Seese
    Linear Time Computable Problems and First-Order Descriptions. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1996, v:6, n:6, pp:505-526 [Journal]
  23. Petr Hlinený, Detlef Seese
    Trees, grids, and MSO decidability: From graphs to matroids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:372-393 [Journal]
  24. Frank Schlottmann, Detlef Seese
    A hybrid heuristic approach to discrete multi-objective optimization of credit portfolios. [Citation Graph (0, 0)][DBLP]
    Computational Statistics & Data Analysis, 2004, v:47, n:2, pp:373-399 [Journal]
  25. Detlef Seese
    Easy Problems for Grid-Structured Graphs. [Citation Graph (0, 0)][DBLP]
    FAW, 2007, pp:293-304 [Conf]

  26. On Measuring the Understandability of Process Models. [Citation Graph (, )][DBLP]

  27. Empirical Analysis of a Proposed Process Granularity Heuristic. [Citation Graph (, )][DBLP]

  28. Autonomous Optimization of Business Processes. [Citation Graph (, )][DBLP]

  29. A Conceptual Framework for the Governance of Service-Oriented Architectures. [Citation Graph (, )][DBLP]

  30. Executable product models - The intelligent way. [Citation Graph (, )][DBLP]

  31. Towards Validating Prediction Systems for Process Understandability: Measuring Process Understandability. [Citation Graph (, )][DBLP]

  32. Visualization and Clustering of Business Process Collections Based on Process Metric Values. [Citation Graph (, )][DBLP]

  33. Flexibility Enhancements in BPM by applying Executable Product Models and Intelligent Agents. [Citation Graph (, )][DBLP]

  34. Heuristic Optimization of Reinsurance Programs and Implications for Reinsurance Buyers. [Citation Graph (, )][DBLP]

  35. Foreign Exchange Trading with Support Vector Machines. [Citation Graph (, )][DBLP]

  36. Width Parameters Beyond Tree-width and their Applications. [Citation Graph (, )][DBLP]

Search in 0.034secs, Finished in 0.035secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002