The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrei A. Krokhin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin
    Soft Constraints: Complexity and Multimorphisms. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:244-258 [Conf]
  2. Andrei A. Krokhin, Benoit Larose
    Maximum Constraint Satisfaction on Diamonds. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:388-402 [Conf]
  3. Ferdinand Börner, Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin
    Quantified Constraints: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:58-70 [Conf]
  4. Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons
    Constraint Satisfaction Problems and Finite Algebras. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:272-282 [Conf]
  5. David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin
    A Maximal Tractable Class of Soft Constraints. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:209-214 [Conf]
  6. Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
    A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:83-88 [Conf]
  7. Andrei A. Krokhin, Andrei A. Bulatov, Peter Jeavons
    Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2003, pp:343-0 [Conf]
  8. 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]
  9. David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin
    Identifying Efficiently Solvable Cases of Max CSP. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:152-163 [Conf]
  10. Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
    The Complexity of Constraints on Intervals and Lengths. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:443-454 [Conf]
  11. Andrei A. Krokhin, Benoit Larose
    Solving Order Constraints in Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:379-390 [Conf]
  12. Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons
    The complexity of maximal constraint languages. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:667-674 [Conf]
  13. Andrei A. Krokhin, Peter Jonsson
    Extending the Point Algebra into the Qualitative Algebra. [Citation Graph (0, 0)][DBLP]
    TIME, 2002, pp:28-35 [Conf]
  14. David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin
    The complexity of soft constraint satisfaction. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2006, v:170, n:11, pp:983-1016 [Journal]
  15. Peter Jonsson, Andrei A. Krokhin
    Complexity classification in qualitative temporal constraint reasoning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:160, n:1-2, pp:35-51 [Journal]
  16. David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin
    Supermodular functions and the complexity of MAX CSP. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:53-72 [Journal]
  17. Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
    The complexity of constraints on intervals and lengths [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:077, pp:- [Journal]
  18. Andrei A. Krokhin, Peter Jonsson
    Recognizing Frozen Variables in Constraint Satisfaction Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:062, pp:- [Journal]
  19. Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
    Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:5, pp:591-640 [Journal]
  20. David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin
    A Maximal Tractable Class of Soft Constraints. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2004, v:22, n:, pp:1-22 [Journal]
  21. Andrei A. Krokhin
    Congruences of Clone Lattices, II. [Citation Graph (0, 0)][DBLP]
    Order, 2001, v:18, n:2, pp:151-159 [Journal]
  22. Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin
    Classifying the Complexity of Constraints Using Finite Algebras. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:720-742 [Journal]
  23. Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
    The Approximability of Three-valued MAX CSP. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:6, pp:1329-1349 [Journal]
  24. Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
    Constraint Satisfaction Problems on Intervals and Length. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:17, n:3, pp:453-477 [Journal]
  25. Peter Jonsson, Andrei A. Krokhin
    Recognizing frozen variables in constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:329, n:1-3, pp:93-113 [Journal]
  26. Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
    Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:182-193 [Conf]
  27. Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
    The approximability of MAX CSP with fixed-value constraints [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  28. Peter Jonsson, Mikael Klasson, Andrei A. Krokhin
    The approximability of three-valued MAX CSP [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  29. Peter Jonsson, Andrei A. Krokhin
    Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:5, pp:691-702 [Journal]
  30. 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]

  31. Tree Dualities for Constraint Satisfaction. [Citation Graph (, )][DBLP]


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


  33. On the Hardness of Losing Weight. [Citation Graph (, )][DBLP]


  34. Caterpillar Duality for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


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


  36. Hard constraint satisfaction problems have hard gaps at location 1 [Citation Graph (, )][DBLP]


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


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


  39. Majority constraints have bounded pathwidth duality. [Citation Graph (, )][DBLP]


Search in 0.083secs, Finished in 0.084secs
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