Tele: office - +01 204 786 9417; home - +01 204 275 2532
Fax: +01 204 783 8057
Dept. Applied Computer Science Winnipeg University 515 Portage Ave. Winnipeg, Manitoba R3B 2E9 Canada
my e-mail (y.chen@uwinnipeg.ca)
Research Profile Excellent Merit Award (2023) granted by the University of Winnipeg Excellent Merit Award (2022) granted by the University of Winnipeg Best Article of the Issue, ACTA Scientific Computer Sciences (2022) Honorable Mention Paper Award, CyberC and Big Data Summit (2017) Best Paper Award, (DBKDA 2016) Eighth International Conference on Advances in Databases, Knowledge, and Data Applications (2016) Best Paper Award, 2nd International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (2010) Excellent Research Award (2014) granted by the University of Winnipeg Excellent Merit Award (2012) granted by the University of Winnipeg Excellent Merit Award (2008) granted by the University of Winnipeg Excellent Merit Award (2006) granted by the University of Winnipeg
Research interests: Federated Databases, Deductive Databases, Document Databases, Graph Databases, DNA Databases, Big Data, Graph Algorithms and Combinatorics, as well as NP-completeness and proof of P = NP
My most favorite articles
Y. Chen, Solving the 2-MAXSAT Problem in Polynomial Time: A Proof of P = NP, submitted to an ACM journal. Y. Chen, The 2-MAXSAT Problem Can Be Solved in Polynomial Time, in: Proceedings of CSCI'2022, IEEE, Dec. 14-16, Las Vegas, USA, 2022, pp. 473-480. An extension of the paper appears in arXiv (draft). Y. Chen, B. Chen, and Y. Wu, On the Multiple Pattern String Matching in DNA Databases, SN Computer Science, Springer Verlag, (2023)4:260. https://doi.org/10.1007/s42979-023-01690-8. Y. Chen, and Y.B. Chen. and Y. Zhang, Evaluation of Reachability Queries Based on Recursive DAG Decomposition, IEEE Transactions on Knowledge and Data Engineering (TKDE), Vol. 35, No. 8, Aug. 2023, pp. 7935 - 7952....(draft) Y. Chen, and G. Singh, Graph Indexing for Efficient Evaluation of Label-constrained Reachability Queries, ACM Transactions on Database Systems (TODS), Vol. 46, No. 2, Article 8, 51 pages, 2021....(draft) Y. Chen, and R. Su, Merge Sort Revisited, ACTA Scientific Computer Sciences, Vol. 4, No. 5, pp. 49 - 52, 2022. Y. Chen, and H. Nguyen, On the String Matching with k Differences in DNA Databases, 47th Conf. VLDB'2021, 14(6)903-915, Copenhagen, Denmark. Y. Chen, B. Guo and X. Huang, Delta-Transitive Closures and Triangle Consistency Checking: A New Way to Evaluate Graph Pattern Queries in Large Graph Databases, The Journal of Supercomputing,(2020)76:8140-8174, Springer Verlag, (DOI: 10.1007/s11227-019-02762-4) Y. Chen and Y.B. Chen, Introducing Cuts into a Top-down Process for Checking Tree Inclusion, IEEE Transactions on Knowledge and Data Engineering, Vol. 31, No. 6, 2019, pp. 1136 - 1149, Article DOI: 10.1109/TKDE.2018.2854797. Y. Chen and Y. Wu, On the String matching with k mismatches, Theoretical Computer Science, Volumn 726, 23 May 2018, pp. 5 - 29.............(draft) Y. Chen and Y. Wu, Mismatching Trees and BWT Arrays: A New Way for String Matching with k-Mismatches, 33rd Int. Conf. ICDE2017, April 19 - 22, 2017, San Diego, USA, IEEE, pp. 339 - 410. Y. Chen and W. Shen, An Efficient Method to Evaluate Intersections on Big Data Sets, Theoretical Computer Science, Vol. 647, 27 September, 2016, pp. 1 -21................(draft) Y. Chen and Y.B. Chen, Subtree Reconstruction, Query Node Intervals and Tree Pattern Query Evaluation, Journal of Information Science and Engineering, Vol. 28, N0. 2, 2014, 263 - 293. Y. Chen and Y.B. Chen, Decomposing DAGs into spanning trees: A new way to compress transitive closures, in Proc. 27th Int. Conf. on Data Engineering (ICDE 2011), IEEE, April 2011, pp. 1007-1018. Y. Chen and Y.B. Chen, An Efficient Algorithm for Answering Graph Reachability Queries, in Proc. 24th Int. Conf. on Data Engineering (ICDE 2008), IEEE, April 2008, pp. 892-901. Y. Chen and Y.B. Chen, On the Signature Tree Construction and Analysis, IEEE Transactions on Knowledge and Data Engineering, Vol. 18, No. 9, 2006, pp. 1207-1224. Y. Chen, On the Costs of Searching Signature Trees, Information Processing Letters, 99 (2006) pp. 19-26. Y. Chen and Y.B. Chen, A New Tree Inclusion Algorithm, Information Processing Letters, 98 (2006), pp. 253-262. Y. Chen, On Signature trees and balanced signature trees, in Proc. Int. conf. on Data Engineering (ICDE2005), Tokyo, Japan: IEEE, April 5-8, 2005, pp. 742-753. Y. Chen, Building Signature Trees into OODBs, Journal of Information Science and Engineering, 20, 275-304 (2004). Y. Chen, Graph Traversal and Binary-chain Programs, IEEE Transactions on Knowledge and Data Engineering. Vol. 15, No. 3, pp. 573-596, 2003. Y. Chen, Signature Files and Signature Trees, Information Processing Letters, Vol. 82, No. 4, March 2002, pp. 213-221. Y. Chen, A Systematic Method for Query Evaluation in Distributed Heterogeneous Relational Databases, Journal of Information Science and Engineering, Vol. 16, No. 4, 2000, pp. 463-497. Y. Chen, On the Integeration of Heterogeneous OO Schemas, Journal of Information Science and Engineering, Vol. 16, No. 4, 2000, pp. 555-592. Y. Chen, Arc Consistency Revisited, Information Processing Letters, 70(1999) 175-184, Elsevier Science B.V. Y. Chen, On the Graph Traversal Method for Evaluating Linear Binary-chain Programs, Science in China (中国科学), Gordon and Breach Science Publisher, Vol. 42, No. 3 (Series E), 1999, pp. 225-243. Y. Chen, OLDTNF-based Evaluation Method for Handling Recursive Queries in Deductive Databases, Science in China (中国科学), Gordon and Breach Science Publisher, Vol. 41, No. 6 (Series E), Dec. 1998, pp. 561-578. Y. Chen, Counting and Topological Order, Journal of Computer Science and Technology, Allerton Press, Vol. 12, No. 6, Nov. 1997, pp. 497-509. Y. Chen, Graph Traversal and Top-Down Evaluation of Logic Queries, Journal of Computer Science and Technology, Allerton Press, Vol. 13, No. 4, July 1998, pp. 300-316. Y. Chen, Magic Sets and Stratified Databases, Int. Journal of Intelligent Systems, John Wiley & Sons, Ltd., Vol. 12, No. 3, pp. 203-231, 1997. Y. Chen, On the Bottom-up Evaluation of Recursive Queries, Int. Journal of Intelligent Systems, John Wiley & Sons, Ltd., Vol. 11, No. 10, 807-832, 1996.
- OO Implementation Issues (Java) (ACS-3941/3-001)
- Databases (ACS-3902/3-001)
- Advanced Databases (ACS-4902/3-001)
- Distributed Database Systems (graduate course)
- Database Application Development (ACS-2914/3-001)
- Applications of Database Systems (ACS-2814/3-001)
- Data Structures and Algorithms (ACS-2947/3-001)
- Advanced Algorithm Design (GACS-7101-001/3,graduate course)
- Web and Document Databases (GACS-7102-001/3,graduate course)
