Filtrer vos résultats
- 75
- 8
- 44
- 33
- 3
- 1
- 1
- 1
- 2
- 83
- 3
- 1
- 3
- 5
- 4
- 3
- 9
- 6
- 9
- 9
- 12
- 5
- 5
- 5
- 4
- 3
- 1
- 75
- 8
- 69
- 36
- 16
- 10
- 8
- 6
- 6
- 5
- 4
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 83
- 29
- 16
- 16
- 11
- 11
- 10
- 9
- 9
- 7
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
83 résultats
|
|
Algorithmes exponentiels pour l'étiquetage, la domination et l'ordonnancementAlgorithme et structure de données [cs.DS]. Université d'Orléans, 2015
HDR
tel-01249255v1
|
||
Généralisation de la méthode Trier et Chercher : application à des problèmes à machines parallèles13ième congrès de la Société Francaise de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2012), 2012, France
Communication dans un congrès
hal-00943025v1
|
|||
|
|
Exact exponential algorithms to find tropical connected sets of minimum sizeTheoretical Computer Science, 2017, 676, pp.33-41. ⟨10.1016/j.tcs.2017.03.003⟩
Article dans une revue
hal-01971120v1
|
||
End-Vertices of Graph Search Algorithms9th International Conference CIAC 2015, May 2015, Paris, France. pp.300-312, ⟨10.1007/978-3-319-18173-8_22⟩
Communication dans un congrès
hal-01216950v1
|
|||
Breaking the $2^n$-barrier for Irredundance: Two lines of attackJournal of Discrete Algorithms, 2011, 9 (3), pp.214-230
Article dans une revue
hal-00607123v1
|
|||
|
|
Efficient algorithms for Roman domination on some classes of graphsDiscrete Applied Mathematics, 2008, 156, pp.3400-3415. ⟨10.1016/j.dam.2008.01.011⟩
Article dans une revue
hal-00460842v1
|
||
|
|
Fast Exact Algorithm for L(2,1)-Labeling of GraphsTAMC 2011 : Theory and Applications of Models of Computation - 8th Annual Conference, May 2011, Tokyo, Japan. pp.82-93, ⟨10.1007/978-3-642-20877-5_9⟩
Communication dans un congrès
hal-00607169v1
|
||
|
|
(Circular) backbone colouring: tree backbones in planar graphs[Research Report] RR-8152, INRIA. 2012
Rapport
hal-00759044v1
|
||
Beyond classes of graphs with “few” minimal separators : FPT results through potential maximal cliquesWorkshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Jun 2015, Munich, Germany. pp.499-512, ⟨10.1007/978-3-662-53174-7_35⟩
Communication dans un congrès
hal-01216955v1
|
|||
On the Number of Minimal Dominating Sets on Cobipartite and Interval Graphs9th International colloquium on graph theory and combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès
hal-01105090v1
|
|||
Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal GraphsInternational Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Jun 2017, Eindhoven, Netherlands. pp.289-302
Communication dans un congrès
hal-01971051v1
|
|||
Scheduling parallel machines with exponential algorithmsInternational Workshop on Approximation, Parameterized and EXact algorithms (APEX 2012), 2012, France
Communication dans un congrès
hal-00943032v1
|
|||
Exponential-time algorithms for scheduling problemsWorkshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2011), 2011, Nymburk, Czech Republic
Communication dans un congrès
hal-00943027v1
|
|||
|
|
Algorithmes exacts et exponentiels pour les problèmes NP-difficiles : domination, variantes et généralisationsAutre [cs.OH]. Université Paul Verlaine - Metz, 2007. Français. ⟨NNT : 2007METZ027S⟩
Thèse
tel-01749022v1
|
||
Sort and search: Exact algorithms for generalized dominationInformation Processing Letters, 2009, 109 (14), pp.795-798. ⟨10.1016/j.ipl.2009.03.023⟩
Article dans une revue
istex
hal-00460850v1
|
|||
On Independent Sets and Bicliques in GraphsWG'08: 34th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2008, Durham, United Kingdom. pp.171-182, ⟨10.1007/978-3-540-92248-3_16⟩
Communication dans un congrès
istex
hal-00460773v1
|
|||
A tight bound on the number of minimal dominating sets in split graphCTW 2013, 2013, Netherlands. pp. 67-70
Communication dans un congrès
hal-00943038v1
|
|||
Scheduling parallel machines with exponential algorithms13th International Conference on Project Management and Scheduling (PMS 2012), 2012, Belgium. pp. 203-206
Communication dans un congrès
hal-00943033v1
|
|||
Fixing improper colorings of graphsTheoretical Computer Science, 2018, 711, pp.66-78
Article dans une revue
hal-01971123v1
|
|||
Exact exponential algorithms for 3-machine flowshop scheduling problemsJournal of Scheduling, 2018, ⟨10.1007/s10951-017-0524-2⟩
Article dans une revue
hal-01550011v1
|
|||
A Parameterized Route to Exact Puzzles: Breaking the $2^n$-barrier for irredundancyCIAC'2010 : 7th International Conference on Algorithms and Complexity, May 2010, Rome, Italy. pp.311-322, ⟨10.1007/978-3-642-13073-1_28⟩
Communication dans un congrès
istex
hal-00461068v1
|
|||
An Exact Algorithm for the Minimum Dominating Clique ProblemTheoretical Computer Science, 2007, 385, pp.226-240. ⟨10.1016/j.tcs.2007.06.014⟩
Article dans une revue
istex
hal-00460832v1
|
|||
Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum SizeParameterized and Exact Computation - 9th International Symposium, Sep 2014, Wroclaw, Poland. pp.147-158, ⟨10.1007/978-3-319-13524-3_13⟩
Communication dans un congrès
hal-01105083v1
|
|||
Treewidth and Pathwidth parameterized by the vertex cover numberDiscrete Applied Mathematics, 2017, 216, pp.114-129
Article dans une revue
hal-01971121v1
|
|||
|
|
Exact algorithms for $L(2,1)$-labeling of graphs[Research Report] RR-6587, INRIA. 2008
Rapport
inria-00303330v1
|
||
|
|
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating SetDiscrete Mathematics and Theoretical Computer Science, 2012, Vol. 14 no. 1 (1), pp.29-42. ⟨10.46298/dmtcs.563⟩
Article dans une revue
hal-00942912v1
|
||
|
|
On finding optimal polytreesTheoretical Computer Science, 2015, 592, pp.49-58. ⟨10.1016/j.tcs.2015.05.012⟩
Article dans une revue
hal-01216951v1
|
||
Exact Algorithms for Weak Roman DominationIWOCA 2013, Jul 2013, Rouen, France. pp.81-93, ⟨10.1007/978-3-642-45278-9_8⟩
Communication dans un congrès
istex
hal-00848454v1
|
|||
An Exact Algorithm for Connected Red-Blue Dominating SetCIAC'2010 : 7th International Conference on Algorithms and Complexity, May 2010, Rome, Italy. pp.25-36, ⟨10.1007/978-3-642-13073-1_4⟩
Communication dans un congrès
istex
hal-00461066v1
|
|||
An Exact Algorithm for the Minimum Dominating Clique ProblemIWPEC'2006 : 2nd International Workshop on Parameterized and Exact Computation, Sep 2006, Zürich, Switzerland. pp.130-141, ⟨10.1007/11847250_12⟩
Communication dans un congrès
istex
hal-00460727v1
|