( en | de | ru )

 

Disambiguation of "Dalirrooyfard, Mina"

Author of the publication

copydeleteadd this publication to your clipboard
A Note on Signed k-Submatching in Graphs.

, , , and . CoRR, (2014)

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.

Mina Hummel

Mina Reza

Mina Kaufmann

Mina Motamedi

Mina Farag

 

Other publications of authors with the same name

Listing Cliques from Smaller Cliques., , , and . CoRR, (2023)Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models., , and . CoRR, (2024)In- or out-of-distribution detection via dual divergence estimation., , , , and . UAI, volume 216 of Proceedings of Machine Learning Research, page 635-646. PMLR, (2023)A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems., , , and . CoRR, (2022)Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs., and . CoRR, (2020)A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems., , , and . ITCS, volume 251 of LIPIcs, page 38:1-38:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles., , and . SIAM J. Comput., 50 (5): 1627-1662 (2021)On Diameter Approximation in Directed Graphs., , , and . ESA, volume 274 of LIPIcs, page 2:1-2:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A note on signed k-submatching in graphs., , , and . Australas. J Comb., (2016)Nearly Tight Bounds For Differentially Private Min s-t and Multiway Cut., , and . CoRR, (2023)