Filtrer vos résultats
- 27
- 19
- 1
- 24
- 19
- 2
- 1
- 1
- 34
- 20
- 2
- 8
- 4
- 10
- 5
- 7
- 6
- 3
- 1
- 1
- 45
- 2
- 30
- 14
- 4
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 47
- 23
- 13
- 8
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 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
47 résultats
|
|
|
triés par
|
|
|
Temporal matching in link stream: kernel and approximationCTW 2018 - 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Jun 2018, Paris, France
Communication dans un congrès
hal-02075831v1
|
||
|
|
Contraction Bidimensionality of Geometric Intersection GraphsAlgorithmica, 2022, 84 (2), pp.510-531. ⟨10.1007/s00453-021-00912-w⟩
Article dans une revue
hal-03541133v1
|
||
|
|
Minimum Reload Cost Graph FactorsSOFSEM 2019 - 45th International Conference on Current Trends in Theory and Practice of Informatics, Jan 2019, Nový Smokovec, Slovakia. pp.67-80, ⟨10.1007/978-3-030-10801-4_7⟩
Communication dans un congrès
lirmm-02342817v1
|
||
A Hybrid Genetic Approach for Bi-Level Flexible Job Shops Arising from Selective Deconstruction2023 IEEE Congress on Evolutionary Computation (CEC), Jul 2023, Chicago, United States. pp.1-8, ⟨10.1109/CEC53210.2023.10254125⟩
Communication dans un congrès
hal-04219763v1
|
|||
|
|
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic TreesBulletin of Mathematical Biology, 2016, 79 (4), pp.920-938. ⟨10.1007/s11538-017-0260-y⟩
Article dans une revue
lirmm-03113710v1
|
||
|
|
Bounding and approximating minimum maximal matchings in regular graphsDiscrete Mathematics, 2021, 344 (3), pp.112243. ⟨10.1016/j.disc.2020.112243⟩
Article dans une revue
hal-03469370v1
|
||
|
|
Parameterized complexity of finding a spanning tree with minimum reload cost diameterNetworks, 2020, 75 (3), pp.259-277. ⟨10.1002/net.21923⟩
Article dans une revue
lirmm-02989889v1
|
||
|
|
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost DiameterIPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.3:1--3:12, ⟨10.4230/LIPIcs.IPEC.2017.3⟩
Communication dans un congrès
hal-01733767v1
|
||
|
|
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex DeletionTheory of Computing Systems, 2017, 61 (3), pp.777-794. ⟨10.1007/s00224-016-9716-y⟩
Article dans une revue
lirmm-01630773v1
|
||
|
|
Domination versus edge dominationDiscrete Applied Mathematics, 2020, 285, pp.343-349. ⟨10.1016/j.dam.2020.05.030⟩
Article dans une revue
hal-03470076v1
|
||
Approximating Maximum Acyclic Matchings by Greedy and Local Search StrategiesComputing and Combinatorics, 12273 (3), Springer International Publishing; Springer International Publishing, pp.542-553, 2020, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-58150-3_44⟩
Chapitre d'ouvrage
hal-03470113v1
|
|||
|
|
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by TreewidthIPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. pp.2:1--2:13, ⟨10.4230/LIPIcs.IPEC.2018.2⟩
Communication dans un congrès
lirmm-02342806v1
|
||
|
|
Hitting minors on bounded treewidth graphs. III. Lower boundsJournal of Computer and System Sciences, 2020, 109, pp.56-77. ⟨10.1016/j.jcss.2019.11.002⟩
Article dans une revue
lirmm-02989938v1
|
||
|
|
Treewidth: algorithmic, combinatorial, and practical aspectsData Structures and Algorithms [cs.DS]. Université de Montpellier, 2017. English. ⟨NNT : ⟩
Thèse
tel-02078814v1
|
||
|
|
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal AlgorithmSIAM Journal on Computing, 2023, 52 (4), pp.865-912. ⟨10.1137/21M140482X⟩
Article dans une revue
lirmm-04171495v1
|
||
Linear programming based approximation for unweighted induced matchings—Breaking the Δ barrierDiscrete Optimization, 2020, 38, pp.100593. ⟨10.1016/j.disopt.2020.100593⟩
Article dans une revue
hal-03470079v1
|
|||
|
|
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theoryArtificial Intelligence, 2022, 303, pp.103644. ⟨10.1016/j.artint.2021.103644⟩
Article dans une revue
hal-03469328v1
|
||
|
|
Contraction-Bidimensionality of Geometric Intersection GraphsIPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.5:1--5:13, ⟨10.4230/LIPIcs.IPEC.2017.5⟩
Communication dans un congrès
lirmm-01890527v1
|
||
|
|
Temporal MatchingTheoretical Computer Science, 2020, ⟨10.1016/j.tcs.2019.03.026⟩
Article dans une revue
hal-02075865v1
|
||
|
|
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability TheoryTwenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}, Jul 2020, Yokohama, Japan. pp.1119-1125, ⟨10.24963/ijcai.2020/156⟩
Communication dans un congrès
hal-03470252v1
|
||
|
|
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic TreesAAIM: Algorithmic Aspects in Information and Management, Jul 2016, Bergamo, Italy. pp.53-64, ⟨10.1007/978-3-319-41168-2_5⟩
Communication dans un congrès
lirmm-01481368v1
|
||
|
|
Quasi-Clique Mining for Graph SummarizationDatabase and Expert Systems Applications. DEXA 2022, Aug 2022, Vienne, Austria. pp.310-315, ⟨10.1007/978-3-031-12426-6_29⟩
Communication dans un congrès
hal-03762142v1
|
||
On the parameterized complexity of the Edge Monitoring problemInformation Processing Letters, 2017, 121, pp.39-44. ⟨10.1016/j.ipl.2017.01.008⟩
Article dans une revue
lirmm-01487565v1
|
|||
Towards hybridization of multi-agent simulation and metaheuristics applied to selective deconstruction2022 IEEE Symposium Series on Computational Intelligence (SSCI), Dec 2022, Singapore, Singapore. pp.767-773, ⟨10.1109/SSCI51031.2022.10022117⟩
Communication dans un congrès
hal-03968476v1
|
|||
|
|
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded TreewidthIPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.4:1--4:12, ⟨10.4230/LIPIcs.IPEC.2017.4⟩
Communication dans un congrès
hal-01733845v1
|
||
|
|
FPT Algorithms for Diverse Collections of Hitting SetsAlgorithms, 2019, 12 (12), pp.254. ⟨10.3390/a12120254⟩
Article dans une revue
hal-03470343v1
|
||
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidthThe 11th International Colloquium on Graph Theory and combinatorics, Jul 2022, Montpellier, France. pp.1-30, ⟨10.2139/ssrn.4197048⟩
Communication dans un congrès
hal-03790659v1
|
|||
|
|
On the Number of Labeled Graphs of Bounded TreewidthWG 2017 - 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. pp.88-99, ⟨10.1007/978-3-319-68705-6_7⟩
Communication dans un congrès
hal-01734085v1
|
||
|
|
Hitting Minors on Bounded Treewidth Graphs. I. General Upper BoundsSIAM Journal on Discrete Mathematics, 2020, 34 (3), pp.1623-1648. ⟨10.1137/19M1287146⟩
Article dans une revue
lirmm-02989921v1
|
||
|
|
Ruling out FPT algorithms for Weighted Coloring on forestsElectronic Notes in Discrete Mathematics, 2017, 62, pp.195-200. ⟨10.1016/j.endm.2017.10.034⟩
Article dans une revue
hal-01733595v1
|
- 1
- 2