Carlos S. Subi

19 papers A* 1Journal 17Unranked 1
YearRankTypeTitle / Venue / Authors
2022 J jnl
On Finding Hamiltonian Cycles in Barnette Graphs.
Fundam. Informaticae
Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi
2021 J jnl
Distance-two colourings of Barnette graphs.
Eur. J. Comb.
Tomás Feder, Pavol Hell, Carlos S. Subi
2021 J jnl
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture.
J. Graph Theory
Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi
2019 J jnl
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints.
CoRR
Tomás Feder, Pavol Hell, Carlos S. Subi
2018 — conf
Distance-Two Coloring of Barnette Graphs.
CCCG
Tomás Feder, Pavol Hell, Carlos S. Subi
2018 J jnl
Distance-Two Colorings of Barnette Graphs.
CoRR
Tomás Feder, Pavol Hell, Carlos S. Subi
2013 J jnl
Edge-coloring almost bipartite multigraphs.
Inf. Process. Lett.
Tomás Feder, Carlos S. Subi
2013 J jnl
On hypercube labellings and antipodal monochromatic paths.
Discret. Appl. Math.
Tomás Feder, Carlos S. Subi
2012 J jnl
Packing Edge-Disjoint Triangles in Given Graphs.
Electron. Colloquium Comput. Complex.
Tomás Feder, Carlos S. Subi
2011 J jnl
Maximum gap labelings of graphs.
Inf. Process. Lett.
Tomás Feder, Carlos S. Subi
2009 J jnl
Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations.
Inf. Process. Lett.
Tomás Feder, Carlos S. Subi
2008 J jnl
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised).
Electron. Colloquium Comput. Complex.
Tomás Feder, Carlos S. Subi
2007 J jnl
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations.
Electron. Colloquium Comput. Complex.
Tomás Feder, Carlos S. Subi
2006 J jnl
On Barnette's conjecture
Electron. Colloquium Comput. Complex.
Tomás Feder, Carlos S. Subi
2006 J jnl
Partition into k-vertex subgraphs of k-partite graphs
Electron. Colloquium Comput. Complex.
Tomás Feder, Carlos S. Subi
2005 J jnl
Disks on a Tree: Analysis of a Combinatorial Game.
SIAM J. Discret. Math.
Tomás Feder, Carlos S. Subi
2002 J jnl
Approximating the Longest Cycle Problem in Sparse Graphs.
SIAM J. Comput.
Tomás Feder, Rajeev Motwani, Carlos S. Subi
2000 A* conf
Finding long paths and cycles in sparse Hamiltonian graphs.
STOC
Tomás Feder, Rajeev Motwani, Carlos S. Subi
1987 J jnl
An Improved Block-Interchange Algorithm.
J. Algorithms
John L. Mohammed, Carlos S. Subi