Václav Koubek

According to our database1, Václav Koubek authored at least 59 papers between 1975 and 2017.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Generalized Gray codes with prescribed ends.
Theor. Comput. Sci., 2017

2016
Isomorphic edge disjoint subgraphs of hypergraphs.
Random Struct. Algorithms, 2016

Fixed Points of Set Functors: How Many Iterations are Needed?
Applied Categorical Structures, 2016

2015
Set Functors and Filters.
Applied Categorical Structures, 2015

2012
Testing connectivity of faulty networks in sublinear time.
J. Discrete Algorithms, 2012

Gray codes with bounded weights.
Discrete Mathematics, 2012

2011
On a conjecture of Thomassen concerning subgraphs of large girth.
Journal of Graph Theory, 2011

Universality of Categories of Coalgebras.
Applied Categorical Structures, 2011

2010
Computational complexity of long paths and cycles in faulty hypercubes.
Theor. Comput. Sci., 2010

On the number of graphs with a given endomorphism monoid.
Discrete Mathematics, 2010

Efficient Connectivity Testing of Hypercubic Networks with Faults.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009
On graphs with a given endomorphism monoid.
Journal of Graph Theory, 2009

Long paths in hypercubes with a quadratic number of faults.
Inf. Sci., 2009

Representing Subdirect Product Monoids by Graphs.
IJAC, 2009

Long paths and cycles in faulty hypercubes: existence, optimality, complexity.
Electronic Notes in Discrete Mathematics, 2009

Book review.
Computer Science Review, 2009

Almost ff-universality Implies Q-universality.
Applied Categorical Structures, 2009

2007
Spanning multi-paths in hypercubes.
Discrete Mathematics, 2007

2006
Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets.
Journal of Graph Theory, 2006

On Completing Partial Groupoids to Semigroups.
IJAC, 2006

2005
Preface.
Theor. Comput. Sci., 2005

2004
On relative universality and Q-universality.
Studia Logica, 2004

2002
Algorithms for transitive closure.
Inf. Process. Lett., 2002

Endomorphism monoids of chained graphs.
Discrete Mathematics, 2002

Optimal embeddings of odd ladders into a hypercube.
Discrete Applied Mathematics, 2002

2001
Optimal embeddings of generalized ladders into hypercubes.
Discrete Mathematics, 2001

1999
Functions preserving classes of languages.
Proceedings of the Developments in Language Theory, 1999

1998
On the Disjunctive Set Problem.
Theor. Comput. Sci., 1998

On Full and Faithful Kan Extensions.
Applied Categorical Structures, 1998

1997
Spanning Regular Caterpillars in Hypercubes.
Eur. J. Comb., 1997

1995
On the Greatest Fixed Point of a Set Functor.
Theor. Comput. Sci., 1995

Rank Problems for Composite Transformations.
IJAC, 1995

1992
Minimum cut in directed planar networks.
Kybernetika, 1992

1991
Alternation with a Pebble.
Inf. Process. Lett., 1991

Variable Multihead Machines.
Elektronische Informationsverarbeitung und Kybernetik, 1991

1986
Fast diagnosis of some semigroup properties of automata.
Kybernetika, 1986

How much Semigroup Structure is Needed to Encode Graphs?
ITA, 1986

Verifying Nonrigidity.
Inf. Process. Lett., 1986

Regular Augmentation of Automata and Transducers (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

Some Improved Parallelisms for Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

On Discerning Words by Automata.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985
Fast Algorithms Constructing Minimal Subalgebras, Congruences, and Ideals in a Finite Algebra.
Theor. Comput. Sci., 1985

A Note on Finding Minimum Cuts in Directed Planar Networks by Parallel Computations.
Inf. Process. Lett., 1985

Combinatorics of the separaion by binary matrices.
Discrete Mathematics, 1985

Parallel algorithms for connected components in a graph.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
On the minimum order of graphs with given semigroup.
J. Comb. Theory, Ser. B, 1984

1983
On Languages Generated by Semigroups.
Proceedings of the Fundamentals of Computation Theory, 1983

1982
A Game of Composing Binary Relations.
ITA, 1982

A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties.
Proceedings of the Automata, 1982

1981
On Subdirectly Irreducible Automata.
ITA, 1981

The Maximum k-Flow in a Network.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Fast Recognition of Rings and Lattices.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
Testing of Properties of Finite Algebras.
Proceedings of the Automata, 1980

1979
Least Fixed Point of a Functor.
J. Comput. Syst. Sci., 1979

A Reduct-and-Closure Algorithm for Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Several algorithms for finite algebras.
FCT, 1979

1977
Functorial algebras and automata.
Kybernetika, 1977

Remarks on Fixed Points of Functors.
FCT, 1977

1975
Automata and Categories - Input Processes.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975


  Loading...