| 2009 |
|---|
| 9 | EE | Tomás Feder,
Carlos S. Subi:
Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations.
Inf. Process. Lett. 109(5): 267-272 (2009) |
| 2008 |
|---|
| 8 | EE | Tomás Feder,
Carlos S. Subi:
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised).
Electronic Colloquium on Computational Complexity (ECCC) 15(087): (2008) |
| 2007 |
|---|
| 7 | EE | Tomás Feder,
Carlos S. Subi:
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations.
Electronic Colloquium on Computational Complexity (ECCC) 14(063): (2007) |
| 2006 |
|---|
| 6 | EE | Tomás Feder,
Carlos S. Subi:
On Barnette's conjecture
Electronic Colloquium on Computational Complexity (ECCC)(015): (2006) |
| 5 | EE | Tomás Feder,
Carlos S. Subi:
Partition into k-vertex subgraphs of k-partite graphs
Electronic Colloquium on Computational Complexity (ECCC)(016): (2006) |
| 2005 |
|---|
| 4 | EE | Tomás Feder,
Carlos S. Subi:
Disks on a Tree: Analysis of a Combinatorial Game.
SIAM J. Discrete Math. 19(3): 543-552 (2005) |
| 2002 |
|---|
| 3 | EE | Tomás Feder,
Rajeev Motwani,
Carlos S. Subi:
Approximating the Longest Cycle Problem in Sparse Graphs.
SIAM J. Comput. 31(5): 1596-1607 (2002) |
| 2000 |
|---|
| 2 | EE | Tomás Feder,
Rajeev Motwani,
Carlos S. Subi:
Finding long paths and cycles in sparse Hamiltonian graphs.
STOC 2000: 524-529 |
| 1987 |
|---|
| 1 | | John L. Mohammed,
Carlos S. Subi:
An Improved Block-Interchange Algorithm.
J. Algorithms 8(1): 113-121 (1987) |
