The following pages link to Benoit Larose (Q178713):
Displaying 50 items.
- (Q393912) (redirect page) (← links)
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- Bounded width problems and algebras (Q997127) (← links)
- A note on supermodular sublattices in finite relatively complemented lattices (Q998786) (← links)
- Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
- Finite projective ordered sets (Q1182039) (← links)
- A property of projective ordered sets (Q1199775) (← links)
- On normal Cayley graphs and hom-idempotent graphs (Q1272791) (← links)
- Algebraic properties and dismantlability of finite posets (Q1356527) (← links)
- A discrete homotopy theory for binary reflexive structures (Q1763635) (← links)
- Isotone analogs of results by Mal'tsev and Rosenberg (Q1770342) (← links)
- Ideal extensions of ordered sets (Q1777809) (← links)
- Stable sets of maximal size in Kneser-type graphs (Q1827339) (← links)
- A note on \(G\)-intersecting families (Q1861255) (← links)
- On the centralizer of the join operation of a finite lattice (Q1902534) (← links)
- Notes on coalition lattices (Q1970931) (← links)
- Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
- Retractions onto series-parallel posets (Q2483392) (← links)
- A note on minimal varieties generated by order-primal algebras (Q2496140) (← links)
- Maximum stable sets in analogs of Kneser and complete graphs (Q2519792) (← links)
- Semilattices with closure (Q2577679) (← links)
- Finite posets and topological spaces in locally finite varieties (Q2577685) (← links)
- Minimal clones -- a minicourse (Q2577750) (← links)
- Endoprimality without duality (Q2583601) (← links)
- A polynomial-time algorithm for near-unanimity graphs (Q3022752) (← links)
- (Q3113761) (← links)
- Projectivity and independent sets in powers of graphs (Q3150193) (← links)
- Strongly Projective Graphs (Q3153537) (← links)
- Graphs Admitting $k$-NU Operations. Part 2: The Irreflexive Case (Q3192166) (← links)
- (Q3304148) (← links)
- OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT (Q3398315) (← links)
- First-order Definable Retraction Problems for Posets and Reflexive Graphs (Q3437257) (← links)
- Directed st-Connectivity Is Not Expressible in Symmetric Datalog (Q3519500) (← links)
- Maximum Constraint Satisfaction on Diamonds (Q3524191) (← links)
- Some Results on Two Conjectures of Schützenberger (Q3586419) (← links)
- Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction (Q3614209) (← links)
- (Q4001097) (← links)
- (Q4325648) (← links)
- (Q4418666) (← links)
- Families of strongly projective graphs (Q4435563) (← links)
- The Complexity of the Extendibility Problem for Finite Posets (Q4443125) (← links)
- (Q4542615) (← links)
- (Q4544370) (← links)
- NU Polymorphisms on Reflexive Digraphs (Q4610183) (← links)
- Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy (Q4635829) (← links)
- MINIMAL AUTOMORPHIC POSETS AND THE PROJECTION PROPERTY (Q4697878) (← links)
- (Q4793059) (← links)
- Asking the Metaquestions in Constraint Tractability (Q4973888) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
