Index of 2009
Department Of Computer Science
Technical Reports
Aachener Informatik-Berichte (AIB)

Available Reports

2009-01
Fachgruppe Informatik
Jahresbericht 2009
2009-02
Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre
Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
2009-03
Alexander Nyßen
Model-Based Construction of Embedded & Real-Time Software - A Methodology for Small Devices
2009-05
George B. Mertzios, Ignasi Sau, Shmuel Zaks
A New Intersection Model and Improved Algorithms for Tolerance Graphs
2009-06
George B. Mertzios, Ignasi Sau, Shmuel Zaks
The Recognition of Tolerance and Bounded Tolerance Graphs is NP-complete
2009-07
Joachim Kneis, Alexander Langer, Peter Rossmanith
Derandomizing Non-uniform Color-Coding I
2009-08
Joachim Kneis, Alexander Langer
Satellites and Mirrors for Solving Independent Set on Sparse Graphs
2009-09
Michael Nett
Implementation of an Automated Proof for an Algorithm Solving the Maximum Independent Set Problem
2009-10
Felix Reidl, Fernando Sánchez Villaamil
Automatic Verification of the Correctness of the Upper Bound of a Maximum Independent Set Algorithm
2009-11
Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos
The Longest Path Problem is Polynomial on Interval Graphs
2009-12
Martin Neuhäußer, Lijun Zhang
Time-Bounded Reachability in Continuous-Time Markov Decision Processes
2009-13
Martin Zimmermann
Time-optimal Winning Strategies for Poset Games
2009-14
Ralf Huuck, Gerwin Klein, Bastian Schlich (eds.)
Doctoral Symposium on Systems Software Verification (DS SSV'09)
2009-15
Joost-Pieter Katoen, Daniel Klink, Martin Neuhäußer
Compositional Abstraction for Stochastic Systems
2009-16
George B. Mertzios, Derek G. Corneil
Vertex Splitting and the Recognition of Trapezoid Graphs
2009-17
Carsten Kern
Learning Communicating and Nondeterministic Automata
2009-18
Paul Hänsch, Michaela Slaats, Wolfgang Thomas
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies