default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSoroush Alamdari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i4]Soroush Alamdari:
Small-World Formation via Local Information. CoRR abs/2301.00849 (2023)
2010 – 2019
- 2018
- [b1]Soroush Alamdari:
Exact and Approximate Algorithms for Some Combinatorial Problems. Cornell University, USA, 2018 - [c10]Elaheh Fata, Soroush Hosseini Alamdari:
A Game of Public Facilities on Networks. CDC 2018: 315-320 - 2017
- [j2]Soroush Alamdari, Patrizio Angelini
, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to Morph Planar Graph Drawings. SIAM J. Comput. 46(2): 824-852 (2017) - [c9]Soroush Alamdari, David B. Shmoys:
A Bicriteria Approximation Algorithm for the k-Center and k-Median Problems. WAOA 2017: 66-75 - 2016
- [c8]Soroush Alamdari:
Brief Announcement: The Small World of Curious Beings. PODC 2016: 51-53 - [i3]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to morph planar graph drawings. CoRR abs/1606.00425 (2016) - 2014
- [j1]Soroush Alamdari, Elaheh Fata, Stephen L. Smith:
Persistent monitoring in discrete environments: Minimizing the maximum weighted latency between observations. Int. J. Robotics Res. 33(1): 138-154 (2014) - 2013
- [c7]Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
Morphing Planar Graph Drawings with a Polynomial Number of Steps. SODA 2013: 1656-1667 - [c6]Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav, Anna Lubiw, Vinayak Pathak:
Smart-Grid Electricity Allocation via Strip Packing with Slicing. WADS 2013: 25-36 - [i2]Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak:
Self-Approaching Graphs. CoRR abs/1306.5460 (2013) - 2012
- [c5]Soroush Alamdari, Therese Biedl:
Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs. GD 2012: 102-113 - [c4]Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak:
Self-approaching Graphs. GD 2012: 260-271 - [c3]Soroush Alamdari, Elaheh Fata, Stephen L. Smith:
Min-Max Latency Walks: Approximation Algorithms for Monitoring Vertex-Weighted Graphs. WAFR 2012: 139-155 - [c2]Soroush Alamdari, Abbas Mehrabian:
On a DAG Partitioning Problem. WAW 2012: 17-28 - [i1]Soroush Alamdari, Elaheh Fata, Stephen L. Smith:
Min-Max Latency Walks: Approximation Algorithms for Monitoring Vertex-Weighted Graphs. CoRR abs/1202.5619 (2012) - 2011
- [c1]Soroush Alamdari, Therese Biedl:
Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames. GD 2011: 14-25
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:09 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:
