Václav Koubek

Petr Gregor

Theor. Comput. Sci., 2017

Generalized Gray codes with prescribed ends of small dimensions.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Isomorphic edge disjoint subgraphs of hypergraphs.

[BibT_eX]

[DOI]

Paul Horn

Random Struct. Algorithms, 2016

Fixed Points of Set Functors: How Many Iterations are Needed?

[BibT_eX]

[DOI]

Thorsten Palm

Appl. Categorical Struct., 2016

2015

Set Functors and Filters.

[BibT_eX]

[DOI]

Vera Trnková

Appl. Categorical Struct., 2015

2012

Testing connectivity of faulty networks in sublinear time.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Gray codes with bounded weights.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

On a conjecture of Thomassen concerning subgraphs of large girth.

[BibT_eX]

[DOI]

Domingos Dellamonica Jr.

Daniel M. Martin

J. Graph Theory, 2011

Universality of Categories of Coalgebras.

[BibT_eX]

[DOI]

Vera Trnková

Appl. Categorical Struct., 2011

2010

Computational complexity of long paths and cycles in faulty hypercubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

On the number of graphs with a given endomorphism monoid.

[BibT_eX]

[DOI]

Discret. Math., 2010

Efficient Connectivity Testing of Hypercubic Networks with Faults.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

On graphs with a given endomorphism monoid.

[BibT_eX]

[DOI]

Benjamin Shemmer

J. Graph Theory, 2009

Long paths in hypercubes with a quadratic number of faults.

[BibT_eX]

[DOI]

Inf. Sci., 2009

Representing Subdirect Product Monoids by Graphs.

[BibT_eX]

[DOI]

Benjamin Shemmer

Int. J. Algebra Comput., 2009

Long paths and cycles in faulty hypercubes: existence, optimality, complexity.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Book review.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2009

Almost ff-universality Implies Q-universality.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 2009

2007

Spanning multi-paths in hypercubes.

[BibT_eX]

[DOI]

Discret. Math., 2007

2006

Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

On Completing Partial Groupoids to Semigroups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2006

2005

Preface.

[BibT_eX]

[DOI]

Jan Kratochvíl

Theor. Comput. Sci., 2005

2004

On relative universality and Q-universality.

[BibT_eX]

[DOI]

Stud Logica, 2004

2002

Algorithms for transitive closure.

[BibT_eX]

[DOI]

Alena Koubková

Inf. Process. Lett., 2002

Endomorphism monoids of chained graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Optimal embeddings of odd ladders into a hypercube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

Optimal embeddings of generalized ladders into hypercubes.

[BibT_eX]

[DOI]

Discret. Math., 2001

1999

Functions preserving classes of languages.

[BibT_eX]

[DOI]

Pavel Kveton

Proceedings of the Developments in Language Theory, 1999

1998

On the Disjunctive Set Problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

On Full and Faithful Kan Extensions.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 1998

1997

Spanning Regular Caterpillars in Hypercubes.

[BibT_eX]

[DOI]

Eur. J. Comb., 1997

1995

On the Greatest Fixed Point of a Set Functor.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Rank Problems for Composite Transformations.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1995

1992

Minimum cut in directed planar networks.

[BibT_eX]

[DOI]

Kybernetika, 1992

1991

Alternation with a Pebble.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Variable Multihead Machines.

[BibT_eX]

Juraj Hromkovic

J. Inf. Process. Cybern., 1991

1986

Fast diagnosis of some semigroup properties of automata.

[BibT_eX]

[DOI]

Kybernetika, 1986

How much Semigroup Structure is Needed to Encode Graphs?

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1986

Verifying Nonrigidity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

Regular Augmentation of Automata and Transducers (Extended Abstract).

[BibT_eX]

[DOI]

Antonín Ríha

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

Some Improved Parallelisms for Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

On Discerning Words by Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985

Fast Algorithms Constructing Minimal Subalgebras, Congruences, and Ideals in a Finite Algebra.

[BibT_eX]

[DOI]

Jirí Demel

Theor. Comput. Sci., 1985

A Note on Finding Minimum Cuts in Directed Planar Networks by Parallel Computations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

Combinatorics of the separaion by binary matrices.

[BibT_eX]

[DOI]

J. Rajlich

Discret. Math., 1985

Parallel algorithms for connected components in a graph.

[BibT_eX]

[DOI]

Jana Krsnakova

Proceedings of the Fundamentals of Computation Theory, 1985

1984

On the minimum order of graphs with given semigroup.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1984

1983

On Languages Generated by Semigroups.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1983

1982

A Game of Composing Binary Relations.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1982

A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1982

1981

On Subdirectly Irreducible Automata.

[BibT_eX]

[DOI]

Jirí Demel

RAIRO Theor. Informatics Appl., 1981

The Maximum k-Flow in a Network.

[BibT_eX]

[DOI]

Antonín Ríha

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Fast Recognition of Rings and Lattices.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1980

Testing of Properties of Finite Algebras.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

1979

Least Fixed Point of a Functor.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1979

A Reduct-and-Closure Algorithm for Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Several algorithms for finite algebras.

[BibT_eX]

Jirí Demel

Proceedings of the Fundamentals of Computation Theory, 1979

1977

Functorial algebras and automata.

[BibT_eX]

[DOI]

Kybernetika, 1977

Remarks on Fixed Points of Functors.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1977

1975

Automata and Categories - Input Processes.

[BibT_eX]

[DOI]