[ABD08]

Konstantin Artiouchine, Philippe Baptiste, and Christoph Dürr. Runway scheduling with holding loop. European Journal of Operational Research, 189(3):1254-1266, 2008.

[ABM08]

Konstantin Artiouchine, Philippe Baptiste, and Juliette Mattioli. The k king problem, an abstract model for computing aircraft landing trajectories: On modeling a dynamic hybrid system with constraints. INFORMS Journal on Computing, 20(2):222-233, 2008.

[BFS08]

Ph. Baptiste, M. Flamini, and F. Sourd. Lagrangian bounds for just-in-time job-shop scheduling. Computers & Operations Research, 35:906-915, 2008.

[BG08]

Manuel Bodirsky and Martin Grohe. Non-dichotomies in constraint satisfaction complexity. In Automata, Languages and Programming, 35th International Colloquium (ICALP), pages 184-196, 2008.

[BGK08]

Manuel Bodirsky, Clemens Gröpl, and Mihyun Kang. Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms, 32(2):157-180, 2008.

[BJ08]

Nadia Brauner and Vincent Jost. Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture. Discrete Mathematics, 308(11):2319-2324, 2008.

[BJS08]

Ph. Baptiste, Antoine Jouglet, and David Savourey. Lower bounds for parallel machine scheduling problems.. International Journal of Operational Research, 3(6):643-664, 2008.

[BK08a]

Manuel Bodirsky and Jan Kára. The complexity of equality constraint languages. Theory Comput. Syst., 43(2):136-158, 2008.

[BK08b]

Manuel Bodirsky and Jan Kára. The complexity of temporal constraint satisfaction problems. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pages 29-38, 2008.

[Bod08]

Manuel Bodirsky. Complexity of Constraints, chapter Constraint Satisfaction Problems with Infinite Templates. Springer, 2008.

[CCHS08]

V. Chepoi, N. Creignou, M. Hermann, and G. Salzer. Deciding the satisfiability of propositional formulas in finitely-valued signed logics. In G. W. Dueck, editor, 38th International Symposium on Multiple Valued Logic (ISMVL 2008), 2008.

[CDHR08]

Marek Chrobak, Christoph Dürr, Mathilde Hurand, and Julien Robert. Algorithms for temperature-aware task scheduling in microprocessor systems. In Proc. of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM), 2008.

[CHKS08]

N. Creignou, M. Hermann, A. Krokhin, and G. Salzer. Complexity of clausal constraints over chains. Theory of Computing Systems, 42(2):239-255, 2008.

[CJ08]

Denis Cornaz and Vincent Jost. A one-to-one correspondence between colorings and stable sets. Oper. Res. Lett., 36(6):673-676, 2008.

[DH08]

A. Durand and M. Hermann. On the counting complexity of propositional circumscription. Information Processing Letters, 106(4):164-170, 2008.

[FJQS08]

Gerd Finke, Vincent Jost, Maurice Queyranne, and András Sebö. Batch processing with interval graph compatibilities between tasks. Discrete Applied Mathematics, 156(5):556-568, 2008.

[GHSZ08]

A. J. Gil, M. Hermann, G. Salzer, and B. Zanuttini. Efficient algorithms for description problems over finite totally ordered domains. SIAM Journal on Computing, 38(3):922-945, 2008.

[Her08]

M. Hermann. On boolean primitive positive clones. Discrete Mathematics, 308(15):3151-3162, 2008.

[HP08a]

M. Hermann and R. Pichler. Counting complexity of minimal cardinality and minimal weight abduction. In S. Hölldobler, C. Lutz, and H. Wansing, editors, 11th European Conference on Logics in Artificial Intelligence (JELIA 2008), pages 206-218, 2008.

[HP08b]

Miki Hermann and Reinhard Pichler. Complexity of counting the optimal solutions. In Computing and Combinatorics, 14th Annual International Conference (COCOON), pages 149-159, 2008.

[HR08]

M. Hermann and F. Richoux. Sur la complexité algorithmique des problèmes de satisfaction de contraintes disjonctifs. In 4e Journés Francophones de Programmation par Contraintes (JFPC 2008), pages 209-218, 2008.

[HS08]

Miki Hermann and Baris Sertkaya. On the complexity of computing generators of closed sets. In Formal Concept Analysis, 6th International Conference (ICFCA), pages 158-168, 2008.

[JSCB08]

A. Jouglet, D. Savourey, J. Carlier, and Philippe Baptiste. Dominance-based heuristics for one-machine total cost scheduling problems. European Journal of Operational Research, 184:879-899, 2008.

[NBKL08]

Giacomo Nannicini, Philippe Baptiste, Daniel Krob, and Leo Liberti. Fast computation of point-to-point paths on time-dependent road networks. In Combinatorial Optimization and Applications, Second International Conference (COCOA), pages 225-234, 2008.