A Simpler Bit-parallel Algorithm for Swap Matching. - Václav Blazej; Ondrej Suchý 001; Tomás Valla (CoRR, 2016)

A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching. - Václav Blazej; Ondrej Suchý 001; Tomás Valla (MACIS, 2017)

On Induced Online Ramsey Number of Paths, Cycles, and Trees. - Václav Blazej; Pavel Dvorák; Tomás Valla (CSR, 2019)

On the m-eternal Domination Number of Cactus Graphs. - Václav Blazej; Jan Matyás Kristan; Tomás Valla (RP, 2019)

On the edge-length ratio of 2-trees. - Václav Blazej; Jirí Fiala 001; Giuseppe Liotta; Simon Lomic (CoRR, 2019)

On the Edge-Length Ratio of 2-Trees. - Václav Blazej; Jirí Fiala 001; Giuseppe Liotta (GD, 2020)

On the Intersections of Non-homotopic Loops. - Václav Blazej; Michal Opler; Matas Sileikis; Pavel Valtr 001 (CALDAM, 2021)

Non-homotopic Loops with a Bounded Number of Pairwise Intersections. - Václav Blazej; Michal Opler; Matas Sileikis; Pavel Valtr 001 (GD, 2021)

On Edge-Length Ratios of Partial 2-Trees. - Václav Blazej; Jirí Fiala 001; Giuseppe Liotta (Int. J. Comput. Geom. Appl., 2021)

Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract). - Václav Blazej; Dusan Knop; Simon Schierreich (AAAI, 2022)

On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. - Václav Blazej; Pratibha Choudhary; Dusan Knop; Simon Schierreich; Ondrej Suchý 001; Tomás Valla (ESA, 2022)

Efficient attack sequences in m-eternal domination. - Václav Blazej; Jan Matyás Kristan; Tomás Valla (CoRR, 2022)

The Parameterized Complexity of Network Microaggregation. - Václav Blazej; Robert Ganian; Dusan Knop; Jan Pokorný; Simon Schierreich; Kirill Simonov (AAAI, 2023)

On the Smallest Synchronizing Terms of Finite Tree Automata. - Václav Blazej; Jan Janousek; Stepán Plachý (CIAA, 2023)

Computing m-Eternal Domination Number of Cactus Graphs in Linear Time. - Václav Blazej; Jan Matyás Kristan; Tomás Valla (CoRR, 2023)

Bears with Hats and Independence Polynomials. - Václav Blazej; Pavel Dvorák; Michal Opler (Discret. Math. Theor. Comput. Sci., 2023)

Polynomial kernels for tracking shortest paths. - Václav Blazej; Pratibha Choudhary; Dusan Knop; Jan Matyás Kristan; Ondrej Suchý 001; Tomás Valla (Inf. Process. Lett., 2023)

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ý 001; Tomás Valla (Discret. Optim., 2023)

Constrained and Ordered Level Planarity Parameterized by the Number of Levels. - Václav Blazej; Boris Klemz; Felix Klesen; Marie Diana Sieper; Alexander Wolff 001; Johannes Zink 001 (SoCG, 2024)

On Controlling Knockout Tournaments Without Perfect Information. - Václav Blazej; Sushmita Gupta; M. S. Ramanujan 001; Peter Strulo (IPEC, 2024)

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. - Václav Blazej; Satyabrata Jana; M. S. Ramanujan 001; Peter Strulo (IPEC, 2024)

Equitable Connected Partition and Structural Parameters Revisited: N-Fold Beats Lenstra. - Václav Blazej; Dusan Knop; Jan Pokorný; Simon Schierreich (MFCS, 2024)

Online Ramsey Numbers: Long versus Short Cycles. - Grzegorz Adamski; Malgorzata Bednarska-Bzdega; Václav Blazej (SIAM J. Discret. Math., 2024)

A Parameterized Perspective of All-Colors. - Václav Blazej; Satyabrata Jana; Peter Strulo (CIAC (1), 2025)

Tractable Graph Structures in EFX Orientation. - Václav Blazej; Sushmita Gupta; M. S. Ramanujan 001; Peter Strulo (SAGT, 2025)

Parameterized Complexity of Directed Traveling Salesman Problem. - Václav Blazej; Andreas Emil Feldmann; Foivos Fioravantes; Pawel Rzazewski; Ondrej Suchý 001 (CoRR, 2025)

On Approximate MMS Allocations on Restricted Graph Classes. - Václav Blazej; Michal Debski; Zbigniew Lonc; Marta Piecyk; Pawel Rzazewski (CoRR, 2025)