 | 2012 |
| 31 |  | Mikolás Janota,
Inês Lynce,
Vasco M. Manquinho,
João Marques-Silva:
PackUp: Tools for Package Upgradability Solving.
JSAT 8(1/2): 89-94 (2012) |
| 2011 |
| 30 |  | Ruben Martins,
Vasco M. Manquinho,
Inês Lynce:
Exploiting Cardinality Encodings in Parallel Maximum Satisfiability.
ICTAI 2011: 313-320 |
| 2010 |
| 29 |  | Ruben Martins,
Vasco M. Manquinho,
Inês Lynce:
Improving Search Space Splitting for Parallel SAT Solving.
ICTAI (1) 2010: 336-343 |
| 28 |  | Vasco M. Manquinho,
Ruben Martins,
Inês Lynce:
Improving Unsatisfiability-Based Algorithms for Boolean Optimization.
SAT 2010: 181-193 |
| 27 |  | Nuno P. Lopes,
Levent Aksoy,
Vasco M. Manquinho,
José Monteiro:
Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability
CoRR abs/1011.2685: (2010) |
| 26 |  | Wei-Chung Kao,
Wei-Shun Chuang,
Shiu-Ting Lin,
Chien-Mo James Li,
Vasco M. Manquinho:
DFT and Minimum Leakage Pattern Generation for Static Power Reduction During Test and Burn-In.
IEEE Trans. VLSI Syst. 18(3): 392-400 (2010) |
| 2009 |
| 25 |  | João Delgado,
Inês Lynce,
Vasco M. Manquinho:
Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes Using Pseudo-Boolean Optimization.
RECOMB-CG 2009: 138-149 |
| 24 |  | Vasco M. Manquinho,
João P. Marques Silva,
Jordi Planes:
Algorithms for Weighted Boolean Optimization.
SAT 2009: 495-508 |
| 23 |  | Olivier Roussel,
Vasco M. Manquinho:
Pseudo-Boolean and Cardinality Constraints.
Handbook of Satisfiability 2009: 695-733 |
| 22 |  | Vasco M. Manquinho,
João P. Marques Silva,
Jordi Planes:
Algorithms for Weighted Boolean Optimization
CoRR abs/0903.0843: (2009) |
| 2008 |
| 21 |  | Federico Heras,
Vasco M. Manquinho,
João Marques-Silva:
On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization.
FLAIRS Conference 2008: 71-76 |
| 20 |  | João Marques-Silva,
Inês Lynce,
Vasco M. Manquinho:
Symmetry Breaking for Maximum Satisfiability.
LPAR 2008: 1-15 |
| 19 |  | José Faustino Fragoso Femenin dos Santos,
Vasco M. Manquinho:
Learning Techniques for Pseudo-Boolean Solving.
LPAR Workshops 2008 |
| 18 |  | João Marques-Silva,
Vasco M. Manquinho:
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms.
SAT 2008: 225-230 |
| 17 |  | Inês Lynce,
Vasco M. Manquinho,
João Marques-Silva:
Backtracking.
Wiley Encyclopedia of Computer Science and Engineering 2008 |
| 16 |  | João Marques-Silva,
Inês Lynce,
Vasco M. Manquinho:
Symmetry Breaking for Maximum Satisfiability
CoRR abs/0804.0599: (2008) |
| 15 |  | Ewald Speckenmeyer,
Armando Tacchella,
Vasco M. Manquinho,
Chu Min Li:
Guest Editors Conclusion.
JSAT 4(2-4): (2008) |
| 2006 |
| 14 |  | António Morgado,
Paulo J. Matos,
Vasco M. Manquinho,
João P. Marques Silva:
Counting Models in Integer Domains.
SAT 2006: 410-423 |
| 13 |  | Vasco M. Manquinho,
Olivier Roussel:
The First Evaluation of Pseudo-Boolean Solvers (PB'05).
JSAT 2(1-4): 103-143 (2006) |
| 12 |  | Vasco M. Manquinho,
João P. Marques Silva:
On Using Cutting Planes in Pseudo-Boolean Optimization.
JSAT 2(1-4): 209-219 (2006) |
| 2005 |
| 11 |  | Vasco M. Manquinho,
João P. Marques Silva:
Effective Lower Bounding Techniques for Pseudo-Boolean Optimization.
DATE 2005: 660-665 |
| 10 |  | Vasco M. Manquinho,
João P. Marques Silva:
Satisfiability-Based Algorithms for Pseudo-Boolean Optimization Using Gomory Cuts and Search Restarts.
ICTAI 2005: 150-155 |
| 9 |  | Vasco M. Manquinho,
João P. Marques Silva:
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization.
SAT 2005: 451-458 |
| 2004 |
| 8 |  | Vasco M. Manquinho,
João P. Marques Silva:
Integration of Lower Bound Estimates in Pseudo-Boolean Optimization.
ICTAI 2004: 742-748 |
| 7 |  | Vasco M. Manquinho,
João P. Marques Silva:
Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization.
SAT 2004 |
| 6 |  | Vasco M. Manquinho,
João P. Marques Silva:
Satisfiability-Based Algorithms for Boolean Optimization.
Ann. Math. Artif. Intell. 40(3-4): 353-372 (2004) |
| 2002 |
| 5 |  | Vasco M. Manquinho,
João P. Marques Silva:
Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem.
IEEE Trans. on CAD of Integrated Circuits and Systems 21(5): 505-516 (2002) |
| 2000 |
| 4 |  | Vasco M. Manquinho,
João P. Marques Silva:
On Solving Boolean Optimization with Satisfiability-Based Algorithms.
AMAI 2000 |
| 3 |  | Vasco M. Manquinho,
João P. Marques Silva:
On Using Satisfiability-Based Pruning Techniques in Covering Algorithms.
DATE 2000: 356-363 |
| 2 |  | Vasco M. Manquinho,
João P. Marques Silva:
Search Pruning Conditions for Boolean Optimization.
ECAI 2000: 103-107 |
| 1997 |
| 1 |  | Vasco M. Manquinho,
Paulo F. Flores,
João P. Marques Silva,
Arlindo L. Oliveira:
Prime Implicant Computation Using Satisfiability Algorithms.
ICTAI 1997: 232-239 |