[Bap09]

P Baptiste. Constraint-Based Schedulers, Do They Really Work?. In Proc. of the 15th International Conference on Principles and Practice of Constraint Programming (CP), 2009.

[Bapar]

Philippe Baptiste. A note on scheduling identical coupled tasks in constant time. Discrete Applied Mathematics, to appear.

[BC09a]

Manuel Bodirsky and Hubie Chen. Qualitative temporal and spatial reasoning revisited. Journal of Logic and Computation, 19(6):1359-1383, 2009.

[BC09b]

Manuel Bodirsky and Hubie Chen. Relatively quantified constraint satisfaction. Constraints, 14(1):3-15, 2009.

[BCATar]

Ph. Baptiste, F. Della Croce, A.Grosso, and V. T'kindt. Sequencing a single machine with due dates and deadlines: an ilp-based approach to solve very large instances. Journal of Scheduling, to appear.

[BCD+09]

Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Je\.z, \Lukasz Je\.z, and Grzegorz Stachowiak. Collecting weighted items from a dynamic queue. In Proc. of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2009.

[BCK+09]

P. Baptiste, J. Carlier, A. Kononov, M. Queyranne, S. Sevastyanov, and M. Sviridenko. Integrality Property in Preemptive Parallel Machine Scheduling. In Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science-Theory and Applications, page 46. Springer, 2009.

[BCKvO09]

Manuel Bodirsky, Hubie Chen, Jan Kára, and Timo von Oertzen. Maximal infinite-valued constraint languages. Theoretical Computer Science, 410(18):1684-1693, 2009.

[BCMGS09]

Ph. Baptiste, Ph. Chrétienne, J. Meng-Grard, and F. Sourd. On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups. Discrete Applied Mathematics, 157:3656-3664, 2009.

[BHR09]

Manuel Bodirsky, Miki Hermann, and Florian Richoux. Complexity of existential positive first-order logic. In In the proceedings of Computing in Europe (CiE), pages 31-36, 2009.

[BJvO09]

Manuel Bodirsky, Peter Jonsson, and Timo von Oertzen. Semilinear program feasibility. In Proc. of the International Colloquium on Automata, Languages and Programming (ICALP), pages 79-90, 2009.

[BLRS09]

Andrea Bettinelli, Leo Liberti, Franco Raimondi, and David Savourey. The anonymous subgraph problem. In Proc. of the Cologne Twente Workshop (CTW), pages 269-274, 2009.

[BNvO09a]

Manuel Bodirsky, Gustav Nordh, and Timo von Oertzen. Integer programming with 2-variable equations and 1-variable inequalities. In Proc. of the Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW), 2009.

[BNvO09b]

Manuel Bodirsky, Gustav Nordh, and Timo von Oertzen. Integer programming with 2-variable equations and 1-variable inequalities. Information Processing Letters, 109(11):572-575, 2009.

[BS09]

Philippe Baptiste and Ruslan Sadykov. On Scheduling a Single Machine to Minimize a Piecewise Linear Objective Function : A Compact MIP Formulation. Naval Research Logistics / Naval Research Logistics An International Journal, 56:487-502, 2009.

[BS10]

Ph. Baptiste and R. Sadykov. Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars. European Journal of Operational Research, 203:476-483, 2010.

[BSD09]

Philippe Baptiste, Ruslan Sadykov, and Savourey David. Planification, ordonnancement : résolution de problèmes disjonctifs. In Alain Appriou, editor, Gestion de la complexité et de l'information dans les grands systèmes critiques. CNRS Éditions, 2009.

[CCHS09]

V. Chepoi, N. Creignou, M. Hermann, and G. Salzer. The Helly property and satisfiability of Boolean formulas defined on set families. European Journal of Combinatorics, 2009.

[DGM09]

Christoph Dürr, Flavio Guínez, and Martín Matamala. Reconstructing 3-colored grids from horizontal and vertical projections is np-hard. In Proc. of the 17th Annual European Symposium on Algorithms (ESA) - best paper award, 2009.

[DH09]

Christoph Dürr and Mathilde Hurand. Finding total unimodularity in optimization problems solved by linear programs. Algorithmica, 2009.

[DHNU09]

A. Durand, M. Hermann, G. Nordh, and L. Universitet. Trichotomy in the Complexity of Minimal Inference. In Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science, pages 387-396. IEEE Computer Society, 2009.

[DJT09]

Christoph Dürr, \Lukasz Je\.z, and Nguyen Kim Thang. Online scheduling of bounded length jobs to maximize throughput. In Proc. of the 7th Workshop on Approximation and Online Algorithms (WAOA), 2009.

[DT09]

Christoph Dürr and Nguyen Kim Thang. Non-clairvoyant scheduling games. In Proc. of the 2nd International Symposium on Algorithmic Game Theory (SAGT), 2009.

[HL09]

N. Hermann and P. Lescanne. Le plus difficile des problèmes difficiles. Les Dossiers de La Recherche, 37:54-57, 2009.

[HP09]

M. Hermann and R. Pichler. Complexity of counting the optimal solutions. Theoretical Computer Science, 410(38-40):3814-3825, 2009.

[HPar]

M. Hermann and R. Pichler. Counting complexity of propositional abduction. Journal of Computer and System Sciences, to appear.

[HR09]

M. Hermann and F. Richoux. On the Computational Complexity of Monotone Constraint Satisfaction Problems. In Proceedings of the 3rd International Workshop on Algorithms and Computation, page 297. Springer, 2009.

[Mouar]

N. Touati Moungla. Performances improvement of the column generation algorithm: Application to vehicle routing problems. A Quarterly Journal of Operations Research (4OR), to appear.

[Sav09]

David Savourey. Outil de visualisation d'ordonnancements. In Actes de la conférence de la Société Francaise de Recherche Opérationnelle et d'Aide à la Décision (ROADEF), pages 210-211, 2009.