Tomas Toufar

According to our database, Tomas Toufar authored at least 7 papers between 2013 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2019

Parameterized Complexity of Fair Vertex Evaluation Problems.

Dusan Knop, Tomás Masarík, Tomás Toufar

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Parameterized complexity of fair deletion problems II.

Dusan Knop, Tomás Masarík, Tomás Toufar

CoRR, 2018

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.

Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Target Set Selection in Dense Graph Classes.

Pavel Dvorák, Dusan Knop, Tomás Toufar

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.

Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Parameterized Complexity of Fair Deletion Problems.

Tomás Masarík, Tomás Toufar

Proceedings of the Theory and Applications of Models of Computation, 2017

2013

Amalgam Width of Matroids.

Lukás Mach, Tomas Toufar

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013