Václav Koubek

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