Václav Koubek

Publication Activity (10 Years)

Years Active: 1975-2017
Publications (10 Years): 5

Top Topics

Frequent Subgraph Mining

Multiple Dimensions

Graph Properties

Top Venues

Appl. Categorical Struct.

Random Struct. Algorithms

J. Discrete Algorithms

Publications

Tomás Dvorák, Petr Gregor, Václav Koubek
Generalized Gray codes with prescribed ends. Theor. Comput. Sci. 668 (2017)
Tomás Dvorák, Václav Koubek
Generalized Gray codes with prescribed ends of small dimensions. CoRR (2017)
Jirí Adámek, Václav Koubek, Thorsten Palm
Fixed Points of Set Functors: How Many Iterations are Needed? Appl. Categorical Struct. 24 (5) (2016)
Paul Horn, Václav Koubek, Vojtech Rödl
Isomorphic edge disjoint subgraphs of hypergraphs. Random Struct. Algorithms 48 (4) (2016)
Tomás Dvorák, Petr Gregor, Václav Koubek
Generalized Gray codes with prescribed ends. CoRR (2016)
Václav Koubek, Vera Trnková
Set Functors and Filters. Appl. Categorical Struct. 23 (3) (2015)
Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek
Gray codes with bounded weights. Discret. Math. 312 (17) (2012)
Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik
Testing connectivity of faulty networks in sublinear time. J. Discrete Algorithms 14 (2012)
Václav Koubek, Jirí Sichler, Vera Trnková
Universality of Categories of Coalgebras. Appl. Categorical Struct. 19 (6) (2011)
Domingos Dellamonica Jr., Václav Koubek, Daniel M. Martin, Vojtech Rödl
On a conjecture of Thomassen concerning subgraphs of large girth. J. Graph Theory 67 (4) (2011)
Václav Koubek, Vojtech Rödl
On the number of graphs with a given endomorphism monoid. Discret. Math. 310 (3) (2010)
Tomás Dvorák, Václav Koubek
Computational complexity of long paths and cycles in faulty hypercubes. Theor. Comput. Sci. 411 (40-42) (2010)
Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik
Efficient Connectivity Testing of Hypercubic Networks with Faults. IWOCA (2010)
Tomás Dvorák, Václav Koubek
Long paths in hypercubes with a quadratic number of faults. Inf. Sci. 179 (21) (2009)
Václav Koubek
Book review. Comput. Sci. Rev. 3 (3) (2009)
Václav Koubek, Jirí Sichler
-universality. Appl. Categorical Struct. 17 (5) (2009)
Tomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek
Long paths and cycles in faulty hypercubes: existence, optimality, complexity. Electron. Notes Discret. Math. 34 (2009)
Václav Koubek, Vojtech Rödl, Benjamin Shemmer
Representing Subdirect Product Monoids by Graphs. Int. J. Algebra Comput. 19 (5) (2009)
Václav Koubek, Vojtech Rödl, Benjamin Shemmer
On graphs with a given endomorphism monoid. J. Graph Theory 62 (3) (2009)
Rostislav Caha, Václav Koubek
Spanning multi-paths in hypercubes. Discret. Math. 307 (16) (2007)
Rostislav Caha, Václav Koubek
Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets. J. Graph Theory 51 (2) (2006)
Pavel Goralcik, Václav Koubek
On Completing Partial Groupoids to Semigroups. Int. J. Algebra Comput. 16 (3) (2006)
Václav Koubek, Jan Kratochvíl
Preface. Theor. Comput. Sci. 345 (2-3) (2005)
Václav Koubek, Jirí Sichler
-universality. Stud Logica 78 (1-2) (2004)
Václav Koubek, Jirí Sichler
Endomorphism monoids of chained graphs. Discret. Math. 242 (1-3) (2002)
Rostislav Caha, Václav Koubek
Optimal embeddings of odd ladders into a hypercube. Discret. Appl. Math. 116 (1-2) (2002)
Alena Koubková, Václav Koubek
Algorithms for transitive closure. Inf. Process. Lett. 81 (6) (2002)
Rostislav Caha, Václav Koubek
Optimal embeddings of generalized ladders into hypercubes. Discret. Math. 233 (1-3) (2001)
Pavel Kveton, Václav Koubek
Functions preserving classes of languages. Developments in Language Theory (1999)
Václav Koubek, Jirí Sichler
On Full and Faithful Kan Extensions. Appl. Categorical Struct. 6 (3) (1998)
Pavel Goralcik, Václav Koubek
On the Disjunctive Set Problem. Theor. Comput. Sci. 204 (1-2) (1998)
Rostislav Caha, Václav Koubek
Spanning Regular Caterpillars in Hypercubes. Eur. J. Comb. 18 (3) (1997)
Jirí Adámek, Václav Koubek
On the Greatest Fixed Point of a Set Functor. Theor. Comput. Sci. 150 (1) (1995)
Pavel Goralcik, Václav Koubek
Rank Problems for Composite Transformations. Int. J. Algebra Comput. 5 (3) (1995)
Ladislav Janiga, Václav Koubek
Minimum cut in directed planar networks. Kybernetika 28 (1) (1992)
Pavel Goralcik, A. Goralciková, Václav Koubek
Alternation with a Pebble. Inf. Process. Lett. 38 (1) (1991)
Juraj Hromkovic, Ladislav Janiga, Václav Koubek
Variable Multihead Machines. J. Inf. Process. Cybern. 27 (8) (1991)
Václav Koubek, Antonín Ríha
Regular Augmentation of Automata and Transducers (Extended Abstract). MFCS (1986)
A. Goralciková, Václav Koubek
Some Improved Parallelisms for Graphs. MFCS (1986)
Pavel Goralcik, A. Goralciková, Václav Koubek
How much Semigroup Structure is Needed to Encode Graphs? RAIRO Theor. Informatics Appl. 20 (2) (1986)
Pavel Goralcik, Václav Koubek
On Discerning Words by Automata. ICALP (1986)
Marie Demlová, Václav Koubek
Fast diagnosis of some semigroup properties of automata. Kybernetika 22 (1) (1986)
Pavel Goralcik, Václav Koubek
Verifying Nonrigidity. Inf. Process. Lett. 22 (2) (1986)
Václav Koubek, Jana Krsnakova
Parallel algorithms for connected components in a graph. FCT (1985)
Jirí Demel, Marie Demlová, Václav Koubek
Fast Algorithms Constructing Minimal Subalgebras, Congruences, and Ideals in a Finite Algebra. Theor. Comput. Sci. 36 (1985)
Václav Koubek, J. Rajlich
Combinatorics of the separaion by binary matrices. Discret. Math. 57 (1-2) (1985)
Ladislav Janiga, Václav Koubek
A Note on Finding Minimum Cuts in Directed Planar Networks by Parallel Computations. Inf. Process. Lett. 21 (2) (1985)
Václav Koubek, Vojtech Rödl
On the minimum order of graphs with given semigroup. J. Comb. Theory, Ser. B 36 (2) (1984)
Ladislav Janiga, Václav Koubek
On Languages Generated by Semigroups. FCT (1983)
Pavel Goralcik, Z. Hedrlín, Václav Koubek, V. Ryslinková
A Game of Composing Binary Relations. RAIRO Theor. Informatics Appl. 16 (4) (1982)
A. Goralciková, Pavel Goralcik, Václav Koubek
A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties. ICALP (1982)
Marie Demlová, Jirí Demel, Václav Koubek
On Subdirectly Irreducible Automata. RAIRO Theor. Informatics Appl. 15 (1) (1981)
Václav Koubek, Antonín Ríha
The Maximum k-Flow in a Network. MFCS (1981)
Pavel Goralcik, A. Goralciková, Václav Koubek, Vojtech Rödl
Fast Recognition of Rings and Lattices. FCT (1981)
A. Goralciková, Pavel Goralcik, Václav Koubek
Testing of Properties of Finite Algebras. ICALP (1980)
Marie Demlová, Jirí Demel, Václav Koubek
Several algorithms for finite algebras. FCT (1979)
Jirí Adámek, Václav Koubek
Least Fixed Point of a Functor. J. Comput. Syst. Sci. 19 (2) (1979)
A. Goralciková, Václav Koubek
A Reduct-and-Closure Algorithm for Graphs. MFCS (1979)
Jirí Adámek, Václav Koubek
Functorial algebras and automata. Kybernetika 13 (4) (1977)
Jirí Adámek, Václav Koubek
Remarks on Fixed Points of Functors. FCT (1977)
Václav Koubek, Jan Reiterman
Automata and Categories - Input Processes. MFCS (1975)