( en | de | ru )

 

Disambiguation of "Larose, Benoît"

Author of the publication

copydeleteadd this publication to your clipboard
QCSP on Reflexive Tournaments.

, , , , , and . ACM Trans. Comput. Log., 23 (3): 14:1-14:22 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Benoît Cordonnier

Non-Newtonian effects in silicate liquids and crystal bearing melts: implication for magma dynamics. Uni München, (2009)

Benoît Mindzeng

Benoît Vaugon

Benoît Delahaye

Benoît Bertholon

 

Other publications of authors with the same name

The complexity of the list homomorphism problem for graphs, , , and . CoRR, (2009)Asking the Metaquestions in Constraint Tractability., and . TOCT, 9 (3): 11:1-11:27 (2017)The Complexity of the List Homomorphism Problem for Graphs., , , and . STACS, volume 5 of LIPIcs, page 335-346. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)NU Polymorphisms on Reflexive Digraphs., and . SIAM J. Discret. Math., 32 (1): 728-749 (2018)Surjective H-Colouring over Reflexive Digraphs., , and . ACM Trans. Comput. Theory, 11 (1): 3:1-3:21 (2019)Universal algebra and hardness results for constraint satisfaction problems., and . Theor. Comput. Sci., 410 (18): 1629-1647 (2009)Universal Algebra and Hardness Results for Constraint Satisfaction Problems., and . Electron. Colloquium Comput. Complex., (2007)The Complexity of the Extendibility Problem for Finite Posets., and . SIAM J. Discret. Math., 17 (1): 114-121 (2003)QCSP on Reflexive Tournaments., , , , , and . ESA, volume 204 of LIPIcs, page 58:1-58:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Dismantlability, Connectedness, and Mixing in Relational Structures., , , and . ICALP, volume 132 of LIPIcs, page 29:1-29:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)