The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tomás Dvorák: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tomás Dvorák
    Dense sets and embedding binary trees into hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:4, pp:506-514 [Journal]
  2. Tomás Dvorák, Ivan Havel, Michel Mollard
    On paths and cycles dominating hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:121-129 [Journal]
  3. Tomás Dvorák
    Chromatic Index of Hypergraphs and Shannon's Theorem. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:5, pp:585-591 [Journal]
  4. Tomás Dvorák, Ivan Havel, Petr Liebl
    Euler Cycles in K2m Plus Perfect Matching. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:3, pp:227-232 [Journal]
  5. Tomás Dvorák
    Hamiltonian Cycles with Prescribed Edges in Hypercubes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:135-144 [Journal]
  6. Tomás Dvorák, Ivan Havel, Petr Liebl
    Euler cycles in the complete graph K2m+1. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:89-102 [Journal]
  7. Tomás Dvorák, Petr Gregor
    Hamiltonian paths with prescribed edges in hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:1982-1998 [Journal]

  8. Sliding CDAWG Perfection. [Citation Graph (, )][DBLP]


  9. Gray Code Compression. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002