Evaluation of Allocation Policies on Hybrid Fiber-Coax Broadband Access Networks for Contention-Type Traffic. - Cèsar Fernández 001; Sebastià Sallent (Broadband Communications, 1999)

A Multi-agent system architecture for monitoring medical protocols. - Teresa Alsinet; Ramón Béjar; Cèsar Fernández 001; Felip Manyà (Agents, 2000)

Capturing Structure with Satisfiability. - Ramón Béjar; Alba Cabiscol; Cèsar Fernández 001; Felip Manyà; Carla P. Gomes (CP, 2001)

Extending the Reach of SAT with Many-Valued Logics. - Ramón Béjar; Alba Cabiscol; Cèsar Fernández 001; Felip Manyà; Carla P. Gomes (Electron. Notes Discret. Math., 2001)

Minimal and Redundant SAT Encodings for the All-Interval-Series Problem. - Teresa Alsinet; Ramón Béjar; Alba Cabiscol; Cèsar Fernández 001; Felip Manyà (CCIA, 2002)

Communication and Computation in Distributed CSP Algorithms. - Cèsar Fernández 001; Ramón Béjar; Bhaskar Krishnamachari; Carla P. Gomes (CP, 2002)

Grid-based SensorDCSP. - Ramón Béjar; Carmel Domshlak; Cèsar Fernández 001; Carla P. Gomes; Bart Selman; Magda Valls (IJCAI, 2003)

Automated monitoring of medical protocols: a secure and distributed architecture. - Teresa Alsinet; Carlos Ansótegui; Ramón Béjar; Cèsar Fernández 001; Felip Manyà (Artif. Intell. Medicine, 2003)

On the Complexity of Distributed Self-Configuration in Wireless Networks. - Bhaskar Krishnamachari; Stephen B. Wicker; Ramón Béjar; Cèsar Fernández 001 (Telecommun. Syst., 2003)

Modeling Choices in Quasigroup Completion: SAT vs. CSP. - Carlos Ansótegui; Alvaro del Val; Iván Dotú; Cèsar Fernández 001; Felip Manyà (AAAI, 2004)

Statistical Regimes Across Constrainedness Regions. - Carla P. Gomes; Cèsar Fernández 001; Bart Selman; Christian Bessiere (CP, 2004)

Statistical Modelling of CSP Solving Algorithms Performance. - Ramón Béjar; Cèsar Fernández 001; Carles Mateu (CP, 2005)

Streamlining Local Search for Spatially Balanced Latin Squares. - Casey Smith; Carla P. Gomes; Cèsar Fernández 001 (IJCAI, 2005)

Sensor networks and distributed CSP: communication, computation and complexity. - Ramón Béjar; Carmel Domshlak; Cèsar Fernández 001; Carla P. Gomes; Bhaskar Krishnamachari; Bart Selman; Magda Valls (Artif. Intell., 2005)

The Impact of Balancing on Problem Hardness in a Highly Structured Domain. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández 001; Carla P. Gomes; Carles Mateu (AAAI, 2006)

On Balanced CSPs with High Treewidth. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández 001; Carles Mateu (AAAI, 2007)

Regular-SAT: A many-valued approach to solving combinatorial problems. - Ramón Béjar; Felip Manyà; Alba Cabiscol; Cèsar Fernández 001; Carla P. Gomes (Discret. Appl. Math., 2007)

Generating Hard SAT/CSP Instances Using Expander Graphs. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández 001; Carles Mateu (AAAI, 2008)

How Hard is a Commercial Puzzle: the Eternity II Challenge. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández 001; Carles Mateu (CCIA, 2008)

From High Girth Graphs to Hard Instances. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández 001; Carles Mateu (CP, 2008)

Edge Matching Puzzles as Hard SAT/CSP Benchmarks. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández 001; Carles Mateu (CP, 2008)

Hard SAT and CSP instances with Expander Graphs. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández 001; Carles Mateu (ISAIM, 2008)

Bounding the Phase Transition on Edge Matching Puzzles. - Ramón Béjar; Cèsar Fernández 001; Carles Mateu; Nuria Pascual (ISMVL, 2009)

Encoding Basic Arithmetic Operations for SAT-Solvers. - Ramón Béjar; Cèsar Fernández 001; Francesc Guitart (CCIA, 2010)

Solving Pseudo-Boolean Modularity Constraints. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández 001; Francesc Guitart; Carles Mateu (ECAI, 2010)

On 2SAT-MaxOnes with Unbalanced Polarity: from Easy Problems to Hard MaxClique Problems. - Josep Argelich; Ramón Béjar; Cèsar Fernández 001; Carles Mateu (CCIA, 2011)

Towards an Efficient Use of Resources in All-Optical Networks. - Ramón Béjar; Cèsar Fernández 001; Francesc Guitart; Carles Mateu (CCIA, 2011)

Generating highly balanced sudoku problems as hard problems. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández 001; Carla P. Gomes; Carles Mateu (J. Heuristics, 2011)

The Automated Vacuum Waste Collection Optimization Problem. - Ramón Béjar; Cèsar Fernández 001; Carles Mateu; Felip Manyà; Francina Sole-Mauri; David Vidal (AAAI, 2012)

Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems. - Ramón Béjar; Cèsar Fernández 001; Felip Manyà; Carles Mateu; Francina Sole-Mauri (ICTAI, 2012)

The Sudoku completion problem with rectangular hole pattern is NP-complete. - Ramón Béjar; Cèsar Fernández 001; Carles Mateu; Magda Valls (Discret. Math., 2012)

Solving Routing and Wavelength Assignment Problem with Conflict-Driven ASP Solvers. - Ramón Béjar; Cèsar Fernández 001; Carles Mateu; Francesc Guitart (CCIA, 2013)

On the hardness of solving edge matching puzzles as SAT or CSP problems. - Carlos Ansótegui; Ramón Béjar; Cèsar Fernández 001; Carles Mateu (Constraints An Int. J., 2013)

Modeling energy consumption in automated vacuum waste collection systems. - Cèsar Fernández 001; Felip Manyà; Carles Mateu; Francina Sole-Mauri (Environ. Model. Softw., 2014)

Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers. - Teresa Alsinet; Ramón Béjar; Cèsar Fernández 001; Francesc Guitart; Carles Mateu (AI Commun., 2015)

Approximate dynamic programming for automated vacuum waste collection systems. - Cèsar Fernández 001; Felip Manyà; Carles Mateu; Francina Sole-Mauri (Environ. Model. Softw., 2015)

Support Analysis of Weighted Discussions in Twitter. - Teresa Alsinet; Josep Argelich; Ramón Béjar; Cèsar Fernández 001; Carles Mateu; Jordi Planes (CCIA, 2016)

On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes. - Josep Argelich; Ramón Béjar; Cèsar Fernández 001; Carles Mateu; Jordi Planes (Ann. Math. Artif. Intell., 2016)

Non existence of some mixed Moore graphs of diameter 2 using SAT. - Nacho López; Josep M. Miret; Cèsar Fernández 001 (Discret. Math., 2016)

A predictor model for the composting process on an industrial scale based on Markov processes. - Cèsar Fernández 001; Carles Mateu; Raul Moral; Francina Sole-Mauri (Environ. Model. Softw., 2016)

Weighted argumentation for analysis of discussions in Twitter. - Teresa Alsinet; Josep Argelich; Ramón Béjar; Cèsar Fernández 001; Carles Mateu; Jordi Planes (Int. J. Approx. Reason., 2017)

An argumentative approach for discovering relevant opinions in Twitter with probabilistic valued relationships. - Teresa Alsinet; Josep Argelich; Ramón Béjar; Cèsar Fernández 001; Carles Mateu; Jordi Planes (Pattern Recognit. Lett., 2018)

New Reasoning Models: Improving Optimisation and Decision Support with the Management of Uncertainty and Constraints. - Aïda Valls; Cèsar Fernández 001; Mateu Villaret (Int. J. Comput. Intell. Syst., 2022)

Modelling and optimising switching on a physical binary sorter. - Josep Maria Salvia Hornos; Cèsar Fernández Camón; Carles Mateu Piñol; João Marques-Silva 001; Ivet Rafegas Fonoll; Josep Cirera Balcells (Ann. Oper. Res., 2026)

Synthetic data through combinatorial optimization of pairwise probabilities. - Josep Maria Salvia Hornos; Cèsar Fernández Camón; Carles Mateu Piñol (Int. J. Data Sci. Anal., 2026)