The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Zeynep Kiziltan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Brahim Hnich, Zeynep Kiziltan, Toby Walsh
    Combining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums. [Citation Graph (0, 0)][DBLP]
    AMAI, 2004, pp:- [Conf]
  2. Christian Bessière, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh
    The ROOTS Constraint. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:75-90 [Conf]
  3. Pierre Flener, Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Justin Pearson, Toby Walsh
    Breaking Row and Column Symmetries in Matrix Models. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:462-476 [Conf]
  4. Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh
    Global Constraints for Lexicographic Orderings. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:93-108 [Conf]
  5. Zeynep Kiziltan
    Labelling Heuristics for CSP Application Domains. [Citation Graph (0, 0)][DBLP]
    CP, 2001, pp:769- [Conf]
  6. Zeynep Kiziltan
    Reducing Symmetry in Matrix Models. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:786- [Conf]
  7. Zeynep Kiziltan
    Symmetry Breaking Ordering Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:979- [Conf]
  8. Christian Bessière, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh
    Filtering Algorithms for the NValue Constraint. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2005, pp:79-93 [Conf]
  9. Christian Bessière, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh
    The Range Constraint: Algorithms and Implementation. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2006, pp:59-73 [Conf]
  10. Christian Bessière, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh
    Among, Common and Disjoint Constraints. [Citation Graph (0, 0)][DBLP]
    CSCLP, 2005, pp:29-43 [Conf]
  11. Christian Bessière, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh
    The Range and Roots Constraints: Specifying Counting and Occurrence Problems. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:60-65 [Conf]
  12. Alan M. Frisch, Ian Miguel, Zeynep Kiziltan, Brahim Hnich, Toby Walsh
    Multiset Ordering Constraints. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:221-226 [Conf]
  13. Zeynep Kiziltan, Pierre Flener, Brahim Hnich
    Towards Inferring Labelling Heuristics for CSP Application Domains. [Citation Graph (0, 0)][DBLP]
    KI/ÖGAI, 2001, pp:275-289 [Conf]
  14. Pierre Flener, Brahim Hnich, Zeynep Kiziltan
    A Meta-heuristic for Subset Problems. [Citation Graph (0, 0)][DBLP]
    PADL, 2001, pp:274-287 [Conf]
  15. Pierre Flener, Brahim Hnich, Zeynep Kiziltan
    Compiling High-Level Type Constructors in Constraint Programming. [Citation Graph (0, 0)][DBLP]
    PADL, 2001, pp:229-244 [Conf]
  16. Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh
    Propagation algorithms for lexicographic ordering constraints. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2006, v:170, n:10, pp:803-834 [Journal]
  17. Zeynep Kiziltan
    Symmetry breaking ordering constraints. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2004, v:17, n:3, pp:167-169 [Journal]
  18. Ivica Crnkovic, Brahim Hnich, Torsten Jonsson, Zeynep Kiziltan
    Specification, implementation, and deployment of components. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 2002, v:45, n:10, pp:35-40 [Journal]
  19. Christian Bessière, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh
    Filtering Algorithms for the NValueConstraint. [Citation Graph (0, 0)][DBLP]
    Constraints, 2006, v:11, n:4, pp:271-293 [Journal]
  20. Zeynep Kiziltan, Andrea Lodi, Michela Milano, Fabio Parisini
    CP-Based Local Branching. [Citation Graph (0, 0)][DBLP]
    CP, 2007, pp:847-855 [Conf]
  21. Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Claude-Guy Quimper, Toby Walsh
    Reformulating Global Constraints: The Slideand RegularConstraints. [Citation Graph (0, 0)][DBLP]
    SARA, 2007, pp:80-92 [Conf]

  22. The Parameterized Complexity of Global Constraints. [Citation Graph (, )][DBLP]


  23. Service-Oriented Volunteer Computing for Massively Parallel Constraint Solving Using Portfolios. [Citation Graph (, )][DBLP]


  24. SLIDE: A Useful Special Case of the CARDPATH Constraint. [Citation Graph (, )][DBLP]


  25. Filtering algorithms for the multiset ordering constraint. [Citation Graph (, )][DBLP]


  26. Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints. [Citation Graph (, )][DBLP]


  27. SLIDE: A Useful Special Case of the CARDPATH Constraint [Citation Graph (, )][DBLP]


  28. Filtering Algorithms for the Multiset Ordering Constraint [Citation Graph (, )][DBLP]


  29. Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints [Citation Graph (, )][DBLP]


  30. The Parameterized Complexity of Global Constraints [Citation Graph (, )][DBLP]


  31. Multiset Ordering Constraints [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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