7 résultats  enregistrer la recherche


hal-00944652v1  Communication dans un congrès
David CattanéoSimon PerdrixParameterized Complexity of Weak Odd Domination Problems
19th International Symposium on Fundamentals of Computation Theory, Aug 2013, Liverpool, United Kingdom. 8070, pp.107-120, 2013, Lecture Notes in Computer Science. <10.1007/978-3-642-40164-0_13>
hal-00944653v1  Communication dans un congrès
David CattanéoSimon PerdrixThe Parameterized Complexity of Domination-type Problems and Application to Linear Codes
Theory and Applications of Models of Computation, Apr 2014, Chennai, India. 8402, pp.86-103, Lecture Notes in Computer Science. <http://link.springer.com/chapter/10.1007%2F978-3-319-06089-7_7>. <10.1007/978-3-319-06089-7_7>
hal-01132843v1  Communication dans un congrès
David CattanéoSimon PerdrixMinimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms
26th International Symposium on Algorithms and Computation (ISAAC 2015), Dec 2015, Nagoya, Japan. 9472, pp.12, 2015, Algorithms and Computation (ISAAC'2015). <10.1007/978-3-662-48971-0_23>
hal-00994182v1  Communication dans un congrès
Stefano FacchiniSimon PerdrixQuantum Circuits for the Unitary Permutation Problem
TAMC 2015, May 2015, Singapore, Singapore. 9076, pp.324-331, 2015, Theory and Applications of Models of Computation. <10.1007/978-3-319-17142-5_28>
hal-01249271v1  Article dans une revue
Sylvain GravierJérôme JavelleMehdi MhallaSimon PerdrixOn weak odd domination and graph-based quantum secret sharing
Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 598, <10.1016/j.tcs.2015.05.038>
...
inria-00549416v1  Chapitre d'ouvrage
Olivier BournezGilles DowekRémi GilleronSerge GrigorieffJean-Yves Marion et al.  Décidabilité et Complexité
Pierre Marquis, Odile Papini and Henri Prade. IA Handbook, Cépaduès, pp.1-63, 2010