Carlos S. Subi Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tomás Feder, Carlos S. Subi: On hypercube labellings and antipodal monochromatic paths. Discrete Applied Mathematics 161(10-11): 1421-1426 (2013)
2012
i5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tomás Feder, Carlos S. Subi: Packing Edge-Disjoint Triangles in Given Graphs. Electronic Colloquium on Computational Complexity (ECCC) 19: 13 (2012)
2011
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tomás Feder, Carlos S. Subi: Maximum gap labelings of graphs. Inf. Process. Lett. 111(4): 169-173 (2011)
2009
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tomás Feder, Carlos S. Subi: On Barnette's conjecture. Electronic Colloquium on Computational Complexity (ECCC)(015) (2006)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tomás Feder, Carlos S. Subi: Partition into k-vertex subgraphs of k-partite graphs. Electronic Colloquium on Computational Complexity (ECCC)(016) (2006)
2005
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Tomás Feder, Rajeev Motwani, Carlos S. Subi: Finding long paths and cycles in sparse Hamiltonian graphs. STOC 2000: 524-529
1987
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
John L. Mohammed, Carlos S. Subi: An Improved Block-Interchange Algorithm. J. Algorithms 8(1): 113-121 (1987)

Coauthor Index

1Tomás Feder
[j6] [i5] [j5] [j4] [i4] [i3] [i2] [i1] [j3] [j2] [c1]
2John L. Mohammed
[j1]
3Rajeev Motwani
[j2] [c1]
Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Thu May 23 11:31:22 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page