Tomás Feder

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
89Dichotomy for tree-structured trigraph list homomorphism problems. Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho. Discrete Applied Mathematics (159): 1217-1224 (2011). Web SearchBibTeXDownload
88Maximum gap labelings of graphs. Tomás Feder, Carlos S. Subi. Inf. Process. Lett. (111): 169-173 (2011). Web SearchBibTeXDownload
87Distributing data for secure database services. Vignesh Ganapathy, Dilys Thomas, Tomás Feder, Hector Garcia-Molina, Rajeev Motwani. PAIS 2011, 8. Web SearchBibTeXDownload
2010
86Achieving anonymity via clustering. Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Samir Khuller, An Zhu. ACM Transactions on Algorithms (6) (2010). Cited by 109Web SearchBibTeXDownload
85Dichotomy for tree-structured trigraph list homomorphism problems. Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho. CoRR (abs/1009.0358) (2010). Web SearchBibTeXDownload
84Finding large cycles in Hamiltonian graphs. Tomás Feder, Rajeev Motwani. Discrete Applied Mathematics (158): 882-893 (2010). Cited by 11Web SearchBibTeXDownload
83Retractions to Pseudoforests. Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh. SIAM J. Discrete Math. (24): 101-112 (2010). Web SearchBibTeXDownload
2009
82Extension problems with degree bounds. Tomás Feder, Pavol Hell, Jing Huang. Discrete Applied Mathematics (157): 1592-1599 (2009). Web SearchBibTeXDownload
81Adjusted Interval Digraphs. Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey. Electronic Notes in Discrete Mathematics (32): 83-91 (2009). Web SearchBibTeXDownload
80Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations. Tomás Feder, Carlos S. Subi. Inf. Process. Lett. (109): 267-272 (2009). Web SearchBibTeXDownload
79Approximating the Minimum Chain Completion problem. Tomás Feder, Heikki Mannila, Evimaria Terzi. Inf. Process. Lett. (109): 980-985 (2009). Web SearchBibTeXDownload
78On the graph turnpike problem. Tomás Feder, Rajeev Motwani. Inf. Process. Lett. (109): 774-776 (2009). Web SearchBibTeXDownload
2008
77Anonymizing Graphs. Tomás Feder, Shubha U. Nabar, Evimaria Terzi. CoRR (abs/0810.5578) (2008). Web SearchBibTeXDownload
76On realizations of point determining graphs, and obstructions to full homomorphisms. Tomás Feder, Pavol Hell. Discrete Mathematics (308): 1639-1652 (2008). Web SearchBibTeXDownload
75Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised). Tomás Feder, Carlos S. Subi. Electronic Colloquium on Computational Complexity (ECCC) (15) (2008). Web SearchBibTeXDownload
74Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms. Tomás Feder, Pavol Hell, Jing Huang. SIAM J. Discrete Math. (22): 1-14 (2008). Web SearchBibTeXDownload
73Near-Unanimity Functions and Varieties of Reflexive Graphs. Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray. SIAM J. Discrete Math. (22): 938-960 (2008). Web SearchBibTeXDownload
2007
72Approximating nash equilibria using small-support strategies. Tomás Feder, Hamid Nazerzadeh, Amin Saberi. ACM Conference on Electronic Commerce 2007, 352-354. Web SearchBibTeXDownload
71Querying priced information in databases: The conjunctive case. Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas. ACM Transactions on Algorithms (3) (2007). Cited by 3Web SearchBibTeXDownload
70List homomorphisms of graphs with bounded degrees. Tomás Feder, Pavol Hell, Jing Huang. Discrete Mathematics (307): 386-392 (2007). Web SearchBibTeXDownload
69The structure of bi-arc trees. Tomás Feder, Pavol Hell, Jing Huang. Discrete Mathematics (307): 393-401 (2007). Web SearchBibTeXDownload
68Matrix Partitions with Finitely Many Obstructions. Tomás Feder, Pavol Hell, Wing Xie. Electr. J. Comb. (14) (2007). Web SearchBibTeXDownload
67Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations. Tomás Feder, Carlos S. Subi. Electronic Colloquium on Computational Complexity (ECCC) (14) (2007). Web SearchBibTeXDownload
66Computing shortest paths with uncertainty. Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy. J. Algorithms (62): 1-18 (2007). Cited by 8Web SearchBibTeXDownload
2006
65Digraph matrix partitions and trigraph homomorphisms. Tomás Feder, Pavol Hell, Kim Tucker-Nally. Discrete Applied Mathematics (154): 2458-2469 (2006). Web SearchBibTeXDownload
64Matrix partitions of perfect graphs. Tomás Feder, Pavol Hell. Discrete Mathematics (306): 2450-2460 (2006). Web SearchBibTeXDownload
63Closures and dichotomies for quantified constraints. Tomás Feder, Phokion G. Kolaitis. Electronic Colloquium on Computational Complexity (ECCC) (13) (2006). Web SearchBibTeXDownload
62Constraint satisfaction: a personal perspective. Tomás Feder. Electronic Colloquium on Computational Complexity (ECCC) (13) (2006). Web SearchBibTeXDownload
61k-connected spanning subgraphs of low degree. Tomás Feder, Rajeev Motwani, An Zhu. Electronic Colloquium on Computational Complexity (ECCC) (13) (2006). Cited by 2Web SearchBibTeXDownload
60Channel assignment in wireless networks and classification of minimum graph homomorphism. Tomás Feder, Gagan Aggarwal, Rajeev Motwani, An Zhu. Electronic Colloquium on Computational Complexity (ECCC) (13) (2006). Cited by 10Web SearchBibTeXDownload
59On Barnette's conjecture. Tomás Feder, Carlos S. Subi. Electronic Colloquium on Computational Complexity (ECCC) 2006. Web SearchBibTeXDownload
58Finding large cycles in Hamiltonian graphs. Tomás Feder, Rajeev Motwani. Electronic Colloquium on Computational Complexity (ECCC) (13) (2006). Cited by 11Web SearchBibTeXDownload
57Partition into k-vertex subgraphs of k-partite graphs. Tomás Feder, Carlos S. Subi. Electronic Colloquium on Computational Complexity (ECCC) 2006. Web SearchBibTeXDownload
56A 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, 69-76. Web SearchBibTeXDownload
55Achieving anonymity via clustering. Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Samir Khuller, An Zhu. PODS 2006, 153-162. Cited by 109Web SearchBibTeXDownload
54Full Constraint Satisfaction Problems. Tomás Feder, Pavol Hell. SIAM J. Comput. (36): 230-246 (2006). Web SearchBibTeXDownload
53A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings. Tomás Feder. SIAM J. Discrete Math. (20): 291-301 (2006). Web SearchBibTeXDownload
52Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection. Tomás Feder, Daniel K. Ford. SIAM J. Discrete Math. (20): 372-394 (2006). Web SearchBibTeXDownload
2005
51Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection. Tomás Feder, Daniel K. Ford. Electronic Colloquium on Computational Complexity (ECCC) 2005. Web SearchBibTeXDownload
50Constraint Satisfaction on Finite Groups with Near Subgroups. Tomás Feder. Electronic Colloquium on Computational Complexity (ECCC) 2005. Web SearchBibTeXDownload
49Anonymizing Tables. Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, An Zhu. ICDT 2005, 246-258. Web SearchBibTeXDownload
48Algorithms for the Database Layout Problem. Gagan Aggarwal, Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu. ICDT 2005, 189-203. Cited by 1Web SearchBibTeXDownload
47Disks on a Tree: Analysis of a Combinatorial Game. Tomás Feder, Carlos S. Subi. SIAM J. Discrete Math. (19): 543-552 (2005). Web SearchBibTeXDownload
46Two algorithms for general list matrix partitions. Tomás Feder, Pavol Hell, Daniel Král, Jiri Sgall. SODA 2005, 870-876. Web SearchBibTeXDownload
45Finding large cycles in Hamiltonian graphs. Tomás Feder, Rajeev Motwani. SODA 2005, 166-175. Cited by 11Web SearchBibTeXDownload
44List matrix partitions of chordal graphs. Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti. Theor. Comput. Sci. (349): 52-66 (2005). Web SearchBibTeXDownload
2004
43Algorithms for Multi-product Pricing. Gagan Aggarwal, Tomás Feder, Rajeev Motwani, An Zhu. ICALP 2004, 72-83. Cited by 37Web SearchBibTeXDownload
42List Partitions of Chordal Graphs. Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti. LATIN 2004, 100-108. Web SearchBibTeXDownload
41Incremental Clustering and Dynamic Information Retrieval. Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani. SIAM J. Comput. (33): 1417-1440 (2004). Cited by 257Web SearchBibTeXDownload
40Combining request scheduling with web caching. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu. Theor. Comput. Sci. (324): 201-218 (2004). Cited by 7Web SearchBibTeXDownload
39Dichotomies for classes of homomorphism problems involving unary functions. Tomás Feder, Florent R. Madelaine, Iain A. Stewart. Theor. Comput. Sci. (314): 1-43 (2004). Web SearchBibTeXDownload
2003
38A combinatorial algorithm for MAX CSP. Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani, Rina Panigrahy. Inf. Process. Lett. (85): 307-315 (2003). Cited by 9Web SearchBibTeXDownload
37Homomorphism Closed vs. Existential Positive. Tomás Feder, Moshe Y. Vardi. LICS 2003, 311-320. Cited by 17Web SearchBibTeXDownload
36Computing the Median with Uncertainty. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom. SIAM J. Comput. (32): 538-547 (2003). Web SearchBibTeXDownload
35List Partitions. Richard S. Bird, Pavol Hell, Sulamita Klein, Rajeev Motwani. SIAM J. Discrete Math. (16): 449-478 (2003). Cited by 39Web SearchBibTeXDownload
34Acyclic Homomorphisms and Circular Colorings of Digraphs. Tomás Feder, Pavol Hell, Bojan Mohar. SIAM J. Discrete Math. (17): 161-169 (2003). Web SearchBibTeXDownload
33Computing Shortest Paths with Uncertainty. Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy. STACS 2003, 367-378. Web SearchBibTeXDownload
32Representing Graph Metrics with Fewest Edges. Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy. STACS 2003, 355-366. Cited by 5Web SearchBibTeXDownload
2002
31Worst-case time bounds for coloring and satisfiability problems. Tomás Feder, Rajeev Motwani. J. Algorithms (45): 192-201 (2002). Cited by 24Web SearchBibTeXDownload
30Approximating the Longest Cycle Problem in Sparse Graphs. Tomás Feder, Rajeev Motwani, Carlos S. Subi. SIAM J. Comput. (31): 1596-1607 (2002). Cited by 16Web SearchBibTeXDownload
29Web caching with request reordering. Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu. SODA 2002, 104-105. Cited by 14Web SearchBibTeXDownload
2001
28Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability. Tomás Feder. SIAM J. Discrete Math. (14): 471-480 (2001). Web SearchBibTeXDownload
27Fanout limitations on constraint systems. Tomás Feder. Theor. Comput. Sci. (255): 281-293 (2001). Web SearchBibTeXDownload
2000
26Computing the median with uncertainty. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom. STOC 2000, 602-607. Cited by 23Web SearchBibTeXDownload
25Finding long paths and cycles in sparse Hamiltonian graphs. Tomás Feder, Rajeev Motwani, Carlos S. Subi. STOC 2000, 524-529. Cited by 11Web SearchBibTeXDownload
24A sublinear parallel algorithm for stable matching. Tomás Feder, Nimrod Megiddo, Serge A. Plotkin. Theor. Comput. Sci. (233): 297-308 (2000). Web SearchBibTeXDownload
1999
23List Homomorphisms and Circular Arc Graphs. Tomás Feder, Pavol Hell, Jing Huang. Combinatorica (19): 487-505 (1999). Web SearchBibTeXDownload
22Complexity of Graph Partition Problems. Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani. STOC 1999, 464-472. Cited by 65Web SearchBibTeXDownload
1998
21Online Channel Allocation in FDMA Networks with Reuse Constraints. Tomás Feder, Sunil M. Shende. Inf. Process. Lett. (67): 295-302 (1998). Web SearchBibTeXDownload
20List Homomorphisms to Reflexive Graphs. Tomás Feder, Pavol Hell. J. Comb. Theory, Ser. B (72): 236-250 (1998). Web SearchBibTeXDownload
19The 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. (28): 57-104 (1998). Web SearchBibTeXDownload
1997
18Incremental Clustering and Dynamic Information Retrieval. Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani. STOC 1997, 626-635. Cited by 257Web SearchBibTeXDownload
1996
17The Benefits of Relaxing Punctuality. Rajeev Alur, Tomás Feder, Thomas A. Henzinger. J. ACM (43): 116-146 (1996). Web SearchBibTeXDownload
1995
16Clique Partitions, Graph Compression and Speeding-Up Algorithms. Tomás Feder, Rajeev Motwani. J. Comput. Syst. Sci. (51): 261-272 (1995). Cited by 131Web SearchBibTeXDownload
15Amortized Communication Complexity. Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan. SIAM J. Comput. (24): 736-750 (1995). Web SearchBibTeXDownload
1994
14Network Flow and 2-Satisfiability. Tomás Feder. Algorithmica (11): 291-319 (1994). Web SearchBibTeXDownload
13A Sublinear Parallel Algorithm for Stable Matching. Tomás Feder, Nimrod Megiddo, Serge A. Plotkin. SODA 1994, 632-637. Web SearchBibTeXDownload
1993
12Monotone monadic SNP and constraint satisfaction. Tomás Feder, Moshe Y. Vardi. STOC 1993, 612-622. Cited by 79Web SearchBibTeXDownload
1992
11Decidability and Undecidability of Equivalence for Linear Datalog with Applications to Normal-Form Optimizations. Tomás Feder, Yatin P. Saraiya. ICDT 1992, 297-311. Web SearchBibTeXDownload
10A New Fixed Point Approach for Stable Networks and Stable Marriages. Tomás Feder. J. Comput. Syst. Sci. (45): 233-284 (1992). Web SearchBibTeXDownload
9Determinism vs. Nondeterminism in Multiparty Communication Complexity. Danny Dolev, Tomás Feder. SIAM J. Comput. (21): 889-895 (1992). Web SearchBibTeXDownload
8Balanced Matroids. Tomás Feder, Milena Mihail. STOC 1992, 26-38. Web SearchBibTeXDownload
1991
7Amortized Communication Complexity (Preliminary Version). Tomás Feder, Eyal Kushilevitz, Moni Naor. FOCS 1991, 239-248. Web SearchBibTeXDownload
6The Benefits of Relaxing Punctuality. Rajeev Alur, Tomás Feder, Thomas A. Henzinger. PODC 1991, 139-152. Web SearchBibTeX
5Clique Partitions, Graph Compression, and Speeding-Up Algorithms. Tomás Feder, Rajeev Motwani. STOC 1991, 123-133. Web SearchBibTeXDownload
1989
4Multiparty Communication Complexity. Danny Dolev, Tomás Feder. FOCS 1989, 428-433. Web SearchBibTeXDownload
3Reliable computation by networks in the presence of noise. Tomás Feder. IEEE Transactions on Information Theory (35): 569-571 (1989). Web SearchBibTeXDownload
2A New Fixed Point Approach for Stable Networks and Stable Marriages. Tomás Feder. STOC 1989, 513-522. Web SearchBibTeXDownload
1988
1Optimal Algorithms for Approximate Clustering. Tomás Feder, Daniel H. Greene. STOC 1988, 434-444. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research