Carlos Anstegui
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
48
Venues
10
Active years
2002–2025
Best venue rank
A*
Where they publish
Papers
48 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | ICCS | Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach. | Carlos Anstegui, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia |
| 2024 | ICCS | Implementing 3-SAT Gadgets for Quantum Annealers with Random Instances. | Pol Rodrguez-Farrs, Rocco Ballester, Carlos Anstegui, Jordi Levy, Jess Cerquides |
| 2023 | CP | Exploiting Configurations of MaxSAT Solvers. | Josep Als, Carlos Anstegui, Josep M. Salvia, Eduard Torres |
| 2022 | SAT | OptiLog V2: Model, Solve, Tune and Run. | Josep Alos, Carlos Anstegui, Josep M. Salvia, Eduard Torres |
| 2021 | CP | Building High Strength Mixed Covering Arrays with Constraints. | Carlos Anstegui, Jesus Ojeda, Eduard Torres |
| 2021 | IJCAI | Reducing SAT to Max2SAT. | Carlos Anstegui, Jordi Levy |
| 2021 | SAT | OptiLog: A Framework for SAT-based Systems. | Carlos Anstegui, Jesus Ojeda, Antnio Pacheco, Josep Pon, Josep M. Salvia, Eduard Torres |
| 2021 | SAT | PyDGGA: Distributed GGA for Automatic Configuration. | Carlos Anstegui, Josep Pon, Meinolf Sellmann, Kevin Tierney |
| 2019 | CP | Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. | Carlos Anstegui, Miquel Bofill, Jordi Coll, Nguyen Dang, Juan Luis Esteban, Ian Miguel, Peter Nightingale, Andrs Z. Salamon, Josep Suy, Mateu Villaret |
| 2018 | AIES | Exploiting Moral Values to Choose the Right Norms. | Marc Serramia, Maite Lpez-Snchez, Juan A. Rodrguez-Aguilar, Javier Morales, Michael J. Wooldridge, Carlos Anstegui |
| 2018 | CP | Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse. | Carlos Anstegui, Meinolf Sellmann, Kevin Tierney |
| 2017 | AAAI | Reactive Dialectic Search Portfolios for MaxSAT. | Carlos Anstegui, Josep Pon, Meinolf Sellmann, Kevin Tierney |
| 2015 | IJCAI | Exploiting the Structure of Unsatisfiable Cores in MaxSAT. | Carlos Anstegui, Frdric Didier, Joel Gabs |
| 2015 | IJCAI | Model-Based Genetic Algorithms for Algorithm Configuration. | Carlos Anstegui, Yuri Malitsky, Horst Samulowitz, Meinolf Sellmann, Kevin Tierney |
| 2015 | SAT | Using Community Structure to Detect Relevant Learnt Clauses. | Carlos Anstegui, Jess Girldez-Cru, Jordi Levy, Laurent Simon |
| 2014 | AAAI | MaxSAT by Improved Instance-Specific Algorithm Configuration. | Carlos Anstegui, Yuri Malitsky, Meinolf Sellmann |
| 2014 | CADE | The Fractal Dimension of SAT Formulas. | Carlos Anstegui, Maria Luisa Bonet, Jess Girldez-Cru, Jordi Levy |
| 2013 | CP | Improving WPM2 for (Weighted) Partial MaxSAT. | Carlos Anstegui, Maria Luisa Bonet, Joel Gabs, Jordi Levy |
| 2013 | CPAIOR | Solving (Weighted) Partial MaxSAT with ILP. | Carlos Anstegui, Joel Gabs |
| 2012 | CP | Improving SAT-Based Weighted MaxSAT Solvers. | Carlos Anstegui, Maria Luisa Bonet, Joel Gabs, Jordi Levy |
| 2012 | SAT | The Community Structure of SAT Formulas. | Carlos Anstegui, Jess Girldez-Cru, Jordi Levy |
| 2010 | AAAI | A New Algorithm for Weighted Partial MaxSAT. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy |
| 2010 | ECAI | Solving Pseudo-Boolean Modularity Constraints. | Carlos Anstegui, Ramn Bjar, Csar Fernndez, Francesc Guitart, Carles Mateu |
| 2010 | SAT | On Solving MaxSAT Through SAT. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy |
| 2009 | CP | On the Structure of Industrial SAT Instances. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy |
| 2009 | CP | A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. | Carlos Anstegui, Meinolf Sellmann, Kevin Tierney |
| 2009 | IJCAI | Towards Industrial-Like Random SAT Instances. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy |
| 2009 | SAT | Solving (Weighted) Partial MaxSAT through Satisfiability Testing. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy |
| 2008 | AAAI | Generating Hard SAT/CSP Instances Using Expander Graphs. | Carlos Anstegui, Ramn Bjar, Csar Fernndez, Carles Mateu |
| 2008 | AAAI | Measuring the Hardness of SAT Instances. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy, Felip Many |
| 2008 | CP | From High Girth Graphs to Hard Instances. | Carlos Anstegui, Ramn Bjar, Csar Fernndez, Carles Mateu |
| 2008 | CP | Edge Matching Puzzles as Hard SAT/CSP Benchmarks. | Carlos Anstegui, Ramn Bjar, Csar Fernndez, Carles Mateu |
| 2008 | ISAIM | Hard SAT and CSP instances with Expander Graphs. | Carlos Anstegui, Ramn Bjar, Csar Fernndez, Carles Mateu |
| 2007 | AAAI | On Balanced CSPs with High Treewidth. | Carlos Anstegui, Ramn Bjar, Csar Fernndez, Carles Mateu |
| 2007 | AAAI | Inference Rules for High-Order Consistency in Weighted CSP. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy, Felip Many |
| 2007 | IJCAI | The Logic Behind Weighted CSP. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy, Felip Many |
| 2007 | SAT | Mapping CSP into Many-Valued SAT. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy, Felip Many |
| 2006 | AAAI | The Impact of Balancing on Problem Hardness in a Highly Structured Domain. | Carlos Anstegui, Ramn Bjar, Csar Fernndez, Carla P. Gomes, Carles Mateu |
| 2006 | AAAI | Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts. | Meinolf Sellmann, Carlos Anstegui |
| 2006 | CP | Boosting Open CSPs. | Santiago Macho Gonzlez, Carlos Anstegui, Pedro Meseguer |
| 2006 | SAT | QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. | Ashish Sabharwal, Carlos Anstegui, Carla P. Gomes, Justin W. Hart, Bart Selman |
| 2005 | AAAI | The Achilles' Heel of QBF. | Carlos Anstegui, Carla P. Gomes, Bart Selman |
| 2004 | AAAI | Modeling Choices in Quasigroup Completion: SAT vs. CSP. | Carlos Anstegui, Alvaro del Val, Ivn Dot, Csar Fernndez, Felip Many |
| 2004 | SAT | Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. | Carlos Anstegui, Felip Many |
| 2004 | SAT | Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. | Carlos Anstegui, Felip Many |
| 2003 | CP | A New Approach to Solving SAT-Encoded Binary CSPs. | Carlos Anstegui |
| 2003 | CP | Boosting Chaff's Performance by Incorporating CSP Heuristics. | Carlos Anstegui, Jose Larrubia, Felip Many |
| 2002 | CP | Bridging the Gap between SAT and CSP. | Carlos Anstegui, Felip Many |