Václav Blazej

According to our database, Václav Blazej authored at least 31 papers between 2016 and 2026.

Collaborative distances:

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

2026

A coarse Menger's Theorem for planar and bounded genus graphs.

Václav Blazej, Michal Pilipczuk, Evangelos Protopapas

CoRR, May, 2026

Tree-independence number of P₅-free graphs with no large bicliques.

Václav Blazej, Jochen Pascal Gollin, Tomás Hons, Tomás Masarík, Martin Milanic, Pawel Rzazewski, Ondrej Suchý, Alexandra Wesolek

CoRR, May, 2026

2025

Tractable Graph Structures in EFX Orientation.

Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo

Proceedings of the Algorithmic Game Theory - 18th International Symposium, 2025

Bridging Treewidth and Clique-Width via Cograph-Modular-Treewidth.

Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo

Proceedings of the 20th International Symposium on Parameterized and Exact Computation, 2025

Parameterized Complexity of Directed Traveling Salesman Problem.

Václav Blazej, Andreas Emil Feldmann, Foivos Fioravantes, Pawel Rzazewski, Ondrej Suchý

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

On Approximate MMS Allocations on Restricted Graph Classes.

Václav Blazej, Michal Debski, Zbigniew Lonc, Marta Piecyk, Pawel Rzazewski

Proceedings of the ECAI 2025 - 28th European Conference on Artificial Intelligence, 25-30 October 2025, Bologna, Italy, 2025

A Parameterized Perspective of All-Colors.

Václav Blazej, Satyabrata Jana, Peter Strulo

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

Online Ramsey Numbers: Long versus Short Cycles.

Grzegorz Adamski, Malgorzata Bednarska-Bzdega, Václav Blazej

SIAM J. Discret. Math., 2024

Equitable Connected Partition and Structural Parameters Revisited: N-Fold Beats Lenstra.

Václav Blazej, Dusan Knop, Jan Pokorný, Simon Schierreich

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion.

Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

On Controlling Knockout Tournaments Without Perfect Information.

Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Constrained and Ordered Level Planarity Parameterized by the Number of Levels.

Václav Blazej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Polynomial kernels for tracking shortest paths.

Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla

Inf. Process. Lett., 2023

Computing m-Eternal Domination Number of Cactus Graphs in Linear Time.

Václav Blazej, Jan Matyás Kristan, Tomás Valla

CoRR, 2023

On the Smallest Synchronizing Terms of Finite Tree Automata.

Václav Blazej, Jan Janousek, Stepán Plachý

Proceedings of the Implementation and Application of Automata, 2023

The Parameterized Complexity of Network Microaggregation.

Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Složitost her na grafech ; Complexity of Games on Graphs.

Václav Blazej

PhD thesis, 2022

Efficient attack sequences in m-eternal domination.

Václav Blazej, Jan Matyás Kristan, Tomás Valla

CoRR, 2022

On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations.

Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract).

Václav Blazej, Dusan Knop, Simon Schierreich

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

On Edge-Length Ratios of Partial 2-Trees.

Václav Blazej, Jirí Fiala, Giuseppe Liotta

Int. J. Comput. Geom. Appl., 2021

Bears with Hats and Independence Polynomials.

Václav Blazej, Pavel Dvorák, Michal Opler

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

Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set.

Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla

Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

Non-homotopic Loops with a Bounded Number of Pairwise Intersections.

Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

On the Intersections of Non-homotopic Loops.

Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

On the Edge-Length Ratio of 2-Trees.

Václav Blazej, Jirí Fiala, Giuseppe Liotta

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019

On the edge-length ratio of 2-trees.

Václav Blazej, Jirí Fiala, Giuseppe Liotta, Simon Lomic

CoRR, 2019

On the m-eternal Domination Number of Cactus Graphs.

Václav Blazej, Jan Matyás Kristan, Tomás Valla

Proceedings of the Reachability Problems - 13th International Conference, 2019

On Induced Online Ramsey Number of Paths, Cycles, and Trees.

Václav Blazej, Pavel Dvorák, Tomás Valla

Proceedings of the Computer Science - Theory and Applications, 2019

2017

A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching.

Václav Blazej, Ondrej Suchý, Tomás Valla

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2016

A Simpler Bit-parallel Algorithm for Swap Matching.

Václav Blazej, Ondrej Suchý, Tomás Valla

CoRR, 2016