The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kostas Stergiou: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kostas Stergiou, Manolis Koubarakis
    Backtracking Algorithms for Disjunctions of Temporal Constraints. [Citation Graph (1, 0)][DBLP]
    AAAI/IAAI, 1998, pp:248-253 [Conf]
  2. Barbara M. Smith, Kostas Stergiou, Toby Walsh
    Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:182-187 [Conf]
  3. Kostas Stergiou, Toby Walsh
    Encodings of Non-Binary Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1999, pp:163-168 [Conf]
  4. Konstantinos Kotis, George A. Vouros, Kostas Stergiou
    Capturing Semantics Towards Automatic Coordination of Domain Ontologies. [Citation Graph (0, 0)][DBLP]
    AIMSA, 2004, pp:22-32 [Conf]
  5. Ian P. Gent, Kostas Stergiou, Toby Walsh
    Decomposable Constraints. [Citation Graph (0, 0)][DBLP]
    New Trends in Constraints, 1999, pp:134-149 [Conf]
  6. Thanasis Balafoutis, Kostas Stergiou
    Algorithms for Stochastic CSPs. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:44-58 [Conf]
  7. Yannis Dimopoulos, Kostas Stergiou
    Propagation in CSP and SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:137-151 [Conf]
  8. Nikos Mamoulis, Kostas Stergiou
    Solving Non-binary CSPs Using the Hidden Variable Encoding. [Citation Graph (0, 0)][DBLP]
    CP, 2001, pp:168-182 [Conf]
  9. Nikos Mamoulis, Kostas Stergiou
    Constraint Satisfaction in Semi-structured Data Graphs. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:393-407 [Conf]
  10. Nikos Mamoulis, Kostas Stergiou
    Algorithms for Quantified Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:752-756 [Conf]
  11. Patrick Prosser, Kostas Stergiou, Toby Walsh
    Singleton Consistencies. [Citation Graph (0, 0)][DBLP]
    CP, 2000, pp:353-368 [Conf]
  12. Kostas Stergiou
    Repair-Based Methods for Quantified CSPs. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:652-666 [Conf]
  13. Kostas Stergiou, Toby Walsh
    Inverse Consistencies for Non-Binary Constraints. [Citation Graph (0, 0)][DBLP]
    ECAI, 2006, pp:153-157 [Conf]
  14. Ian P. Gent, Peter Nightingale, Kostas Stergiou
    QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:138-143 [Conf]
  15. Kostas Stergiou, Toby Walsh
    The Difference All-Difference Makes. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:414-419 [Conf]
  16. Nikos Samaras, Kostas Stergiou
    Arc Consistency in Binary Encodings of Non-binary CSPs: Theoretical and Experimental Evaluation. [Citation Graph (0, 0)][DBLP]
    SETN, 2004, pp:352-361 [Conf]
  17. Kostas Stergiou
    On Algorithms for Decomposable Constraints. [Citation Graph (0, 0)][DBLP]
    SETN, 2002, pp:65-71 [Conf]
  18. Ian P. Gent, Kostas Stergiou, Toby Walsh
    Decomposable constraints. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2000, v:123, n:1-2, pp:133-156 [Journal]
  19. Kostas Stergiou, Manolis Koubarakis
    Backtracking algorithms for disjunctions of temporal constraints. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2000, v:120, n:1, pp:81-117 [Journal]
  20. Paraskevi Raftopoulou, Manolis Koubarakis, Kostas Stergiou, Peter Triantafillou
    Fair Resource Allocation in a Simple Multi-agent Setting: Search Algorithms and Experimental Evaluation. [Citation Graph (0, 0)][DBLP]
    International Journal on Artificial Intelligence Tools, 2005, v:14, n:6, pp:887-900 [Journal]
  21. Fahiem Bacchus, Kostas Stergiou
    Solution Directed Backjumping for QCSP. [Citation Graph (0, 0)][DBLP]
    CP, 2007, pp:148-163 [Conf]
  22. Kostas Stergiou, Nikos Samaras
    Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2005, v:24, n:, pp:641-684 [Journal]

  23. Overlay networks for task allocation and coordination in dynamic large-scale networks of cooperative agents. [Citation Graph (, )][DBLP]


  24. Learning How to Propagate Using Random Probing. [Citation Graph (, )][DBLP]


  25. Heuristics for Dynamically Adapting Propagation. [Citation Graph (, )][DBLP]


  26. Adaptive Branching for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


  27. Strong Inverse Consistencies for Non-Binary CSPs. [Citation Graph (, )][DBLP]


  28. Conflict Directed Variable Selection Strategies for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


  29. A Study of SAT-Based Branching Heuristics for the CSP. [Citation Graph (, )][DBLP]


  30. Domain filtering consistencies for non-binary constraints. [Citation Graph (, )][DBLP]


  31. Solving quantified constraint satisfaction problems. [Citation Graph (, )][DBLP]


  32. Heuristics for dynamically adapting propagation in constraint satisfaction problems. [Citation Graph (, )][DBLP]


  33. Introduction to the special issue on quantified CSPs and QBF. [Citation Graph (, )][DBLP]


  34. Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs [Citation Graph (, )][DBLP]


  35. Adaptive Branching for Constraint Satisfaction Problems [Citation Graph (, )][DBLP]


  36. Improving the Performance of maxRPC [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.007secs
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