Color-coding, Journal ACM, vol.42, issue.4, pp.844-856, 1995. ,
, , 2007.
New algorithm for coupledtasks scheduling, a survey, vol.46, pp.335-353, 2012. ,
W [2]-hardness of precedence constrained k-processor scheduling, Operations Research Letters, vol.18, issue.2, pp.93-97, 1995. ,
Cross-composition: A new technique for kernelization lower bounds, STACS, pp.165-176, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00573603
On the parameterized complexity of short computation and factorisation, Archive for Mathematical Logic, vol.36, pp.321-337, 1997. ,
Handbook of Combinatorial Optimization, Chapter A review of machine scheduling: Complexity, Algorithms and Approximability, vol.3, 1998. ,
Scheduling coupled-operations jobs with exact time-lags, Discrete Applied Mathematics, vol.160, pp.2370-2388, 2012. ,
Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013. ,
On the parametric complexity of schedules to minimize tardy tasks, Theoretical Computer Sciences, vol.2, issue.298, pp.317-324, 2003. ,
, Parameterized Complexity Theory. Texts in Theoretical Computer Science
, An EATCS Series, 2006.
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979. ,
Optimization and approximation in deterministic sequencing and scheduling theory: a survey, Annals of Discrete Mathematics, vol.5, pp.287-326, 1979. ,
Viennot Partition refinement techniques: an interesting algorithmic tool kit, International Journal of Foundations of Computer Science, vol.10, issue.2, pp.147-170, 1999. ,
Identical coupled task scheduling: polynomial complexity of the cycle cas, Journal of Scheduling, vol.18, issue.6, pp.631-644, 2015. ,
Fixed-parameter tractable scheduling problems, Report from Dagsthul Seminar, vol.11091, issue.2, p.86, 2011. ,
Scheduling and Fixed-Parameter Tractability, Mathematical Programming, vol.154, issue.1-2, pp.533-562, 2015. ,
Invitation to Fixed Parameter Algorithms, Oxford Lectures Series in Math. and its Applications, vol.31, 2006. ,
On the complexity of coupled-task scheduling, Discrete Applied Mathematics, vol.72, pp.141-154, 1997. ,
The spatial complexity of oblivious k-probe hash functions, SIAM Journal of Computing, vol.19, issue.5, pp.775-786, 1990. ,
Scheduling coupled-tasks, Naval Research Logistics Quarterly, vol.20, pp.489-498, 1980. ,
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
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
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
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