Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVáclav Blazej
Person information
- unicode name: Václav Blažej
- affiliation: Czech Technical University in Prague, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Václav Blazej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink:
Constrained and Ordered Level Planarity Parameterized by the Number of Levels. SoCG 2024: 20:1-20:16- [i13]Václav Blazej, Boris Klemz, Felix Klesen, Marie Diana Sieper, Alexander Wolff, Johannes Zink:
Constrained and Ordered Level Planarity Parameterized by the Number of Levels. CoRR abs/2403.13702 (2024) - [i12]Václav Blazej, Dusan Knop, Jan Pokorný, Simon Schierreich:
Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra. CoRR abs/2404.18968 (2024) - 2023
- [j2]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan
, Ondrej Suchý, Tomás Valla:
Constant factor approximation for tracking paths and fault tolerant feedback vertex set. Discret. Optim. 47: 100756 (2023) - [j1]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Polynomial kernels for tracking shortest paths. Inf. Process. Lett. 179: 106315 (2023) - [c12]Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov:
The Parameterized Complexity of Network Microaggregation. AAAI 2023: 6262-6270 - [c11]Václav Blazej, Jan Janousek, Stepán Plachý:
On the Smallest Synchronizing Terms of Finite Tree Automata. CIAA 2023: 79-90 - [i11]Václav Blazej, Jan Matyás Kristan, Tomás Valla:
Computing m-Eternal Domination Number of Cactus Graphs in Linear Time. CoRR abs/2301.05155 (2023) - 2022
- [c10]Václav Blazej, Dusan Knop, Simon Schierreich:
Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract). AAAI 2022: 12919-12920 - [c9]Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla:
On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. ESA 2022: 22:1-22:16 - [i10]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Polynomial Kernels for Tracking Shortest Paths. CoRR abs/2202.11927 (2022) - [i9]Václav Blazej, Jan Matyás Kristan, Tomás Valla:
Efficient attack sequences in m-eternal domination. CoRR abs/2204.02720 (2022) - [i8]Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla:
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations. CoRR abs/2207.01109 (2022) - 2021
- [c8]Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr:
On the Intersections of Non-homotopic Loops. CALDAM 2021: 196-205 - [c7]Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr:
Non-homotopic Loops with a Bounded Number of Pairwise Intersections. GD 2021: 210-222 - [c6]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. WAOA 2021: 23-38 - [c5]Václav Blazej, Pavel Dvorák, Michal Opler:
Bears with Hats and Independence Polynomials. WG 2021: 283-295 - [i7]Václav Blazej, Pavel Dvorák, Michal Opler:
Bears with Hats and Independence Polynomials. CoRR abs/2103.07401 (2021) - [i6]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. CoRR abs/2108.01430 (2021) - [i5]Václav Blazej, Michal Opler, Matas Sileikis, Pavel Valtr:
Non-homotopic Loops with a Bounded Number of Pairwise Intersections. CoRR abs/2108.13953 (2021) - 2020
- [c4]Václav Blazej, Jirí Fiala, Giuseppe Liotta:
On the Edge-Length Ratio of 2-Trees. GD 2020: 85-98
2010 – 2019
- 2019
- [c3]Václav Blazej, Pavel Dvorák, Tomás Valla:
On Induced Online Ramsey Number of Paths, Cycles, and Trees. CSR 2019: 60-69 - [c2]Václav Blazej, Jan Matyás Kristan, Tomás Valla:
On the m-eternal Domination Number of Cactus Graphs. RP 2019: 33-47 - [i4]Václav Blazej, Pavel Dvorák, Tomás Valla:
On Induced Online Ramsey Number of Paths, Cycles, and Trees. CoRR abs/1901.03671 (2019) - [i3]Václav Blazej, Jan Matyás Kristan, Tomás Valla:
On the m-eternal Domination Number of Cactus Graphs. CoRR abs/1907.07910 (2019) - [i2]Václav Blazej, Jirí Fiala, Giuseppe Liotta, Simon Lomic:
On the edge-length ratio of 2-trees. CoRR abs/1909.11152 (2019) - 2017
- [c1]Václav Blazej, Ondrej Suchý, Tomás Valla:
A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching. MACIS 2017: 333-348 - 2016
- [i1]Václav Blazej, Ondrej Suchý, Tomás Valla:
A Simpler Bit-parallel Algorithm for Swap Matching. CoRR abs/1606.04763 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-07 19:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
