What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Algorithm
- Discrete mathematics
The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, Algorithm, Block graph and Table.
The study of Discrete mathematics is intertwined with the study of Upper and lower bounds in a number of ways.
In general Combinatorics, his work in Graph homomorphism, Indifference graph and Matroid is often linked to Complexity of constraint satisfaction and Monotone polygon linking many areas of study.
His Algorithm research integrates issues from Domain, Automaton, Punctuality and Temporal logic.
His studies deal with areas such as Data integrity, Fraction and Approximation algorithm as well as Table.
His research investigates the link between Approximation algorithm and topics such as Partition that cross with problems in Correlation clustering.
His most cited work include:
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory (990 citations)
- The benefits of relaxing punctuality (468 citations)
- Optimal algorithms for approximate clustering (380 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Combinatorics, Discrete mathematics, Homomorphism, Time complexity and Chordal graph.
His works in Indifference graph, Bipartite graph, Conjecture, Digraph and Graph are all subjects of inquiry into Combinatorics.
Tomás Feder works mostly in the field of Indifference graph, limiting it down to topics relating to Interval graph and, in certain cases, Treewidth and Clique-sum.
His studies in Bipartite graph integrate themes in fields like Hamiltonian path and Vertex.
As part of the same scientific family, he usually focuses on Discrete mathematics, concentrating on Algorithm and intersecting with Theoretical computer science.
In his work, Graph partition is strongly intertwined with Null graph, which is a subfield of Strength of a graph.
He most often published in these fields:
- Combinatorics (70.77%)
- Discrete mathematics (55.38%)
- Homomorphism (16.92%)
What were the highlights of his more recent work (between 2012-2021)?
- Combinatorics (70.77%)
- Homomorphism (16.92%)
- Bipartite graph (10.77%)
In recent papers he was focusing on the following fields of study:
Combinatorics, Homomorphism, Bipartite graph, Conjecture and Discrete mathematics are his primary areas of study.
Tomás Feder performs multidisciplinary study on Combinatorics and Planar in his works.
The concepts of his Homomorphism study are interwoven with issues in Tree, Reflexive relation, Transitive relation and Signed graph.
His Bipartite graph research is multidisciplinary, incorporating elements of Edge coloring, Degree, Foster graph and List edge-coloring.
His Conjecture study integrates concerns from other disciplines, such as Hypercube, Path, Square and Antipodal point.
Discrete mathematics is often connected to Class in his work.
Between 2012 and 2021, his most popular works were:
- Dichotomy for Digraph Homomorphism Problems. (21 citations)
- On hypercube labellings and antipodal monochromatic paths (11 citations)
- Matrix partitions of split graphs (5 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algebra
- Algorithm
Tomás Feder mostly deals with Combinatorics, Discrete mathematics, Conjecture, Simple and Chordal graph.
Many of his research projects under Combinatorics are closely connected to Reflexivity and Group homomorphism with Reflexivity and Group homomorphism, tying the diverse disciplines of science together.
Tomás Feder has included themes like Cubic graph, Spanning tree and Vertex in his Barnette's conjecture study.
His research in Interval graph intersects with topics in Clique-sum and Treewidth.
Tomás Feder combines subjects such as Indifference graph, Pathwidth and Frequency partition of a graph with his study of Chordal graph.
His Split graph research is multidisciplinary, relying on both Modular decomposition and Graph partition.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
