Author of the publication

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

Eliminating Odd Cycles by Removing a Matching., , , and . CoRR, (2017)Bipartizing with a Matching., , , and . COCOA, volume 11346 of Lecture Notes in Computer Science, page 198-213. Springer, (2018)Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4., , , , and . CTW, page 197-200. (2015)FPT algorithms to recognize well covered graphs., , , , and . Discret. Math. Theor. Comput. Sci., (2019)Designing screen layout in multimedia applications through integer programming and metaheuristic., , , , , , and . RAIRO Oper. Res., 55 (6): 3379-3397 (2021)Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4., , , , and . CoRR, (2022)Computing the Largest Bond and the Maximum Connected Cut of a Graph., , , , , , , , and . CoRR, (2020)Partitioning a Graph into Complementary Subgraphs., , and . Graphs Comb., 37 (4): 1311-1331 (2021)Linear-time algorithms for eliminating claws in graphs., , , , and . Int. Trans. Oper. Res., 31 (1): 296-315 (January 2024)On the complexity of coloring -graphs., , and . Int. Trans. Oper. Res., 28 (6): 3172-3189 (2021)