The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Benoit Larose: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrei A. Krokhin, Benoit Larose
    Maximum Constraint Satisfaction on Diamonds. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:388-402 [Conf]
  2. Víctor Dalmau, Andrei A. Krokhin, Benoit Larose
    First-Order Definable Retraction Problems for Posets and Reflexive Graph. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:232-241 [Conf]
  3. Benoit Larose, Cynthia Loten, Claude Tardif
    A Characterisation of First-Order Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:201-210 [Conf]
  4. Ondrej Klíma, Benoit Larose, Pascal Tesson
    Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:584-595 [Conf]
  5. Andrei A. Krokhin, Benoit Larose
    Solving Order Constraints in Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:379-390 [Conf]
  6. Benoit Larose, Claude Tardif
    Hedetniemi's Conjecture and the Retracts of a Product of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:4, pp:531-544 [Journal]
  7. Benoit Larose, François Laviolette, Claude Tardif
    On Normal Cayley Graphs and Hom-idempotent Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:7, pp:867-881 [Journal]
  8. Benoit Larose, Claudia Malvenuto
    Stable sets of maximal size in Kneser-type graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:5, pp:657-673 [Journal]
  9. Benoit Larose, László Zádori
    Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras. [Citation Graph (0, 0)][DBLP]
    IJAC, 2006, v:16, n:3, pp:563-582 [Journal]
  10. Benoit Larose, Cynthia Loten, László Zádori
    A polynomial-time algorithm for near-unanimity graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:55, n:2, pp:177-191 [Journal]
  11. Benoit Larose, László Zádori
    The Complexity of the Extendibility Problem for Finite Posets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:17, n:1, pp:114-121 [Journal]
  12. Benoit Larose, Pascal Tesson
    Universal Algebra and Hardness Results for Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:267-278 [Conf]
  13. László Egri, Benoit Larose, Pascal Tesson
    Symmetric Datalog and Constraint Satisfaction Problems in Logspace. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:193-202 [Conf]
  14. Benoit Larose, Cynthia Loten, Claude Tardif
    A Characterisation of First-Order Constraint Satisfaction Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  15. Benoit Larose, László Zádori
    Algebraic properties and dismantlability of finite posets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:89-99 [Journal]
  16. Víctor Dalmau, Andrei A. Krokhin, Benoit Larose
    First-order Definable Retraction Problems for Posets and Reflexive Graphs. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2007, v:17, n:1, pp:31-51 [Journal]

  17. Dualities for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


  18. Directed st-Connectivity Is Not Expressible in Symmetric Datalog. [Citation Graph (, )][DBLP]


  19. Maltsev + Datalog --> Symmetric Datalog. [Citation Graph (, )][DBLP]


  20. The Complexity of the List Homomorphism Problem for Graphs. [Citation Graph (, )][DBLP]


  21. The complexity of the list homomorphism problem for graphs [Citation Graph (, )][DBLP]


  22. Retractions onto series-parallel posets. [Citation Graph (, )][DBLP]


  23. Symmetric Datalog and Constraint Satisfaction Problems in Logspace. [Citation Graph (, )][DBLP]


  24. Universal Algebra and Hardness Results for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


  25. Maximum stable sets in analogs of Kneser and complete graphs. [Citation Graph (, )][DBLP]


Search in 0.046secs, Finished in 0.048secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002