default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJunyan Su
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j3]Quan Xu, Yueyue Liu, Jifang Hu, Xiaohong Duan, Niuben Song, Jiale Zhou, Jincheng Zhai, Junyan Su, Siyao Liu
, Fan Chen, Wei Zheng, Zhongjia Guo, Hexiang Li, Qiming Zhou, Beifang Niu:
OncoPubMiner: a platform for mining oncology publications. Briefings Bioinform. 23(5) (2022)- [j2]Qiulin Lin, Yanfang Mo, Junyan Su, Minghua Chen:
Competitive Online Optimization with Multiple Inventories: A Divide-and-Conquer Approach. Proc. ACM Meas. Anal. Comput. Syst. 6(2): 36:1-36:28 (2022) - 2020
- [j1]Yuning Jiang, Junyan Su, Yuanming Shi, Boris Houska:
Distributed Optimization for Massive Connectivity. IEEE Wirel. Commun. Lett. 9(9): 1412-1416 (2020)
Conference and Workshop Papers
- 2024
- [c7]Qiulin Lin, Junyan Su, Minghua Chen:
Competitive Online Age-of-Information Optimization for Energy Harvesting Systems. INFOCOM 2024: 901-910 - 2023
- [c6]Junyan Su, Qiulin Lin, Minghua Chen, Haibo Zeng:
Minimizing Carbon Footprint for Timely E-Truck Transportation: Hardness and Approximation Algorithm. CDC 2023: 7773-7778 - [c5]Junyan Su, Qiulin Lin, Minghua Chen:
Follow the Sun and Go with the Wind: Carbon Footprint Optimized Timely E-Truck Transportation. e-Energy 2023: 159-171 - 2022
- [c4]Junyan Su, Minghua Chen, Haibo Zeng:
E2Pilot: An energy-efficient navigation system for long-haul timely truck transportation: demo. e-Energy 2022: 430-431 - [c3]Qiulin Lin, Yanfang Mo, Junyan Su, Minghua Chen:
Competitive Online Optimization with Multiple Inventories: A Divide-and-Conquer Approach. SIGMETRICS (Abstracts) 2022: 83-84 - 2021
- [c2]Junyan Su, Minghua Chen, Haibo Zeng:
Energy efficient timely transportation: a comparative study of internal combustion trucks and electric trucks. BuildSys@SenSys 2021: 224-225 - 2020
- [c1]Ling Gao, Junyan Su, Jiadi Cui, Xiangchen Zeng, Xin Peng, Laurent Kneip:
Efficient Globally-Optimal Correspondence-Less Visual Odometry for Planar Ground Vehicles. ICRA 2020: 2696-2702
Informal and Other Publications
- 2023
- [i4]Junyan Su, Qiulin Lin, Minghua Chen, Haibo Zeng:
Minimizing Carbon Footprint for Timely E-Truck Transportation: Hardness and Approximation Algorithm. CoRR abs/2308.09866 (2023) - 2022
- [i3]Qiulin Lin, Yanfang Mo, Junyan Su, Minghua Chen:
Competitive Online Optimization with Multiple Inventories: A Divide-and-Conquer Approach. CoRR abs/2202.02975 (2022) - [i2]Ling Gao, Junyan Su, Jiadi Cui, Xiangchen Zeng, Xin Peng, Laurent Kneip:
Efficient Globally-Optimal Correspondence-Less Visual Odometry for Planar Ground Vehicles. CoRR abs/2203.00291 (2022) - 2021
- [i1]Junyan Su, Yuning Jiang, Altug Bitlislioglu, Colin N. Jones, Boris Houska:
Distributed Multi-Building Coordination for Demand Response. CoRR abs/2101.04928 (2021)
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 2024-10-09 21:28 CEST 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:
