Claire Hanen

Orcid: 0000-0003-2482-5042

According to our database1, Claire Hanen authored at least 27 papers between 1988 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines.
J. Sched., April, 2024

Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods.
Proceedings of the 13th International Conference on Operations Research and Enterprise Systems, 2024

2023
Target search with a radar on an airborne platform.
Proceedings of the 26th International Conference on Information Fusion, 2023

Target search with an allocation of search effort to overlapping cones of observation.
Proceedings of the 18th Conference on Computer Science and Intelligence Systems, 2023

Parameterized Analysis of a Dynamic Programming Algorithm for a Parallel Machine Scheduling Problem.
Proceedings of the Euro-Par 2023: Parallel Processing - 29th International Conference on Parallel and Distributed Computing, Limassol, Cyprus, August 28, 2023

2022
Parameterized Complexity of a Parallel Machine Scheduling Problem.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021
Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

2020
Grouping tasks to save energy in a cyclic scheduling problem: A complexity study.
Eur. J. Oper. Res., 2020

Periodic Scheduling and Packing Problems.
CoRR, 2020

2017
The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays.
J. Sched., 2017

2015
The impact of core precedences in a cyclic RCPSP with precedence delays.
J. Sched., 2015

2014
A polynomial scheduling algorithm for IEEE 802.15.4/ ZigBee cluster tree WSN with one collision domain and period crossing constraint.
Proceedings of the 2014 IEEE Emerging Technology and Factory Automation, 2014

2013
The resource-constrained modulo scheduling problem: an experimental study.
Comput. Optim. Appl., 2013

2012
Periodic Schedules for Bounded Timed Weighted Event Graphs.
IEEE Trans. Autom. Control., 2012

2011
Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays.
J. Sched., 2011

2010
Performance of Garey-Johnson algorithm for pipelined typed tasks systems.
Int. Trans. Oper. Res., 2010

Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors.
Electron. Notes Discret. Math., 2010

2009
The worst-case analysis of the Garey-Johnson algorithm.
J. Sched., 2009

Periodic schedules for linear precedence constraints.
Discret. Appl. Math., 2009

Cyclic Scheduling.
Proceedings of the Introduction to Scheduling., 2009

2002
Minimizing the volume in scheduling an out-tree with communication delays and duplication.
Parallel Comput., 2002

2001
An approximation algorithm for scheduling dependent tasks on m processors with small communication delays.
Discret. Appl. Math., 2001

1998
Performance of Coffman-Graham Schedules in the Presence of Unit Communication Delays.
Discret. Appl. Math., 1998

1997
Using Duplication for Scheduling Unitary Tasks on m Processors with Unit Communication Delays.
Theor. Comput. Sci., 1997

1995
A Study of the Cyclic Scheduling Problem on Parallel Processors.
Discret. Appl. Math., 1995

1988
Optimizing horizontal microprograms for vectorial loops with timed petri nets.
Proceedings of the 2nd international conference on Supercomputing, 1988

Optimizing microprograms for recurrent loops on pipelined architectures using timed Petri nets.
Proceedings of the Advances in Petri Nets 1989, 1988


  Loading...