default search action
Václav Koubek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j44]Tomás Dvorák
, Petr Gregor
Generalized Gray codes with prescribed ends. Theor. Comput. Sci. 668: 70-94 (2017) - [i2]Tomás Dvorák
Generalized Gray codes with prescribed ends of small dimensions. CoRR abs/1701.06705 (2017) - 2016
- [j43]Jirí Adámek, Václav Koubek, Thorsten Palm:
Fixed Points of Set Functors: How Many Iterations are Needed? Appl. Categorical Struct. 24(5): 649-661 (2016) - [j42]Paul Horn, Václav Koubek, Vojtech Rödl:
Isomorphic edge disjoint subgraphs of hypergraphs. Random Struct. Algorithms 48(4): 767-793 (2016) - [i1]Tomás Dvorák, Petr Gregor, Václav Koubek:
Generalized Gray codes with prescribed ends. CoRR abs/1603.08827 (2016) - 2015
- [j41]Václav Koubek, Vera Trnková:
Set Functors and Filters. Appl. Categorical Struct. 23(3): 337-363 (2015) - 2012
- [j40]Tomás Dvorák
Gray codes with bounded weights. Discret. Math. 312(17): 2599-2611 (2012) - [j39]Tomás Dvorák
Testing connectivity of faulty networks in sublinear time. J. Discrete Algorithms 14: 223-231 (2012) - 2011
- [j38]Václav Koubek, Jirí Sichler, Vera Trnková:
Universality of Categories of Coalgebras. Appl. Categorical Struct. 19(6): 939-957 (2011) - [j37]Domingos Dellamonica Jr., Václav Koubek, Daniel M. Martin, Vojtech Rödl:
On a conjecture of Thomassen concerning subgraphs of large girth. J. Graph Theory 67(4): 316-331 (2011) - 2010
- [j36]Václav Koubek, Vojtech Rödl:
On the number of graphs with a given endomorphism monoid. Discret. Math. 310(3): 376-384 (2010) - [j35]Tomás Dvorák
Computational complexity of long paths and cycles in faulty hypercubes. Theor. Comput. Sci. 411(40-42): 3774-3786 (2010) - [c15]Tomás Dvorák
Efficient Connectivity Testing of Hypercubic Networks with Faults. IWOCA 2010: 181-191
2000 – 2009
- 2009
- [j34]Václav Koubek, Jirí Sichler:
Almost ff-universality Implies Q-universality. Appl. Categorical Struct. 17(5): 419-434 (2009) - [j33]Václav Koubek:
Book review. Comput. Sci. Rev. 3(3): 193-194 (2009) - [j32]Tomás Dvorák
Long paths and cycles in faulty hypercubes: existence, optimality, complexity. Electron. Notes Discret. Math. 34: 35-39 (2009) - [j31]Václav Koubek, Vojtech Rödl, Benjamin Shemmer:
Representing Subdirect Product Monoids by Graphs. Int. J. Algebra Comput. 19(5): 705-721 (2009) - [j30]Tomás Dvorák
Long paths in hypercubes with a quadratic number of faults. Inf. Sci. 179(21): 3763-3771 (2009) - [j29]Václav Koubek, Vojtech Rödl, Benjamin Shemmer:
On graphs with a given endomorphism monoid. J. Graph Theory 62(3): 241-262 (2009) - 2007
- [j28]Rostislav Caha, Václav Koubek:
Spanning multi-paths in hypercubes. Discret. Math. 307(16): 2053-2066 (2007) - 2006
- [j27]Pavel Goralcik, Václav Koubek:
On Completing Partial Groupoids to Semigroups. Int. J. Algebra Comput. 16(3): 551-562 (2006) - [j26]Rostislav Caha, Václav Koubek:
Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets. J. Graph Theory 51(2): 137-169 (2006) - 2005
- [j25]Václav Koubek, Jan Kratochvíl
Preface. Theor. Comput. Sci. 345(2-3): 171-172 (2005) - 2004
- [j24]Václav Koubek, Jirí Sichler:
On relative universality and Q-universality. Stud Logica 78(1-2): 279-291 (2004) - [e4]Jirí Fiala, Václav Koubek, Jan Kratochvíl:
Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings. Lecture Notes in Computer Science 3153, Springer 2004, ISBN 3-540-22823-3 [contents] - 2002
- [j23]Rostislav Caha, Václav Koubek:
Optimal embeddings of odd ladders into a hypercube. Discret. Appl. Math. 116(1-2): 73-102 (2002) - [j22]Václav Koubek, Jirí Sichler:
Endomorphism monoids of chained graphs. Discret. Math. 242(1-3): 157-174 (2002) - [j21]Alena Koubková
Algorithms for transitive closure. Inf. Process. Lett. 81(6): 289-296 (2002) - 2001
- [j20]Rostislav Caha, Václav Koubek:
Optimal embeddings of generalized ladders into hypercubes. Discret. Math. 233(1-3): 65-83 (2001)
1990 – 1999
- 1999
- [c14]Pavel Kveton, Václav Koubek:
Functions preserving classes of languages. Developments in Language Theory 1999: 81-102 - 1998
- [j19]Václav Koubek, Jirí Sichler:
On Full and Faithful Kan Extensions. Appl. Categorical Struct. 6(3): 291-332 (1998) - [j18]Pavel Goralcik, Václav Koubek:
On the Disjunctive Set Problem. Theor. Comput. Sci. 204(1-2): 99-118 (1998) - 1997
- [j17]Rostislav Caha, Václav Koubek:
Spanning Regular Caterpillars in Hypercubes. Eur. J. Comb. 18(3): 249-266 (1997) - 1995
- [j16]Pavel Goralcik, Václav Koubek:
Rank Problems for Composite Transformations. Int. J. Algebra Comput. 5(3): 309-316 (1995) - [j15]Jirí Adámek, Václav Koubek:
On the Greatest Fixed Point of a Set Functor. Theor. Comput. Sci. 150(1): 57-75 (1995) - 1992
- [j14]Ladislav Janiga, Václav Koubek:
Minimum cut in directed planar networks. Kybernetika 28(1): 37-49 (1992) - [e3]Ivan M. Havel, Václav Koubek:
Mathematical Foundations of Computer Science 1992, 17th International Symposium, MFCS'92, Prague, Czechoslovakia, August 24-28, 1992, Proceedings. Lecture Notes in Computer Science 629, Springer 1992, ISBN 3-540-55808-X [contents] - 1991
- [j13]Juraj Hromkovic, Ladislav Janiga, Václav Koubek:
Variable Multihead Machines. J. Inf. Process. Cybern. 27(8): 411-424 (1991) - [j12]Pavel Goralcik, A. Goralciková, Václav Koubek:
Alternation with a Pebble. Inf. Process. Lett. 38(1): 7-13 (1991)
1980 – 1989
- 1988
- [e2]Michal Chytil, Ladislav Janiga, Václav Koubek:
Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings. Lecture Notes in Computer Science 324, Springer 1988, ISBN 3-540-50110-X [contents] - 1986
- [j11]Pavel Goralcik, Václav Koubek:
Verifying Nonrigidity. Inf. Process. Lett. 22(2): 91-95 (1986) - [j10]Pavel Goralcik, A. Goralciková, Václav Koubek:
How much Semigroup Structure is Needed to Encode Graphs? RAIRO Theor. Informatics Appl. 20(2): 191-206 (1986) - [j9]Marie Demlová, Václav Koubek:
Fast diagnosis of some semigroup properties of automata. Kybernetika 22(1): 92-99 (1986) - [c13]Pavel Goralcik, Václav Koubek:
On Discerning Words by Automata. ICALP 1986: 116-122 - [c12]A. Goralciková, Václav Koubek:
Some Improved Parallelisms for Graphs. MFCS 1986: 379-385 - [c11]Václav Koubek, Antonín Ríha:
Regular Augmentation of Automata and Transducers (Extended Abstract). MFCS 1986: 467-475 - 1985
- [j8]Václav Koubek, J. Rajlich:
Combinatorics of the separaion by binary matrices. Discret. Math. 57(1-2): 203-208 (1985) - [j7]Ladislav Janiga, Václav Koubek:
A Note on Finding Minimum Cuts in Directed Planar Networks by Parallel Computations. Inf. Process. Lett. 21(2): 75-78 (1985) - [j6]Jirí Demel, Marie Demlová, Václav Koubek:
Fast Algorithms Constructing Minimal Subalgebras, Congruences, and Ideals in a Finite Algebra. Theor. Comput. Sci. 36: 203-216 (1985) - [c10]Václav Koubek, Jana Krsnakova:
Parallel algorithms for connected components in a graph. FCT 1985: 208-217 - 1984
- [j5]Václav Koubek, Vojtech Rödl:
On the minimum order of graphs with given semigroup. J. Comb. Theory B 36(2): 135-155 (1984) - [e1]Michal Chytil, Václav Koubek:
Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia, September 3-7, 1984, Proceedings. Lecture Notes in Computer Science 176, Springer 1984, ISBN 3-540-13372-0 [contents] - 1983
- [c9]Ladislav Janiga, Václav Koubek:
On Languages Generated by Semigroups. FCT 1983: 232-240 - 1982
- [j4]Pavel Goralcik, Z. Hedrlín, Václav Koubek, V. Ryslinková:
A Game of Composing Binary Relations. RAIRO Theor. Informatics Appl. 16(4): 365-369 (1982) - [c8]A. Goralciková, Pavel Goralcik, Václav Koubek:
A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties. ICALP 1982: 292-299 - 1981
- [j3]Marie Demlová, Jirí Demel, Václav Koubek:
On Subdirectly Irreducible Automata. RAIRO Theor. Informatics Appl. 15(1): 23-46 (1981) - [c7]Pavel Goralcik, A. Goralciková, Václav Koubek, Vojtech Rödl:
Fast Recognition of Rings and Lattices. FCT 1981: 137-145 - [c6]Václav Koubek, Antonín Ríha:
The Maximum k-Flow in a Network. MFCS 1981: 389-397 - 1980
- [c5]A. Goralciková, Pavel Goralcik, Václav Koubek:
Testing of Properties of Finite Algebras. ICALP 1980: 273-281
1970 – 1979
- 1979
- [j2]Jirí Adámek, Václav Koubek:
Least Fixed Point of a Functor. J. Comput. Syst. Sci. 19(2): 163-178 (1979) - [c4]Marie Demlová, Jirí Demel, Václav Koubek:
Several algorithms for finite algebras. FCT 1979: 99-104 - [c3]A. Goralciková, Václav Koubek:
A Reduct-and-Closure Algorithm for Graphs. MFCS 1979: 301-307 - 1977
- [j1]Jirí Adámek, Václav Koubek:
Functorial algebras and automata. Kybernetika 13(4): 245-260 (1977) - [c2]Jirí Adámek, Václav Koubek:
Remarks on Fixed Points of Functors. FCT 1977: 199-205 - 1975
- [c1]Václav Koubek, Jan Reiterman:
Automata and Categories - Input Processes. MFCS 1975: 280-286
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: