|
Search the dblp DataBase
Carlos S. Subi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised). [Citation Graph (, )][DBLP]
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.001secs
|