Cèsar Fernández

According to our database, Cèsar Fernández authored at least 45 papers between 1999 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

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., December, 2026

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, Ivet Rafegas Fonoll, Josep Cirera Balcells

Ann. Oper. Res., March, 2026

2022

New Reasoning Models: Improving Optimisation and Decision Support with the Management of Uncertainty and Constraints.

Aïda Valls, Cèsar Fernández, Mateu Villaret

Int. J. Comput. Intell. Syst., 2022

2018

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, Carles Mateu, Jordi Planes

Pattern Recognit. Lett., 2018

2017

Weighted argumentation for analysis of discussions in Twitter.

Teresa Alsinet, Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes

Int. J. Approx. Reason., 2017

2016

A predictor model for the composting process on an industrial scale based on Markov processes.

Cèsar Fernández, Carles Mateu, Raul Moral, Francina Sole-Mauri

Environ. Model. Softw., 2016

Non existence of some mixed Moore graphs of diameter 2 using SAT.

Nacho López, Josep M. Miret, Cèsar Fernández

Discret. Math., 2016

On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes.

Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes

Ann. Math. Artif. Intell., 2016

Support Analysis of Weighted Discussions in Twitter.

Teresa Alsinet, Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu, Jordi Planes

Proceedings of the Artificial Intelligence Research and Development, 2016

2015

Approximate dynamic programming for automated vacuum waste collection systems.

Cèsar Fernández, Felip Manyà, Carles Mateu, Francina Sole-Mauri

Environ. Model. Softw., 2015

Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers.

Teresa Alsinet, Ramón Béjar, Cèsar Fernández, Francesc Guitart, Carles Mateu

AI Commun., 2015

2014

Modeling energy consumption in automated vacuum waste collection systems.

Cèsar Fernández, Felip Manyà, Carles Mateu, Francina Sole-Mauri

Environ. Model. Softw., 2014

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, Carles Mateu

Constraints An Int. J., 2013

Solving Routing and Wavelength Assignment Problem with Conflict-Driven ASP Solvers.

Ramón Béjar, Cèsar Fernández, Carles Mateu, Francesc Guitart

Proceedings of the Artificial Intelligence Research and Development, 2013

2012

The Sudoku completion problem with rectangular hole pattern is NP-complete.

Ramón Béjar, Cèsar Fernández, Carles Mateu, Magda Valls

Discret. Math., 2012

Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems.

Ramón Béjar, Cèsar Fernández, Felip Manyà, Carles Mateu, Francina Sole-Mauri

Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

The Automated Vacuum Waste Collection Optimization Problem.

Ramón Béjar, Cèsar Fernández, Carles Mateu, Felip Manyà, Francina Sole-Mauri, David Vidal

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Generating highly balanced sudoku problems as hard problems.

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carla P. Gomes, Carles Mateu

J. Heuristics, 2011

Towards an Efficient Use of Resources in All-Optical Networks.

Ramón Béjar, Cèsar Fernández, Francesc Guitart, Carles Mateu

Proceedings of the Artificial Intelligence Research and Development, 2011

On 2SAT-MaxOnes with Unbalanced Polarity: from Easy Problems to Hard MaxClique Problems.

Josep Argelich, Ramón Béjar, Cèsar Fernández, Carles Mateu

Proceedings of the Artificial Intelligence Research and Development, 2011

2010

Solving Pseudo-Boolean Modularity Constraints.

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Francesc Guitart, Carles Mateu

Proceedings of the ECAI 2010, 2010

Encoding Basic Arithmetic Operations for SAT-Solvers.

Ramón Béjar, Cèsar Fernández, Francesc Guitart

Proceedings of the Artificial Intelligence Research and Development, 2010

2009

Bounding the Phase Transition on Edge Matching Puzzles.

Ramón Béjar, Cèsar Fernández, Carles Mateu, Nuria Pascual

Proceedings of the ISMVL 2009, 2009

2008

Hard SAT and CSP instances with Expander Graphs.

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Edge Matching Puzzles as Hard SAT/CSP Benchmarks.

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu

Proceedings of the Principles and Practice of Constraint Programming, 2008

From High Girth Graphs to Hard Instances.

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu

Proceedings of the Principles and Practice of Constraint Programming, 2008

How Hard is a Commercial Puzzle: the Eternity II Challenge.

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu

Proceedings of the Artificial Intelligence Research and Development, 2008

Generating Hard SAT/CSP Instances Using Expander Graphs.

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

Regular-SAT: A many-valued approach to solving combinatorial problems.

Ramón Béjar, Felip Manyà, Alba Cabiscol, Cèsar Fernández, Carla P. Gomes

Discret. Appl. Math., 2007

On Balanced CSPs with High Treewidth.

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

The Impact of Balancing on Problem Hardness in a Highly Structured Domain.

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carla P. Gomes, Carles Mateu

Proceedings of the Proceedings, 2006

2005

Sensor networks and distributed CSP: communication, computation and complexity.

Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bhaskar Krishnamachari, Bart Selman, Magda Valls

Artif. Intell., 2005

Streamlining Local Search for Spatially Balanced Latin Squares.

Casey Smith, Carla P. Gomes, Cèsar Fernández

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Statistical Modelling of CSP Solving Algorithms Performance.

Ramón Béjar, Cèsar Fernández, Carles Mateu

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

Statistical Regimes Across Constrainedness Regions.

Carla P. Gomes, Cèsar Fernández, Bart Selman, Christian Bessiere

Proceedings of the Principles and Practice of Constraint Programming, 2004

Modeling Choices in Quasigroup Completion: SAT vs. CSP.

Carlos Ansótegui, Alvaro del Val, Iván Dotú, Cèsar Fernández, Felip Manyà

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003

On the Complexity of Distributed Self-Configuration in Wireless Networks.

Bhaskar Krishnamachari, Stephen B. Wicker, Ramón Béjar, Cèsar Fernández

Telecommun. Syst., 2003

Automated monitoring of medical protocols: a secure and distributed architecture.

Teresa Alsinet, Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Felip Manyà

Artif. Intell. Medicine, 2003

Grid-based SensorDCSP.

Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bart Selman, Magda Valls

Proceedings of the IJCAI-03, 2003

2002

Communication and Computation in Distributed CSP Algorithms.

Cèsar Fernández, Ramón Béjar, Bhaskar Krishnamachari, Carla P. Gomes

Proceedings of the Principles and Practice of Constraint Programming, 2002

Minimal and Redundant SAT Encodings for the All-Interval-Series Problem.

Teresa Alsinet, Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà

Proceedings of the Topics in Artificial Intelligence, 5th Catalonian Conference on AI, 2002

2001

Extending the Reach of SAT with Many-Valued Logics.

Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes

Electron. Notes Discret. Math., 2001

Capturing Structure with Satisfiability.

Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes

Proceedings of the Principles and Practice of Constraint Programming, 2001

2000

A Multi-agent system architecture for monitoring medical protocols.

Teresa Alsinet, Ramón Béjar, Cèsar Fernández, Felip Manyà

Proceedings of the Fourth International Conference on Autonomous Agents, 2000

1999

Evaluation of Allocation Policies on Hybrid Fiber-Coax Broadband Access Networks for Contention-Type Traffic.

Cèsar Fernández, Sebastià Sallent

Proceedings of the Broadband Communications: Convergence of Network Technologies, 1999