Author of the publication

Balanced Connected Subgraph Problem in Geometric Intersection Graphs.

, , , and . COCOA, volume 11949 of Lecture Notes in Computer Science, page 56-68. Springer, (2019)

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

The balanced connected subgraph problem for geometric intersection graphs., , , and . Theor. Comput. Sci., (2022)Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity., , , and . IPEC, volume 285 of LIPIcs, page 5:1-5:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Parameterized complexity of perfectly matched sets., , , and . Theor. Comput. Sci., (May 2023)The balanced connected subgraph problem., , , , , and . Discret. Appl. Math., (2022)Balanced Connected Subgraph Problem in Geometric Intersection Graphs., , , and . COCOA, volume 11949 of Lecture Notes in Computer Science, page 56-68. Springer, (2019)Parameterized Complexity of Perfectly Matched Sets., , , and . IPEC, volume 249 of LIPIcs, page 2:1-2:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The Balanced Connected Subgraph Problem., , , , , and . CALDAM, volume 11394 of Lecture Notes in Computer Science, page 201-215. Springer, (2019)On the Parameterized Complexity of Eulerian Strong Component Arc Deletion., , , and . CoRR, (2024)Maximum Bipartite Subgraph of Geometric Intersection Graphs., , , and . WALCOM, volume 12049 of Lecture Notes in Computer Science, page 158-169. Springer, (2020)A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion., , and . LATIN (2), volume 14579 of Lecture Notes in Computer Science, page 208-222. Springer, (2024)