default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRuilong Zhang 0001
Person information
- unicode name: 张瑞龙
- affiliation: Technical University of Munich, Department of Mathematics, Germany
- affiliation (former): University at Buffalo - North Campus, Department Computer Science and Engineering, Amherst, NY, USA
- affiliation (PhD 2022): City University of Hong Kong, Department of Computer Science, Hong Kong
Other persons with the same name
- Ruilong Zhang 0002
![[0000-0002-1278-0556]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-1278-0556")
— Tianjin University, School of Electrical and Information Engineering, China - Ruilong Zhang 0003 — Chinese Academy of Sciences, Institute of Geology and Geophysics, Beijing, China
- Ruilong Zhang 0004 — Henan Polytechnic University, School of Surveying and Land Information Engineering, Jiaozuo, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Qingyun Chen, Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Sampling for Beyond-Worst-Case Online Ranking. AAAI 2024: 20649-20656- [c13]Rufan Bai, Chao Xu, Chenyang Xu, Ruilong Zhang:
Resource-Limited Network Security Games with General Contagious Attacks. COCOON (2) 2024: 79-91 - [c12]Shi Li, Chenyang Xu, Ruilong Zhang:
Polylogarithmic Approximations for Robust s-t Path. ICALP 2024: 106:1-106:17 - [c11]Bo Li, Lijun Li, Minming Li, Ruilong Zhang:
Public Event Scheduling with Busy Agents. IJCAI 2024: 2877-2885 - [i9]Bo Li, Lijun Li, Minming Li, Ruilong Zhang:
Public Event Scheduling with Busy Agents. CoRR abs/2404.11879 (2024) - [i8]Yuda Feng, Yang Hu, Shi Li, Ruilong Zhang:
Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations. CoRR abs/2411.02942 (2024) - 2023
- [c10]Bo Li, Xiaowei Wu, Chenyang Xu, Ruilong Zhang:
Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule. AAAI 2023: 5730-5738 - [c9]Qingyun Chen, Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Min-Max Submodular Ranking for Multiple Agents. AAAI 2023: 7061-7068 - [c8]Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, Ruilong Zhang:
Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings. ESA 2023: 38:1-38:15 - [c7]Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Online Dynamic Acknowledgement with Learned Predictions. INFOCOM 2023: 1-10 - [c6]Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms. ECML/PKDD (4) 2023: 333-348 - [c5]Pinyan Lu, Chenyang Xu, Ruilong Zhang:
Auction Design for Value Maximizers with Budget and Return-on-Spend Constraints. WINE 2023: 474-491 - [i7]Shi Li, Chenyang Xu, Ruilong Zhang:
Polylogarithmic Approximation for Robust s-t Path. CoRR abs/2305.16439 (2023) - [i6]Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Online Dynamic Acknowledgement with Learned Predictions. CoRR abs/2305.18227 (2023) - [i5]Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, Ruilong Zhang:
Scheduling with a Limited Testing Budget. CoRR abs/2306.15597 (2023) - [i4]Pinyan Lu, Chenyang Xu, Ruilong Zhang:
Auction Design for Value Maximizers with Budget and Return-on-spend Constraints. CoRR abs/2307.04302 (2023) - 2022
- [j3]Bo Li, Chenhao Wang, Ruilong Zhang:
A note on the online interval scheduling secretary problem. Oper. Res. Lett. 50(1): 72-75 (2022) - [j2]Benjamin Moseley, Ruilong Zhang, Shanjiawen Zhao:
Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models. Theor. Comput. Sci. 938: 24-38 (2022) - [i3]Bo Li, Xiaowei Wu, Chenyang Xu, Ruilong Zhang:
Multiagent MST Cover: Pleasing All Optimally via A Simple Voting Rule. CoRR abs/2211.13578 (2022) - [i2]Qingyun Chen, Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Min-max Submodular Ranking for Multiple Agents. CoRR abs/2212.07682 (2022) - 2021
- [c4]Bo Li, Minming Li, Ruilong Zhang:
Fair Scheduling for Time-dependent Resources. NeurIPS 2021: 21744-21756 - [i1]Bo Li, Minming Li, Ruilong Zhang:
Fair Allocation with Interval Scheduling Constraints. CoRR abs/2107.11648 (2021) - 2020
- [j1]Vincent Chau, Minming Li, Elaine Yinling Wang, Ruilong Zhang, Yingchao Zhao:
Minimizing the cost of batch calibrations. Theor. Comput. Sci. 828-829: 55-64 (2020) - [c3]Christoph Damerius, Peter Kling, Minming Li, Florian Schneider, Ruilong Zhang:
Improved Scheduling with a Shared Resource via Structural Insights. COCOA 2020: 168-182
2010 – 2019
- 2019
- [c2]Vincent Chau, Minming Li, Yinling Wang, Ruilong Zhang, Yingchao Zhao:
Minimizing the Cost of Batch Calibrations. COCOON 2019: 78-89 - 2018
- [c1]Ruilong Zhang, Lei Li, Yuhong Zhang, Chenyang Bu:
Imbalanced Networked Multi-label Classification with Active Learning. ICBK 2018: 290-297
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-03-10 20:49 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:
