default search action
Ahad N. Zehmakan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Ahad N. Zehmakan
:
Majority opinion diffusion: when tie-breaking rule matters. Auton. Agents Multi Agent Syst. 38(1): 21 (2024) - [j8]Charlotte Out
Majority vote in social networks. Inf. Sci. 657: 119970 (2024) - [j7]Changan Liu
A Fast Algorithm for Moderating Critical Nodes via Edge Removal. IEEE Trans. Knowl. Data Eng. 36(4): 1385-1398 (2024) - [c18]Ahad N. Zehmakan, Xiaotian Zhou, Zhongzhi Zhang:
Viral Marketing in Social Networks with Competing Products. AAMAS 2024: 2047-2056 - [c17]Ahad N. Zehmakan:
Majority-based Preference Diffusion on Social Networks. AAMAS 2024: 2057-2065 - [c16]Charlotte Out
The Impact of External Sources on the Friedkin-Johnsen Model. CIKM 2024: 1815-1824 - [c15]Zenan Lu, Xiaotian Zhou, Ahad N. Zehmakan, Zhongzhi Zhang:
Resistance Eccentricity in Graphs: Distribution, Computation and Optimization. ICDE 2024: 4113-4126 - [c14]Changan Liu
Fast Query of Biharmonic Distance in Networks. KDD 2024: 1887-1897 - [i30]Paras Stefanopoulos, Ahad N. Zehmakan, Sourin Chatterjee:
A First Principles Approach to Trust-Based Recommendation Systems. CoRR abs/2407.00062 (2024) - [i29]Changan Liu, Ahad N. Zehmakan, Zhongzhi Zhang:
Fast Query of Biharmonic Distance in Networks. CoRR abs/2408.13538 (2024) - [i28]Mohammad Shirzadi, Ahad N. Zehmakan:
Do Stubborn Users Always Cause More Polarization and Disagreement? A Mathematical Study. CoRR abs/2410.22577 (2024) - 2023
- [c13]Ahad N. Zehmakan:
Random Majority Opinion Diffusion: Stabilization Time, Absorbing States, and Influential Nodes. AAMAS 2023: 2179-2187 - [c12]Hossein Soltani, Ahad N. Zehmakan
Minimum Target Sets in Non-Progressive Threshold Models: When Timing Matters. ECAI 2023: 2178-2185 - [c11]Ahad N. Zehmakan
Why Rumors Spread Fast in Social Networks, and How to Stop It. IJCAI 2023: 234-242 - [i27]Ahad N. Zehmakan
Random Majority Opinion Diffusion: Stabilization Time, Absorbing States, and Influential Nodes. CoRR abs/2302.06760 (2023) - [i26]Ahad N. Zehmakan, Charlotte Out, Sajjad Hesamipour Khelejan:
Why Rumors Spread Fast in Social Networks, and How to Stop It. CoRR abs/2305.08558 (2023) - [i25]Sourin Chatterjee, Ahad N. Zehmakan:
Effective Vaccination Strategies in Network-based SIR Model. CoRR abs/2305.16458 (2023) - [i24]Hossein Soltani, Ahad N. Zehmakan, Ataabak B. Hushmandi:
Minimum Target Sets in Non-Progressive Threshold Models: When Timing Matters. CoRR abs/2307.09111 (2023) - [i23]Ahad N. Zehmakan, Khushvind Maurya:
Mitigating Misinformation Spreading in Social Networks Via Edge Blocking. CoRR abs/2308.08860 (2023) - [i22]Seyedali Tabaeiaghdaei, Marc Wyss, Giacomo Giuliari, Jelte van Bommel, Ahad N. Zehmakan
Inter-Domain Routing with Extensible Criteria. CoRR abs/2309.03551 (2023) - [i21]Changan Liu, Xiaotian Zhou, Ahad N. Zehmakan, Zhongzhi Zhang:
A Fast Algorithm for Moderating Critical Nodes via Edge Removal. CoRR abs/2309.06392 (2023) - [i20]Sining Li, Ahad N. Zehmakan:
Graph-Based Generalization of Galam Model: Convergence Time and Influential Nodes. CoRR abs/2312.12811 (2023) - [i19]Ahad N. Zehmakan
Majority-based Preference Diffusion on Social Networks. CoRR abs/2312.15140 (2023) - [i18]Ahad N. Zehmakan
Viral Marketing in Social Networks with Competing Products. CoRR abs/2312.15819 (2023) - 2022
- [c10]Nicolas Emmenegger, Rasmus Kyng, Ahad N. Zehmakan:
On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization. AISTATS 2022: 10718-10752 - [c9]Ahad N. Zehmakan
Mitigating Misinformation Spreading in Social Networks via Edge Blocking. PRICAI (1) 2022: 98-103 - 2021
- [j6]Ahad N. Zehmakan
Threshold behavior of bootstrap percolation. Discret. Math. 344(2): 112211 (2021) - [j5]Ahad N. Zehmakan
On the spread of influence in graphs. Inf. Comput. 281: 104808 (2021) - [j4]Bernd Gärtner, Ahad N. Zehmakan
Majority rule cellular automata. Theor. Comput. Sci. 889: 41-59 (2021) - [c8]Ahad N. Zehmakan
Majority Opinion Diffusion in Social Networks: An Adversarial Approach. AAAI 2021: 5611-5619 - [c7]Charlotte Out, Ahad N. Zehmakan
Majority Vote in Social Networks: Make Random Friends or Be Stubborn to Overpower Elites. IJCAI 2021: 349-355 - [i17]Nicolas Emmenegger, Rasmus Kyng, Ahad N. Zehmakan:
On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization. CoRR abs/2103.05138 (2021) - [i16]Charlotte Out, Ahad N. Zehmakan:
Majority Vote in Social Networks: Make Random Friends or Be Stubborn to Overpower Elites. CoRR abs/2109.14265 (2021) - 2020
- [j3]Ahad N. Zehmakan
Opinion forming in Erdős-Rényi random graph and expanders. Discret. Appl. Math. 277: 280-290 (2020) - [j2]Torrie L. Nichols, Alexander Pilz, Csaba D. Tóth
Transition operations over plane trees. Discret. Math. 343(8): 111929 (2020) - [i15]Ahad N. Zehmakan:
Spread of Influence in Graphs. CoRR abs/2006.03440 (2020) - [i14]Ahad N. Zehmakan:
Majority Opinion Diffusion in Social Networks: An Adversarial Approach. CoRR abs/2012.03143 (2020)
2010 – 2019
- 2019
- [b1]Ahad N. Zehmakan:
On the Spread of Information Through Graphs. ETH Zurich, Zürich, Switzerland, 2019 - [j1]Clemens Jeger, Ahad N. Zehmakan
Dynamic monopolies in two-way bootstrap percolation. Discret. Appl. Math. 262: 116-126 (2019) - [c6]Ahad N. Zehmakan:
Two Phase Transitions in Two-Way Bootstrap Percolation. ISAAC 2019: 5:1-5:21 - [c5]Ahad N. Zehmakan
Tight Bounds on the Minimum Size of a Dynamic Monopoly. LATA 2019: 381-393 - [i13]Ahad N. Zehmakan:
Tight Bounds on the Minimum Size of a Dynamic Monopoly. CoRR abs/1901.05917 (2019) - [i12]Bernd Gärtner, Ahad N. Zehmakan:
Phase Transition in Democratic Opinion Dynamics. CoRR abs/1904.13309 (2019) - [i11]Ahad N. Zehmakan, Serge Galam:
Fake news and rumors: a trigger for proliferation or fading away. CoRR abs/1905.06894 (2019) - [i10]Ahad N. Zehmakan, Jerri Nummenpalo, Alexander Pilz, Daniel Wolleb-Graf:
Switches in Eulerian graphs. CoRR abs/1905.06895 (2019) - [i9]Ahad N. Zehmakan:
Target Set in Threshold Models. CoRR abs/1905.06896 (2019) - 2018
- [c4]Ahad N. Zehmakan:
Opinion Forming in Erdös-Rényi Random Graph and Expanders. ISAAC 2018: 4:1-4:13 - [c3]Bernd Gärtner, Ahad N. Zehmakan
Majority Model on Random Regular Graphs. LATIN 2018: 572-583 - [c2]Torrie L. Nichols, Alexander Pilz, Csaba D. Tóth, Ahad N. Zehmakan
Transition Operations over Plane Trees. LATIN 2018: 835-848 - [i8]Clemens Jeger, Ahad N. Zehmakan:
Dynamic Monopolies in Reversible Bootstrap Percolation. CoRR abs/1805.07392 (2018) - [i7]Ahad N. Zehmakan:
Opinion Forming in Binomial Random Graph and Expanders. CoRR abs/1805.12172 (2018) - [i6]Ahad N. Zehmakan:
Two Phase Transitions in Two-way Bootstrap Percolation. CoRR abs/1809.10764 (2018) - 2017
- [c1]Bernd Gärtner, Ahad N. Zehmakan
Color War: Cellular Automata with Majority-Rule. LATA 2017: 393-404 - [i5]Bernd Gärtner, Ahad N. Zehmakan:
Majority Model on Random Regular Graphs. CoRR abs/1711.07423 (2017) - [i4]Bernd Gärtner, Ahad N. Zehmakan:
(Biased) Majority Rule Cellular Automata. CoRR abs/1711.10920 (2017) - 2016
- [i3]Abdolahad Noori Zehmakan:
Bin Packing Problem: A Linear Constant-Space 3/2-Approximation Algorithm. CoRR abs/1610.08820 (2016) - 2015
- [i2]Abdolahad Noori Zehmakan:
Bin Packing Problem: Two Approximation Algorithms. CoRR abs/1508.01376 (2015) - [i1]Abdolahad Noori Zehmakan, Mojtaba Eslahi:
A linear approximation algorithm for the BPP with the best possible absolute approximation ratio. CoRR abs/1509.06048 (2015)
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-12-10 20:47 CET 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: