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

Almost Well-Covered Graphs Without Short Cycles., , , and . CoRR, (2017)A polynomial algorithm to find an independent set of maximum weight in a fork-free graph., and . SODA, page 26-30. ACM Press, (2006)Avoidable Vertices and Edges in Graphs., , , , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 126-139. Springer, (2019)Vector Connectivity in Graphs., , , and . TAMC, volume 7876 of Lecture Notes in Computer Science, page 331-342. Springer, (2013)Maximum independent sets in graphs of low degree., and . SODA, page 874-880. SIAM, (2007)The Maximum Independent Set Problem in Planar Graphs., , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 96-107. Springer, (2008)On total domination in the Cartesian product of graphs., , , and . Discussiones Mathematicae Graph Theory, 38 (4): 963-976 (2018)A polynomial algorithm to find an independent set of maximum weight in a fork-free graph., and . J. Discrete Algorithms, 6 (4): 595-604 (2008)Treewidth is NP-Complete on Cubic Graphs (and related results)., , , , , , , , and . CoRR, (2023)Detecting K2,3 as an Induced Minor., , , , , and . IWOCA, volume 14764 of Lecture Notes in Computer Science, page 151-164. Springer, (2024)