Author of the publication

Reducing Rank of the Adjacency Matrix by Graph Modification.

, , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 361-373. Springer, (2015)

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

Rank Vertex Cover as a Natural Problem for Algebraic Compression., , , and . CoRR, (2017)PTAS for Steiner Tree on Map Graphs., , , , and . CoRR, (2019)Reducing Rank of the Adjacency Matrix by Graph Modification., , and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 361-373. Springer, (2015)Rectangle Tiling Binary Arrays., , and . APPROX/RANDOM, volume 317 of LIPIcs, page 28:1-28:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Unknot Recognition Through Quantifier Elimination., and . SC-Square@FLOC, volume 2189 of CEUR Workshop Proceedings, page 77. CEUR-WS.org, (2018)Parameterized complexity of Strip Packing and Minimum Volume Packing., , , and . Theor. Comput. Sci., (2017)Dense Steiner problems: Approximation algorithms and inapproximability., , , and . CoRR, (2020)Matrix Rigidity from the Viewpoint of Parameterized Complexity., , , , and . STACS, volume 66 of LIPIcs, page 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Rank Reduction of Directed Graphs by Vertex and Edge Deletions., and . LATIN, volume 9644 of Lecture Notes in Computer Science, page 619-633. Springer, (2016)Approximate Shifted Combinatorial Optimization., , , and . CoRR, (2017)