Author of the publication

The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results.

, and . WG, volume 9224 of Lecture Notes in Computer Science, page 169-185. 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

Inapproximability results for graph convexity parameters., , and . Theor. Comput. Sci., (2015)Complexity and winning strategies of graph convexity games (Brief Announcement)., , , and . LAGOS, volume 223 of Procedia Computer Science, page 394-396. Elsevier, (2023)Spy Game: FPT-Algorithm and Results on Graph Products., , and . COCOON, volume 13025 of Lecture Notes in Computer Science, page 680-691. Springer, (2021)Inapproximability Results for Graph Convexity Parameters., , and . WAOA, volume 8447 of Lecture Notes in Computer Science, page 97-107. Springer, (2013)PSPACE-completeness of two graph coloring games., , , and . Theor. Comput. Sci., (2020)The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results., and . WG, volume 9224 of Lecture Notes in Computer Science, page 169-185. Springer, (2015)On the complexity of the flow coloring problem., , , and . Discret. Appl. Math., (2015)Target set selection with maximum activation time., , , , and . Discret. Appl. Math., (October 2023)The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results., , and . WG, volume 8747 of Lecture Notes in Computer Science, page 372-383. Springer, (2014)Graph convexity impartial games: Complexity and winning strategies., , , , and . Theor. Comput. Sci., (2024)