Cèsar Fernández

Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: On the hardness of solving edge matching puzzles as SAT or CSP problems. Constraints 18(1): 7-37 (2013)

Ramón Béjar, Cèsar Fernández, Carles Mateu, Magda Valls: The Sudoku completion problem with rectangular hole pattern is NP-complete. Discrete Mathematics 312(22): 3306-3315 (2012)

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

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

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

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

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

Cèsar Fernández, Hector Geffner, Felip Manyà (Eds.): Artificial Intelligence Research and Development - Proceedings of the 14th International Conference of the Catalan Association for Artificial Intelligence, Lleida, Catalonia, Spain, October 26-28, 2011. Frontiers in Artificial Intelligence and Applications 232, IOS Press 2011, isbn 978-1-60750-841-0

Ramón Béjar, Cèsar Fernández, Francesc Guitart: Encoding Basic Arithmetic Operations for SAT-Solvers. CCIA 2010: 239-248

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

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

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

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

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

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

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

Ramón Béjar, Felip Manyà, Alba Cabiscol, Cèsar Fernández, Carla P. Gomes: Regular-SAT: A many-valued approach to solving combinatorial problems. Discrete Applied Mathematics 155(12): 1613-1626 (2007)

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

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

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

Carla P. Gomes, Cèsar Fernández, Bart Selman, Christian Bessière: Statistical Regimes Across Constrainedness Regions. Constraints 10(4): 317-337 (2005)

Ramón Béjar, Cèsar Fernández, Carles Mateu: Statistical Modelling of CSP Solving Algorithms Performance. CP 2005: 861

Casey Smith, Carla P. Gomes, Cèsar Fernández: Streamlining Local Search for Spatially Balanced Latin Squares. IJCAI 2005: 1539-1540

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

Carla P. Gomes, Cèsar Fernández, Bart Selman, Christian Bessière: Statistical Regimes Across Constrainedness Regions. CP 2004: 32-46

Teresa Alsinet, Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Felip Manyà: Automated monitoring of medical protocols: a secure and distributed architecture. Artificial Intelligence in Medicine 27(3): 367-392 (2003)

Bhaskar Krishnamachari, Stephen B. Wicker, Ramón Béjar, Cèsar Fernández: On the Complexity of Distributed Self-Configuration in Wireless Networks. Telecommunication Systems 22(1-4): 33-59 (2003)

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

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

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

Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes: Extending the Reach of SAT with Many-Valued Logics. Electronic Notes in Discrete Mathematics 9: 392-407 (2001)

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

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

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