Search for

Bibliographia Humboldtiana Index

Bibliographia Humboldtiana

III. Publications by Research Awardees in 2009

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
  • Michael Altenhofen, Egon Boerger: Concurrent Abstract State Machines and +CAL. In: Recent Trends in Algebraic Development Techniques (WADT 2008) (LNCS 5486). (Ed. A. Corradini and U. Montanari) Berlin, Heidelberg, New York: Springer, 2009, p. 1 - 17 [Abstract State Machines, concurrency, +CAL].

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 Dom, Michael R. Fellows, Frances A. Rosamond: Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. In: Lecture Notes in Computer Science: Proc 3rd WALCOM Confe. 5431, 2009, p. 298 - 309 [Parameterized Complexity Algorithm design Computational Complexity Theoretical Computer Science Rectangle Stabbing Embedded sensor networks Radiotherapy Spatial Data Organization].

  • Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem. In: STACS. 2009, p. 409 - 420 [Parameterized Complexity Algorithm design Computational Complexity Theoretical Computer Science Optimization].

  • Michael Ralph Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier: A Generalization of Nemhauser and Trotter's Local Optimization Theorem. In: STACS Proceedings 2009. 2009, p. 409 - 420 [Parameterized complexity Optimization Algorithm design Computational complexity Theoretical Computer Science].

  • Michael Ralph Fellows, Danny Hermelin, Frances A. Rosamond, Stéphane Vialette: On the parameterized complexity of multiple-interval graph problems. In: Theoretical Computer Science. 410(1), 2009, p. 53 - 61 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Applications to high throughput genotyping, and to scheduling RAM and processor time for multiple real-time programs on multi-tasking. ].

  • Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos: Derivation of algorithms for cutwidth and related graph layout parameters. In: Journal Computation System Science. 75(4), 2009, p. 231 - 244 [Parameterized Complexity, Algorithm design, Computational Complexity, Theoretical Computer Science, Graph Layout].

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: Newton-Puiseux series for non-holonomic D-modules and factoring linear partial differential operators. In: Moscow Mathematical Journal. 9, 2009, p. 775 - 800.

  • Dima Grigoriev Vladimir Shpilrain: Authentication from matrix conjugation. In: Groups, Complexity, Cryptology. 1, 2009, p. 199 - 205.

  • Dima Grigoriev, Sergei Vakulenko: Instability, Complexity and evolution. In: Journal of Mathematical Sciences . 158, 2009, p. 787 - 808.

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
  • Gabor Erdelyi, Lane A. Hemaspaandra, Joerg Rothe, Holger Spakowski: Generalized Juntas and NP-Hard Sets. In: Theoretical Computer Science. 410, 2009, p. 3995 - 4000 [Computational complexity, computational social choice ].

  • Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe: Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. In: Mathematical Logic Quarterly. 55, 2009, p. 397 - 424 [Computational complexity, computational social choice ].

  • Gabor Erdelyi, Lane A. Hemaspaandra, Joerg Rothe, Holger Spakowski: Frequency of Correctness versus Average Polynomial Time. In: Information Processing Letters. 109, 2009, p. 946 - 949 [Computational complexity, computational social choice].

  • Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe : Llull and Copeland Voting Computationally Resist Bribery and Control. In: Journal of Artificial Intelligence Research. 35, 2009, p. 275 - 341 [Computational complexity, computational social choice ].