default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSina Dehghani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2017
[b1]Sina Dehghani:
Online Network Design under Uncertainty. University of Maryland, College Park, MD, USA, 2017
Journal Articles
- 2023
- [j3]Soheil Behnezhad, Sina Dehghani
, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Fast and Simple Solutions of Blotto Games. Oper. Res. 71(2): 506-516 (2023) - 2019
- [j2]AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, Saeed Seddighin:
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games. Math. Oper. Res. 44(4): 1304-1325 (2019) - 2015
- [j1]Sina Dehghani, MohammadAmin Fazli, Jafar Habibi, Sadra Yazdanbod:
Using shortcut edges to maximize the number of triangles in graphs. Oper. Res. Lett. 43(6): 586-591 (2015)
Conference and Workshop Papers
- 2021
- [c12]Sina Dehghani, Hamed Saleh, Saeed Seddighin, Shang-Hua Teng:
Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable. AAAI 2021: 5294-5302 - 2018
- [c11]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin:
Greedy Algorithms for Online Survivable Network Design. ICALP 2018: 152:1-152:14 - [c10]Sina Dehghani, Alireza Farhadi, Mohammad Taghi Hajiaghayi, Hadi Yami:
Envy-free Chore Division for An Arbitrary Number of Agents. SODA 2018: 2564-2583 - 2017
- [c9]Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. AAAI 2017: 369-375 - [c8]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin:
Stochastic k-Server: How Should Uber Work?. ICALP 2017: 126:1-126:14 - 2016
- [c7]AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, Saeed Seddighin:
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games. AAAI 2016: 376-382 - [c6]Sina Dehghani, Mohammad Taghi Hajiaghayi, Hamid Mahini, Saeed Seddighin:
Price of Competition and Dueling Games. ICALP 2016: 21:1-21:14 - [c5]Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin:
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. ICALP 2016: 42:1-42:14 - [c4]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat:
Online Degree-Bounded Steiner Network Design. SODA 2016: 164-175 - 2015
- [c3]MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Revenue Maximization for Selling Multiple Correlated Items. ESA 2015: 95-105 - [c2]AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini, Saeed Seddighin, Sadra Yazdanbod:
Forming external behaviors by leveraging internal opinions. INFOCOM 2015: 1849-1857 - 2014
- [c1]AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini, Saeed Seddighin, Sadra Yazdanbod:
How effectively can we form opinions? WWW (Companion Volume) 2014: 213-214
Informal and Other Publications
- 2019
- [i8]Mahdi Boroujeni, Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems. CoRR abs/1905.08127 (2019) - 2017
- [i7]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke:
Online Degree-Bounded Steiner Network Design. CoRR abs/1704.05430 (2017) - [i6]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin:
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering. CoRR abs/1704.05811 (2017) - [i5]Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin:
Stochastic k-Server: How Should Uber Work? CoRR abs/1705.05755 (2017) - 2016
- [i4]Mahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, Saeed Seddighin:
From Duels to Battefields: Computing Equilibria of Blotto and Other Games. CoRR abs/1603.00119 (2016) - [i3]Sina Dehghani, MohammadTaghi Hajiaghayi, Hamid Mahini, Saeed Seddighin:
Price of Competition and Dueling Games. CoRR abs/1605.04004 (2016) - [i2]Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. CoRR abs/1612.04029 (2016) - 2014
- [i1]MohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Revenue Maximization for Selling Multiple Correlated Items. CoRR abs/1412.3187 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
