Hubie Chen - RankMe

140 papers A* 22A 13B 12C 2Journal 78Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time. CoRR Mahmoud Abo Khamis, Hubie Chen
2024	J	`jnl`	Algebraic Global Gadgetry for Surjective Constraint Satisfaction. Comput. Complex. Hubie Chen
2024	J	`jnl`	Intermediate Relation Size Bounds for Select-Project-Join Query Plans: Asymptotically Tight Characterizations. CoRR Hubie Chen, Markus Schneider
2024	A	`conf`	Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. ICDT Hubie Chen, Stefan Mengel
2024	J	`jnl`	Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. CoRR Hubie Chen, Stefan Mengel
2023	J	`jnl`	Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability. CoRR Hubie Chen, Gianluigi Greco, Stefan Mengel, Francesco Scarcello
2023	J	`jnl`	Sparsification Lower Bounds for List ACM Trans. Comput. Theory Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
2021	J	`jnl`	Tractability of Quantified Temporal Constraints To The Max. CoRR Manuel Bodirsky, Hubie Chen, Michal Wrona
2020	J	`jnl`	Algebraic Global Gadgetry for Surjective Constraint Satisfaction. CoRR Hubie Chen
2020	J	`jnl`	Best-Case and Worst-Case Sparsifiability of Boolean CSPs. Algorithmica Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
2020	A*	`conf`	Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. IJCAI Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler
2020	J	`jnl`	Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. CoRR Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler
2020	B	`conf`	Sparsification Lower Bounds for List H-Coloring. ISAAC Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
2020	J	`jnl`	Sparsification Lower Bounds for List H-Coloring. CoRR Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
2019	A*	`conf`	Compiling Existential Positive Queries to Bounded-Variable Fragments. PODS Christoph Berkholz, Hubie Chen
2019	J	`jnl`	Constant-Query Testability of Assignments to Constraint Satisfaction Problems. SIAM J. Comput. Hubie Chen, Matt Valeriote, Yuichi Yoshida
2019	J	`jnl`	How Many Variables are Needed to Express an Existential Positive Query? Theory Comput. Syst. Simone Bova, Hubie Chen
2019	J	`jnl`	Learnability of Solutions to Conjunctive Queries. J. Mach. Learn. Res. Hubie Chen, Matthew Valeriote
2019	A*	`conf`	Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory. PODS Hubie Chen, Yuichi Yoshida
2019	B	`conf`	The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. WG Hubie Chen, Radu Curticapean, Holger Dell
2019	A*	`conf`	The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems. PODS Hubie Chen
2018	B	`conf`	Best-Case and Worst-Case Sparsifiability of Boolean CSPs. IPEC Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
2018	J	`jnl`	Best-case and Worst-case Sparsifiability of Boolean CSPs. CoRR Hubie Chen, Bart M. P. Jansen, Astrid Pieterse
2018	—	`conf`	The Computational Complexity of Distinctive Feature Minimization in Phonology. NAACL-HLT (2) Hubie Chen, Mans Hulden
2017	J	`jnl`	Asking the Metaquestions in Constraint Tractability. ACM Trans. Comput. Theory Hubie Chen, Benoît Larose
2017	J	`jnl`	Homomorphisms are indeed a good basis for counting: Three fixed-template dichotomy theorems, for the price of one. CoRR Hubie Chen
2017	A	`conf`	How Many Variables Are Needed to Express an Existential Positive Query?. ICDT Simone Bova, Hubie Chen
2017	J	`jnl`	One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries. ACM Trans. Comput. Log. Hubie Chen, Moritz Müller
2017	J	`jnl`	Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. ACM Trans. Comput. Theory Hubie Chen
2017	J	`jnl`	The Parameterized Space Complexity of Embedding Along a Path. Theory Comput. Syst. Hubie Chen, Moritz Müller
2017	J	`jnl`	The Tractability Frontier of Graph-Like First-Order Query Sets. J. ACM Hubie Chen
2017	A*	`conf`	The logic of counting query answers. LICS Hubie Chen, Stefan Mengel
2016	J	`jnl`	Asking the metaquestions in constraint tractability. CoRR Hubie Chen, Benoît Larose
2016	A*	`conf`	Counting Answers to Existential Positive Queries: A Complexity Classification. PODS Hubie Chen, Stefan Mengel
2016	J	`jnl`	Counting Answers to Existential Positive Queries: A Complexity Classification. CoRR Hubie Chen, Stefan Mengel
2016	J	`jnl`	Decomposing Quantified Conjunctive (or Disjunctive) Formulas. SIAM J. Comput. Hubie Chen, Víctor Dalmau
2016	A*	`conf`	Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. ICALP Hubie Chen
2016	B	`conf`	Quantified Constraint Satisfaction on Monoids. CSL Hubie Chen, Peter Mayr
2016	A*	`conf`	Testing Assignments to Constraint Satisfaction Problems. FOCS Hubie Chen, Matthew Valeriote, Yuichi Yoshida
2016	J	`jnl`	Testing Assignments to Constraint Satisfaction Problems. CoRR Hubie Chen, Matthew Valeriote, Yuichi Yoshida
2016	J	`jnl`	The parameterized space complexity of embedding along a path. CoRR Hubie Chen, Moritz Müller
2015	A	`conf`	A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. ICDT Hubie Chen, Stefan Mengel
2015	A*	`conf`	Learnability of Solutions to Conjunctive Queries: The Full Dichotomy. COLT Hubie Chen, Matthew Valeriote
2015	B	`conf`	Parameter Compilation. IPEC Hubie Chen
2015	J	`jnl`	Parameter Compilation. CoRR Hubie Chen
2015	J	`jnl`	Quantified Constraints and Containment Problems. Log. Methods Comput. Sci. Hubie Chen, Florent R. Madelaine, Barnaby Martin
2015	J	`jnl`	The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space. ACM Trans. Comput. Theory Hubie Chen, Moritz Müller
2015	J	`jnl`	The Logic of Counting Query Answers: A Study via Existential Positive Queries. CoRR Hubie Chen, Stefan Mengel
2015	J	`jnl`	The complexity of equivalence, entailment, and minimization in existential positive logic. J. Comput. Syst. Sci. Simone Bova, Hubie Chen
2014	J	`jnl`	A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. CoRR Hubie Chen, Stefan Mengel
2014	J	`jnl`	An Algebraic Hardness Criterion for Surjective Constraint Satisfaction. CoRR Hubie Chen
2014	J	`jnl`	Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction. Log. Methods Comput. Sci. Hubie Chen
2014	J	`jnl`	On the complexity of existential positive queries. ACM Trans. Comput. Log. Hubie Chen
2014	—	`conf`	One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries. CSL-LICS Hubie Chen, Moritz Müller
2014	J	`jnl`	Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. CoRR Hubie Chen
2014	A	`conf`	The Complexity of Width Minimization for Existential Positive Queries. ICDT Simone Bova, Hubie Chen
2014	J	`jnl`	The Tractability Frontier of Graph-Like First-Order Query Sets. CoRR Hubie Chen
2014	—	`conf`	The tractability frontier of graph-like first-order query sets. CSL-LICS Hubie Chen
2014	J	`jnl`	Tractability of quantified temporal constraints to the max. Int. J. Algebra Comput. Manuel Bodirsky, Hubie Chen, Michal Wrona
2013	J	`jnl`	Arc consistency and friends. J. Log. Comput. Hubie Chen, Víctor Dalmau, Berit Grußien
2013	—	`conf`	Block-Sorted Quantified Conjunctive Queries. ICALP (2) Hubie Chen, Dániel Marx
2013	J	`jnl`	Bounded rationality, strategy simplification, and equilibrium. Int. J. Game Theory Hubie Chen
2013	J	`jnl`	Generic expression hardness results for primitive positive formula comparison. Inf. Comput. Simone Bova, Hubie Chen, Matthew Valeriote
2013	J	`jnl`	One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries. CoRR Hubie Chen, Moritz Müller
2013	J	`jnl`	The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity. CoRR Hubie Chen, Moritz Müller
2013	A*	`conf`	The fine classification of conjunctive queries and parameterized logarithmic space complexity. PODS Hubie Chen, Moritz Müller
2012	J	`jnl`	An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction Log. Methods Comput. Sci. Hubie Chen, Moritz Müller
2012	A*	`conf`	An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction. LICS Hubie Chen, Moritz Müller
2012	A*	`conf`	Decomposing Quantified Conjunctive (or Disjunctive) Formulas. LICS Hubie Chen, Víctor Dalmau
2012	J	`jnl`	Generic Expression Hardness Results for Primitive Positive Formula Comparison CoRR Simone Bova, Hubie Chen, Matthew Valeriote
2012	C	`conf`	Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction. TIME Hubie Chen, Michal Wrona
2012	J	`jnl`	Meditations on Quantified Constraint Satisfaction CoRR Hubie Chen
2012	—	`conf`	Meditations on Quantified Constraint Satisfaction. Logic and Program Semantics Hubie Chen
2012	J	`jnl`	On the Complexity of Existential Positive Queries CoRR Hubie Chen
2012	J	`jnl`	On the Complexity of MMSNP. SIAM J. Discret. Math. Manuel Bodirsky, Hubie Chen, Tomás Feder
2012	J	`jnl`	On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. Theory Comput. Syst. Simone Bova, Hubie Chen, Matthew Valeriote
2011	J	`jnl`	Arc Consistency and Friends CoRR Hubie Chen, Víctor Dalmau, Berit Grußien
2011	—	`conf`	Generic Expression Hardness Results for Primitive Positive Formula Comparison. ICALP (2) Simone Bova, Hubie Chen, Matthew Valeriote
2010	J	`jnl`	Bounded Rationality, Strategy Simplification, and Equilibrium CoRR Hubie Chen
2010	J	`jnl`	Causal graphs and structurally restricted planning. J. Comput. Syst. Sci. Hubie Chen, Omer Giménez
2010	J	`jnl`	Constraint satisfaction with succinctly specified relations. J. Comput. Syst. Sci. Hubie Chen, Martin Grohe
2010	J	`jnl`	Peek arc consistency. Theor. Comput. Sci. Manuel Bodirsky, Hubie Chen
2010	J	`jnl`	Quantified Equality Constraints. SIAM J. Comput. Manuel Bodirsky, Hubie Chen
2010	J	`jnl`	The reducts of equality up to primitive positive interdefinability. J. Symb. Log. Manuel Bodirsky, Hubie Chen, Michael Pinsker
2009	J	`jnl`	A rendezvous of logic, complexity, and algebra. ACM Comput. Surv. Hubie Chen
2009	J	`jnl`	Existentially restricted quantified constraint satisfaction. Inf. Comput. Hubie Chen
2009	J	`jnl`	Maximal infinite-valued constraint languages. Theor. Comput. Sci. Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
2009	—	`conf`	On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. The Constraint Satisfaction Problem: Complexity and Approximability Matthew Valeriote, Simone Bova, Hubie Chen
2009	C	`conf`	On-the-Fly Macros. WoLLIC Hubie Chen, Omer Giménez
2009	J	`jnl`	Qualitative Temporal and Spatial Reasoning Revisited. J. Log. Comput. Manuel Bodirsky, Hubie Chen
2009	J	`jnl`	Relatively quantified constraint satisfaction. Constraints An Int. J. Manuel Bodirsky, Hubie Chen
2009	J	`jnl`	The complexity of constraint satisfaction games and QCSP. Inf. Comput. Ferdinand Börner, Andrei A. Bulatov, Hubie Chen, Peter Jeavons, Andrei A. Krokhin
2008	A*	`conf`	Causal Graphs and Structurally Restricted Planning. ICAPS Hubie Chen, Omer Giménez
2008	J	`jnl`	Inverse NP Problems. Comput. Complex. Hubie Chen
2008	J	`jnl`	Peek Arc Consistency CoRR Manuel Bodirsky, Hubie Chen
2008	—	`conf`	Quantified Constraint Satisfaction and the Polynomially Generated Powers Property. ICALP (2) Hubie Chen
2008	A*	`conf`	Quantified Constraints and Containment Problems. LICS Hubie Chen, Florent R. Madelaine, Barnaby Martin
2008	J	`jnl`	The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case. SIAM J. Comput. Hubie Chen
2007	A*	`conf`	Act Local, Think Global: Width Notions for Tractable Planning. ICAPS Hubie Chen, Omer Giménez
2007	J	`jnl`	Learning intersection-closed classes with signatures. Theor. Comput. Sci. Andrei A. Bulatov, Hubie Chen, Víctor Dalmau
2007	A*	`conf`	Maximal Infinite-Valued Constraint Languages. ICALP Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen
2007	B	`conf`	Qualitative Temporal and Spatial Reasoning Revisited. CSL Manuel Bodirsky, Hubie Chen
2007	A*	`conf`	Quantified Equality Constraints. LICS Manuel Bodirsky, Hubie Chen
2006	J	`jnl`	A rendezvous of logic, complexity, and algebra. SIGACT News Hubie Chen
2006	B	`conf`	Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. CSL Manuel Bodirsky, Hubie Chen
2006	—	`conf`	Constraint Satisfaction with Succinctly Specified Relations. Complexity of Constraints Hubie Chen, Martin Grohe
2006	J	`jnl`	Logic Column 17: A Rendezvous of Logic, Complexity, and Algebra CoRR Hubie Chen
2006	J	`jnl`	The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case CoRR Hubie Chen
2005	A*	`conf`	A Model for Generating Random Quantified Boolean Formulas. IJCAI Hubie Chen, Yannet Interian
2005	J	`jnl`	Beyond Hypertree Width: Decomposition Methods Without Decompositions CoRR Hubie Chen, Víctor Dalmau
2005	A	`conf`	Beyond Hypertree Width: Decomposition Methods Without Decompositions. CP Hubie Chen, Víctor Dalmau
2005	J	`jnl`	Existentially Restricted Quantified Constraint Satisfaction CoRR Hubie Chen
2005	B	`conf`	From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. CSL Hubie Chen, Víctor Dalmau
2005	A*	`conf`	Parameterized Compilability. IJCAI Hubie Chen
2005	J	`jnl`	Periodic Constraint Satisfaction Problems: Tractable Subclasses. Constraints An Int. J. Hubie Chen
2005	J	`jnl`	Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms Electron. Colloquium Comput. Complex. Hubie Chen
2005	A	`conf`	Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms. STACS Hubie Chen
2005	J	`jnl`	The expressive rate of constraints. Ann. Math. Artif. Intell. Hubie Chen
2004	A	`conf`	(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. CP Hubie Chen, Víctor Dalmau
2004	J	`jnl`	A Coalgebraic Approach to Kleene Algebra with Tests CoRR Hubie Chen, Riccardo Pucella
2004	J	`jnl`	A coalgebraic approach to Kleene algebra with tests. Theor. Comput. Sci. Hubie Chen, Riccardo Pucella
2004	A*	`conf`	Collapsibility and Consistency in Quantified Constraint Satisfaction. AAAI Hubie Chen
2004	B	`conf`	Learnability of Relatively Quantified Generalized Formulas. ALT Andrei A. Bulatov, Hubie Chen, Víctor Dalmau
2004	A	`conf`	Looking Algebraically at Tractable Quantified Boolean Formulas. SAT Hubie Chen, Víctor Dalmau
2004	—	`conf`	Looking Algebraically at Tractable Quantified Boolean Formulas. SAT (Selected Papers Hubie Chen, Víctor Dalmau
2004	B	`conf`	Optimization, Games, and Quantified Constraint Satisfaction. MFCS Hubie Chen, Martin Pál
2004	—	`conf`	Owned Policies for Information Security. CSFW Hubie Chen, Stephen Chong
2004	A	`conf`	Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms. CP Hubie Chen
2004	A	`conf`	Quantified Constraint Satisfaction and Bounded Treewidth. ECAI Hubie Chen
2004	—	`conf`	The Expressive Rate of Constraints. AI&M Hubie Chen
2003	—	`conf`	A Coalgebraic Approach to Kleene Algebra with Tests. CMCS Hubie Chen, Riccardo Pucella
2003	A*	`conf`	A Theory of Average-Case Compilability in Knowledge Representation. IJCAI Hubie Chen
2003	A	`conf`	An Algorithm for SAT Above the Threshold. SAT Hubie Chen
2003	B	`conf`	Arithmetic Constant-Depth Circuit Complexity Classes. MFCS Hubie Chen
2003	A*	`conf`	Inverse Circumscription. IJCAI Hubie Chen
2003	B	`conf`	Inverse NP Problems. MFCS Hubie Chen
2003	A	`conf`	Periodic Constraint Satisfaction Problems: Polynomial-Time Algorithms. CP Hubie Chen
2001	J	`jnl`	Arithmetic Versions of Constant Depth Circuit Complexity Classes Electron. Colloquium Comput. Complex. Hubie Chen
2001	A	`conf`	Formal Models of Heavy-Tailed Behavior in Combinatorial Search. CP Hubie Chen, Carla P. Gomes, Bart Selman
2001	J	`jnl`	Polynomial Programs and the Razborov-Smolensky Method Electron. Colloquium Comput. Complex. Hubie Chen