| Introducing UniCorT: an iterative university course timetabling tool with MaxSAT | 0 | 0.34 | 2022 |
| DeepData: Machine learning in the marine ecosystems | 0 | 0.34 | 2022 |
| Counterfeiting Congestion Control Algorithms | 0 | 0.34 | 2021 |
| FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions. | 0 | 0.34 | 2021 |
| Replication of SOAR: A Synthesis Approach for Data Science API Refactoring | 0 | 0.34 | 2021 |
| Disruptions In Timetables: A Case Study At Universidade De Lisboa | 1 | 0.36 | 2021 |
| SOAR: A Synthesis Approach for Data Science API Refactoring | 0 | 0.34 | 2021 |
| UnchartIt: an interactive framework for program recovery from charts | 0 | 0.34 | 2020 |
| ModRev - Model Revision Tool for Boolean Logical Models of Biological Regulatory Networks. | 0 | 0.34 | 2020 |
| Minimal Perturbation in University Timetabling with Maximum Satisfiability. | 0 | 0.34 | 2020 |
| Repairing Boolean logical models from time-series data using Answer Set Programming. | 0 | 0.34 | 2019 |
| Concurrency Debugging with MaxSMT | 0 | 0.34 | 2019 |
| Virtual machine consolidation using constraint-based multi-objective optimization | 1 | 0.34 | 2019 |
| Integrating Pseudo-Boolean Constraint Reasoning in Multi-Objective Evolutionary Algorithms. | 0 | 0.34 | 2019 |
| Model Revision of Boolean Regulatory Networks at Stable State. | 0 | 0.34 | 2019 |
| Model Revision of Logical Regulatory Networks Using Logic-Based Tools. | 0 | 0.34 | 2018 |
| Enhancing Constraint-Based Multi-Objective Combinatorial Optimization. | 0 | 0.34 | 2018 |
| Multi-Objective Optimization Through Pareto Minimal Correction Subsets. | 0 | 0.34 | 2018 |
| Stable States of Boolean Regulatory Networks Composed Over Hexagonal Grids. | 0 | 0.34 | 2018 |
| Stratification for Constraint-Based Multi-Objective Combinatorial Optimization. | 0 | 0.34 | 2018 |
| Introducing Pareto Minimal Correction Subsets. | 1 | 0.34 | 2017 |
| Non-Portfolio Approaches for Distributed Maximum Satisfiability | 0 | 0.34 | 2016 |
| Deterministic Parallel Maxsat Solving | 0 | 0.34 | 2015 |
| Exploiting Resolution-Based Representations for MaxSAT Solving | 4 | 0.40 | 2015 |
| Improving linear search algorithms with model-based approaches for MaxSAT solving | 0 | 0.34 | 2015 |
| Algorithms for computing backbones of propositional formulae. | 15 | 0.56 | 2015 |
| DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability | 0 | 0.34 | 2015 |
| On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving. | 0 | 0.34 | 2014 |
| Efficient Autarkies. | 0 | 0.34 | 2014 |
| Progression in Maximum Satisfiability. | 11 | 0.48 | 2014 |
| Algorithms for computing minimal equivalent subformulas. | 5 | 0.40 | 2014 |
| Inferring phylogenetic trees using pseudo-Boolean optimization | 2 | 0.36 | 2014 |
| Open-WBO: A Modular MaxSAT Solver, . | 37 | 0.95 | 2014 |
| Community-Based partitioning for MaxSAT solving | 11 | 0.60 | 2013 |
| Parallel search for maximum satisfiability | 4 | 0.40 | 2012 |
| On Partitioning for Maximum Satisfiability. | 5 | 0.45 | 2012 |
| Clause sharing in parallel MaxSAT | 3 | 0.39 | 2012 |
| PackUp: Tools for Package Upgradability Solving. | 8 | 0.54 | 2012 |
| Reasoning over biological networks using maximum satisfiability | 7 | 0.43 | 2012 |
| On computing minimal equivalent subformulas | 12 | 0.57 | 2012 |
| On When and How to use SAT to Mine Frequent Itemsets | 8 | 0.46 | 2012 |
| Satisfiability: where Theory meets Practice (Invited Talk). | 0 | 0.34 | 2012 |
| Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT. | 2 | 0.39 | 2012 |
| Towards efficient MUS extraction | 51 | 1.21 | 2012 |
| An overview of parallel SAT solving | 27 | 0.98 | 2012 |
| Restoring CSP Satisfiability with MaxSAT | 0 | 0.34 | 2011 |
| Exploiting Cardinality Encodings in Parallel Maximum Satisfiability | 4 | 0.43 | 2011 |
| On improving MUS extraction algorithms | 27 | 0.95 | 2011 |
| Haplotype inference with pseudo-Boolean optimization | 11 | 0.62 | 2011 |
| Boolean lexicographic optimization: algorithms & applications | 12 | 0.62 | 2011 |
