default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJunxing Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]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): S18-85 (2023)- 2021
- [c12]Junxing Wang, Xinyi Li, Zhen Tan, Xiang Zhao, Weidong Xiao:
Relation-aware Bidirectional Path Reasoning for Commonsense Question Answering. CoNLL 2021: 445-453 - 2020
- [c11]Saurabh Sawlani, Junxing Wang:
Near-optimal fully dynamic densest subgraph. STOC 2020: 181-193 - [c10]Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang:
Flowless: Extracting Densest Subgraphs Without Flow Computations. WWW 2020: 573-583
2010 – 2019
- 2019
- [j4]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): 12:1-12:32 (2019) - [i5]Saurabh Sawlani, Junxing Wang:
Near-Optimal Fully Dynamic Densest Subgraph. CoRR abs/1907.03037 (2019) - [i4]Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang:
Flowless: Extracting Densest Subgraphs Without Flow Computations. CoRR abs/1910.07087 (2019) - 2018
- [j3]David Kurokawa, Ariel D. Procaccia, Junxing Wang:
Fair Enough: Guaranteeing Approximate Maximin Shares. J. ACM 65(2): 8:1-8:27 (2018) - [c9]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: 101-112 - [c8]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: 361-372 - [i3]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 abs/1804.04239 (2018) - [i2]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 abs/1805.12051 (2018) - 2017
- [j2]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): 1951 (2017) - [c7]Ariel D. Procaccia, Junxing Wang:
A Lower Bound for Equitable Cake Cutting. EC 2017: 479-495 - [i1]Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu:
On Computing Min-Degree Elimination Orderings. CoRR abs/1711.08446 (2017) - 2016
- [c6]David Kurokawa, Ariel D. Procaccia, Junxing Wang:
When Can the Maximin Share Guarantee Be Guaranteed? AAAI 2016: 523-529 - [c5]Ioannis Caragiannis, David Kurokawa, Hervé Moulin, Ariel D. Procaccia, Nisarg Shah, Junxing Wang:
The Unreasonable Fairness of Maximum Nash Welfare. EC 2016: 305-322 - 2015
- [c4]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: 2076-2081 - 2014
- [j1]Junxing Wang:
A simple Byzantine Generals protocol. J. Comb. Optim. 27(3): 541-544 (2014) - [c3]Junxing Wang, Zhengyu Wang:
Mutual Exclusion Algorithms in the Shared Queue Model. ICDCN 2014: 29-43 - [c2]Ariel D. Procaccia, Junxing Wang:
Fair enough: guaranteeing approximate maximin shares. EC 2014: 675-692 - 2013
- [c1]Junxing Wang, Xia Wang, Zhigang Chen, Yuan Yao:
Energy efficient cooperative multicast based on relay selection and power allocation. WOCC 2013: 1-5
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
