Author of the publication

Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths.

, , , , and . Inf. Process. Lett., 116 (6): 433-436 (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

Strong immersion is a well-quasi-ordering for semicomplete digraphs., , and . J. Graph Theory, 90 (4): 484-496 (2019)Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths., , , , and . Inf. Process. Lett., 116 (6): 433-436 (2016)Quasiperiods of biinfinite words., , and . Eur. J. Comb., (2020)Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs., , and . ACM Trans. Algorithms, 14 (3): 38:1-38:31 (2018)On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs., , and . IPEC, volume 115 of LIPIcs, page 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Parameterized and Approximation Algorithms for the Load Coloring Problem., , , and . CoRR, (2014)Strong immersion is a well-quasi-ordering for semi-complete digraphs., , and . CoRR, (2017)Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs., , and . ICALP, volume 80 of LIPIcs, page 70:1-70:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Parameterized and Approximation Algorithms for the Load Coloring Problem., , , and . Algorithmica, 79 (1): 211-229 (2017)Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths., , , , and . CoRR, (2015)