| Publication | Date of Publication | Type |
|---|
| Reducing income variability in natural resource portfolios via integer programming | 2025-11-19 | Paper |
Efficiently approximating high-dimensional Pareto frontiers for tree-structured networks using expansion and compression
Integration of Constraint Programming, Artificial Intelligence, and Operations Research | 2023-10-04 | Paper |
Efficient projection algorithms onto the weighted \(\ell_1\) ball
Artificial Intelligence | 2022-04-11 | Paper |
| Boosting efficiency for computing the Pareto frontier on tree structured networks | 2018-11-21 | Paper |
| An efficient relaxed projection method for constrained non-negative matrix factorization with application to the phase-mapping problem in materials science | 2018-11-21 | Paper |
| In search of balance: the challenge of generating balanced Latin rectangles | 2017-08-04 | Paper |
| Relaxation methods for constrained matrix factorization problems: solving the phase mapping problem in materials discovery | 2017-08-04 | Paper |
| Model counting: a new stategy for obtaining good bounds | 2016-07-26 | Paper |
On the Erdős discrepancy problem
Lecture Notes in Computer Science | 2015-07-21 | Paper |
Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
Annals of Mathematics and Artificial Intelligence | 2014-09-26 | Paper |
Solutions for hard and soft constraints using optimized probabilistic satisfiability
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Wildlife corridors as a connected subgraph problem
Journal of Environmental Economics and Management | 2012-10-25 | Paper |
Upgrading Shortest Paths in Networks
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2011-05-26 | Paper |
Solving Connected Subgraph Problems in Wildlife Conservation
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2010-06-22 | Paper |
Backdoors in the Context of Learning
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Backdoors to Combinatorial Optimization: Feasibility and Optimality
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2009-06-03 | Paper |
A generative power-law search tree model
Computers & Operations Research | 2009-04-03 | Paper |
Short XORs for Model Counting: From Theory to Practice
Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
Connections in Networks: Hardness of Feasibility Versus Optimality
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2009-03-10 | Paper |
Principles and Practice of Constraint Programming – CP 2004
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Principles and Practice of Constraint Programming – CP 2004
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Principles and Practice of Constraint Programming – CP 2004
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Principles and Practice of Constraint Programming – CP 2004
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Tradeoffs in the Complexity of Backdoor Detection
Principles and Practice of Constraint Programming – CP 2007 | 2008-09-02 | Paper |
Sensor networks and distributed CSP: communication, computation and complexity
Artificial Intelligence | 2007-10-23 | Paper |
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
Logical Methods in Computer Science | 2007-10-11 | Paper |
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Regular-SAT: A many-valued approach to solving combinatorial problems
Discrete Applied Mathematics | 2007-08-23 | Paper |
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Statistical regimes across constrainedness regions
Constraints | 2006-11-03 | Paper |
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Lecture Notes in Computer Science | 2005-12-27 | Paper |
| scientific article; zbMATH DE number 2234850 (Why is no real title available?) | 2005-12-02 | Paper |
| scientific article; zbMATH DE number 2159471 (Why is no real title available?) | 2005-04-19 | Paper |
An improved approximation algorithm for the partial Latin square extension problem.
Operations Research Letters | 2005-01-11 | Paper |
Approximations and randomization to boost CSP techniques
Annals of Operations Research | 2004-08-20 | Paper |
| scientific article; zbMATH DE number 2084720 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 2084702 (Why is no real title available?) | 2004-08-09 | Paper |
| scientific article; zbMATH DE number 2063192 (Why is no real title available?) | 2004-03-29 | Paper |
| Heavy-tailed phenomena and satisfiability and constraint satisfaction problems | 2001-10-21 | Paper |
| Balance and filtering in structured satisfiable problems. (Preliminary report) | 2001-09-24 | Paper |
| A Bayesian approach to tackling hard computational problems. (Preliminary report) | 2001-09-24 | Paper |
| Extending the reach of SAT with many-valued logics | 2001-09-24 | Paper |
Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
Journal of Automated Reasoning | 2001-09-03 | Paper |
Algorithm portfolios
Artificial Intelligence | 2001-08-20 | Paper |
