Optimizing microprograms for recurrent loops on pipelined architectures using timed Petri nets. - Claire Hanen (European Workshop on Applications and Theory in Petri Nets, 1988)

Optimizing horizontal microprograms for vectorial loops with timed petri nets. - Claire Hanen (ICS, 1988)

A Study of the Cyclic Scheduling Problem on Parallel Processors. - Claire Hanen; Alix Munier (Discret. Appl. Math., 1995)

Using Duplication for Scheduling Unitary Tasks on m Processors with Unit Communication Delays. - Alix Munier; Claire Hanen (Theor. Comput. Sci., 1997)

Performance of Coffman-Graham Schedules in the Presence of Unit Communication Delays. - Claire Hanen; Alix Munier Kordon (Discret. Appl. Math., 1998)

An approximation algorithm for scheduling dependent tasks on m processors with small communication delays. - Claire Hanen; Alix Munier (Discret. Appl. Math., 2001)

Minimizing the volume in scheduling an out-tree with communication delays and duplication. - Claire Hanen; Alix Munier Kordon (Parallel Comput., 2002)

Cyclic Scheduling. - Claire Hanen (Introduction to Scheduling, 2009)

Periodic schedules for linear precedence constraints. - Claire Hanen; Alix Munier Kordon (Discret. Appl. Math., 2009)

The worst-case analysis of the Garey-Johnson algorithm. - Claire Hanen; Yakov Zinder (J. Sched., 2009)

Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors. - Abir Benabid; Claire Hanen (Electron. Notes Discret. Math., 2010)

Performance of Garey-Johnson algorithm for pipelined typed tasks systems. - Abir Benabid; Claire Hanen (Int. Trans. Oper. Res., 2010)

Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays. - Abir Benabid; Claire Hanen (J. Sched., 2011)

Periodic Schedules for Bounded Timed Weighted Event Graphs. - Abir Benabid-Najjar; Claire Hanen; Olivier Marchetti; Alix Munier Kordon (IEEE Trans. Autom. Control., 2012)

The resource-constrained modulo scheduling problem: an experimental study. - Maria Ayala; Abir Benabid; Christian Artigues; Claire Hanen (Comput. Optim. Appl., 2013)

A polynomial scheduling algorithm for IEEE 802.15.4/ ZigBee cluster tree WSN with one collision domain and period crossing constraint. - Aasem Ahmad; Zdenek Hanzálek; Claire Hanen (ETFA, 2014)

The impact of core precedences in a cyclic RCPSP with precedence delays. - Zdenek Hanzálek; Claire Hanen (J. Sched., 2015)

The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays. - Aurélien Carlier; Claire Hanen; Alix Munier Kordon (J. Sched., 2017)

Periodic Scheduling and Packing Problems. - Claire Hanen; Zdenek Hanzálek (CoRR, 2020)

Grouping tasks to save energy in a cyclic scheduling problem: A complexity study. - Claire Hanen; Zdenek Hanzálek (Eur. J. Oper. Res., 2020)

Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors. - Claire Hanen; Alix Munier Kordon; Theo Pedersen (CPAIOR, 2021)

Parameterized Complexity of a Parallel Machine Scheduling Problem. - Maher Mallem; Claire Hanen; Alix Munier Kordon (IPEC, 2022)

Parameterized Analysis of a Dynamic Programming Algorithm for a Parallel Machine Scheduling Problem. - Istenç Tarhan; Jacques Carlier; Claire Hanen; Antoine Jouglet; Alix Munier Kordon (Euro-Par, 2023)

Target search with an allocation of search effort to overlapping cones of observation. - Hugo Vaillaud; Claire Hanen; Emmanuel Hyon; Cyrille Enderli (FedCSIS, 2023)

Target search with a radar on an airborne platform. - Hugo Vaillaud; Claire Hanen; Emmanuel Hyon; Cyrille Enderli (FUSION, 2023)

Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods. - Josef Grus; Claire Hanen; Zdenek Hanzálek (ICORES, 2024)

A New Structural Parameter on Single Machine Scheduling with Release Dates and Deadlines. - Maher Mallem; Claire Hanen; Alix Munier Kordon (ISCO, 2024)

Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines. - Claire Hanen; Alix Munier Kordon (J. Sched., 2024)

Measuring the slack between lower bounds for scheduling on parallel machines. - Jacques Carlier; Claire Hanen (Ann. Oper. Res., 2024)

Periodic chains scheduling on dedicated resources - A crucial problem in time-sensitive networks. - Josef Grus; Claire Hanen; Zdenek Hanzálek (Comput. Oper. Res., 2025)

FPT implicit enumeration of active schedules. - Istenç Tarhan; Claire Hanen; Alix Munier Kordon; Jacques Carlier; Antoine Jouglet (Discret. Appl. Math., 2025)