Václav Blazej

Orcid: 0000-0001-9165-6280

Affiliations:
  • Czech Technical University in Prague, Prague, Czech Republic


According to our database1, Václav Blazej authored at least 18 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2023
Constant factor approximation for tracking paths and fault tolerant feedback vertex set.
Discret. Optim., February, 2023

Polynomial kernels for tracking shortest paths.
Inf. Process. Lett., 2023

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

On the Smallest Synchronizing Terms of Finite Tree Automata.
Proceedings of the Implementation and Application of Automata, 2023

The Parameterized Complexity of Network Microaggregation.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Efficient attack sequences in m-eternal domination.
CoRR, 2022

On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract).
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Bears with Hats and Independence Polynomials.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Non-homotopic Loops with a Bounded Number of Pairwise Intersections.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

On the Intersections of Non-homotopic Loops.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
On the Edge-Length Ratio of 2-Trees.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019
On the edge-length ratio of 2-trees.
CoRR, 2019

On the m-eternal Domination Number of Cactus Graphs.
Proceedings of the Reachability Problems - 13th International Conference, 2019

On Induced Online Ramsey Number of Paths, Cycles, and Trees.
Proceedings of the Computer Science - Theory and Applications, 2019

2017
A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2016
A Simpler Bit-parallel Algorithm for Swap Matching.
CoRR, 2016


  Loading...