The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Carlos S. Subi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tomás Feder, Rajeev Motwani, Carlos S. Subi
    Finding long paths and cycles in sparse Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:524-529 [Conf]
  2. Tomás Feder, Carlos S. Subi
    On Barnette's conjecture [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:015, pp:- [Journal]
  3. Tomás Feder, Carlos S. Subi
    Partition into k-vertex subgraphs of k-partite graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:016, pp:- [Journal]
  4. John L. Mohammed, Carlos S. Subi
    An Improved Block-Interchange Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:1, pp:113-121 [Journal]
  5. Tomás Feder, Rajeev Motwani, Carlos S. Subi
    Approximating the Longest Cycle Problem in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1596-1607 [Journal]
  6. Tomás Feder, Carlos S. Subi
    Disks on a Tree: Analysis of a Combinatorial Game. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:3, pp:543-552 [Journal]

  7. Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised). [Citation Graph (, )][DBLP]


  8. Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations. [Citation Graph (, )][DBLP]


Search in 0.144secs, Finished in 0.145secs
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