Author of the publication

Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models.

, , , , , and . ICDM, page 829-834. IEEE Computer Society, (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.

 

Other publications of authors with the same name

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class., , , , , , , and . CoRR, (2018)Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class., , , , , , , and . ESA, volume 144 of LIPIcs, page 37:1-37:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Mining Maximal Induced Bicliques using Odd Cycle Transversals., , and . CoRR, (2018)Approximating Vertex Cover using Structural Rounding., , , and . ALENEX, page 70-80. SIAM, (2020)A Fast Parameterized Algorithm for Co-Path Set., and . IPEC, volume 63 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models., , , , , and . ICDM, page 829-834. IEEE Computer Society, (2016)Approximating Vertex Cover using Structural Rounding., , , and . CoRR, (2019)A practical fpt algorithm for Flow Decomposition and transcript assembly., , , , , , and . CoRR, (2017)Mining Maximal Induced Bicliques using Odd Cycle Transversals., , and . SDM, page 324-332. SIAM, (2019)Faster Biclique Mining in Near-Bipartite Graphs., , and . SEA², volume 11544 of Lecture Notes in Computer Science, page 424-453. Springer, (2019)