Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
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).
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.
Feder, Tomás, et al.. (2012). Packing Edge-Disjoint Triangles in Given Graphs.. Electronic colloquium on computational complexity. 19. 13.5 indexed citations
Feder, Tomás, et al.. (2007). Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised).. Electronic colloquium on computational complexity. 14.2 indexed citations
8.
Feder, Tomás, Rajeev Motwani, & An Zhu. (2006). k-connected spanning subgraphs of low degree.. Electronic colloquium on computational complexity. 13.9 indexed citations
9.
Feder, Tomás, Gagan Aggarwal, Rajeev Motwani, & An Zhu. (2006). Channel Assignment in Wireless Networks and Classification of Minimum Graph Homomorphism. Electronic colloquium on computational complexity. 13.3 indexed citations
10.
Feder, Tomás & Phokion G. Kolaitis. (2006). Closures and Dichotomies for Quantified Constraints. Electronic colloquium on computational complexity. 13.4 indexed citations
11.
Feder, Tomás, et al.. (2006). On Barnette's conjecture. Electronic colloquium on computational complexity.6 indexed citations
12.
Feder, Tomás. (2006). Constraint satisfaction: a personal perspective.. Electronic colloquium on computational complexity. 13.1 indexed citations
Feder, Tomás. (2005). Constraint Satisfaction on Finite Groups with Near Subgroups. Electronic colloquium on computational complexity.7 indexed citations
Feder, Tomás & Pavol Hell. (1998). List Homomorphisms to Reflexive Graphs. Journal of Combinatorial Theory Series B. 72(2). 236–250.76 indexed citations
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.