default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaeed Akhoondian Amiri
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Saeed Akhoondian Amiri, Ben Wiederhake
:
Distributed distance-r covering problems on sparse high-girth graphs. Theor. Comput. Sci. 906: 18-31 (2022)- [j8]Amir Varasteh, Saeed Akhoondian Amiri, Carmen Mas Machuca:
Homa: Online In-Flight Service Provisioning With Dynamic Bipartite Matching. IEEE Trans. Netw. Serv. Manag. 19(3): 3174-3187 (2022) - 2021
- [j7]Saeed Akhoondian Amiri:
A note on the fine-grained complexity of MIS on regular graphs. Inf. Process. Lett. 170: 106123 (2021) - [c12]Saeed Akhoondian Amiri, Ben Wiederhake:
Distributed Distance-r Covering Problems on Sparse High-Girth Graphs. CIAC 2021: 37-60 - [i17]Saeed Akhoondian Amiri:
Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs. CoRR abs/2102.08076 (2021) - 2020
- [j6]Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid:
Walking Through Waypoints. Algorithmica 82(7): 1784-1812 (2020) - [c11]Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi:
Complexity of Computing the Anti-Ramsey Numbers for Paths. MFCS 2020: 6:1-6:14 - [i16]Saeed Akhoondian Amiri:
Disjoint Shortest Paths with Congestion on DAGs. CoRR abs/2008.08368 (2020) - [i15]Saeed Akhoondian Amiri:
On Fine-Grained Exact Computation in Regular Graphs. CoRR abs/2008.09008 (2020)
2010 – 2019
- 2019
- [j5]Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich:
Routing with congestion in acyclic digraphs. Inf. Process. Lett. 151 (2019) - [j4]Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz:
Distributed Dominating Set Approximations beyond Planar Graphs. ACM Trans. Algorithms 15(3): 39:1-39:18 (2019) - [c10]Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, Sebastian Wiederrecht:
On Polynomial-Time Congestion-Free Software-Defined Network Updates. Networking 2019: 1-9 - [i14]Saeed Akhoondian Amiri, Ben Wiederhake:
Distributed Distance-r Dominating Set on Sparse High-Girth Graphs. CoRR abs/1910.02794 (2019) - 2018
- [j3]Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid:
Charting the Algorithmic Complexity of Waypoint Routing. Comput. Commun. Rev. 48(1): 42-48 (2018) - [c9]Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht:
Congestion-Free Rerouting of Flows on DAGs. ICALP 2018: 143:1-143:13 - [c8]Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid:
Walking Through Waypoints. LATIN 2018: 37-51 - [c7]Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Mahmoud Parham, Stefan Schmid:
Waypoint Routing in Special Networks. Networking 2018: 496-504 - [c6]Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Distributed Domination on Graph Classes of Bounded Expansion. SPAA 2018: 143-151 - [i13]Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, Sebastian Wiederrecht:
Short Schedules for Fast Flow Rerouting. CoRR abs/1805.06315 (2018) - [i12]Saeed Akhoondian Amiri, Alexandru Popa, Golnoosh Shahkarami, Hossein Vahidi:
Complexity of computing the anti-Ramsey numbers. CoRR abs/1810.08004 (2018) - 2017
- [b1]Saeed Akhoondian Amiri:
Structural graph theory meets algorithms: covering and connectivity problems in graphs (Strukturelle Graphentheorie trifft Algorithmen: Überdeckungs- und Zusammenhangsprobleme in Graphen). TU Berlin, Germany, 2017 - [j2]Ali Golshani, Dara Moazzami, Saeed Akhoondian Amiri:
On the complexity of recognizing tenacious graphs. Ars Comb. 131: 11-21 (2017) - [i11]Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Distributed Domination on Graph Classes of Bounded Expansion. CoRR abs/1702.02848 (2017) - [i10]Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid:
Charting the Complexity Landscape of Waypoint Routing. CoRR abs/1705.00055 (2017) - [i9]Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz:
Distributed Dominating Set Approximations beyond Planar Graphs. CoRR abs/1705.09617 (2017) - [i8]Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid:
Walking Through Waypoints. CoRR abs/1708.09827 (2017) - 2016
- [j1]Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich:
DAG-width is PSPACE-complete. Theor. Comput. Sci. 655: 78-89 (2016) - [c5]Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich:
Routing with Congestion in Acyclic Digraphs. MFCS 2016: 7:1-7:11 - [c4]Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz:
A Local Constant Factor MDS Approximation for Bounded Genus Graphs. PODC 2016: 227-233 - [c3]Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid:
Transiently Consistent SDN Updates: Being Greedy is Hard. SIROCCO 2016: 391-406 - [i7]Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz:
A local constant factor approximation for the minimum dominating set problem on bounded genus graphs. CoRR abs/1602.02991 (2016) - [i6]Saeed Akhoondian Amiri, Ken-ichi Kawarabayashi, Stephan Kreutzer, Paul Wollan:
The Erdos-Posa Property for Directed Graphs. CoRR abs/1603.02504 (2016) - [i5]Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich:
Routing with Congestion in Acyclic Digraphs. CoRR abs/1605.01866 (2016) - [i4]Saeed Akhoondian Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid:
Transiently Consistent SDN Updates: Being Greedy is Hard. CoRR abs/1605.03158 (2016) - [i3]Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht:
Congestion-Free Rerouting of Flows on DAGs. CoRR abs/1611.09296 (2016) - 2015
- [c2]Saeed Akhoondian Amiri, Lukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz:
Graph Searching Games and Width Measures for Directed Graphs. STACS 2015: 34-47 - 2014
- [c1]Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz:
Vertex Disjoint Paths in Upward Planar Graphs. CSR 2014: 52-64 - [i2]Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich:
DAG-width is PSPACE-complete. CoRR abs/1411.2438 (2014) - 2013
- [i1]Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz:
Vertex Disjoint Path in Upward Planar Graphs. CoRR abs/1312.1526 (2013)
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-05-08 21:03 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:
