| 2009 |
|---|
| 50 | EE | Hubie Chen:
Existentially restricted quantified constraint satisfaction.
Inf. Comput. 207(3): 369-388 (2009) |
| 49 | EE | Manuel Bodirsky,
Hubie Chen,
Jan Kára,
Timo von Oertzen:
Maximal infinite-valued constraint languages.
Theor. Comput. Sci. 410(18): 1684-1693 (2009) |
| 2008 |
|---|
| 48 | EE | Hubie Chen:
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property.
ICALP (2) 2008: 197-208 |
| 47 | | Hubie Chen,
Omer Giménez:
Causal Graphs and Structurally Restricted Planning.
ICAPS 2008: 36-43 |
| 46 | EE | Hubie Chen,
Florent R. Madelaine,
Barnaby Martin:
Quantified Constraints and Containment Problems.
LICS 2008: 317-328 |
| 45 | EE | Manuel Bodirsky,
Hubie Chen:
Peek Arc Consistency
CoRR abs/0809.0788: (2008) |
| 44 | EE | Hubie Chen:
Inverse NP Problems.
Computational Complexity 17(1): 94-118 (2008) |
| 43 | EE | Hubie Chen:
The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case.
SIAM J. Comput. 37(5): 1674-1701 (2008) |
| 2007 |
|---|
| 42 | EE | Manuel Bodirsky,
Hubie Chen:
Qualitative Temporal and Spatial Reasoning Revisited.
CSL 2007: 194-207 |
| 41 | EE | Manuel Bodirsky,
Hubie Chen,
Jan Kára,
Timo von Oertzen:
Maximal Infinite-Valued Constraint Languages.
ICALP 2007: 546-557 |
| 40 | | Hubie Chen,
Omer Giménez:
Act Local, Think Global: Width Notions for Tractable Planning.
ICAPS 2007: 73-80 |
| 39 | EE | Manuel Bodirsky,
Hubie Chen:
Quantified Equality Constraints.
LICS 2007: 203-212 |
| 38 | EE | Andrei A. Bulatov,
Hubie Chen,
Víctor Dalmau:
Learning intersection-closed classes with signatures.
Theor. Comput. Sci. 382(3): 209-220 (2007) |
| 2006 |
|---|
| 37 | EE | Manuel Bodirsky,
Hubie Chen:
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction.
CSL 2006: 197-211 |
| 36 | EE | Hubie Chen,
Martin Grohe:
Constraint Satisfaction with Succinctly Specified Relations.
Complexity of Constraints 2006 |
| 35 | EE | Hubie Chen:
The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
CoRR abs/cs/0607106: (2006) |
| 34 | EE | Hubie Chen:
Logic Column 17: A Rendezvous of Logic, Complexity, and Algebra
CoRR abs/cs/0611018: (2006) |
| 33 | EE | Hubie Chen:
A rendezvous of logic, complexity, and algebra.
SIGACT News 37(4): 85-114 (2006) |
| 2005 |
|---|
| 32 | EE | Hubie Chen,
Víctor Dalmau:
Beyond Hypertree Width: Decomposition Methods Without Decompositions.
CP 2005: 167-181 |
| 31 | EE | Hubie Chen,
Víctor Dalmau:
From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction.
CSL 2005: 232-247 |
| 30 | EE | Hubie Chen:
Parameterized Compilability.
IJCAI 2005: 412-417 |
| 29 | EE | Hubie Chen,
Yannet Interian:
A Model for Generating Random Quantified Boolean Formulas.
IJCAI 2005: 66-71 |
| 28 | EE | Hubie Chen:
Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms.
STACS 2005: 315-326 |
| 27 | EE | Hubie Chen:
The expressive rate of constraints.
Ann. Math. Artif. Intell. 44(4): 341-352 (2005) |
| 26 | EE | Hubie Chen,
Víctor Dalmau:
Beyond Hypertree Width: Decomposition Methods Without Decompositions
CoRR abs/cs/0505035: (2005) |
| 25 | EE | Hubie Chen:
Existentially Restricted Quantified Constraint Satisfaction
CoRR abs/cs/0506059: (2005) |
| 24 | EE | Hubie Chen:
Periodic Constraint Satisfaction Problems: Tractable Subclasses.
Constraints 10(2): 97-113 (2005) |
| 23 | EE | Hubie Chen:
Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms
Electronic Colloquium on Computational Complexity (ECCC)(036): (2005) |
| 2004 |
|---|
| 22 | | Hubie Chen:
Collapsibility and Consistency in Quantified Constraint Satisfaction.
AAAI 2004: 155-160 |
| 21 | EE | Andrei A. Bulatov,
Hubie Chen,
Víctor Dalmau:
Learnability of Relatively Quantified Generalized Formulas.
ALT 2004: 365-379 |
| 20 | EE | Hubie Chen:
The Expressive Rate of Constraints.
AMAI 2004 |
| 19 | EE | Hubie Chen:
Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms.
CP 2004: 168-181 |
| 18 | EE | Hubie Chen,
Víctor Dalmau:
(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability.
CP 2004: 182-196 |
| 17 | EE | Hubie Chen,
Stephen Chong:
Owned Policies for Information Security.
CSFW 2004: 126-138 |
| 16 | | Hubie Chen:
Quantified Constraint Satisfaction and Bounded Treewidth.
ECAI 2004: 161-165 |
| 15 | EE | Hubie Chen,
Martin Pál:
Optimization, Games, and Quantified Constraint Satisfaction.
MFCS 2004: 239-250 |
| 14 | EE | Hubie Chen,
Víctor Dalmau:
Looking Algebraically at Tractable Quantified Boolean Formulas.
SAT 2004 |
| 13 | EE | Hubie Chen,
Víctor Dalmau:
Looking Algebraically at Tractable Quantified Boolean Formulas.
SAT (Selected Papers 2004: 71-79 |
| 12 | EE | Hubie Chen,
Riccardo Pucella:
A Coalgebraic Approach to Kleene Algebra with Tests
CoRR cs.LO/0405097: (2004) |
| 11 | EE | Hubie Chen,
Riccardo Pucella:
A coalgebraic approach to Kleene algebra with tests.
Theor. Comput. Sci. 327(1-2): 23-44 (2004) |
| 2003 |
|---|
| 10 | EE | Hubie Chen:
Periodic Constraint Satisfaction Problems: Polynomial-Time Algorithms.
CP 2003: 199-213 |
| 9 | | Hubie Chen:
Inverse Circumscription.
IJCAI 2003: 449-454 |
| 8 | | Hubie Chen:
A Theory of Average-Case Compilability in Knowledge Representation.
IJCAI 2003: 455-460 |
| 7 | EE | Hubie Chen:
Arithmetic Constant-Depth Circuit Complexity Classes.
MFCS 2003: 328-337 |
| 6 | EE | Hubie Chen:
Inverse NP Problems.
MFCS 2003: 338-347 |
| 5 | EE | Hubie Chen:
An Algorithm for SAT Above the Threshold.
SAT 2003: 14-24 |
| 4 | EE | Hubie Chen,
Riccardo Pucella:
A Coalgebraic Approach to Kleene Algebra with Tests.
Electr. Notes Theor. Comput. Sci. 82(1): (2003) |
| 2001 |
|---|
| 3 | EE | Hubie Chen,
Carla P. Gomes,
Bart Selman:
Formal Models of Heavy-Tailed Behavior in Combinatorial Search.
CP 2001: 408-421 |
| 2 | EE | Hubie Chen:
Polynomial Programs and the Razborov-Smolensky Method
Electronic Colloquium on Computational Complexity (ECCC) 8(067): (2001) |
| 1 | EE | Hubie Chen:
Arithmetic Versions of Constant Depth Circuit Complexity Classes
Electronic Colloquium on Computational Complexity (ECCC)(095): (2001) |
