N. Alon, R. Yuster, and U. Zwick, Color-coding, Journal ACM, vol.42, issue.4, pp.844-856, 1995.

J. Blazewicz, K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, , 2007.

J. Blazewicz, G. Pawlak, M. Tanas, and W. Wojciechowicz, New algorithm for coupledtasks scheduling, a survey, vol.46, pp.335-353, 2012.

H. L. Bodlaender and M. R. Fellows, W [2]-hardness of precedence constrained k-processor scheduling, Operations Research Letters, vol.18, issue.2, pp.93-97, 1995.

H. L. Bodlaender, B. M. Jansen, and S. Kratsch, Cross-composition: A new technique for kernelization lower bounds, STACS, pp.165-176, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573603

L. Cai, J. Chen, R. G. Downey, and M. R. Fellows, On the parameterized complexity of short computation and factorisation, Archive for Mathematical Logic, vol.36, pp.321-337, 1997.

B. Chen, C. N. Potts, and G. J. Woeginger, Handbook of Combinatorial Optimization, Chapter A review of machine scheduling: Complexity, Algorithms and Approximability, vol.3, 1998.

A. Condotta and N. V. Shakhlevich, Scheduling coupled-operations jobs with exact time-lags, Discrete Applied Mathematics, vol.160, pp.2370-2388, 2012.

R. G. Downey and M. R. Fellows, Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013.

M. R. Fellows and C. Mccartin, On the parametric complexity of schedules to minimize tardy tasks, Theoretical Computer Sciences, vol.2, issue.298, pp.317-324, 2003.

J. Flum and M. Grohe, Parameterized Complexity Theory. Texts in Theoretical Computer Science

, An EATCS Series, 2006.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy-kan, Optimization and approximation in deterministic sequencing and scheduling theory: a survey, Annals of Discrete Mathematics, vol.5, pp.287-326, 1979.

M. Habib, C. Paul, and L. , Viennot Partition refinement techniques: an interesting algorithmic tool kit, International Journal of Foundations of Computer Science, vol.10, issue.2, pp.147-170, 1999.

V. Lehoux-lebacque, N. Brauner, and G. Finke, Identical coupled task scheduling: polynomial complexity of the cycle cas, Journal of Scheduling, vol.18, issue.6, pp.631-644, 2015.

D. Marx, Fixed-parameter tractable scheduling problems, Report from Dagsthul Seminar, vol.11091, issue.2, p.86, 2011.

M. Mnich and A. Wiese, Scheduling and Fixed-Parameter Tractability, Mathematical Programming, vol.154, issue.1-2, pp.533-562, 2015.

R. Niedermeier, Invitation to Fixed Parameter Algorithms, Oxford Lectures Series in Math. and its Applications, vol.31, 2006.

A. J. Orman and C. N. Potts, On the complexity of coupled-task scheduling, Discrete Applied Mathematics, vol.72, pp.141-154, 1997.

J. P. Schmidt and A. Siegel, The spatial complexity of oblivious k-probe hash functions, SIAM Journal of Computing, vol.19, issue.5, pp.775-786, 1990.

R. D. Shapiro, Scheduling coupled-tasks, Naval Research Logistics Quarterly, vol.20, pp.489-498, 1980.

G. Simonin, B. Darties, R. Giroudeau, and J. König, Coupled-tasks in presence of bipartite compatibilities graphs, Third International Symposium on Combinatorial Optimization, pp.161-172, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00981164

G. Simonin, R. Giroudeau, and J. König, Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks, International Journal of Planning and Scheduling, vol.1, issue.4, pp.285-300, 2013.
URL : https://hal.archives-ouvertes.fr/lirmm-00952599

G. Simonin, B. Darties, R. Giroudeau, and J. König, Theoretical aspects of scheduling coupled-tasks in presence of compatibility graph, Algorithmic Operations Research, vol.7, issue.1, pp.1-12, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00612821

R. Van-bevern, M. Mnich, R. Niedermeier, and M. Weller, Interval Scheduling and Colorful Independent Sets, Journal of Scheduling, vol.18, issue.5, pp.449-469, 2015.
URL : https://hal.archives-ouvertes.fr/lirmm-01349213