Search for

Bibliographia Humboldtiana Index

Bibliographia Humboldtiana

III. Publications by Research Awardees in 2008

Computer science, information science, statistics

Boerger, Prof. Dr. Egon

Universita di Pisa, Italy
Field of research: Applied computer science, applied information science
Host: Prof. Dr. Bernhard Thalheim Christian-Albrechts-Universität zu Kiel
  • Egon Boerger and Bernhard Thalheim: A Method for Verifiable and Validatable Business Process Modeling. In: Advances in Software Engineering (LNCS 5316). (Ed. Egon Boerger and Antonio Cisternino) Berlin, Heidelberg, New York etc.: Springer-Verlag, 2008, p. 59 - 115 [Business Process Modeling, Abstract State Machine, BPMN].

  • Egon Boerger and Bernhard Thalheim: Modeling Workflows, Interaction Patterns, Web Services and Business Processes: The ASM-Based Approach. In: Abstract State Machines, B and Z (LNCS 5238) . (Ed. Egon Boerger and Michael Butler and Jonathan Bowen and Paul Boca) Berlin, Heidelberg, New York, etc.: Springer-Verlag , 2008, p. 24 - 38 [Workflows, Web Services, Interaction Patterns, Business Processes, Abstract State Machines, ].

  • Egon Boerger Owe Soerensen Bernhard Thalheim: On defining the behavior of OR-joins in business process models. In: J. Universal Computer Science. 14, 2008, p. 1 - 22 [BPMN, OR-Join Problem, Synchronization of Parallel Workflows].

Fellows, Prof. Dr. Michael Ralph

University of Bergen, Norway
Field of research: Theoretical computer and information science
Host: Prof. Dr. Rolf Niedermeier Friedrich-Schiller-Universität Jena
  • Michael R. Fellows, Henning Fernau: Facility Location Problems: A Parameterized View. In: AAIM 2008. 2008, p. 188 - 199 [rized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Facilities Location].

  • Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: Fixed-Parameter Algorithms for Kemeny Scores . In: AAIM 2008. 2008, p. 60 - 71 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Social Choice, Election, Voting Theory].

  • Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier: Algorithms and Hardness Results for Some Graph Motif Problems. In: CPM 2008. 2008, p. 31 - 43 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Computational Biology, Phylogenetic Trees].

  • Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On Problems without Polynomial Kernels. In: ICALP(1)2008. 2008, p. 563 - 574 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Applications to Preprocessing, Data Reduction].

  • Michael Ralph Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh: Graph Layout Problems Parameterized by Vertex Cover. In: ISAAC2008. 2008, p. 294 - 305 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Graph Layout, Geometry ].

  • Michael Ralph Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle: Leaf Powers and Their Properties: Using the Trees. In: ISAAC2008. 2008, p. 402 - 413 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Applications in reconstruction of the evolutionary history of species.].

  • Michael Ralph Fellows, Danny Hermelin, Moritz Müller, Frances A. Rosamond: A Purely Democratic Characterization of W[1]. In: IWPEC 2008. 2008, p. 103 - 114 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Satisfiability, Networks ].

  • Michael Ralph Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. In: Algorithmica. 52(2), 2008, p. 167 - 176 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Packing Problems, Matching Problems.].

  • Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood: On the Parameterized Complexity of Layered Graph Drawing. In: Algorithmica. 52(2), 2008, p. 267 - 292 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Graph Drawing, Geometry].

  • Michael Ralph Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh: Parameterized Low-distortion Embeddings - Graph metrics into lines and trees. In: CoRR abs/0804.3028: (2008). 2008, p. 1 - 14 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Graph Metrics, Graph Distortion, Graph Embeddings.].

  • Michael Ralph Fellows, Rodney G. Downey, Michael A. Langston: The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. In: The Computer Journal. 51(1), 2008, p. 1 - 6 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Vision of the future of theoretical computer science. ].

  • Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond: : Parameterized approximation of dominating set problems. In: Information Processing Letters. 109(1), 2008, p. 68 - 70 [Parameterized Complexity, Theoretical Computer Science, Algorithm Design, Approximation, Dominating Set Problems, Applications to Scheduling].

Grigoriev, Prof. Dr. Dima

Universite de Lille I, France
Field of research: Theoretical computer and information science
Host: Prof. Dr. Ulrich Trottenberg Fraunhofer-Institut für Algorithmen und Wissenschaftliches Rechnen (SCAI)
  • Dima Grigoriev Fritz Schwarz: Loewy decomposition of linear third-order PDE's in the plane. In: Proc. ACM Int. Symp. Symb. Algebr. Comput., Austria. 2008, p. 277 - 286 [PDE].

Hemaspaandra, Prof. Dr. Lane A.

University of Rochester, United States of America
Field of research: Theoretical computer and information science
Host: Prof. Dr. Jörg-Matthias Rothe Heinrich-Heine-Universität Düsseldorf
  • Lane A. Hemaspaandra, Joerg Rothe, Amitabh Saxena: Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for Worst-Case One-Way Functions. In: Theoretical Computer Science. 401, 2008, p. 27 - 35 [Computational complexity].