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 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.
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.
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.
Incremental Clustering and Dynamic Information Retrieval
Moses Charikar;Chandra Chekuri;Tomas Feder;Rajeev Motwani.
SIAM Journal on Computing (2004)
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
Tomás Feder;Moshe Y. Vardi.
SIAM Journal on Computing (1999)
The benefits of relaxing punctuality
Rajeev Alur;Tomás Feder;Thomas A. Henzinger.
Journal of the ACM (1996)
Optimal algorithms for approximate clustering
Tomás Feder;Daniel Greene.
symposium on the theory of computing (1988)
Achieving anonymity via clustering
Gagan Aggarwal;Rina Panigrahy;Tomás Feder;Dilys Thomas.
ACM Transactions on Algorithms (2010)
Gagan Aggarwal;Tomás Feder;Krishnaram Kenthapadi;Rajeev Motwani.
international conference on database theory (2005)
Achieving anonymity via clustering
Gagan Aggarwal;Tomás Feder;Krishnaram Kenthapadi;Samir Khuller.
symposium on principles of database systems (2006)
Approximation Algorithms for k-Anonymity
Gagan Aggarwal;Tomas Feder;Krishnaram Kenthapadi;Rajeev Motwani.
Journal of Privacy Technology (2005)
Tomás Feder;Milena Mihail.
symposium on the theory of computing (1992)
Clique Partitions, Graph Compression and Speeding-Up Algorithms
T. Feder;R. Motwani.
Journal of Computer and System Sciences (1995)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: