S. Seddighin

Available identifiers

zbMath Open seddighin.saeedMaRDI QIDQ524377

List of research outcomes

Publication	Date of Publication	Type
On complexity of 1-center in various metrics	2025-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q6126342	2024-04-09	Paper
https://portal.mardi4nfdi.de/entity/Q6126361	2024-04-09	Paper
Fast and Simple Solutions of Blotto Games	2024-03-12	Paper
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem	2024-02-13	Paper
https://portal.mardi4nfdi.de/entity/Q6147371	2024-01-15	Paper
Improved dynamic algorithms for longest increasing subsequence	2023-11-14	Paper
Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems	2023-04-28	Paper
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce	2022-12-08	Paper
Fair allocation of indivisible goods: beyond additive valuations	2022-03-02	Paper
Fair Allocation of Indivisible Goods: Improvement	2021-09-14	Paper
https://portal.mardi4nfdi.de/entity/Q5002841	2021-07-28	Paper
Improved Algorithms for Edit Distance and LCS: Beyond Worst Case	2021-02-02	Paper
Dynamic algorithms for LIS and distance to monotonicity	2021-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q5111458	2020-05-27	Paper
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games	2020-04-30	Paper
Covering orthogonal polygons with sliding \(k\)-transmitters	2020-04-06	Paper
Computing Stackelberg equilibria of large general-sum games	2020-02-04	Paper
1+ ε approximation of tree edit distance in quadratic time	2020-01-30	Paper
Approximating LCS in Linear Time: Beating the √n Barrier	2019-10-15	Paper
Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence	2019-10-15	Paper
Fast algorithms for knapsack via convolution and prediction	2019-08-22	Paper
Fair Allocation of Indivisible Goods to Asymmetric Agents	2019-01-18	Paper
https://portal.mardi4nfdi.de/entity/Q4608043	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4607964	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	2017-05-02	Paper
Revenue maximization for selling multiple correlated items	2015-11-19	Paper
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)	2015-09-15	Paper
Some bounds for the signed edge domination number of a graph	2014-08-15	Paper

Research outcomes over time

This page was built for person: S. Seddighin