default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarlos S. Subi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j10]Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi:
On Finding Hamiltonian Cycles in Barnette Graphs. Fundam. Informaticae 188(1): 1-14 (2022)- 2021
- [j9]Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-two colourings of Barnette graphs. Eur. J. Comb. 91: 103210 (2021) - [j8]Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner
, Carlos S. Subi:
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture. J. Graph Theory 96(2): 269-288 (2021)
2010 – 2019
- 2019
- [i7]Tomás Feder, Pavol Hell, Carlos S. Subi:
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints. CoRR abs/1907.00061 (2019) - 2018
- [c2]Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-Two Coloring of Barnette Graphs. CCCG 2018: 304-310 - [i6]Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-Two Colorings of Barnette Graphs. CoRR abs/1807.01410 (2018) - 2013
- [j7]Tomás Feder, Carlos S. Subi:
On hypercube labellings and antipodal monochromatic paths. Discret. Appl. Math. 161(10-11): 1421-1426 (2013) - [j6]Tomás Feder, Carlos S. Subi:
Edge-coloring almost bipartite multigraphs. Inf. Process. Lett. 113(18): 685-689 (2013) - 2012
- [i5]Tomás Feder, Carlos S. Subi:
Packing Edge-Disjoint Triangles in Given Graphs. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j5]Tomás Feder, Carlos S. Subi:
Maximum gap labelings of graphs. Inf. Process. Lett. 111(4): 169-173 (2011)
2000 – 2009
- 2009
- [j4]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
- [i4]Tomás Feder, Carlos S. Subi:
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised). Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [i3]Tomás Feder, Carlos S. Subi:
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [i2]Tomás Feder, Carlos S. Subi:
On Barnette's conjecture. Electron. Colloquium Comput. Complex. TR06 (2006) - [i1]Tomás Feder, Carlos S. Subi:
Partition into k-vertex subgraphs of k-partite graphs. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j3]Tomás Feder, Carlos S. Subi:
Disks on a Tree: Analysis of a Combinatorial Game. SIAM J. Discret. Math. 19(3): 543-552 (2005) - 2002
- [j2]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
- [c1]Tomás Feder, Rajeev Motwani, Carlos S. Subi:
Finding long paths and cycles in sparse Hamiltonian graphs. STOC 2000: 524-529
1980 – 1989
- 1987
- [j1]John L. Mohammed, Carlos S. Subi:
An Improved Block-Interchange Algorithm. J. Algorithms 8(1): 113-121 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
