Amirreza Akbari

Generating author description...

All published works

Action	Title	Year	Authors
+	Online Locality Meets Distributed Quantum Computing	2024	Amirreza Akbari Xavier Coiteux-Roy Francesco d’Amore François Le Gall Henrik Lievonen Darya Melnyk Augusto Modanese Shreyas Pai Marc-Olivier Renou Václav Rozhoň
+	Online Algorithms with Lookaround.	2021	Amirreza Akbari Henrik Lievonen Darya Melnyk Joona Sarkijarvi Jukka Suomela
+ PDF Chat	Independent domination in subcubic graphs	2021	Amirreza Akbari Saieed Akbari Ali Doosthosseini Z. Hadizadeh Michael A. Henning A. Naraghi
+	Locality in online, dynamic, sequential, and distributed graph algorithms	2021	Amirreza Akbari Henrik Lievonen Darya Melnyk Joona Särkijärvi Jukka Suomela
+	Independent Domination in Subcubic Graphs	2020	Amirreza Akbari Saieed Akbari Ali Doosthosseini Z. Hadizadeh Michael A. Henning A. Naraghi

Common Coauthors

Coauthor	Papers Together
Henrik Lievonen	3
Jukka Suomela	3
Darya Melnyk	3
A. Naraghi	2
Michael A. Henning	2
Ali Doosthosseini	2
Saieed Akbari	2
Z. Hadizadeh	2
Augusto Modanese	1
Joona Sarkijarvi	1
Marc-Olivier Renou	1
Francesco d’Amore	1
Joona Särkijärvi	1
Shreyas Pai	1
François Le Gall	1
Xavier Coiteux-Roy	1
Václav Rozhoň	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Independent domination in regular graphs	1995	Julie Haviland	2
+	Upper bounds for independent domination in regular graphs	2007	Julie Haviland	2
+	A note on the independent domination number in graphs	2013	Nader Jafari Rad Lutz Volkmann	2
+ PDF Chat	A note on the independent domination number versus the domination number in bipartite graphs	2017	Shaohui Wang Bing Wei	2
+	On independent domination number of regular graphs	1999	Peter Che Bor Lam Wai Chee Shiu Liang Sun	2
+	A Structural Approach for Independent Domination of Regular Graphs	2014	Jeremy Lyle	2
+ PDF Chat	A Note on Independent Sets in Graphs with Large Minimum Degree and Small Cliques	2014	Jeremy Lyle	2
+ PDF Chat	The Distributed Complexity of Locally Checkable Problems on Paths is Decidable	2019	Alkida Balliu Sebastian Brandt Yi‐Jun Chang Dennis Olivetti Mikaël Rabie Jukka Suomela	1
+ PDF Chat	An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model	2016	Yi‐Jun Chang Tsvi Kopelowitz Seth Pettie	1
+ PDF Chat	A Time Hierarchy Theorem for the LOCAL Model	2017	Yi‐Jun Chang Seth Pettie	1
+ PDF Chat	On Derandomizing Local Distributed Algorithms	2018	Mohsen Ghaffari David G. Harris Fabian Kühn	1
+ PDF Chat	Distributed Graph Problems Through an Automata-Theoretic Lens	2021	Yi‐Jun Chang Jan Studený Jukka Suomela	1
+	Local Mending	2021	Alkida Balliu Juho Hirvonen Darya Melnyk Dennis Olivetti Joel Rybicki Jukka Suomela	1
+	Locality in Online Algorithms.	2021	Maciej Pacut Mahmoud Parham Joel Rybicki Stefan Schmid Jukka Suomela Aleksandr Tereshchenko	1
+ PDF Chat	Locally Checkable Problems in Rooted Trees	2021	Alkida Balliu Sebastian Brandt Dennis Olivetti Jan Studený Jukka Suomela Aleksandr Tereshchenko	1
+	What Can be Computed Locally?	1995	Moni Naor Larry Stockmeyer	1
+ PDF Chat	A lower bound for the distributed Lovász local lemma	2016	Sebastian Brandt Orr Fischer Juho Hirvonen Barbara Keller Tuomo Lempiäinen Joel Rybicki Jukka Suomela Jara Uitto	1
+ PDF Chat	Online matching: haste makes waste!	2016	Yuval Emek Shay Kutten Roger Wattenhofer	1
+ PDF Chat	On the complexity of local distributed graph problems	2017	Mohsen Ghaffari Fabian Kühn Yannic Maus	1
+	A Local Computation Approximation Scheme to Maximum Matching	2013	Yishay Mansour Shai Vardi	1
+ PDF Chat	Hardness of Minimal Symmetry Breaking in Distributed Computing	2019	Alkida Balliu Juho Hirvonen Dennis Olivetti Jukka Suomela	1