Tomás Feder

Thompson Rivers University — Canada

Computer Science · Physical Sciences

31h-index5.7kcitations121works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(90), Complexity and Algorithms in Graphs(42), Graph Labeling and Dimension Problems(31), graph theory and CDMA systems(28), Limits and Structures in Graph Theory(20)

Publications121 total

List homomorphisms to separable signed graphs
Theoretical Computer Science·2024
List homomorphisms to separable signed graphs
arXiv (Cornell University)·2023Open Access
On Finding Hamiltonian Cycles in Barnette Graphs
Fundamenta Informaticae·2022· 1 cited
On finding hamiltonian cycles in Barnette graphs
arXiv (Cornell University)·2022Open Access
List homomorphism problems for signed trees
Discrete Mathematics·2022· 4 cited
List Homomorphisms to Separable Signed Graphs
Lecture notes in computer science·2022· 5 cited
Digraph homomorphism problem and weak near unanimity polymorphism
arXiv (Cornell University)·2020Open Access
Distance-two colourings of Barnette graphs
European Journal of Combinatorics·2020· 7 cited
Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture
Journal of Graph Theory·2020Open Access
Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture
PubMed Central·2020· 6 citedOpen Access
List homomorphism problems for signed trees
arXiv (Cornell University)·2020Open Access
Complexity of correspondence <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e421" altimg="si177.svg"><mml:mi>H</mml:mi></mml:math>-colourings
Discrete Applied Mathematics·2019
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints
arXiv (Cornell University)·2019· 3 citedOpen Access
Distance-Two Colorings of Barnette Graphs
arXiv (Cornell University)·2018Open Access
On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs
arXiv (Cornell University)·2018Open Access
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a\n new partial solution of Barnette's Conjecture
arXiv (Cornell University)·2018Open Access
Distance-Two Coloring of Barnette Graphs.
Canadian Conference on Computational Geometry·2018· 1 cited
Correspondence Homomorphisms to Reflexive Graphs
Electronic Notes in Discrete Mathematics·2017· 1 cited
Complexity of Correspondence Homomorphisms
arXiv (Cornell University)·2017· 2 citedOpen Access
Dichotomy for Digraph Homomorphism Problems (two algorithms)
2017
page 1 of 7Next →

Frequent Co-authors

Pavol Hell(18), Rajeev Motwani(16), Rina Panigrahy‎(9), An Zhu(7), Gagan Aggarwal(5), Dilys Thomas(5), Jing Huang(5), Krishnaram Kenthapadi(4), Sulamita Klein(3), Chris Olston(3), Moshe Y. Vardi(2), Moses Charikar(2), Chandra Chekuri(2), Samir Khuller(2), Milena Mihail(2), Amin Saberi(2), Jennifer Widom(2), Arash Rafiey(2), Daniel Greene(1), Eyal Kushilevitz(1)