The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mark Ramras: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mark Ramras
    Semi-regular Bipartite Graphs and an Extension of the Marriage Lemma. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:66, n:, pp:- [Journal]
  2. Mark Ramras
    Bipartite Dominating Sets in Hypercubes. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:77, n:, pp:- [Journal]
  3. Mark Ramras
    Fundamental Subsets of Edges of Hypercubes. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:46, n:, pp:- [Journal]
  4. Mark Ramras
    Regular Subgraphs of Hypercubes. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:52, n:, pp:- [Journal]
  5. Mark Ramras
    A set intersection theorem and an application to a bipartite Ramsey theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:242, n:1-3, pp:297-298 [Journal]
  6. Mark Ramras
    Minimum cutsets in hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:289, n:1-3, pp:193-198 [Journal]
  7. Mark Ramras
    Symmetric vertex partitions of hypercubes by isometric trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:239-248 [Journal]
  8. Mark Ramras
    Congestion-free Optimal Routings of Hypercube Automorphisms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:2, pp:201-208 [Journal]
  9. Mark Ramras
    Congestion-free Routings of Linear Complement Permutations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:3, pp:487-500 [Journal]
  10. Mark Ramras
    A new method of generating Hamiltonian cycles on the n-cube. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:3, pp:329-331 [Journal]

Search in 0.001secs, Finished in 0.002secs
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