I agree that this site is using cookies. You can find further informations here.
X
Derakhshan, Mahsa
59  results:
Search for persons X
?
1

Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Ap..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Derakhshan, Mahsa ; Durvasula, Naveen ; Haghtalab, Nika - p. 242-253 , 2023
Link: https://dl.acm.org/doi/1..
 
?
2

Max-Weight Online Stochastic Matching: Improved Approximati..:

, In: Proceedings of the 23rd ACM Conference on Economics and Computation,
Braverman, Mark ; Derakhshan, Mahsa ; Molina Lovett, Antonio - p. 967-985 , 2022
Link: https://dl.acm.org/doi/1..
 
?
3

Investigating the relationship between: urban identity, qua.. 

Case study: Andisheh new town 
Derakhshan, Mahsa , 2021
Link: https://nbn-resolving.de..
 
?
4

Beating greedy for approximating reserve prices in multi-un..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Derakhshan, Mahsa ; Pennock, David M. ; Slivkins, Aleksandrs - p. 1099-1118 , 2021
Link: https://dl.acm.org/doi/1..
 
?
5

Beating Greedy For Approximating Reserve Prices in Multi-Un..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Derakhshan, Mahsa ; Pennock, David M. ; Slivkins, Aleksandrs - p. 1099-1118 , 2021
Link: https://doi.org/10.1137/..
 
?
6

Stochastic matching with few queries: (1-ε) approximation:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,
Behnezhad, Soheil ; Derakhshan, Mahsa ; Hajiaghayi, MohammadTaghi - p. 1111-1124 , 2020
Link: https://dl.acm.org/doi/1..
 
?
7

Product Ranking on Online Platforms:

, In: Proceedings of the 21st ACM Conference on Economics and Computation,
Derakhshan, Mahsa ; Golrezaei, Negin ; Manshadi, Vahideh. - p. 459 ff. , 2020
Link: https://dl.acm.org/doi/1..
 
?
8

Stochastic Weighted Matching: (1-ϵ) Approximation:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Behnezhad, Soheil ; Derakhshan, Mahsa - p. 1392-1403 , 2020
Link: https://doi.org/10.1109/..
 
?
9

Stochastic Matching on Uniformly Sparse Graphs:

, In: Algorithmic Game Theory; Lecture Notes in Computer Science,
Behnezhad, Soheil ; Derakhshan, Mahsa ; Farhadi, Alireza.. - p. 357-373 , 2019
Link: https://doi.org/10.1007/..
 
?
10

Massively Parallel Computation of Matching and MIS in Spars..:

, In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing,
Behnezhad, Soheil ; Brandt, Sebastian ; Derakhshan, Mahsa... - p. 481-490 , 2019
Link: https://dl.acm.org/doi/1..
 
?
11

Optimal Strategies of Blotto Games : Beyond Convexity:

, In: Proceedings of the 2019 ACM Conference on Economics and Computation,
Behnezhad, Soheil ; Blum, Avrim ; Derakhshan, Mahsa... - p. 597-616 , 2019
Link: https://dl.acm.org/doi/1..
 
?
12

Fully Dynamic Maximal Independent Set with Polylogarithmic ..:

, In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS),
Behnezhad, Soheil ; Derakhshan, Mahsa ; Hajiaghayi, MohammadTaghi.. - p. 382-405 , 2019
Link: https://doi.org/10.1109/..
 
?
13

LP-based Approximation for Personalized Reserve Prices:

, In: Proceedings of the 2019 ACM Conference on Economics and Computation,
Derakhshan, Mahsa ; Golrezaei, Negin ; Paes Leme, Renato - p. 589 ff. , 2019
Link: https://dl.acm.org/doi/1..
 
?
14

Spatio-Temporal Games Beyond One Dimension:

, In: Proceedings of the 2018 ACM Conference on Economics and Computation,
Behnezhad, Soheil ; Derakhshan, Mahsa ; Hajiaghayi, Mohammadtaghi. - p. 411-428 , 2018
Link: https://dl.acm.org/doi/1..
 
?
15

From battlefields to elections : winning strategies of b..:

, In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms,
Behnezhad, Soheil ; Blum, Avrim ; Derakhshan, Mahsa... - p. 2291-2310 , 2018
Link: https://dl.acm.org/doi/1..
 
1-15