I am a member of Cornflower Project under the supervision of Prof. Meinolf Sellmann.
So far, I have worked on a variety of topics regarding filtering algorithms and search methods in constraint programming, such as;
Same-relation constraint on various constraint graphs
Dialectic search: A new local search meta-heuristic inspired by philosophy
Dichotomic search protocols for constrained optimization
Filtering algorithms for context-free grammar constraints
Supervised by Prof. Meinolf Sellmann at Brown University, USA.
Our methods and algorithms are publicly available in the Cornflower Library.
Grammar Constraints
Serdar Kadioglu and Meinolf Sellmann
Constraints Journal vol. 14, 2009
Same-Relation Constraints
Christopher Jefferson, Serdar Kadioglu, Karen Petrie, Meinolf Sellmann, Stanislav Zivny
Proceedings of the 15th Inter. Conference on the Principles and Practice of Constraint Programming (CP-2009)
Dialectic Search
Serdar Kadioglu and Meinolf Sellmann
Proceedings of the 15th Inter. Conference on the Principles and Practice of Constraint Programming (CP-2009)
Dichotomic Search Protocols for Constrained Optimization
Meinolf Sellmann and Serdar Kadioglu
Proceedings of the 14th Inter. Conference on the Principles and Practice of Constraint Programming (CP-2008)
Nominated for Best Paper Award