Select Publications
Preprints
, 2009, Circuit Complexity and Decompositions of Global Constraints, http://dx.doi.org/10.48550/arxiv.0905.3757
, 2009, Decompositions of All Different, Global Cardinality and Related Constraints, http://dx.doi.org/10.48550/arxiv.0905.3755
, 2009, Multiset Ordering Constraints, http://dx.doi.org/10.48550/arxiv.0905.3769
, 2009, Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques, http://dx.doi.org/10.48550/arxiv.0905.3766
, 2009, Stochastic Constraint Programming: A Scenario-Based Approach, http://dx.doi.org/10.48550/arxiv.0903.1150
, 2009, Tetravex is NP-complete, http://dx.doi.org/10.48550/arxiv.0903.1147
, 2009, The Complexity of Reasoning with Global Constraints, http://dx.doi.org/10.48550/arxiv.0903.1139
, 2009, Online Estimation of SAT Solving Runtime, http://dx.doi.org/10.48550/arxiv.0903.0695
, 2009, Combining Symmetry Breaking and Global Constraints, http://dx.doi.org/10.48550/arxiv.0903.0479
, 2009, Decompositions of Grammar Constraints, http://dx.doi.org/10.48550/arxiv.0903.0470
, 2009, Filtering Algorithms for the Multiset Ordering Constraint, http://dx.doi.org/10.48550/arxiv.0903.0460
, 2009, Reformulating Global Grammar Constraints, http://dx.doi.org/10.48550/arxiv.0903.0475
, 2009, SLIDE: A Useful Special Case of the CARDPATH Constraint, http://dx.doi.org/10.48550/arxiv.0903.0471
, 2009, The Parameterized Complexity of Global Constraints, http://dx.doi.org/10.48550/arxiv.0903.0467
, 2009, Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints, http://dx.doi.org/10.48550/arxiv.0903.0211