Junxing Wang

Publication Activity (10 Years)

Years Active: 2013-2023
Publications (10 Years): 18

Top Topics

Spectral Decomposition

Mutual Exclusion

Dense Subgraphs

Laplacian Matrix

Top Venues

J. Comb. Optim.

Publications

Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions. SIAM J. Comput. 52 (6) (2023)
Junxing Wang, Xinyi Li, Zhen Tan, Xiang Zhao, Weidong Xiao
Relation-aware Bidirectional Path Reasoning for Commonsense Question Answering. CoNLL (2021)
Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang
Flowless: Extracting Densest Subgraphs Without Flow Computations. WWW (2020)
Saurabh Sawlani, Junxing Wang
Near-optimal fully dynamic densest subgraph. STOC (2020)
Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang
Flowless: Extracting Densest Subgraphs Without Flow Computations. CoRR (2019)
Saurabh Sawlani, Junxing Wang
Near-Optimal Fully Dynamic Densest Subgraph. CoRR (2019)
Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, Junxing Wang
The Unreasonable Fairness of Maximum Nash Welfare. ACM Trans. Economics and Comput. 7 (3) (2019)
Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. FOCS (2018)
Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu
Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm. CoRR (2018)
Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. CoRR (2018)
Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu
Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm. FOCS (2018)
David Kurokawa, Ariel D. Procaccia, Junxing Wang
Fair Enough: Guaranteeing Approximate Maximin Shares. J. ACM 65 (2) (2018)
Ariel D. Procaccia, Junxing Wang
A Lower Bound for Equitable Cake Cutting. EC (2017)
Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu
On Computing Min-Degree Elimination Orderings. CoRR (2017)
Jinmeng Rao, Yanjun Qiao, Fu Ren, Junxing Wang, Qingyun Du
A Mobile Outdoor Augmented Reality Method Combining Deep Learning Object Detection and Spatial Relationships for Geovisualization. Sensors 17 (9) (2017)
Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, Junxing Wang
The Unreasonable Fairness of Maximum Nash Welfare. EC (2016)
David Kurokawa, Ariel D. Procaccia, Junxing Wang
When Can the Maximin Share Guarantee Be Guaranteed? AAAI (2016)
Junxing Wang, Zhongping Yang, Fei Lin, Yajie Zhao, Huan Xia, Yutong Lu, Xiaohao Zhao
Thresholds modification strategy of wayside supercapacitor storage considering DC substation characteristics. IECON (2015)
Ariel D. Procaccia, Junxing Wang
Fair enough: guaranteeing approximate maximin shares. EC (2014)
Junxing Wang, Zhengyu Wang
Mutual Exclusion Algorithms in the Shared Queue Model. ICDCN (2014)
Junxing Wang
A simple Byzantine Generals protocol. J. Comb. Optim. 27 (3) (2014)
Junxing Wang, Xia Wang, Zhigang Chen, Yuan Yao
Energy efficient cooperative multicast based on relay selection and power allocation. WOCC (2013)