Author of the publication

Parameterized Complexity of Superstring Problems.

, , , , , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 89-99. 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

Approximating acyclicity parameters of sparse hypergraphs, , and . CoRR, (2008)Exploring Subexponential Parameterized Complexity of Completion Problems., , , and . CoRR, (2013)A 3-approximation for the pathwidth of Halin graphs., and . Electron. Notes Discret. Math., (2004)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 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)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)Cops and Robber with Constraints., , and . SIAM J. Discret. Math., 26 (2): 571-590 (2012)Complexity of approximating the oriented diameter of chordal graphs., , and . J. Graph Theory, 45 (4): 255-269 (2004)