Václav Koubek - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 55 from 55

2017

Generalized Gray codes with prescribed endsTomás Dvorák, Petr Gregor, Václav Koubek. TCS, 668:70-94, 2017. [doi]

2016

Fixed Points of Set Functors: How Many Iterations are Needed?Jirí Adámek, Václav Koubek, T. Palm. acs, 24(5):649-661, 2016. [doi]

Isomorphic edge disjoint subgraphs of hypergraphsPaul Horn, Václav Koubek, Vojtech Rödl. rsa, 48(4):767-793, 2016. [doi]

2015

Set Functors and FiltersVáclav Koubek, Vera Trnková. acs, 23(3):337-363, 2015. [doi]

2012

Gray codes with bounded weightsTomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek. DM, 312(17):2599-2611, 2012. [doi]

Testing connectivity of faulty networks in sublinear timeTomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik. jda, 14:223-231, 2012. [doi]

2011

On a conjecture of Thomassen concerning subgraphs of large girthDomingos Dellamonica Jr., Václav Koubek, Daniel M. Martin, Vojtech Rödl. jgt, 67(4):316-331, 2011. [doi]

Universality of Categories of CoalgebrasVáclav Koubek, Jirí Sichler, Vera Trnková. acs, 19(6):939-957, 2011. [doi]

2010

Computational complexity of long paths and cycles in faulty hypercubesTomás Dvorák, Václav Koubek. TCS, 411(40-42):3774-3786, 2010. [doi]

Efficient Connectivity Testing of Hypercubic Networks with FaultsTomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek, Tomasz Radzik. iwoca 2011: 181-191 [doi]

On the number of graphs with a given endomorphism monoidVáclav Koubek, Vojtech Rödl. DM, 310(3):376-384, 2010. [doi]

2009

Long paths and cycles in faulty hypercubes: existence, optimality, complexityTomás Dvorák, Jirí Fink, Petr Gregor, Václav Koubek. endm, 34:35-39, 2009. [doi]

On graphs with a given endomorphism monoidVáclav Koubek, Vojtech Rödl, Benjamin Shemmer. jgt, 62(3):241-262, 2009. [doi]

2007

Spanning multi-paths in hypercubesRostislav Caha, Václav Koubek. DM, 307(16):2053-2066, 2007. [doi]

2006

Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense setsRostislav Caha, Václav Koubek. jgt, 51(2):137-169, 2006. [doi]

On Completing Partial Groupoids to SemigroupsPavel Goralcik, Václav Koubek. ijac, 16(3):551-562, 2006. [doi]

2005

PrefaceVáclav Koubek, Jan Kratochvíl. TCS, 345(2-3):171-172, 2005. [doi]

2004

On relative universality and ::::Q::::-universalityVáclav Koubek, Jirí Sichler. sLogica, 78(1-2):279-291, 2004. [doi]

2002

Optimal embeddings of odd ladders into a hypercubeRostislav Caha, Václav Koubek. DAM, 116(1-2):73-102, 2002.

Endomorphism monoids of chained graphsVáclav Koubek, Jirí Sichler. DM, 242(1-3):157-174, 2002. [doi]

Algorithms for transitive closureA. Koubková, Václav Koubek. ipl, 81(6):289-296, 2002. [doi]

2001

Optimal embeddings of generalized ladders into hypercubesRostislav Caha, Václav Koubek. DM, 233(1-3):65-83, 2001. [doi]

1999

Functions preserving classes of languagesPavel Kveton, Václav Koubek. dlt 2000: 81-102

1998

On the Disjunctive Set ProblemPavel Goralcik, Václav Koubek. TCS, 204(1-2):99-118, 1998. [doi]

On Full and Faithful Kan ExtensionsVáclav Koubek, Jirí Sichler. acs, 6(3):291-332, 1998. [doi]

1997

Spanning Regular Caterpillars in HypercubesRostislav Caha, Václav Koubek. ejc, 18(3):249-266, 1997. [doi]

1995

On the Greatest Fixed Point of a Set FunctorJirí Adámek, Václav Koubek. TCS, 150(1):57-75, 1995. [doi]

Rank Problems for Composite TransformationsPavel Goralcik, Václav Koubek. ijac, 5(3):309-316, 1995. [doi]

1992

Minimum cut in directed planar networksLadislav Janiga, Václav Koubek. kybernetika, 28(1):37-49, 1992. [doi]

1991

Alternation with a PebblePavel Goralcik, A. Goralciková, Václav Koubek. ipl, 38(1):7-13, 1991.

Variable Multihead MachinesJuraj Hromkovic, Ladislav Janiga, Václav Koubek. eik, 27(8):411-424, 1991.

1986

1985

Fast Algorithms Constructing Minimal Subalgebras, Congruences, and Ideals in a Finite AlgebraJiri Demel, Marie Demlová, Václav Koubek. TCS, 36:203-216, 1985.

A Note on Finding Minimum Cuts in Directed Planar Networks by Parallel ComputationsLadislav Janiga, Václav Koubek. ipl, 21(2):75-78, 1985.

Parallel algorithms for connected components in a graphVáclav Koubek, Jana Krsnakova. fct 1985: 208-217

Combinatorics of the separaion by binary matricesVáclav Koubek, J. Rajlich. DM, 57(1-2):203-208, 1985. [doi]

1984

On the minimum order of graphs with given semigroupVáclav Koubek, Vojtech Rödl. JCT, 36(2):135-155, 1984. [doi]

1983

On Languages Generated by SemigroupsLadislav Janiga, Václav Koubek. fct 1983: 232-240

1982

A Game of Composing Binary RelationsPavel Goralcik, Z. Hedrlín, Václav Koubek, V. Ryslinková. ita, 16(4):365-369, 1982.

A Boundary of Isomorphism Completeness in the Lattice of Semigroup PseudovarietiesA. Goralciková, Pavel Goralcik, Václav Koubek. icalp 1982: 292-299

1981

On Subdirectly Irreducible AutomataMarie Demlová, Jiri Demel, Václav Koubek. ita, 15(1):23-46, 1981.

Fast Recognition of Rings and LatticesPavel Goralcik, A. Goralciková, Václav Koubek, Vojtech Rödl. fct 1981: 137-145

The Maximum k-Flow in a NetworkVáclav Koubek, Antonín Ríha. mfcs 1981: 389-397

1980

Testing of Properties of Finite AlgebrasA. Goralciková, Pavel Goralcik, Václav Koubek. icalp 1980: 273-281

1979

Least Fixed Point of a FunctorJirí Adámek, Václav Koubek. jcss, 19(2):163-178, 1979.

Several algorithms for finite algebrasMarie Demlová, Jiri Demel, Václav Koubek. fct 1979: 99-104

A Reduct-and-Closure Algorithm for GraphsA. Goralciková, Václav Koubek. mfcs 1979: 301-307

1977

Remarks on Fixed Points of FunctorsJirí Adámek, Václav Koubek. fct 1977: 199-205

Functorial algebras and automataJirí Adámek, Václav Koubek. kybernetika, 13(4):245-260, 1977. [doi]

1975

Automata and Categories - Input ProcessesVáclav Koubek, Jan Reiterman. mfcs 1975: 280-286

Sign in or sign up to see more results.

runs on WebDSL