Cèsar Fernández

	2011
30		Cèsar Fernández, Hector Geffner, Felip Manyà: 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 IOS Press 2011
29		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
28		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
27		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)
	2010
26		Ramón Béjar, Cèsar Fernández, Francesc Guitart: Encoding Basic Arithmetic Operations for SAT-Solvers. CCIA 2010: 239-248
25		Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Francesc Guitart, Carles Mateu: Solving Pseudo-Boolean Modularity Constraints. ECAI 2010: 867-872
	2009
24		Ramón Béjar, Cèsar Fernández, Carles Mateu, Nuria Pascual: Bounding the Phase Transition on Edge Matching Puzzles. ISMVL 2009: 80-85
	2008
23		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
22		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
21		Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: From High Girth Graphs to Hard Instances. CP 2008: 298-312
20		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
19		Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: Hard SAT and CSP instances with Expander Graphs. ISAIM 2008
	2007
18		Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu: On Balanced CSPs with High Treewidth. AAAI 2007: 161-166
17		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)
	2006
16		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
	2005
15		Ramón Béjar, Cèsar Fernández, Carles Mateu: Statistical Modelling of CSP Solving Algorithms Performance. CP 2005: 861
14		Casey Smith, Carla P. Gomes, Cèsar Fernández: Streamlining Local Search for Spatially Balanced Latin Squares. IJCAI 2005: 1539-1540
13		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)
12		Carla P. Gomes, Cèsar Fernández, Bart Selman, Christian Bessière: Statistical Regimes Across Constrainedness Regions. Constraints 10(4): 317-337 (2005)
	2004
11		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
10		Carla P. Gomes, Cèsar Fernández, Bart Selman, Christian Bessière: Statistical Regimes Across Constrainedness Regions. CP 2004: 32-46
	2003
9		Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bart Selman, Magda Valls: Grid-based SensorDCSP. IJCAI 2003: 1359-1361
8		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)
7		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)
	2002
6		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
5		Cèsar Fernández, Ramón Béjar, Bhaskar Krishnamachari, Carla P. Gomes: Communication and Computation in Distributed CSP Algorithms. CP 2002: 664-679
	2001
4		Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes: Capturing Structure with Satisfiability. CP 2001: 137-152
3		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)
	2000
2		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
	1999
1		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

Coauthor Index

1	Teresa Alsinet	[2] [6] [8]
2	Carlos Ansótegui	[8] [11] [16] [18] [19] [20] [21] [22] [23] [25] [27]
3	Josep Argelich	[29]
4	Ramón Béjar	[2] [3] [4] [5] [6] [7] [8] [9] [13] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29]
5	Christian Bessiere (Christian Bessière)	[10] [12]
6	Alba Cabiscol	[3] [4] [6] [17]
7	Carmel Domshlak	[9] [13]
8	Iván Dotú (Iván Javier Dotú Rodríguez)	[11]
9	Hector Geffner	[30]
10	Carla P. Gomes	[3] [4] [5] [9] [10] [12] [13] [14] [16] [17] [27]
11	Francesc Guitart	[25] [26] [28]
12	Bhaskar Krishnamachari	[5] [7] [13]
13	Felip Manyà	[2] [3] [4] [6] [8] [11] [17] [30]
14	Carles Mateu	[15] [16] [18] [19] [20] [21] [22] [23] [24] [25] [27] [28] [29]
15	Nuria Pascual	[24]
16	Sebastià Sallent (Sebastià Sallent Ribes)	[1]
17	Bart Selman	[9] [10] [12] [13]
18	Casey Smith	[14]
19	Alvaro del Val	[11]
20	Magda Valls	[9] [13]
21	Stephen B. Wicker	[7]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page