| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| 4 |      | Calin Anton: An Improved Satisfiable SAT Generator Based on Random Subgraph Isomorphism. Canadian Conference on AI 2011: 44-49 |
| 2010 | ||
| 3 | | Calin Anton, Christopher Neal: Notes on Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism. Canadian Conference on AI 2010: 315-318 |
| 2009 | ||
| 2 | | Calin Anton, Lane Olson: Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism. Canadian Conference on AI 2009: 16-26 |
| 2005 | ||
| 1 | | Joseph C. Culberson, Yong Gao, Calin Anton: Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search. IJCAI 2005: 78-83 |
| 1 | Joseph C. Culberson | [1] |
| 2 | Yong Gao | [1] |
| 3 | Christopher Neal | [3] |
| 4 | Lane Olson | [2] |
Colors in the list of coauthors
Last update Sat May 26 04:23:17 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page