Currently, I am launching a startup company ePolisher.
ePolisher provides excellent AI writing tools, including AI-humanizer, AI-detector and more. Check it out!
Email: kourenmu AT gmail
I earned my Bachelor's degree in Computer Science and Technology from Zhejiang University in 2012. Following my undergraduate studies, I pursued a Ph.D. at The Chinese University of Hong Kong under the supervision of Prof. Leizhen Cai, which I completed in 2016. Subsequently, I worked as a Postdoctoral Fellow at The Hong Kong Polytechnic University, collaborating with Dr. Yixin Cao. After my postdoctoral research, I transitioned to industry, first joining vivo and later Huawei as a researcher.
AI Agents, Graph Algorithms, Computational Complexity.
Yixin Cao, Ashutosh Rai, R. B. Sandeep, and Junjie Ye. A Polynomial Kernel for Diamond-Free Editing, European Symposium on Algorithms (ESA), 2018.
Wenjun Li, Junjie Ye and Yixin Cao. Kernelization for P2-packing: A Gerrymandering Approach, Frontiers of Algorithmics Workshop (FAW), 2018.
Jian Kuang, Junjie Ye and Evangeline F.Y. Young. STOMA: Simultaneous Template Optimization and Mask Assignment for Directed Self-Assembly Lithography with Multiple Patterning, Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD), 2018.
Leizhen Cai and Junjie Ye. Finding Two Edge-Disjoint Paths with Length Constraints, Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2016.
Jian Kuang, Junjie Ye and Evangeline F.Y. Young. Simultaneous Template Optimization and Mask Assignment for DSA with Multiple Patterning, IEEE/ACM Asia and South Pacific Design Automation Conference (ASP-DAC), 2016. (Best Paper Nomination)
Junjie Ye. A Note on Finding Dual Feedback Vertex Set, arxiv, 2015.
Leizhen Cai and Junjie Ye. Parameterized Complexity of Finding Connected Induced Subgraphs, Theoretical Computer Science (TCS), 2015.
Leizhen Cai and Junjie Ye. Dual Connectedness of Edge-Bicolored Graphs and Beyond, Mathematical Foundations of Computer Science (MFCS), 2014.
Leizhen Cai and Junjie Ye. Parameterized Complexity of Connected Induced Subgraph Problems, Algorithmic Aspects in Information and Management (AAIM), 2014.