Publication
-
Computer-aided complexity classification of dial-a-ride problems. Article
INFORMS Journal on Computing, 120-132.January 2004
-
Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard Article
Journal of Scheduling, 333-348.January 2004
-
January 2004
-
An Algorithm to Verify Formulas by means of (O,S,=)-BDDs In Proceedings
January 2004
-
January 2004
-
Modal abstractions in $ \mu $ CRL In Proceedings
January 2004
-
Verifying a sliding window protocol in muCRL In Proceedings
January 2004
-
January 2004