Approximate Constrained Subgraph Matching. - Stéphane Zampelli; Yves Deville; Pierre Dupont (CP, 2005)

Filtering for Subgraph Isomorphism. - Stéphane Zampelli; Yves Deville; Christine Solnon; Sébastien Sorlin; Pierre Dupont (CP, 2007)

Combining Two Structured Domains for Modeling Various Graph Matching Problems. - Yves Deville; Grégoire Dooms; Stéphane Zampelli (CSCLP, 2007)

Decomposition Techniques for Subgraph Matching - Stéphane Zampelli; Martin Mann; Yves Deville; Rolf Backofen (CoRR, 2008)

A constraint programming approach to subgraph isomorphism. - Stéphane Zampelli (2008)

Six Ways of Integrating Symmetries within Non-overlapping Constraints. - Magnus Ågren 002; Nicolas Beldiceanu; Mats Carlsson; Mohamed Sbihi; Charlotte Truchet; Stéphane Zampelli (CPAIOR, 2009)

Solving subgraph isomorphism problems with constraint programming. - Stéphane Zampelli; Yves Deville; Christine Solnon (Constraints An Int. J., 2010)

The Berth Allocation and Quay Crane Assignment Problem Using a CP Approach. - Stéphane Zampelli; Yannis Vergados; Rowan Van Schaeren; Wout Dullaert; Birger Raa (CP, 2013)

A Declarative Paradigm for Robust Cumulative Scheduling. - Alban Derrien; Thierry Petit; Stéphane Zampelli (CP, 2014)

Dynamic Sweep Filtering Algorithm for FlexC. - Alban Derrien; Thierry Petit; Stéphane Zampelli (CoRR, 2014)