| Publication | Date of Publication | Type |
|---|
On complexity of 1-center in various metrics
| 2025-01-14 | Paper |
Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
| 2024-04-09 | Paper |
scientific article; zbMATH DE number 7829347 (Why is no real title available?)
| 2024-04-09 | Paper |
Fast and Simple Solutions of Blotto Games
Operations Research | 2024-03-12 | Paper |
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
Artificial Intelligence | 2024-02-13 | Paper |
scientific article; zbMATH DE number 7788453 (Why is no real title available?)
| 2024-01-15 | Paper |
Improved dynamic algorithms for longest increasing subsequence
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
Algorithmica | 2023-04-28 | Paper |
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
Journal of the ACM | 2022-12-08 | Paper |
Fair allocation of indivisible goods: beyond additive valuations
Artificial Intelligence | 2022-03-02 | Paper |
Fair allocation of indivisible goods: improvement
Mathematics of Operations Research | 2021-09-14 | Paper |
Greedy algorithms for online survivable network design
| 2021-07-28 | Paper |
Improved Algorithms for Edit Distance and LCS: Beyond Worst Case
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Dynamic algorithms for LIS and distance to monotonicity
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
scientific article; zbMATH DE number 7204578 (Why is no real title available?)
| 2020-05-27 | Paper |
From duels to battlefields: computing equilibria of Blotto and other games
Mathematics of Operations Research | 2020-04-30 | Paper |
Covering orthogonal polygons with sliding \(k\)-transmitters
Theoretical Computer Science | 2020-04-06 | Paper |
Computing Stackelberg equilibria of large general-sum games
| 2020-02-04 | Paper |
\(1+\varepsilon\) approximation of tree edit distance in quadratic time
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Approximating LCS in Linear Time: Beating the √n Barrier
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Massively parallel approximation algorithms for edit distance and longest common subsequence
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Fast algorithms for knapsack via convolution and prediction
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Fair Allocation of Indivisible Goods to Asymmetric Agents
Journal of Artificial Intelligence Research | 2019-01-18 | Paper |
From battlefields to elections: winning strategies of Blotto and auditing games
| 2018-03-15 | Paper |
Approximating edit distance in truly subquadratic time: quantum and MapReduce
| 2018-03-15 | Paper |
Online weighted degree-bounded Steiner networks via novel online mixed packing/covering
| 2017-12-19 | Paper |
Price of Competition and Dueling Games
| 2017-12-19 | Paper |
A tight algorithm for strongly connected Steiner subgraph on two terminals with demands
Algorithmica | 2017-05-02 | Paper |
Revenue maximization for selling multiple correlated items
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 |
