Optimal Algorithms for Approximate Clustering - Tomás Feder; Daniel H. Greene (STOC, 1988)

Multiparty Communication Complexity - Danny Dolev; Tomás Feder (FOCS, 1989)

Reliable computation by networks in the presence of noise. - Tomás Feder (IEEE Trans. Inf. Theory, 1989)

Amortized Communication Complexity (Preliminary Version) - Tomás Feder; Eyal Kushilevitz; Moni Naor (FOCS, 1991)

Stable networks and product graphs. - Tomás Feder (1991)

Decidability and Undecidability of Equivalence for Linear Datalog with Applications to Normal-Form Optimizations. - Tomás Feder; Yatin P. Saraiya (ICDT, 1992)

Balanced Matroids - Tomás Feder; Milena Mihail (STOC, 1992)

A New Fixed Point Approach for Stable Networks and Stable Marriages. - Tomás Feder (J. Comput. Syst. Sci., 1992)

Product graph representations. - Tomás Feder (J. Graph Theory, 1992)

Determinism vs. Nondeterminism in Multiparty Communication Complexity. - Danny Dolev; Tomás Feder (SIAM J. Comput., 1992)

Monotone monadic SNP and constraint satisfaction. - Tomás Feder; Moshe Y. Vardi (STOC, 1993)

Network Flow and 2-Satisfiability. - Tomás Feder (Algorithmica, 1994)

Clique Partitions, Graph Compression and Speeding-Up Algorithms. - Tomás Feder; Rajeev Motwani 001 (J. Comput. Syst. Sci., 1995)

Amortized Communication Complexity. - Tomás Feder; Eyal Kushilevitz; Moni Naor; Noam Nisan (SIAM J. Comput., 1995)

The Benefits of Relaxing Punctuality. - Rajeev Alur; Tomás Feder; Thomas A. Henzinger (J. ACM, 1996)

Online Channel Allocation in FDMA Networks with Reuse Constraints. - Tomás Feder; Sunil M. Shende (Inf. Process. Lett., 1998)

List Homomorphisms to Reflexive Graphs. - Tomás Feder; Pavol Hell (J. Comb. Theory B, 1998)

The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. - Tomás Feder; Moshe Y. Vardi (SIAM J. Comput., 1998)

Complexity of Graph Partition Problems. - Tomás Feder; Pavol Hell; Sulamita Klein; Rajeev Motwani 001 (STOC, 1999)

List Homomorphisms and Circular Arc Graphs. - Tomás Feder; Pavol Hell; Jing Huang 007 (Comb., 1999)

Finding long paths and cycles in sparse Hamiltonian graphs. - Tomás Feder; Rajeev Motwani 001; Carlos S. Subi (STOC, 2000)

A sublinear parallel algorithm for stable matching. - Tomás Feder; Nimrod Megiddo; Serge A. Plotkin (Theor. Comput. Sci., 2000)

Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability. - Tomás Feder (SIAM J. Discret. Math., 2001)

Fanout limitations on constraint systems. - Tomás Feder (Theor. Comput. Sci., 2001)

Web caching with request reordering. - Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; An Zhu (SODA, 2002)

Worst-case time bounds for coloring and satisfiability problems. - Tomás Feder; Rajeev Motwani 001 (J. Algorithms, 2002)

Approximating the Longest Cycle Problem in Sparse Graphs. - Tomás Feder; Rajeev Motwani 001; Carlos S. Subi (SIAM J. Comput., 2002)

Homomorphism Closed vs. Existential Positive. - Tomás Feder; Moshe Y. Vardi (LICS, 2003)

Representing Graph Metrics with Fewest Edges. - Tomás Feder; Adam Meyerson; Rajeev Motwani 001; Liadan O'Callaghan; Rina Panigrahy (STACS, 2003)

A combinatorial algorithm for MAX CSP. - Mayur Datar; Tomás Feder; Aristides Gionis; Rajeev Motwani 001; Rina Panigrahy (Inf. Process. Lett., 2003)

Bi-arc graphs and the complexity of list homomorphisms. - Tomás Feder; Pavol Hell; Jing Huang 007 (J. Graph Theory, 2003)

Computing the Median with Uncertainty. - Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; Chris Olston; Jennifer Widom (SIAM J. Comput., 2003)

List Partitions. - Tomás Feder; Pavol Hell; Sulamita Klein; Rajeev Motwani 001 (SIAM J. Discret. Math., 2003)

Acyclic Homomorphisms and Circular Colorings of Digraphs. - Tomás Feder; Pavol Hell; Bojan Mohar (SIAM J. Discret. Math., 2003)

Algorithms for Multi-product Pricing. - Gagan Aggarwal; Tomás Feder; Rajeev Motwani 001; An Zhu (ICALP, 2004)

List Partitions of Chordal Graphs. - Tomás Feder; Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (LATIN, 2004)

Incremental Clustering and Dynamic Information Retrieval. - Moses Charikar; Chandra Chekuri; Tomás Feder; Rajeev Motwani 001 (SIAM J. Comput., 2004)

Combining request scheduling with web caching. - Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; Steven S. Seiden; Rob van Stee; An Zhu (Theor. Comput. Sci., 2004)

Dichotomies for classes of homomorphism problems involving unary functions. - Tomás Feder; Florent R. Madelaine; Iain A. Stewart (Theor. Comput. Sci., 2004)

Anonymizing Tables. - Gagan Aggarwal; Tomás Feder; Krishnaram Kenthapadi; Rajeev Motwani 001; Rina Panigrahy; Dilys Thomas; An Zhu (ICDT, 2005)

Algorithms for the Database Layout Problem. - Gagan Aggarwal; Tomás Feder; Rajeev Motwani 001; Rina Panigrahy; An Zhu (ICDT, 2005)

Two algorithms for general list matrix partitions. - Tomás Feder; Pavol Hell; Daniel Král; Jirí Sgall (SODA, 2005)

Constraint Satisfaction on Finite Groups with Near Subgroups - Tomás Feder (Electron. Colloquium Comput. Complex., 2005)

Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection - Tomás Feder; Daniel K. Ford (Electron. Colloquium Comput. Complex., 2005)

Disks on a Tree: Analysis of a Combinatorial Game. - Tomás Feder; Carlos S. Subi (SIAM J. Discret. Math., 2005)

List matrix partitions of chordal graphs. - Tomás Feder; Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (Theor. Comput. Sci., 2005)

A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks. - Tomás Feder; Adam Guetz; Milena Mihail; Amin Saberi (FOCS, 2006)

Digraph matrix partitions and trigraph homomorphisms. - Tomás Feder; Pavol Hell; Kim Tucker-Nally (Discret. Appl. Math., 2006)

Matrix partitions of perfect graphs. - Tomás Feder; Pavol Hell (Discret. Math., 2006)

On Barnette's conjecture - Tomás Feder; Carlos S. Subi (Electron. Colloquium Comput. Complex., 2006)

Partition into k-vertex subgraphs of k-partite graphs - Tomás Feder; Carlos S. Subi (Electron. Colloquium Comput. Complex., 2006)

Constraint satisfaction: a personal perspective. - Tomás Feder (Electron. Colloquium Comput. Complex., 2006)

Channel assignment in wireless networks and classification of minimum graph homomorphism. - Tomás Feder; Gagan Aggarwal; Rajeev Motwani 001; An Zhu (Electron. Colloquium Comput. Complex., 2006)

Closures and dichotomies for quantified constraints. - Tomás Feder; Phokion G. Kolaitis (Electron. Colloquium Comput. Complex., 2006)

k-connected spanning subgraphs of low degree. - Tomás Feder; Rajeev Motwani 001; An Zhu (Electron. Colloquium Comput. Complex., 2006)

Full Constraint Satisfaction Problems. - Tomás Feder; Pavol Hell (SIAM J. Comput., 2006)

A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings. - Tomás Feder (SIAM J. Discret. Math., 2006)

Approximating nash equilibria using small-support strategies. - Tomás Feder; Hamid Nazerzadeh; Amin Saberi (EC, 2007)

List homomorphisms of graphs with bounded degrees. - Tomás Feder; Pavol Hell; Jing Huang 007 (Discret. Math., 2007)

The structure of bi-arc trees. - Tomás Feder; Pavol Hell; Jing Huang 007 (Discret. Math., 2007)

Matrix Partitions with Finitely Many Obstructions. - Tomás Feder; Pavol Hell; Wing Xie (Electron. Notes Discret. Math., 2007)

Computing shortest paths with uncertainty. - Tomás Feder; Rajeev Motwani 001; Liadan O'Callaghan; Chris Olston; Rina Panigrahy (J. Algorithms, 2007)

Querying priced information in databases: The conjunctive case. - Renato Carmo; Tomás Feder; Yoshiharu Kohayakawa; Eduardo Sany Laber; Rajeev Motwani 001; Liadan O'Callaghan; Rina Panigrahy; Dilys Thomas (ACM Trans. Algorithms, 2007)

Anonymizing Graphs - Tomás Feder; Shubha U. Nabar; Evimaria Terzi (CoRR, 2008)

On realizations of point determining graphs, and obstructions to full homomorphisms. - Tomás Feder; Pavol Hell (Discret. Math., 2008)

Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised). - Tomás Feder; Carlos S. Subi (Electron. Colloquium Comput. Complex., 2008)

Near-Unanimity Functions and Varieties of Reflexive Graphs. - Richard C. Brewster; Tomás Feder; Pavol Hell; Jing Huang 007; Gary MacGillivray (SIAM J. Discret. Math., 2008)

Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms. - Tomás Feder; Pavol Hell; Jing Huang 007 (SIAM J. Discret. Math., 2008)

Extension problems with degree bounds. - Tomás Feder; Pavol Hell; Jing Huang 007 (Discret. Appl. Math., 2009)

Adjusted Interval Digraphs. - Tomás Feder; Pavol Hell; Jing Huang 007; Arash Rafiey (Electron. Notes Discret. Math., 2009)

On the graph turnpike problem. - Tomás Feder; Rajeev Motwani 001 (Inf. Process. Lett., 2009)

Approximating the Minimum Chain Completion problem. - Tomás Feder; Heikki Mannila; Evimaria Terzi (Inf. Process. Lett., 2009)

Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations. - Tomás Feder; Carlos S. Subi (Inf. Process. Lett., 2009)

Finding large cycles in Hamiltonian graphs. - Tomás Feder; Rajeev Motwani 001 (Discret. Appl. Math., 2010)

Retractions to Pseudoforests. - Tomás Feder; Pavol Hell; Peter Jonsson; Andrei A. Krokhin; Gustav Nordh (SIAM J. Discret. Math., 2010)

Achieving anonymity via clustering. - Gagan Aggarwal; Rina Panigrahy; Tomás Feder; Dilys Thomas; Krishnaram Kenthapadi; Samir Khuller; An Zhu (ACM Trans. Algorithms, 2010)

Dichotomy for tree-structured trigraph list homomorphism problems. - Tomás Feder; Pavol Hell; David G. Schell; Juraj Stacho (Discret. Appl. Math., 2011)

Partitioning Chordal Graphs. - Tomás Feder; Pavol Hell; Shekoofeh Nekooei Rizi (Electron. Notes Discret. Math., 2011)

Maximum gap labelings of graphs. - Tomás Feder; Carlos S. Subi (Inf. Process. Lett., 2011)

Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. - Tomás Feder; Pavol Hell; Jing Huang 007; Arash Rafiey (Discret. Appl. Math., 2012)

Packing Edge-Disjoint Triangles in Given Graphs. - Tomás Feder; Carlos S. Subi (Electron. Colloquium Comput. Complex., 2012)

On the Complexity of MMSNP. - Manuel Bodirsky; Hubie Chen; Tomás Feder (SIAM J. Discret. Math., 2012)

Distributing Data for Secure Database Services. - Vignesh Ganapathy; Dilys Thomas; Tomás Feder; Hector Garcia-Molina; Rajeev Motwani 001 (Trans. Data Priv., 2012)

On hypercube labellings and antipodal monochromatic paths. - Tomás Feder; Carlos S. Subi (Discret. Appl. Math., 2013)

Obstructions to partitions of chordal graphs. - Tomás Feder; Pavol Hell; Shekoofeh Nekooei Rizi (Discret. Math., 2013)

Edge-coloring almost bipartite multigraphs. - Tomás Feder; Carlos S. Subi (Inf. Process. Lett., 2013)

Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. - Tomás Feder; Pavol Hell; Benoît Larose; Cynthia Loten; Mark H. Siggers; Claude Tardif (SIAM J. Discret. Math., 2013)

Matrix partitions of split graphs. - Tomás Feder; Pavol Hell; Oren Shklarsky (Discret. Appl. Math., 2014)

Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. - Tomás Feder; Pavol Hell; Benoît Larose; Mark H. Siggers; Claude Tardif (SIAM J. Discret. Math., 2014)

Complexity of Correspondence Homomorphisms. - Tomás Feder; Pavol Hell (CoRR, 2017)

Dichotomy for Digraph Homomorphism Problems. - Arash Rafiey; Jeff Kinne; Tomás Feder (CoRR, 2017)

Colourings, homomorphisms, and partitions of transitive digraphs. - Tomás Feder; Pavol Hell; César Hernández-Cruz (Eur. J. Comb., 2017)

Correspondence Homomorphisms to Reflexive Graphs. - Tomás Feder; Pavol Hell (Electron. Notes Discret. Math., 2017)

Distance-Two Coloring of Barnette Graphs. - Tomás Feder; Pavol Hell; Carlos S. Subi (CCCG, 2018)

Distance-Two Colorings of Barnette Graphs. - Tomás Feder; Pavol Hell; Carlos S. Subi (CoRR, 2018)

Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints. - Tomás Feder; Pavol Hell; Carlos S. Subi (CoRR, 2019)

List Homomorphism Problems for Signed Graphs. - Jan Bok; Richard C. Brewster; Tomás Feder; Pavol Hell; Nikola Jedlicková (MFCS, 2020)

Complexity of correspondence H-colourings. - Tomás Feder; Pavol Hell (Discret. Appl. Math., 2020)

Distance-two colourings of Barnette graphs. - Tomás Feder; Pavol Hell; Carlos S. Subi (Eur. J. Comb., 2021)

Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture. - Behrooz Bagheri Gh.; Tomás Feder; Herbert Fleischner; Carlos S. Subi (J. Graph Theory, 2021)

On Finding Hamiltonian Cycles in Barnette Graphs. - Behrooz Bagheri Gh.; Tomás Feder; Herbert Fleischner; Carlos S. Subi (Fundam. Informaticae, 2022)

List homomorphism problems for signed trees. - Jan Bok; Richard C. Brewster; Tomás Feder; Pavol Hell; Nikola Jedlicková (Discret. Math., 2023)

List homomorphisms to separable signed graphs. - Jan Bok; Richard C. Brewster; Tomás Feder; Pavol Hell; Nikola Jedlicková (Theor. Comput. Sci., 2024)