Energy efficient cooperative multicast based on relay selection and power allocation. - Junxing Wang; Xia Wang; Zhigang Chen 002; Yuan Yao (WOCC, 2013)

Mutual Exclusion Algorithms in the Shared Queue Model. - Junxing Wang; Zhengyu Wang (ICDCN, 2014)

Fair enough: guaranteeing approximate maximin shares. - Ariel D. Procaccia; Junxing Wang (EC, 2014)

A simple Byzantine Generals protocol. - Junxing Wang (J. Comb. Optim., 2014)

Thresholds modification strategy of wayside supercapacitor storage considering DC substation characteristics. - Junxing Wang; Zhongping Yang; Fei Lin; Yajie Zhao; Huan Xia; Yutong Lu; Xiaohao Zhao (IECON, 2015)

When Can the Maximin Share Guarantee Be Guaranteed? - David Kurokawa; Ariel D. Procaccia; Junxing Wang (AAAI, 2016)

A Lower Bound for Equitable Cake Cutting. - Ariel D. Procaccia; Junxing Wang (EC, 2017)

On Computing Min-Degree Elimination Orderings. - Matthew Fahrbach; Gary L. Miller; Richard Peng; Saurabh Sawlani; Junxing Wang; Shen Chen Xu (CoRR, 2017)

A Mobile Outdoor Augmented Reality Method Combining Deep Learning Object Detection and Spatial Relationships for Geovisualization. - Jinmeng Rao; Yanjun Qiao; Fu Ren; Junxing Wang; Qingyun Du (Sensors, 2017)

Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm. - Matthew Fahrbach; Gary L. Miller; Richard Peng; Saurabh Sawlani; Junxing Wang; Shen Chen Xu (FOCS, 2018)

Fair Enough: Guaranteeing Approximate Maximin Shares. - David Kurokawa; Ariel D. Procaccia; Junxing Wang (J. ACM, 2018)

The Unreasonable Fairness of Maximum Nash Welfare. - Ioannis Caragiannis; David Kurokawa; Hervé Moulin 001; Ariel D. Procaccia; Nisarg Shah 001; Junxing Wang (ACM Trans. Economics and Comput., 2019)

Near-optimal fully dynamic densest subgraph. - Saurabh Sawlani; Junxing Wang (STOC, 2020)

Flowless: Extracting Densest Subgraphs Without Flow Computations. - Digvijay Boob; Yu Gao 001; Richard Peng; Saurabh Sawlani; Charalampos E. Tsourakakis; Di Wang 005; Junxing Wang (WWW, 2020)

Relation-aware Bidirectional Path Reasoning for Commonsense Question Answering. - Junxing Wang; Xinyi Li 001; Zhen Tan; Xiang Zhao 002; Weidong Xiao (CoNLL, 2021)

Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions. - Timothy Chu; Yu Gao 001; Richard Peng; Sushant Sachdeva; Saurabh Sawlani; Junxing Wang (SIAM J. Comput., 2023)