Ruilong Zhang

Orcid: 0000-0002-4859-2661

Affiliations:
  • Technical University of Munich, Department of Mathematics, Germany
  • University at Buffalo - North Campus, Department Computer Science and Engineering, Amherst, NY, USA (former)
  • City University of Hong Kong, Department of Computer Science, Hong Kong (PhD 2022)


According to our database1, Ruilong Zhang authored at least 24 papers between 2018 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Fair Submodular Maximization over a Knapsack Constraint.
CoRR, May, 2025

Logarithmic Approximations for Fair k-Set Selection.
CoRR, May, 2025

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps.
CoRR, April, 2025

Multiplicative assignment with upgrades.
CoRR, April, 2025

Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024
Public Event Scheduling with Busy Agents.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Polylogarithmic Approximations for Robust s-t Path.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Resource-Limited Network Security Games with General Contagious Attacks.
Proceedings of the Computing and Combinatorics - 30th International Conference, 2024

Sampling for Beyond-Worst-Case Online Ranking.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Scheduling with a Limited Testing Budget.
CoRR, 2023

Polylogarithmic Approximation for Robust s-t Path.
CoRR, 2023

Auction Design for Value Maximizers with Budget and Return-on-Spend Constraints.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms.
Proceedings of the Machine Learning and Knowledge Discovery in Databases: Research Track, 2023

Online Dynamic Acknowledgement with Learned Predictions.
Proceedings of the IEEE INFOCOM 2023, 2023

Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Min-Max Submodular Ranking for Multiple Agents.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models.
Theor. Comput. Sci., 2022

A note on the online interval scheduling secretary problem.
Oper. Res. Lett., 2022

2021
Fair Allocation with Interval Scheduling Constraints.
CoRR, 2021

Fair Scheduling for Time-dependent Resources.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Minimizing the cost of batch calibrations.
Theor. Comput. Sci., 2020

Improved Scheduling with a Shared Resource via Structural Insights.
Proceedings of the Combinatorial Optimization and Applications, 2020

2018
Imbalanced Networked Multi-label Classification with Active Learning.
Proceedings of the 2018 IEEE International Conference on Big Knowledge, 2018


  Loading...