| 2017 | ICDE | BWT Arrays and Mismatching Trees: A New Way for String Matching with k Mismatches. | Yangjun Chen, Yujia Wu |
| 2016 | ICNC | On the massive string matching problem. | Yangjun Chen, Yujia Wu |
| 2015 | DATA | Tree Inclusion Checking Revisited. | Yangjun Chen, Yibin Chen |
| 2011 | ICDE | Decomposing DAGs into spanning trees: A new way to compress transitive closures. | Yangjun Chen, Yibin Chen |
| 2010 | IKE | Data Stream Transformation and Query Node Arrays: A New Way to Evaluate Tree Pattern Queries. | Yangjun Chen |
| 2010 | SAC | A time optimal algorithm for evaluating tree pattern queries. | Yangjun Chen |
| 2009 | DEXA | Bottom-Up Evaluation of Twig Join Pattern Queries in XML Document Databases. | Yangjun Chen |
| 2009 | IKE | Document Tree Reconstruction and Fast Twig Pattern Matching. | Yangjun Chen |
| 2009 | ICSoft | General Spanning Trees and Core Labeling. | Yangjun Chen |
| 2009 | ICSoft | Unordered Tree Matching and Tree Pattern Queries in XML Databases. | Yangjun Chen |
| 2008 | DEXA | On the Evaluation of Large and Sparse Graph Reachability Queries. | Yangjun Chen |
| 2008 | ICDE | An Efficient Algorithm for Answering Graph Reachability Queries. | Yangjun Chen, Yibin Chen |
| 2008 | WEBIST | An Efficient Streaming Algorithm for Evaluating XPath Queries. | Yangjun Chen |
| 2007 | DEXA | Decomposing DAGs into Disjoint Chains. | Yangjun Chen |
| 2007 | IV | Tree Encoding and Transitive Closure Compression. | Yangjun Chen |
| 2007 | WEBIST | Stack Encoding Revisited. | Yangjun Chen |
| 2006 | DEXA | On the Query Evaluation in Document DBs. | Yangjun Chen |
| 2006 | ICSoft | On the evaluation of tree pattern queries. | Yangjun Chen |
| 2006 | SAC | On the transitive closure representation and adjustable compression. | Yangjun Chen, Donovan Cooke |
| 2006 | SAC | Tree inclusion algorithm, signatures and evaluation of path-oriented queries. | Yangjun Chen, Yong Shi, Yibin Chen |
| 2006 | WEBIST | Rule-Based Query Tree Evaluation over Fragmented XML Documents. | Ron McFadyen, Yangjun Chen |
| 2005 | DEXA | On the General Signature Trees. | Yangjun Chen |
| 2005 | ICDE | On the Signature Trees and Balanced Signature Trees. | Yangjun Chen |
| 2005 | WEBIST | XML-Based Evaluation of Synthesized Queries. | Ron McFadyen, Yangjun Chen, Fung-Yee Chan |
| 2004 | SAC | A new algorithm for computing transitive closures. | Yangjun Chen |
| 2004 | SAC | Signature file hierarchies and signature graphs: a new index method for object-oriented databases. | Yangjun Chen, Yibin Chen |
| 2003 | CaiSE | Graph Decomposition and Recursive Closures. | Yangjun Chen |
| 2003 | IV | A New Algorithm for Transitive Closures and Computation of Recursion in relational Databases. | Yangjun Chen |
| 2002 | CIKM | On the efficient evaluation of relaxed queries in biological databases. | Yangjun Chen, Dunren Che, Karl Aberer |
| 2001 | DEXA | On the Evaluation of Path-Oriented Queries in Document Databases. | Yangjun Chen, Gerald Huck |
| 2001 | WISE | Mapping DTDs to Object-Oriented Schemas. | Yangjun Chen, Ron McFadyen, Fung-Yee Chan |
| 1999 | DEXA | Combining Pat-Trees and Signature Files for Query Evaluation in Document Databases. | Yangjun Chen, Karl Aberer |
| 1999 | ICDE | Integrating Heterogeneous OO Schemas. | Yangjun Chen, Wolfgang Benn |
| 1999 | SSDBM | A Query System in a Biological Database. | Dunren Che, Yangjun Chen, Karl Aberer |
| 1999 | SSDBM | The Advanced Web Query System of GPCRDB. | Dunren Che, Yangjun Chen, Karl Aberer, Hannelore Eisner |
| 1998 | CIKM | Layered Index Structures in Document Database Systems. | Yangjun Chen, Karl Aberer |
| 1998 | CoopIS | Query Evaluation for Distributed Heterogeneous Relational Databases. | Yangjun Chen, Wolfgang Benn |
| 1997 | ADBIS | Speeding up the Counting Method by Computing Heritage Functions in Topological Order. | Yangjun Chen |
| 1997 | CoopIS | Poster on Rule-based Technology for Schema Transformation. | Yangjun Chen, Wolfgang Benn |
| 1997 | DEXA | On the Query Treatment in Federated Systems. | Yangjun Chen, Wolfgang Benn |
| 1997 | IDEAS | Multidatabase Query Optimization: Tree Balance and Node Allocation. | Yangjun Chen, Wolfgang Benn |
| 1994 | CIKM | An Optimal Graph Traversal Algorithm for Evaluating Linear Binary-Chain Programs. | Yangjun Chen, Theo Hrder |
| 1994 | DEXA | On the Optimal Top-down Evaluation of Recursive Queries. | Yangjun Chen, Theo Hrder |
| 1993 | ICDE | A Bottom-up Query Evaluation Method for Stratified Databases. | Yangjun Chen |
| 1991 | ICTAI | Improving Han and Lee's path consistency algorithm. | Yangjun Chen |