Xiaowei Wu

Math. Program., January, 2024

Approximately EFX allocations for indivisible chores.

[BibT_eX]

[DOI]

Artif. Intell., January, 2024

2023

Toward a Better Understanding of Randomized Greedy Matching.

[BibT_eX]

[DOI]

J. ACM, December, 2023

Near-Optimal Scheduling for Crowdsourced Transit System With Skip-Stop Tactic.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., November, 2023

Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.

[BibT_eX]

[DOI]

SIAM J. Comput., October, 2023

Well-behaved online load balancing against strategic jobs.

[BibT_eX]

[DOI]

Minming Li

J. Sched., October, 2023

Fair division of indivisible goods: Recent progress and open questions.

[BibT_eX]

[DOI]

Alexandros A. Voudouris

Artif. Intell., September, 2023

Stackelberg Security Games with Contagious Attacks on a Network: Reallocation to the Rescue.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2023

On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores.

[BibT_eX]

[DOI]

CoRR, 2023

One Quarter Each (on Average) Ensures Proportionality.

[BibT_eX]

[DOI]

Cong Zhang

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Improved Competitive Ratio for Edge-Weighted Online Stochastic Matching.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Weighted EF1 Allocations for Indivisible Chores.

[BibT_eX]

[DOI]

Cong Zhang

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Multi-agent Online Scheduling: MMS Allocations for Indivisible Items.

[BibT_eX]

[DOI]

Rufan Bai

Proceedings of the International Conference on Machine Learning, 2023

Approximation Algorithm for Computing Budget-Feasible EF1 Allocations.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Algorithmic fair allocation of indivisible items: a survey and new questions.

[BibT_eX]

[DOI]

SIGecom Exch., July, 2022

Distributed PageRank computation with improved round complexities.

[BibT_eX]

[DOI]

Siqiang Luo

Ben Kao

Inf. Sci., 2022

Fair Division of Indivisible Goods: A Survey.

[BibT_eX]

[DOI]

Alexandros A. Voudouris

CoRR, 2022

Query Efficient Prophet Inequality with Unknown I.I.D. Distributions.

[BibT_eX]

[DOI]

Yutong Wu

CoRR, 2022

Almost (Weighted) Proportional Allocations for Indivisible Chores✱✱.

[BibT_eX]

[DOI]

Yingkai Li

Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Mixed Strategies for Security Games with General Defending Requirements.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Approximately Envy-Free Budget-Feasible Allocation.

[BibT_eX]

[DOI]

CoRR, 2021

Almost Proportional Allocations for Indivisible Chores.

[BibT_eX]

[DOI]

Yingkai Li

CoRR, 2021

Upper and Lower Bounds for Fully Retroactive Graph Problems.

[BibT_eX]

[DOI]

Monika Henzinger

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Dynamic Set Cover: Improved Amortized and Worst-Case Update Time.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Budget-feasible Maximum Nash Social Welfare is Almost Envy-free.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Near-Optimal Fixed-Route Scheduling for Crowdsourced Transit System.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Defending against Contagious Attacks on a Network with Resource Reallocation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Fully Online Matching.

[BibT_eX]

[DOI]

J. ACM, 2020

Budget-feasible Maximum Nash Social Welfare Allocation is Almost Envy-free.

[BibT_eX]

[DOI]

CoRR, 2020

An Improved Algorithm for Dynamic Set Cover.

[BibT_eX]

[DOI]

CoRR, 2020

A Simple 1-1/e Approximation for Oblivious Bipartite Matching.

[BibT_eX]

[DOI]

CoRR, 2020

Towards a better understanding of randomized greedy matching.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Fully Online Matching II: Beating Ranking and Water-filling.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Defending with Shared Resources on a Network.

[BibT_eX]

[DOI]

Minming Li

Long Tran-Thanh

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Diffusion operator and spectral analysis for directed hypergraph Laplacian.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Online Vertex-Weighted Bipartite Matching: Beating 1-1/<i>e</i> with Random Arrivals.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Perturbed Greedy on Oblivious Matching Problems.

[BibT_eX]

[DOI]

CoRR, 2019

Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Maximin-Aware Allocations of Indivisible Goods.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Strategyproof and Approximately Maxmin Fair Share Allocation of Chores.

[BibT_eX]

[DOI]

Haris Aziz

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

MPR - A Partitioning-Replication Framework for Multi-Processing kNN Search on Road Networks.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2018

Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity.

[BibT_eX]

[DOI]

Fei Chen

ACM Trans. Algorithms, 2018

Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

On (1,ϵ)-Restricted Max-Min Fair Allocation Problem.

[BibT_eX]

[DOI]

Algorithmica, 2018

How to match when all vertices arrive online.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Online Makespan Minimization: The Power of Restart.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2018

2017

On Minimal Steiner Maximum-Connected Subgraph Queries.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2017

Finding k most influential edges on flow graphs.

[BibT_eX]

[DOI]

Inf. Syst., 2017

Online Submodular Maximization Problem with Vector Packing Constraint.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Maintaining Densest Subsets Efficiently in Evolving Hypergraphs.

[BibT_eX]

[DOI]

Shuguang Hu

Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017

2016

On (1, epsilon)-Restricted Max-Min Fair Allocation Problem.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Beating Ratio 0.5 for Weighted Oblivious Matching Problems.

[BibT_eX]

[DOI]

MohammadTaghi Hajiaghayi

Hamid Mahini

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2015

Randomized algorithms for graph problems with incomplete information.

[BibT_eX]

[DOI]

PhD thesis, 2015

Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs.

[BibT_eX]

[DOI]

Chenzi Zhang

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Decentralized P2P protocol for video-on-demand streaming: Simple and efficient.

[BibT_eX]

[DOI]

Wenbin Tang

Proceedings of the 12th IEEE International Conference on Networking, Sensing and Control, 2015

Dynamic Tree Shortcut with Constant Degree.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Fei Chen

Proceedings of the Theoretical Computer Science, 2014

An incentive protocol for distributed dynamic P2P video-on-demand streaming.

[BibT_eX]

[DOI]

Wenbin Tang