Benoit Larose
Affiliations: | Computer Science and Operations Research | Université de Montréal, Montréal, Canada |
Area:
MathematicsGoogle:
"Benoit Larose"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Larose B, Siggers MH. (2018) NU Polymorphisms on Reflexive Digraphs Siam Journal On Discrete Mathematics. 32: 728-749 |
| Chen H, Larose B. (2017) Asking the Metaquestions in Constraint Tractability Acm Transactions On Computation Theory. 9: 11 |
| Feder T, Hell P, Larose B, et al. (2014) Graphs admitting k-nu operations. part 2: The irreflexive case Siam Journal On Discrete Mathematics. 28: 817-834 |
| Feder T, Hell P, Larose B, et al. (2013) Graphs admitting k-NU operations. Part 1: The reflexive case Siam Journal On Discrete Mathematics. 27: 1940-1963 |
| Larose B, Lemaître A. (2013) List-homomorphism problems on graphs and arc consistency Dedicated to Ivo G. Rosenberg, from mathematical son and grandson Discrete Mathematics. 313: 2525-2537 |
| Larose B, Lemaitre A. (2012) List-homomorphism problems on graphs and arc consistency Proceedings of the International Symposium On Multiple-Valued Logic. 343-348 |
| Egri L, Krokhin A, Larose B, et al. (2010) The complexity of the list homomorphism problem for graphs Leibniz International Proceedings in Informatics, Lipics. 5: 335-346 |
| Larose B, Valeriote M, Zádori L. (2009) Omitting types, bounded width and the ability to count International Journal of Algebra and Computation. 19: 647-668 |
| Larose B, Tesson P. (2009) Universal algebra and hardness results for constraint satisfaction problems Theoretical Computer Science. 410: 1629-1647 |
| Kun G, Larose B. (2009) Maximum stable sets in analogs of Kneser and complete graphs European Journal of Combinatorics. 30: 17-29 |