On Finding Hamiltonian Cycles in Barnette Graphs - Behrooz Bagheri Gh.; Tomás Feder; Herbert Fleischner; Carlos S. Subi (Fundam. Informaticae, 2022)

Distance-two colourings of Barnette graphs - Tomás Feder; Pavol Hell; Carlos S. Subi (Eur. J. Comb., 2021)

Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture - Behrooz Bagheri Gh.; Tomás Feder; Herbert Fleischner; Carlos S. Subi (J. Graph Theory, 2021)

Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints - Tomás Feder; Pavol Hell; Carlos S. Subi (CoRR, 2019)

Distance-Two Coloring of Barnette Graphs - Tomás Feder; Pavol Hell; Carlos S. Subi (Proceedings of the 30th Canadian Conference on Computational Geometry, CCCG 2018, August 8-10, 2018, University of Manitoba, Winnipeg, Manitoba, Canada, 2018)

Distance-Two Colorings of Barnette Graphs - Tomás Feder; Pavol Hell; Carlos S. Subi (CoRR, 2018)

On hypercube labellings and antipodal monochromatic paths - Tomás Feder; Carlos S. Subi (Discret. Appl. Math., 2013)

Edge-coloring almost bipartite multigraphs - Tomás Feder; Carlos S. Subi (Inf. Process. Lett., 2013)

Packing Edge-Disjoint Triangles in Given Graphs - Tomás Feder; Carlos S. Subi (Electron. Colloquium Comput. Complex., 2012)

Maximum gap labelings of graphs - Tomás Feder; Carlos S. Subi (Inf. Process. Lett., 2011)

Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations - Tomás Feder; Carlos S. Subi (Inf. Process. Lett., 2009)

Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised) - Tomás Feder; Carlos S. Subi (Electron. Colloquium Comput. Complex., 2008)

Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations - Tomás Feder; Carlos S. Subi (Electron. Colloquium Comput. Complex., 2007)

On Barnette's conjecture - Tomás Feder; Carlos S. Subi (Electron. Colloquium Comput. Complex., 2006)

Partition into k-vertex subgraphs of k-partite graphs - Tomás Feder; Carlos S. Subi (Electron. Colloquium Comput. Complex., 2006)

Disks on a Tree: Analysis of a Combinatorial Game - Tomás Feder; Carlos S. Subi (SIAM J. Discret. Math., 2005)

Approximating the Longest Cycle Problem in Sparse Graphs - Tomás Feder; Rajeev Motwani; Carlos S. Subi (SIAM J. Comput., 2002)

Finding long paths and cycles in sparse Hamiltonian graphs - Tomás Feder; Rajeev Motwani; Carlos S. Subi (Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, USA, 2000)

An Improved Block-Interchange Algorithm - John L. Mohammed; Carlos S. Subi (J. Algorithms, 1987)