The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yijia Chen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yongqiang Sun, Kai Lin, Yijia Chen
    Automatic Generation of Parallel Compiler-Partial Evaluation of Parallel Lambda Language . [Citation Graph (0, 0)][DBLP]
    APDC, 1997, pp:390-397 [Conf]
  2. Yijia Chen, Jörg Flum, Martin Grohe
    Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:13-29 [Conf]
  3. Yijia Chen, Martin Grohe
    An Isomorphism between Subexponential and Parameterized Complexity Theory. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:314-330 [Conf]
  4. Yijia Chen, Jörg Flum
    Machine Characterization of the Classes of the W-Hierarchy. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:114-127 [Conf]
  5. Yijia Chen, Enshao Shen
    Capture Complexity by Partition. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:84-98 [Conf]
  6. Yijia Chen, Jörg Flum
    On Miniaturized Problems in Parameterized Complexity Theory. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:108-120 [Conf]
  7. Yijia Chen, Jörg Flum
    The Parameterized Complexity of Maximality and Minimality Problems. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:25-37 [Conf]
  8. Yijia Chen, Martin Grohe, Magdalena Grüber
    On Parameterized Approximability. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:109-120 [Conf]
  9. Yijia Chen, Martin Grohe
    An Isomorphism between Subexponential and Parameterized Complexity Theory [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:011, pp:- [Journal]
  10. Enshao Shen, Yijia Chen
    The Downward Transfer of Elementary Satisfiability of Partition Logics. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:477-487 [Journal]
  11. Yijia Chen, Jörg Flum
    On miniaturized problems in parameterized complexity theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:314-336 [Journal]
  12. Yijia Chen, Jörg Flum, Martin Grohe
    Machine-based methods in parameterized complexity theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:339, n:2-3, pp:167-199 [Journal]
  13. Yijia Chen, Jörg Flum
    On Parameterized Path and Chordless Path Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:250-263 [Conf]
  14. Yijia Chen, Jörg Flum
    Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:389-404 [Conf]

  15. A Logic for PTIME and a Parameterized Halting Problem. [Citation Graph (, )][DBLP]


  16. Lower Bounds for Kernelizations and Other Preprocessing Procedures. [Citation Graph (, )][DBLP]


  17. On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT. [Citation Graph (, )][DBLP]


  18. Understanding the Complexity of Induced Subgraph Isomorphisms. [Citation Graph (, )][DBLP]


  19. On p-Optimal Proof Systems and Logics for PTIME. [Citation Graph (, )][DBLP]


  20. A Logic for PTIME and a Parameterized Halting Problem. [Citation Graph (, )][DBLP]


  21. The parameterized complexity of maximality and minimality problems. [Citation Graph (, )][DBLP]


  22. A logic for PTIME and a parameterized halting problem. [Citation Graph (, )][DBLP]


  23. Lower Bounds for Kernelizations. [Citation Graph (, )][DBLP]


  24. On Parameterized Approximability. [Citation Graph (, )][DBLP]


Search in 0.018secs, Finished in 0.019secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002