Tomás Feder
- Computational Theory and Mathematics top 0.2%
- Computer Networks and Communications top 1%
- Artificial Intelligence top 1%
- Signal Processing top 2%
- Discrete Mathematics and Combinatorics top 1%
- Co-authors
- Moshe Y. VardiRajeev MotwaniPavol HellDaniel GreeneChandra ChekuriMoses CharikarRina PanigrahyAn Zhu
- Topics
- Advanced Graph Theory Research (66 papers)Complexity and Algorithms in Graphs (37 papers)graph theory and CDMA systems (21 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsComputer Graphics and Computer-Aided Design
- Partner nations
- United StatesCanadaBrazil
In The Last Decade
Tomás Feder
82 papers receiving 2.5k citations
Hit Papers
Peers
Comparison fields: 5 of 90
- Computational Theory and Mathematics 1.5k
- Computer Networks and Communications 850
- Artificial Intelligence 846
- Signal Processing 322
- Discrete Mathematics and Combinatorics 314
Countries citing papers authored by Tomás Feder
This map shows the geographic impact of Tomás Feder's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tomás Feder with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tomás Feder more than expected).
Fields of papers citing papers by Tomás Feder
This network shows the impact of papers produced by Tomás Feder. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tomás Feder. The network helps show where Tomás Feder may publish in the future.
Co-authorship network of co-authors of Tomás Feder
This figure shows the co-authorship network connecting the top 25 collaborators of Tomás Feder. A scholar is included among the top collaborators of Tomás Feder based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Tomás Feder. Tomás Feder is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 3 | |
| 2 | Distance-Two Coloring of Barnette Graphs. | 1 |
| 3 | 0 | |
| 4 | 0 | |
| 5 | Packing Edge-Disjoint Triangles in Given Graphs. | 5 |
| 6 | 2 | |
| 7 | Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised). | 2 |
| 8 | k-connected spanning subgraphs of low degree. | 9 |
| 9 | Channel Assignment in Wireless Networks and Classification of Minimum Graph Homomorphism | 3 |
| 10 | Closures and Dichotomies for Quantified Constraints | 4 |
| 11 | On Barnette's conjecture | 6 |
| 12 | Constraint satisfaction: a personal perspective. | 1 |
| 13 | 14 | |
| 14 | Constraint Satisfaction on Finite Groups with Near Subgroups | 7 |
| 15 | 28 | |
| 16 | 9 | |
| 17 | 14 | |
| 18 | 9 | |
| 19 | 76 | |
| 20 | 5 |
About Tomás Feder
Tomás Feder is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design, having authored 87 papers that have together received 2.8k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (66 papers), Complexity and Algorithms in Graphs (37 papers) and graph theory and CDMA systems (21 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (314 citations), Computational Theory and Mathematics (1.5k citations) and Computer Graphics and Computer-Aided Design (182 citations). Tomás Feder has collaborated with scholars based in United States, Canada and Brazil. Frequent co-authors include Moshe Y. Vardi, Rajeev Motwani, Pavol Hell, Daniel Greene, Chandra Chekuri, Moses Charikar, Rina Panigrahy, An Zhu, Jing Huang and Dilys Thomas. Their work appears in journals such as SIAM Journal on Computing, American Mathematical Monthly and Theoretical Computer Science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.