Yijia Chen - RankMe

88 papers A* 8A 4B 11C 4Misc 1Journal 45Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Parameterized inapproximability: From Clique to PIH. Comput. Sci. Rev. Yijia Chen, Bingkai Lin
2025	J	`jnl`	A Parameterized Halting Problem, $ \Delta _0$ Truth and the Mrdp Theorem. J. Symb. Log. Yijia Chen, Moritz Müller, Keita Yokoyama
2025	A	`conf`	On Average Baby PIH and Its Applications. STACS Yuwei Liu, Yijia Chen, Shuangle Li, Bingkai Lin, Xin Zheng
2025	J	`jnl`	On algorithms based on finitely many homomorphism counts. Inf. Comput. Yijia Chen, Jörg Flum, Mingjun Liu, Zhiyang Xun
2025	C	`conf`	Separation Between Walksat and DPLL. TAMC Tao Jiang, Shaowei Cai, Ziqun Li, Jiabao Lin, Yijia Chen
2025	—	`conf`	Simple Combinatorial Construction of the SOSA Yijia Chen, Yi Feng, Bundit Laekhanukit, Yanlin Liu
2025	J	`jnl`	Some remarks on the uncolored versions of the original CFI-graphs. CoRR Yijia Chen, Jörg Flum, Mingjun Liu
2024	J	`jnl`	Forbidden induced subgraphs and the łOś-Tarski Theorem. J. Symb. Log. Yijia Chen, Jörg Flum
2023	J	`jnl`	Preface for the special issue of Theoretical Computer Science in honor of the 60 Theor. Comput. Sci. Yijia Chen, Pierre-Louis Curien, Yuxin Deng, Min Zhang
2023	J	`jnl`	Simple Combinatorial Construction of the k CoRR Yijia Chen, Yi Feng, Bundit Laekhanukit, Yanlin Liu
2022	J	`jnl`	A Surprising Relationship Between Descriptive Complexity and Proof Complexity. Bull. EATCS Yijia Chen, Jörg Flum, Moritz Müller
2022	J	`jnl`	A parameterized halting problem, Δ CoRR Yijia Chen, Moritz Müller, Keita Yokoyama
2022	B	`conf`	On Algorithms Based on Finitely Many Homomorphism Counts. MFCS Yijia Chen, Jörg Flum, Mingjun Liu, Zhiyang Xun
2022	—	`ed.`	Theoretical Computer Science - 40th National Conference, NCTCS 2022, Changchun, China, July 29-31, 2022, Revised Selected Papers NCTCS Zhiping Cai, Yijia Chen, Jialin Zhang
2021	A*	`conf`	Forbidden Induced Subgraphs and the Łoś-Tarski Theorem. LICS Yijia Chen, Jörg Flum
2021	J	`jnl`	On Queries Determined by a Constant Number of Homomorphism Counts. CoRR Yijia Chen, Jörg Flum, Mingjun Liu, Zhiyang Xun
2020	B	`conf`	FO-Definability of Shrub-Depth. CSL Yijia Chen, Jörg Flum
2020	J	`jnl`	Forbidden Induced Subgraphs and the Łoś-Tarski Theorem. CoRR Yijia Chen, Jörg Flum
2020	—	`conf`	Parameterized Parallel Computing and First-Order Logic. Fields of Logic and Computation III Yijia Chen, Jörg Flum
2019	Misc	`ed.`	Frontiers in Algorithmics - 13th International Workshop, FAW 2019, Sanya, China, April 29 - May 3, 2019, Proceedings FAW Yijia Chen, Xiaotie Deng, Mei Lu
2019	J	`jnl`	Some lower bounds in parameterized AC Inf. Comput. Yijia Chen, Jörg Flum
2019	B	`conf`	The Complexity of Homomorphism Indistinguishability. MFCS Jan Böker, Yijia Chen, Martin Grohe, Gaurav Rattan
2019	J	`jnl`	The Constant Inapproximability of the Parameterized Dominating Set Problem. SIAM J. Comput. Yijia Chen, Bingkai Lin
2019	J	`jnl`	The parameterized space complexity of model-checking bounded variable first-order logic. Log. Methods Comput. Sci. Yijia Chen, Michael Elberfeld, Moritz Müller
2018	A*	`conf`	A parameterized halting problem, the linear time hierarchy, and the MRDP theorem. LICS Yijia Chen, Moritz Müller, Keita Yokoyama
2018	A*	`conf`	The Complexity of Limited Belief Reasoning - The Quantifier-Free Case. IJCAI Yijia Chen, Abdallah Saffidine, Christoph Schwering
2018	J	`jnl`	The Complexity of Limited Belief Reasoning - The Quantifier-Free Case. CoRR Yijia Chen, Abdallah Saffidine, Christoph Schwering
2018	A*	`conf`	Tree-depth, quantifier elimination, and quantifier rank. LICS Yijia Chen, Jörg Flum
2017	J	`jnl`	Logic and Computational Complexity (NII Shonan Meeting 2017-13). NII Shonan Meet. Rep. Yijia Chen, Rodney G. Downey, Jörg Flum
2017	B	`conf`	Slicewise Definability in First-Order Logic with Bounded Quantifier Rank. CSL Yijia Chen, Jörg Flum, Xuangui Huang
2017	J	`jnl`	Slicewise definability in first-order logic with bounded quantifier rank. CoRR Yijia Chen, Jörg Flum, Xuangui Huang
2017	B	`conf`	The Hardness of Embedding Grids and Walls. WG Yijia Chen, Martin Grohe, Bingkai Lin
2017	J	`jnl`	The Hardness of Embedding Grids and Walls. CoRR Yijia Chen, Martin Grohe, Bingkai Lin
2017	J	`jnl`	The parameterized complexity of k-edge induced subgraphs. Inf. Comput. Bingkai Lin, Yijia Chen
2017	J	`jnl`	The parameterized space complexity of model-checking bounded variable first-order logic. CoRR Yijia Chen, Michael Elberfeld, Moritz Müller
2016	B	`conf`	Some Lower Bounds in Parameterized AC^0. MFCS Yijia Chen, Jörg Flum
2016	J	`jnl`	Some lower bounds in parameterized AC CoRR Yijia Chen, Jörg Flum
2016	A*	`conf`	The Constant Inapproximability of the Parameterized Dominating Set Problem. FOCS Yijia Chen, Bingkai Lin
2015	J	`jnl`	The Constant Inapproximability of the Parameterized Dominating Set Problem. CoRR Yijia Chen, Bingkai Lin
2015	—	`conf`	The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture. Fields of Logic and Computation II Yijia Chen, Jörg Flum
2014	—	`conf`	Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch's Theorem. MFCS (1) Yijia Chen, Moritz Müller
2014	J	`jnl`	Hard Instances of Algorithms and Proof Systems. ACM Trans. Comput. Theory Yijia Chen, Jörg Flum, Moritz Müller
2014	J	`jnl`	On Optimal Inverters. Bull. Symb. Log. Yijia Chen, Jörg Flum
2013	J	`jnl`	Consistency, optimality, and incompleteness. Ann. Pure Appl. Log. Yijia Chen, Jörg Flum, Moritz Müller
2013	J	`jnl`	On Limitations of the Ehrenfeucht-Fraisse-method in Descriptive Complexity. Electron. Colloquium Comput. Complex. Yijia Chen, Jörg Flum
2012	—	`conf`	A Parameterized Halting Problem. The Multivariate Algorithmic Revolution and Beyond Yijia Chen, Jörg Flum
2012	J	`jnl`	From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem. J. ACM Yijia Chen, Jörg Flum
2012	C	`conf`	Hard Instances of Algorithms and Proof Systems. CiE Yijia Chen, Jörg Flum, Moritz Müller
2012	A*	`conf`	On the Ordered Conjecture. LICS Yijia Chen, Jörg Flum
2012	B	`conf`	The Exponential Time Hypothesis and the Parameterized Clique Problem. IPEC Yijia Chen, Kord Eickmeyer, Jörg Flum
2012	—	`conf`	The Parameterized Complexity of k-Edge Induced Subgraphs. ICALP (1) Bingkai Lin, Yijia Chen
2011	C	`conf`	Consistency and Optimality. CiE Yijia Chen, Jörg Flum, Moritz Müller
2011	J	`jnl`	Hard instances of algorithms and proof systems. Electron. Colloquium Comput. Complex. Yijia Chen, Jörg Flum, Moritz Müller
2011	A*	`conf`	Listings and Logics. LICS Yijia Chen, Jörg Flum
2011	J	`jnl`	Listings and logics. Electron. Colloquium Comput. Complex. Yijia Chen, Jörg Flum
2011	J	`jnl`	Lower Bounds for Kernelizations and Other Preprocessing Procedures. Theory Comput. Syst. Yijia Chen, Jörg Flum, Moritz Müller
2011	J	`jnl`	Strong isomorphism reductions in complexity theory. J. Symb. Log. Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman, Moritz Müller
2011	J	`jnl`	The parameterized complexity of k-edge induced subgraphs CoRR Bingkai Lin, Yijia Chen
2010	—	`conf`	A Logic for PTIME and a Parameterized Halting Problem. Fields of Logic and Computation Yijia Chen, Jörg Flum
2010	—	`conf`	On ICALP (2) Yijia Chen, Jörg Flum
2010	B	`conf`	On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT. CSL Yijia Chen, Jörg Flum
2010	J	`jnl`	On optimal proof systems and logics for PTIME. Electron. Colloquium Comput. Complex. Yijia Chen, Jörg Flum
2010	J	`jnl`	On the complexity of Gödel's proof predicate. J. Symb. Log. Yijia Chen, Jörg Flum
2009	A*	`conf`	A Logic for PTIME and a Parameterized Halting Problem. LICS Yijia Chen, Jörg Flum
2009	C	`conf`	Lower Bounds for Kernelizations and Other Preprocessing Procedures. CiE Yijia Chen, Jörg Flum, Moritz Müller
2009	J	`jnl`	Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping. J. Log. Comput. Yijia Chen, Jörg Flum
2008	J	`jnl`	A logic for PTIME and a parameterized halting problem. Electron. Colloquium Comput. Complex. Yijia Chen, Jörg Flum
2008	J	`jnl`	The parameterized complexity of maximality and minimality problems. Ann. Pure Appl. Log. Yijia Chen, Jörg Flum
2008	—	`conf`	Understanding the Complexity of Induced Subgraph Isomorphisms. ICALP (1) Yijia Chen, Marc Thurley, Mark Weyer
2007	J	`jnl`	An Isomorphism Between Subexponential and Parameterized Complexity Theory. SIAM J. Comput. Yijia Chen, Martin Grohe
2007	J	`jnl`	An analysis of the W J. Symb. Log. Yijia Chen, Jörg Flum, Martin Grohe
2007	J	`jnl`	Lower Bounds for Kernelizations. Electron. Colloquium Comput. Complex. Yijia Chen, Jörg Flum, Moritz Müller
2007	J	`jnl`	On Parameterized Approximability. Electron. Colloquium Comput. Complex. Yijia Chen, Martin Grohe, Magdalena Grüber
2007	A	`conf`	On Parameterized Path and Chordless Path Problems. CCC Yijia Chen, Jörg Flum
2007	B	`conf`	Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping. CSL Yijia Chen, Jörg Flum
2006	J	`jnl`	An Isomorphism between Subexponential and Parameterized Complexity Theory Electron. Colloquium Comput. Complex. Yijia Chen, Martin Grohe
2006	A	`conf`	An Isomorphism between Subexponential and Parameterized Complexity Theory. CCC Yijia Chen, Martin Grohe
2006	—	`conf`	On Parameterized Approximability. IWPEC Yijia Chen, Martin Grohe, Magdalena Grüber
2006	J	`jnl`	On miniaturized problems in parameterized complexity theory. Theor. Comput. Sci. Yijia Chen, Jörg Flum
2006	—	`conf`	The Parameterized Complexity of Maximality and Minimality Problems. IWPEC Yijia Chen, Jörg Flum
2005	J	`jnl`	Machine-based methods in parameterized complexity theory. Theor. Comput. Sci. Yijia Chen, Jörg Flum, Martin Grohe
2004	—	`—`	Model-checking problems, machines and parameterized complexity. Yijia Chen
2004	—	`conf`	On Miniaturized Problems in Parameterized Complexity Theory. IWPEC Yijia Chen, Jörg Flum
2003	A	`conf`	Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. CCC Yijia Chen, Jörg Flum, Martin Grohe
2003	B	`conf`	Machine Characterization of the Classes of the W-Hierarchy. CSL Yijia Chen, Jörg Flum
2001	B	`conf`	Capture Complexity by Partition. CSL Yijia Chen, Enshao Shen
2000	J	`jnl`	The Downward Transfer of Elementary Satisfiability of Partition Logics. Math. Log. Q. Enshao Shen, Yijia Chen
1997	—	`conf`	Automatic Generation of Parallel Compiler-Partial Evaluation of Parallel Lambda Language . APDC Yongqiang Sun, Kai Lin, Yijia Chen