Automata and Categories - Input Processes. - Václav Koubek; Jan Reiterman (MFCS, 1975)

Remarks on Fixed Points of Functors. - Jirí Adámek; Václav Koubek (FCT, 1977)

Functorial algebras and automata. - Jirí Adámek; Václav Koubek (Kybernetika, 1977)

Several algorithms for finite algebras. - Marie Demlová; Jirí Demel; Václav Koubek (FCT, 1979)

A Reduct-and-Closure Algorithm for Graphs. - A. Goralciková; Václav Koubek (MFCS, 1979)

Least Fixed Point of a Functor. - Jirí Adámek; Václav Koubek (J. Comput. Syst. Sci., 1979)

Testing of Properties of Finite Algebras. - A. Goralciková; Pavel Goralcik; Václav Koubek (ICALP, 1980)

Fast Recognition of Rings and Lattices. - Pavel Goralcik; A. Goralciková; Václav Koubek; Vojtech Rödl (FCT, 1981)

The Maximum k-Flow in a Network. - Václav Koubek; Antonín Ríha (MFCS, 1981)

On Subdirectly Irreducible Automata. - Marie Demlová; Jirí Demel; Václav Koubek (RAIRO Theor. Informatics Appl., 1981)

A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties. - A. Goralciková; Pavel Goralcik; Václav Koubek (ICALP, 1982)

A Game of Composing Binary Relations. - Pavel Goralcik; Z. Hedrlín; Václav Koubek; V. Ryslinková (RAIRO Theor. Informatics Appl., 1982)

On Languages Generated by Semigroups. - Ladislav Janiga; Václav Koubek (FCT, 1983)

On the minimum order of graphs with given semigroup. - Václav Koubek; Vojtech Rödl (J. Comb. Theory B, 1984)

Parallel algorithms for connected components in a graph. - Václav Koubek; Jana Krsnakova (FCT, 1985)

Combinatorics of the separaion by binary matrices. - Václav Koubek; J. Rajlich (Discret. Math., 1985)

A Note on Finding Minimum Cuts in Directed Planar Networks by Parallel Computations. - Ladislav Janiga; Václav Koubek (Inf. Process. Lett., 1985)

Fast Algorithms Constructing Minimal Subalgebras, Congruences, and Ideals in a Finite Algebra. - Jirí Demel; Marie Demlová; Václav Koubek (Theor. Comput. Sci., 1985)

On Discerning Words by Automata. - Pavel Goralcik; Václav Koubek (ICALP, 1986)

Some Improved Parallelisms for Graphs. - A. Goralciková; Václav Koubek (MFCS, 1986)

Regular Augmentation of Automata and Transducers (Extended Abstract). - Václav Koubek; Antonín Ríha (MFCS, 1986)

Verifying Nonrigidity. - Pavel Goralcik; Václav Koubek (Inf. Process. Lett., 1986)

How much Semigroup Structure is Needed to Encode Graphs? - Pavel Goralcik; A. Goralciková; Václav Koubek (RAIRO Theor. Informatics Appl., 1986)

Fast diagnosis of some semigroup properties of automata. - Marie Demlová; Václav Koubek (Kybernetika, 1986)

Variable Multihead Machines. - Juraj Hromkovic; Ladislav Janiga; Václav Koubek (J. Inf. Process. Cybern., 1991)

Alternation with a Pebble. - Pavel Goralcik; A. Goralciková; Václav Koubek (Inf. Process. Lett., 1991)

Minimum cut in directed planar networks. - Ladislav Janiga; Václav Koubek (Kybernetika, 1992)

Rank Problems for Composite Transformations. - Pavel Goralcik; Václav Koubek (Int. J. Algebra Comput., 1995)

On the Greatest Fixed Point of a Set Functor. - Jirí Adámek; Václav Koubek (Theor. Comput. Sci., 1995)

Spanning Regular Caterpillars in Hypercubes. - Rostislav Caha; Václav Koubek (Eur. J. Comb., 1997)

On Full and Faithful Kan Extensions. - Václav Koubek; Jirí Sichler (Appl. Categorical Struct., 1998)

On the Disjunctive Set Problem. - Pavel Goralcik; Václav Koubek (Theor. Comput. Sci., 1998)

Functions preserving classes of languages. - Pavel Kveton; Václav Koubek (Developments in Language Theory, 1999)

Optimal embeddings of generalized ladders into hypercubes. - Rostislav Caha; Václav Koubek (Discret. Math., 2001)

Optimal embeddings of odd ladders into a hypercube. - Rostislav Caha; Václav Koubek (Discret. Appl. Math., 2002)

Endomorphism monoids of chained graphs. - Václav Koubek; Jirí Sichler (Discret. Math., 2002)

Algorithms for transitive closure. - Alena Koubková; Václav Koubek (Inf. Process. Lett., 2002)

On relative universality and Q-universality. - Václav Koubek; Jirí Sichler (Stud Logica, 2004)

Preface. - Václav Koubek; Jan Kratochvíl (Theor. Comput. Sci., 2005)

On Completing Partial Groupoids to Semigroups. - Pavel Goralcik; Václav Koubek (Int. J. Algebra Comput., 2006)

Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets. - Rostislav Caha; Václav Koubek (J. Graph Theory, 2006)

Spanning multi-paths in hypercubes. - Rostislav Caha; Václav Koubek (Discret. Math., 2007)

Almost ff-universality Implies Q-universality. - Václav Koubek; Jirí Sichler (Appl. Categorical Struct., 2009)

Book review. - Václav Koubek (Comput. Sci. Rev., 2009)

Long paths and cycles in faulty hypercubes: existence, optimality, complexity. - Tomás Dvorák; Jirí Fink; Petr Gregor; Václav Koubek (Electron. Notes Discret. Math., 2009)

Representing Subdirect Product Monoids by Graphs. - Václav Koubek; Vojtech Rödl; Benjamin Shemmer (Int. J. Algebra Comput., 2009)

Long paths in hypercubes with a quadratic number of faults. - Tomás Dvorák; Václav Koubek (Inf. Sci., 2009)

On graphs with a given endomorphism monoid. - Václav Koubek; Vojtech Rödl; Benjamin Shemmer (J. Graph Theory, 2009)

Efficient Connectivity Testing of Hypercubic Networks with Faults. - Tomás Dvorák; Jirí Fink; Petr Gregor; Václav Koubek; Tomasz Radzik (IWOCA, 2010)

On the number of graphs with a given endomorphism monoid. - Václav Koubek; Vojtech Rödl (Discret. Math., 2010)

Computational complexity of long paths and cycles in faulty hypercubes. - Tomás Dvorák; Václav Koubek (Theor. Comput. Sci., 2010)

Universality of Categories of Coalgebras. - Václav Koubek; Jirí Sichler; Vera Trnková (Appl. Categorical Struct., 2011)

On a conjecture of Thomassen concerning subgraphs of large girth. - Domingos Dellamonica Jr.; Václav Koubek; Daniel M. Martin; Vojtech Rödl (J. Graph Theory, 2011)

Gray codes with bounded weights. - Tomás Dvorák; Jirí Fink; Petr Gregor; Václav Koubek (Discret. Math., 2012)

Testing connectivity of faulty networks in sublinear time. - Tomás Dvorák; Jirí Fink; Petr Gregor; Václav Koubek; Tomasz Radzik (J. Discrete Algorithms, 2012)

Set Functors and Filters. - Václav Koubek; Vera Trnková (Appl. Categorical Struct., 2015)

Fixed Points of Set Functors: How Many Iterations are Needed? - Jirí Adámek; Václav Koubek; Thorsten Palm (Appl. Categorical Struct., 2016)

Isomorphic edge disjoint subgraphs of hypergraphs. - Paul Horn; Václav Koubek; Vojtech Rödl (Random Struct. Algorithms, 2016)

Generalized Gray codes with prescribed ends of small dimensions. - Tomás Dvorák; Václav Koubek (CoRR, 2017)

Generalized Gray codes with prescribed ends. - Tomás Dvorák; Petr Gregor; Václav Koubek (Theor. Comput. Sci., 2017)