CHEN ZHANG
**** ***** ** **, ********, WA ***** 425-***-**** ***************@*****.***
E3D visa with EAD
EDUCATION
University of New South Wales, School of Computer Science Sydney, Australia Ph.D in Computer Science Jan 2020
Research Area: Graph Analytic, Data Mining, Database Xidian University, School of Computer Science Xi’an, China Master in Computer Technology, GPA 91/100 Mar 2016 Xidian University, School of Computer Science Xi’an, China Bachelor in Computer Science and Technology, GPA 87/100 July 2013 PROFESSIONAL EXPERIENCE
Paypal Shanghai, China
Software Engineer Intern Sept 2019 - Nov 2019
• Built an online graph analysis processing demo
• Designed an in-memory and offline graph analysis system
• Implemented basic graph analysis algorithms for above system Xi’an Modern Control Technology Research Institute Xi’an, China Software Engineer Intern Oct 2012 - Mar 2014
• Participated software development and maintenance for a software and hardware interaction system
• Responsible for the user interface development and serial communication
• Participated the test of simulation system
PROJECT EXPERIENCE
Efficient (k,p)- CoreComputation and Decomposition,University of New South Wales
• Proposed a new model of cohesive subgraph
• Designed new algorithms for (k,p)-core computation and decomposition
• Project is about 4000+ lines of code in C++, and outperformed state-of-the-art algorithms
• The paper of the project was accepted in IEEE ICDE 2020 conference as a full paper Efficient Maximal Spatial Clique Enumeration,University of New South Wales
• Studied the problem of “Maximal Spatial Clique Enumeration”
• Proposed an approach aiming to enumerate all maximal cliques in spatial graph
• Experimental results outperformed state-of-the-art approaches
• The paper of the project was accepted in IEEE ICDE 2019 conference as a full paper Selecting the Optimal Groups: Efficiently Computing Skyline k-Cliques,University of New South Wales
• Designed a new model of cohesive subgraph called skyline k-cliques on multidimensional attributed graph
• Proposed an efficient algorithm for group dominance verification
• Developed a progressive algorithm for skyline k-cliques computation
• The paper of the project was accepted in CIKM 2019 conference as a full paper SELETCTED PUBLICATIONS
• "Exploring Finer Granularity within the Cores: Efficient (k,p)-Core Computation and Decomposition", Chen Zhang, Fan Zhang, Wenjie Zhang, Boge Liu, Lu Qin, Xuemin Lin, ICDE 2020.
• "Selecting the Optimal Groups: Efficiently Computing Skyline k-Cliques", Chen Zhang, Wenjie Zhang, Ying Zhang, Fan Zhang, Xuemin Lin, CIKM 2019.
• "CoreCube: Core Decomposition in Multilayer Graphs", Boge Liu, Fan Zhang, Chen Zhang, Wenjie Zhang, Xuemin Lin, WISE 2019.
• "Efficient Maximal Spatial Clique Enumeration", Chen Zhang, Ying Zhang, Wenjie Zhang, Lu Qin, Jianye Yang, ICDE 2019.
• "Scalable Top-k Structural Diversity Search", Lijun Chang, Chen Zhang, Xuemin Lin, Lu Qin, ICDE 2017.