Author of the publication

Partial Complementation of Graphs.

, , , and . SWAT, volume 101 of LIPIcs, page 21:1-21:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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

Minimum Fill-in of Sparse Graphs: Kernelization and Approximation., , and . FSTTCS, volume 13 of LIPIcs, page 164-175. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Parameterized Low-Rank Binary Matrix Approximation., , and . ICALP, volume 107 of LIPIcs, page 53:1-53:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Structured Connectivity Augmentation., , and . MFCS, volume 83 of LIPIcs, page 29:1-29:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Parameterized Complexity of Connected Even/Odd Subgraph Problems., and . STACS, volume 14 of LIPIcs, page 432-440. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Editing to Connected f-Degree Graph., , , and . STACS, volume 47 of LIPIcs, page 36:1-36:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Exact Algorithms for Terrain Guarding., , , , and . ACM Trans. Algorithms, 14 (2): 25:1-25:20 (2018)Complexity of approximating the oriented diameter of chordal graphs., , and . J. Graph Theory, 45 (4): 255-269 (2004)Backbone colorings for graphs: Tree and path backbones., , , and . J. Graph Theory, 55 (2): 137-152 (2007)Shortest Cycles with Monotone Submodular Costs., , , , and . ACM Trans. Algorithms, 20 (1): 2:1-2:16 (January 2024)FPT approximation and subexponential algorithms for covering few or many edges., , , and . Inf. Process. Lett., (March 2024)