Filtrer vos résultats
- 16
- 3
- 1
- 10
- 5
- 4
- 1
- 1
- 20
- 7
- 3
- 5
- 2
- 4
- 2
- 1
- 1
- 2
- 19
- 1
- 17
- 6
- 4
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 20
- 8
- 5
- 3
- 3
- 3
- 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
- 1
- 1
- 1
- 1
- 1
- 1
20 résultats
|
|
triés par
|
Shortest Reconfiguration of Colorings Under Kempe Changes37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France, 2020, Montpellier, France. pp.35:1--35:14, ⟨10.4230/LIPIcs.STACS.2020.35⟩
Communication dans un congrès
hal-02527059v1
|
|||
|
Short and local transformations between ($\Delta+1$)-colorings2022
Pré-publication, Document de travail
hal-03663638v1
|
||
|
Local Conflict ColoringFOCS 2016 - 57th Annual IEEE Symposium on Foundations of Computer Science, Oct 2016, New Brunswick, NJ, United States
Communication dans un congrès
hal-01223494v2
|
||
|
The Perfect Matching Reconfiguration ProblemMFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.1-14, ⟨10.4230/LIPIcs.MFCS.2019.80⟩
Communication dans un congrès
hal-02335588v1
|
||
|
Distributed Recoloring of Interval and Chordal Graphs25th International Conference on Principles of Distributed Systems, OPODIS 2021, Dec 2021, Strasbourg, France. ⟨10.4230/LIPIcs.OPODIS.2021.19⟩
Communication dans un congrès
hal-03610449v1
|
||
|
Weighted Total AcquisitionDiscrete Applied Mathematics, 2021, 304, pp.260-282. ⟨10.1016/j.dam.2021.07.040⟩
Article dans une revue
hal-02880093v2
|
||
|
The switch operators and push-the-button games: a sequential compound over rulesetsTheoretical Computer Science, 2018, 715, pp.71-85. ⟨10.1016/j.tcs.2018.01.003⟩
Article dans une revue
hal-01566273v2
|
||
|
Enumerating Minimal Dominating Sets in Triangle-Free Graphs36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Mar 2019, Berlin, Germany. pp.16:1--16:12, ⟨10.4230/LIPIcs.STACS.2019.16⟩
Communication dans un congrès
hal-02181721v1
|
||
|
New Algorithmic Approaches to Point Constellation Recognition29th IFIP International Information Security Conference (SEC), Jun 2014, Marrakech, Morocco. pp.80-90, ⟨10.1007/978-3-642-55415-5_7⟩
Communication dans un congrès
hal-01098401v2
|
||
New Algorithmic Approaches to Point Constellation Recogniti[Technical Report] CoRR abs/1405.1402 (2014), Ecole normale supérieure. 2014, pp.14
Rapport
hal-01098399v1
|
|||
|
PACE Solver Description: µSolver - Heuristic Track *16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Nov 2021, Lisbon, Portugal. ⟨10.4230/LIPIcs.IPEC.2021.33⟩
Communication dans un congrès
hal-04084587v1
|
||
|
PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters16th International Symposium on Parameterized and Exact Computation, IPEC 2021, Sep 2021, Lisbonne, Portugal. pp.29:1-29:4, ⟨10.4230/LIPIcs.IPEC.2021.29⟩
Communication dans un congrès
hal-03671173v1
|
||
|
Online graph coloring with bichromatic exchanges2019
Pré-publication, Document de travail
hal-02167055v1
|
||
|
The Glauber dynamics for edges colourings of trees2018
Pré-publication, Document de travail
hal-02156373v1
|
||
|
A polynomial version of Cereceda's conjectureJournal of Combinatorial Theory, Series B, 2022, 155, pp.1-16. ⟨10.1016/j.jctb.2022.01.006⟩
Article dans une revue
hal-02167051v2
|
||
PACE Challenge 2021: heuristique pour le cluster editing problem23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France
Communication dans un congrès
hal-03596213v1
|
|||
|
On a recolouring version of Hadwiger's conjecture2021
Pré-publication, Document de travail
hal-04097535v1
|
||
|
Enumerating Minimal Dominating Sets in Kt-free Graphs and VariantsACM Transactions on Algorithms, 2020, 16 (3), pp.1-23. ⟨10.1145/3386686⟩
Article dans une revue
hal-03448793v1
|
||
|
A generalization of Arc-KaylesInternational Journal of Game Theory, In press, pp.1-21. ⟨10.1007/s00182-018-0639-5⟩
Article dans une revue
hal-01587921v3
|
||
|
Computing maximum cliques in B 2 EPG graphsWG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands
Communication dans un congrès
hal-01557335v1
|