
BibTeX records: Maryam Bahrani
@inproceedings{DBLP:conf/icalp/BahraniIMW20, author = {Maryam Bahrani and Nicole Immorlica and Divyarthi Mohan and S. Matthew Weinberg}, title = {Asynchronous Majority Dynamics in Preferential Attachment Trees}, booktitle = {{ICALP}}, series = {LIPIcs}, volume = {168}, pages = {8:1--8:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020} }
@article{DBLP:journals/corr/abs-1907-05823, author = {Maryam Bahrani and Nicole Immorlica and Divyarthi Mohan and S. Matthew Weinberg}, title = {Asynchronous Majority Dynamics in Preferential Attachment Trees}, journal = {CoRR}, volume = {abs/1907.05823}, year = {2019} }
@article{DBLP:journals/combinatorics/BahraniL18, author = {Maryam Bahrani and J{\'{e}}r{\'{e}}mie O. Lumbroso}, title = {Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition}, journal = {Electron. J. Comb.}, volume = {25}, number = {4}, pages = {P4.47}, year = {2018} }
@inproceedings{DBLP:conf/analco/BahraniL18, author = {Maryam Bahrani and J{\'{e}}r{\'{e}}mie O. Lumbroso}, title = {Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs}, booktitle = {{ANALCO}}, pages = {143--157}, publisher = {{SIAM}}, year = {2018} }
@article{DBLP:journals/corr/abs-1711-10647, author = {Maryam Bahrani and J{\'{e}}r{\'{e}}mie O. Lumbroso}, title = {Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs}, journal = {CoRR}, volume = {abs/1711.10647}, year = {2017} }
@article{DBLP:journals/corr/BahraniL16, author = {Maryam Bahrani and J{\'{e}}r{\'{e}}mie O. Lumbroso}, title = {Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition}, journal = {CoRR}, volume = {abs/1608.01465}, year = {2016} }

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.