Tomás Feder

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

Coauthor Index

1	Gagan Aggarwal	[43] [50] [51] [58] [64] [87]
2	Rajeev Alur	[6] [17]
3	Manuel Bodirsky	[93]
4	Richard C. Brewster	[74]
5	Renato Carmo	[72]
6	Moses Charikar	[18] [41]
7	Chandra Chekuri	[18] [41]
8	Hubie Chen	[93]
9	Mayur Datar	[35]
10	Danny Dolev	[4] [8]
11	Daniel K. Ford	[46] [52]
12	Vignesh Ganapathy	[91] [92]
13	Hector Garcia-Molina	[91] [92]
14	Aristides Gionis	[35]
15	Daniel H. Greene	[1]
16	Adam Guetz	[65]
17	Pavol Hell	[20] [22] [23] [32] [33] [42] [44] [48] [54] [62] [63] [67] [69] [70] [71] [74] [75] [77] [82] [83] [84] [86] [89] [90] [95]
18	Thomas A. Henzinger	[6] [17]
19	Jing Huang	[22] [70] [71] [74] [75] [82] [83] [95]
20	Peter Jonsson	[84]
21	Krishnaram Kenthapadi	[50] [64] [87]
22	Samir Khuller	[64] [87]
23	Sulamita Klein	[23] [33] [42] [44]
24	Yoshiharu Kohayakawa	[72]
25	Phokion G. Kolaitis	[55]
26	Daniel Král (Daniel Král')	[48]
27	Andrei A. Krokhin	[84]
28	Eyal Kushilevitz	[7] [15]
29	Eduardo Sany Laber	[72]
30	Gary MacGillivray	[74]
31	Florent R. Madelaine	[40]
32	Heikki Mannila	[80]
33	Nimrod Megiddo	[14] [24]
34	Adam Meyerson	[37]
35	Milena Mihail	[10] [65]
36	Bojan Mohar	[32]
37	Rajeev Motwani	[5] [16] [18] [23] [25] [26] [29] [30] [31] [33] [34] [35] [36] [37] [39] [41] [43] [49] [50] [51] [56] [57] [58] [66] [72] [81] [85] [91] [92]
38	Shubha U. Nabar	[78]
39	Moni Naor	[7] [15]
40	Hamid Nazerzadeh	[73]
41	Noam Nisan	[15]
42	Loana Tito Nogueira	[42] [44]
43	Gustav Nordh	[84]
44	Liadan O'Callaghan	[36] [37] [66] [72]
45	Christopher Olston (Chris Olston)	[25] [34] [36] [66]
46	Rina Panigrahy	[25] [31] [34] [35] [36] [37] [39] [50] [51] [64] [66] [72] [87]
47	Serge A. Plotkin	[14] [24]
48	Fábio Protti	[42] [44]
49	Arash Rafiey	[82] [95]
50	Shekoofeh Nekooei Rizi	[89]
51	Amin Saberi	[65] [73]
52	Yatin P. Saraiya	[11]
53	David G. Schell	[86] [90]
54	Steven S. Seiden	[39]
55	Jiri Sgall	[48]
56	Sunil M. Shende	[21]
57	Juraj Stacho	[86] [90]
58	Rob van Stee	[39]
59	Iain A. Stewart	[40]
60	Carlos S. Subi	[26] [29] [45] [60] [61] [68] [76] [79] [88] [94]
61	Evimaria Terzi	[78] [80]
62	Dilys Thomas	[50] [64] [72] [87] [91] [92]
63	Kim Tucker-Nally	[63]
64	Moshe Y. Vardi	[12] [19] [38]
65	Jennifer Widom	[25] [34]
66	Wing Xie	[67] [69]
67	An Zhu	[31] [39] [43] [50] [51] [57] [58] [64] [87]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page