H. Esfandiari

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Robust load balancing with machine learned advice	2024-07-19	Paper
Almost tight approximation algorithms for explainable clustering	2024-07-19	Paper
Optimal fully dynamic \(k\)-center clustering for adaptive and oblivious adversaries	2024-05-14	Paper
Improved approximations for Euclidean k -means and k -median, via nested quasi-independent sets Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing	2023-12-08	Paper
Online allocation and display ads optimization with surplus supply Web and Internet Economics	2023-08-04	Paper
Seeding with costly network information Operations Research	2022-09-19	Paper
Second Hamiltonian cycles in claw-free graphs Theory and Applications of Graphs	2019-07-22	Paper
Streaming algorithms for estimating the matching size in planar graphs and beyond ACM Transactions on Algorithms	2019-03-28	Paper
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
A bounded-risk mechanism for the kidney exchange game Discrete Applied Mathematics	2018-05-24	Paper
Beating ratio 0.5 for weighted oblivious matching problems	2018-03-02	Paper
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms	2017-10-05	Paper
Beating \(1-\frac{1}{e}\) for ordered prophets Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing	2017-08-17	Paper
Prophet secretary SIAM Journal on Discrete Mathematics	2017-08-14	Paper
A tight algorithm for strongly connected Steiner subgraph on two terminals with demands Algorithmica	2017-05-02	Paper
A Bounded-Risk Mechanism for the Kidney Exchange Game LATIN 2016: Theoretical Informatics	2016-05-03	Paper
Prophet secretary Algorithms - ESA 2015	2015-11-19	Paper
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) Parameterized and Exact Computation	2015-09-15	Paper
Some bounds for the signed edge domination number of a graph The Australasian Journal of Combinatorics	2014-08-15	Paper
On the Erdős-Gyárfás conjecture in claw-free graphs Discussiones Mathematicae Graph Theory	2014-07-28	Paper
Online stochastic reordering buffer scheduling Automata, Languages, and Programming	2014-07-01	Paper

Research outcomes over time

This page was built for person: H. Esfandiari