default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaire Hanen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Jacques Carlier, Claire Hanen
:
Measuring the slack between lower bounds for scheduling on parallel machines. Ann. Oper. Res. 338(1): 347-377 (2024)- [j16]Claire Hanen, Alix Munier Kordon:
Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines. J. Sched. 27(2): 119-133 (2024) - [c10]Josef Grus, Claire Hanen, Zdenek Hanzálek:
Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods. ICORES 2024: 101-112 - [c9]Maher Mallem, Claire Hanen, Alix Munier Kordon:
A New Structural Parameter on Single Machine Scheduling with Release Dates and Deadlines. ISCO 2024: 205-219 - 2023
- [c8]Istenç Tarhan, Jacques Carlier, Claire Hanen, Antoine Jouglet, Alix Munier Kordon:
Parameterized Analysis of a Dynamic Programming Algorithm for a Parallel Machine Scheduling Problem. Euro-Par 2023: 139-153 - [c7]Hugo Vaillaud, Claire Hanen, Emmanuel Hyon, Cyrille Enderli:
Target search with an allocation of search effort to overlapping cones of observation. FedCSIS 2023: 801-811 - [c6]Hugo Vaillaud, Claire Hanen, Emmanuel Hyon, Cyrille Enderli:
Target search with a radar on an airborne platform. FUSION 2023: 1-8 - 2022
- [c5]Maher Mallem, Claire Hanen, Alix Munier Kordon:
Parameterized Complexity of a Parallel Machine Scheduling Problem. IPEC 2022: 21:1-21:21 - 2021
- [c4]Claire Hanen, Alix Munier Kordon, Theo Pedersen:
Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors. CPAIOR 2021: 214-230 - 2020
- [j15]Claire Hanen, Zdenek Hanzálek:
Grouping tasks to save energy in a cyclic scheduling problem: A complexity study. Eur. J. Oper. Res. 284(2): 445-459 (2020) - [i1]Claire Hanen, Zdenek Hanzálek:
Periodic Scheduling and Packing Problems. CoRR abs/2011.01898 (2020)
2010 – 2019
- 2017
- [j14]Aurélien Carlier, Claire Hanen, Alix Munier Kordon:
The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays. J. Sched. 20(3): 303-311 (2017) - 2015
- [j13]Zdenek Hanzálek, Claire Hanen:
The impact of core precedences in a cyclic RCPSP with precedence delays. J. Sched. 18(3): 275-284 (2015) - 2014
- [c3]Aasem Ahmad, Zdenek Hanzálek, Claire Hanen:
A polynomial scheduling algorithm for IEEE 802.15.4/ ZigBee cluster tree WSN with one collision domain and period crossing constraint. ETFA 2014: 1-8 - 2013
- [j12]Maria Ayala, Abir Benabid, Christian Artigues, Claire Hanen:
The resource-constrained modulo scheduling problem: an experimental study. Comput. Optim. Appl. 54(3): 645-673 (2013) - 2012
- [j11]Abir Benabid-Najjar, Claire Hanen, Olivier Marchetti, Alix Munier Kordon:
Periodic Schedules for Bounded Timed Weighted Event Graphs. IEEE Trans. Autom. Control. 57(5): 1222-1232 (2012) - 2011
- [j10]Abir Benabid, Claire Hanen:
Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays. J. Sched. 14(5): 511-522 (2011) - 2010
- [j9]Abir Benabid, Claire Hanen:
Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors. Electron. Notes Discret. Math. 36: 791-798 (2010) - [j8]Abir Benabid, Claire Hanen:
Performance of Garey-Johnson algorithm for pipelined typed tasks systems. Int. Trans. Oper. Res. 17(6): 797-808 (2010)
2000 – 2009
- 2009
- [j7]Claire Hanen, Alix Munier Kordon:
Periodic schedules for linear precedence constraints. Discret. Appl. Math. 157(2): 280-291 (2009) - [j6]Claire Hanen, Yakov Zinder:
The worst-case analysis of the Garey-Johnson algorithm. J. Sched. 12(4): 389-400 (2009) - [p1]Claire Hanen:
Cyclic Scheduling. Introduction to Scheduling 2009: 103-128 - 2002
- [j5]Claire Hanen, Alix Munier Kordon:
Minimizing the volume in scheduling an out-tree with communication delays and duplication. Parallel Comput. 28(11): 1573-1585 (2002) - 2001
- [j4]Claire Hanen, Alix Munier:
An approximation algorithm for scheduling dependent tasks on m processors with small communication delays. Discret. Appl. Math. 108(3): 239-257 (2001)
1990 – 1999
- 1998
- [j3]Claire Hanen, Alix Munier Kordon:
Performance of Coffman-Graham Schedules in the Presence of Unit Communication Delays. Discret. Appl. Math. 81(1-3): 93-108 (1998) - 1997
- [j2]Alix Munier, Claire Hanen:
Using Duplication for Scheduling Unitary Tasks on m Processors with Unit Communication Delays. Theor. Comput. Sci. 178(1-2): 119-127 (1997) - 1995
- [j1]Claire Hanen, Alix Munier:
A Study of the Cyclic Scheduling Problem on Parallel Processors. Discret. Appl. Math. 57(2-3): 167-192 (1995)
1980 – 1989
- 1988
- [c2]Claire Hanen:
Optimizing microprograms for recurrent loops on pipelined architectures using timed Petri nets. European Workshop on Applications and Theory in Petri Nets 1988: 236-261 - [c1]Claire Hanen:
Optimizing horizontal microprograms for vectorial loops with timed petri nets. ICS 1988: 466-477
Coauthor Index
aka: Alix Munier
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
