| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Vignesh Ganapathy, Dilys Thomas, Tomás Feder, Hector Garcia-Molina, Rajeev Motwani |
Distributing Data for Secure Database Services.  |
Transactions on Data Privacy  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Carlos S. Subi |
Packing Edge-Disjoint Triangles in Given Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Hubie Chen, Tomás Feder |
On the Complexity of MMSNP. |
SIAM J. Discrete Math. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey |
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi |
Partitioning Chordal Graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Carlos S. Subi |
Maximum gap labelings of graphs. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho |
Dichotomy for tree-structured trigraph list homomorphism problems. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vignesh Ganapathy, Dilys Thomas, Tomás Feder, Hector Garcia-Molina, Rajeev Motwani |
Distributing data for secure database services. |
PAIS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gagan Aggarwal, Rina Panigrahy, Tomás Feder, Dilys Thomas, Krishnaram Kenthapadi, Samir Khuller, An Zhu |
Achieving anonymity via clustering. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho |
Dichotomy for tree-structured trigraph list homomorphism problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh |
Retractions to Pseudoforests. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani |
Finding large cycles in Hamiltonian graphs. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey |
Adjusted Interval Digraphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Carlos S. Subi |
Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani |
On the graph turnpike problem. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Heikki Mannila, Evimaria Terzi |
Approximating the Minimum Chain Completion problem. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang |
Extension problems with degree bounds. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Carlos S. Subi |
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised). |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell |
On realizations of point determining graphs, and obstructions to full homomorphisms. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Shubha U. Nabar, Evimaria Terzi |
Anonymizing Graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang |
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray |
Near-Unanimity Functions and Varieties of Reflexive Graphs. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Wing Xie |
Matrix Partitions with Finitely Many Obstructions. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Carlos S. Subi |
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang |
The structure of bi-arc trees. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang |
List homomorphisms of graphs with bounded degrees. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Wing Xie |
Matrix Partitions with Finitely Many Obstructions. |
Electr. J. Comb. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas |
Querying priced information in databases: The conjunctive case. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
online algorithms, Competitive analysis |
| 1 | Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy |
Computing shortest paths with uncertainty. |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Hamid Nazerzadeh, Amin Saberi |
Approximating nash equilibria using small-support strategies. |
ACM Conference on Electronic Commerce |
2007 |
DBLP DOI BibTeX RDF |
small-support strategies, Nash equilibrium, probabilistic methods |
| 1 | Tomás Feder, Carlos S. Subi |
On Barnette's conjecture |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Phokion G. Kolaitis |
Closures and dichotomies for quantified constraints. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Carlos S. Subi |
Partition into k-vertex subgraphs of k-partite graphs |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder |
Constraint satisfaction: a personal perspective. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Gagan Aggarwal, Rajeev Motwani, An Zhu |
Channel assignment in wireless networks and classification of minimum graph homomorphism. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani |
Finding large cycles in Hamiltonian graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani, An Zhu |
k-connected spanning subgraphs of low degree. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell |
Matrix partitions of perfect graphs. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder |
A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Daniel K. Ford |
Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Kim Tucker-Nally |
Digraph matrix partitions and trigraph homomorphisms. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell |
Full Constraint Satisfaction Problems. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Adam Guetz, Milena Mihail, Amin Saberi |
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu |
Achieving anonymity via clustering. |
PODS |
2006 |
DBLP DOI BibTeX RDF |
clustering, privacy, approximation algorithms, anonymity |
| 1 | Tomás Feder |
Constraint Satisfaction on Finite Groups with Near Subgroups |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Daniel K. Ford |
Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
List matrix partitions of chordal graphs. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Carlos S. Subi |
Disks on a Tree: Analysis of a Combinatorial Game. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani |
Finding large cycles in Hamiltonian graphs. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Daniel Král, Jiri Sgall |
Two algorithms for general list matrix partitions. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, An Zhu |
Anonymizing Tables. |
ICDT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gagan Aggarwal, Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu |
Algorithms for the Database Layout Problem. |
ICDT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Florent R. Madelaine, Iain A. Stewart |
Dichotomies for classes of homomorphism problems involving unary functions. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu |
Combining request scheduling with web caching. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani |
Incremental Clustering and Dynamic Information Retrieval. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gagan Aggarwal, Tomás Feder, Rajeev Motwani, An Zhu |
Algorithms for Multi-product Pricing. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti |
List Partitions of Chordal Graphs. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani, Rina Panigrahy |
A combinatorial algorithm for MAX CSP. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Bojan Mohar |
Acyclic Homomorphisms and Circular Colorings of Digraphs. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani |
List Partitions. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom |
Computing the Median with Uncertainty. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy |
Representing Graph Metrics with Fewest Edges. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy |
Computing Shortest Paths with Uncertainty. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Moshe Y. Vardi |
Homomorphism Closed vs. Existential Positive. |
LICS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani |
Worst-case time bounds for coloring and satisfiability problems. |
J. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani, Carlos S. Subi |
Approximating the Longest Cycle Problem in Sparse Graphs. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu |
Web caching with request reordering. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder |
Fanout limitations on constraint systems. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder |
Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability. |
SIAM J. Discrete Math. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Nimrod Megiddo, Serge A. Plotkin |
A sublinear parallel algorithm for stable matching. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom |
Computing the median with uncertainty. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani, Carlos S. Subi |
Finding long paths and cycles in sparse Hamiltonian graphs. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Jing Huang |
List Homomorphisms and Circular Arc Graphs. |
Combinatorica |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C85, 68R10, 05C15, 05C75 |
| 1 | Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani |
Complexity of Graph Partition Problems. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell |
List Homomorphisms to Reflexive Graphs. |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Sunil M. Shende |
Online Channel Allocation in FDMA Networks with Reuse Constraints. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Moshe Y. Vardi |
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani |
Incremental Clustering and Dynamic Information Retrieval. |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Tomás Feder, Thomas A. Henzinger |
The Benefits of Relaxing Punctuality. |
J. ACM |
1996 |
DBLP DOI BibTeX RDF |
model checking, real time, temporal logic, timed automata |
| 1 | Tomás Feder, Rajeev Motwani |
Clique Partitions, Graph Compression and Speeding-Up Algorithms. |
J. Comput. Syst. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan |
Amortized Communication Complexity. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder |
Network Flow and 2-Satisfiability. |
Algorithmica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Nimrod Megiddo, Serge A. Plotkin |
A Sublinear Parallel Algorithm for Stable Matching. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Moshe Y. Vardi |
Monotone monadic SNP and constraint satisfaction. |
STOC |
1993 |
DBLP DOI BibTeX RDF |
Datalog |
| 1 | Tomás Feder |
A New Fixed Point Approach for Stable Networks and Stable Marriages. |
J. Comput. Syst. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Dolev, Tomás Feder |
Determinism vs. Nondeterminism in Multiparty Communication Complexity. |
SIAM J. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Yatin P. Saraiya |
Decidability and Undecidability of Equivalence for Linear Datalog with Applications to Normal-Form Optimizations. |
ICDT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Milena Mihail |
Balanced Matroids |
STOC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Tomás Feder, Thomas A. Henzinger |
The Benefits of Relaxing Punctuality. |
PODC |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Eyal Kushilevitz, Moni Naor |
Amortized Communication Complexity (Preliminary Version) |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
amortised communication complexity, direct sum problem, lower bound |
| 1 | Tomás Feder, Rajeev Motwani |
Clique Partitions, Graph Compression, and Speeding-Up Algorithms |
STOC |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder |
Reliable computation by networks in the presence of noise. |
IEEE Transactions on Information Theory |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Dolev, Tomás Feder |
Multiparty Communication Complexity |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
nondeterministic communication complexity, information lower bound, Boolean function, communication complexity |
| 1 | Tomás Feder |
A New Fixed Point Approach for Stable Networks and Stable Marriages |
STOC |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Daniel H. Greene |
Optimal Algorithms for Approximate Clustering |
STOC |
1988 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")