Benoît Larose

Affiliations:
  • Université du Québec à Montréal, Laboratoire de Combinatoire et d'Informatique Mathématique (LACIM), Canada
  • Champlain College, St-Lambert, QC, Canada
  • Concordia University, Montreal, QC, Canada (former)


According to our database1, Benoît Larose authored at least 42 papers between 1992 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
QCSP on Reflexive Tournaments.
ACM Trans. Comput. Log., 2022

Surjective polymorphisms of reflexive cycles.
CoRR, 2022

2021
Dismantlability, connectedness, and mixing in relational structures.
J. Comb. Theory B, 2021

2019
Surjective H-Colouring over Reflexive Digraphs.
ACM Trans. Comput. Theory, 2019

Long range actions, connectedness, and dismantlability in relational structures.
CoRR, 2019

2018
NU Polymorphisms on Reflexive Digraphs.
SIAM J. Discret. Math., 2018

2017
Asking the Metaquestions in Constraint Tractability.
ACM Trans. Comput. Theory, 2017

Algebra and the Complexity of Digraph CSPs: a Survey.
Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

2015
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case.
SIAM J. Discret. Math., 2014

Space complexity of list <i>H</i>-colouring: a dichotomy.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case.
SIAM J. Discret. Math., 2013

List-homomorphism problems on graphs and arc consistency.
Discret. Math., 2013

Space complexity of list H-colouring: a dichotomy.
CoRR, 2013

2012
The Complexity of the List Homomorphism Problem for Graphs.
Theory Comput. Syst., 2012

2009
Universal algebra and hardness results for constraint satisfaction problems.
Theor. Comput. Sci., 2009

Omitting Types, Bounded Width and the Ability to Count.
Int. J. Algebra Comput., 2009

Maximum stable sets in analogs of Kneser and complete graphs.
Eur. J. Comb., 2009

2008
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction.
SIAM J. Discret. Math., 2008

Retractions onto series-parallel posets.
Discret. Math., 2008

Maltsev + Datalog --> Symmetric Datalog.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Directed st-Connectivity Is Not Expressible in Symmetric Datalog.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Dualities for Constraint Satisfaction Problems.
Proceedings of the Complexity of Constraints, 2008

2007
First-order Definable Retraction Problems for Posets and Reflexive Graphs.
J. Log. Comput., 2007

A Characterisation of First-Order Constraint Satisfaction Problems.
Log. Methods Comput. Sci., 2007

Symmetric Datalog and Constraint Satisfaction Problems in Logspace.
Electron. Colloquium Comput. Complex., 2007

2006
Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras.
Int. J. Algebra Comput., 2006

Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005
A polynomial-time algorithm for near-unanimity graphs.
J. Algorithms, 2005

Maximum Constraint Satisfaction on Diamonds.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Stable sets of maximal size in Kneser-type graphs.
Eur. J. Comb., 2004

First-Order Definable Retraction Problems for Posets and Reflexive Graph.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003
The Complexity of the Extendibility Problem for Finite Posets.
SIAM J. Discret. Math., 2003

Solving Order Constraints in Logarithmic Space.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002
Projectivity and independent sets in powers of graphs.
J. Graph Theory, 2002

Families of strongly projective graphs.
Discuss. Math. Graph Theory, 2002

2000
Hedetniemi's Conjecture and the Retracts of a Product of Graphs.
Comb., 2000

1999
Notes on Coalition Lattices.
Order, 1999

1998
On Normal Cayley Graphs and Hom-idempotent Graphs.
Eur. J. Comb., 1998

1997
Algebraic properties and dismantlability of finite posets.
Discret. Math., 1997

1995
Minimal automorphic Posets and the Projection Property.
Int. J. Algebra Comput., 1995

1992
A property of projective ordered sets.
Eur. J. Comb., 1992


  Loading...