( en | de | ru )

 

Disambiguation of "Pourmoradnasseri, Mozhgan"

Author of the publication

copydeleteadd this publication to your clipboard
On the Graph of the Pedigree Polytope.

, , and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mozhgan Donyaei

Mozhgan Bizhang

 

Other publications of authors with the same name

Enumerating Minimal Transversals of Hypergraphs without Small Holes., , and . MFCS, volume 117 of LIPIcs, page 55:1-55:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)., , and . CoRR, (2016)A Survey on the Advancement of Travel Time Estimation Using Mobile Phone Network Data., and . IEEE Trans. Intell. Transp. Syst., 23 (8): 11779-11788 (2022)Exploring Machine Learning Techniques to Identify Important Factors Leading to Injury in Curve Related Crashes., , , and . CoRR, (2023)A Real-Time Model for Pedestrian Flow Estimation in Urban Areas based on IoT Sensors., , and . ITSC, page 4124-4130. IEEE, (2022)On the Graph of the Pedigree Polytope., , and . CoRR, (2016)The Rectangle Covering Number of Random Boolean Matrices., and . Electron. J. Comb., 24 (2): 2 (2017)The (Minimum) Rank of Typical Fooling-Set Matrices., and . CSR, volume 10304 of Lecture Notes in Computer Science, page 273-284. Springer, (2017)Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract)., and . CoRR, (2016)The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)., , and . CALDAM, volume 10156 of Lecture Notes in Computer Science, page 294-307. Springer, (2017)