Tomás Feder

Tomás Feder, Carlos S. Subi: On hypercube labellings and antipodal monochromatic paths. Discrete Applied Mathematics 161(10-11): 1421-1426 (2013)

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)

Manuel Bodirsky, Hubie Chen, Tomás Feder: On the Complexity of MMSNP. SIAM J. Discrete Math. 26(1): 404-414 (2012)

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)

Tomás Feder, Carlos S. Subi: Packing Edge-Disjoint Triangles in Given Graphs. Electronic Colloquium on Computational Complexity (ECCC) 19: 13 (2012)

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)

Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi: Partitioning Chordal Graphs. Electronic Notes in Discrete Mathematics 38: 325-330 (2011)

Tomás Feder, Carlos S. Subi: Maximum gap labelings of graphs. Inf. Process. Lett. 111(4): 169-173 (2011)

Vignesh Ganapathy, Dilys Thomas, Tomás Feder, Hector Garcia-Molina, Rajeev Motwani: Distributing data for secure database services. PAIS 2011: 8

Tomás Feder, Rajeev Motwani: Finding large cycles in Hamiltonian graphs. Discrete Applied Mathematics 158(8): 882-893 (2010)

Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh: Retractions to Pseudoforests. SIAM J. Discrete Math. 24(1): 101-112 (2010)

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)

Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho: Dichotomy for tree-structured trigraph list homomorphism problems. CoRR abs/1009.0358 (2010)

Tomás Feder, Pavol Hell, Jing Huang: Extension problems with degree bounds. Discrete Applied Mathematics 157(7): 1592-1599 (2009)

Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey: Adjusted Interval Digraphs. Electronic Notes in Discrete Mathematics 32: 83-91 (2009)

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)

Tomás Feder, Rajeev Motwani: On the graph turnpike problem. Inf. Process. Lett. 109(14): 774-776 (2009)

Tomás Feder, Heikki Mannila, Evimaria Terzi: Approximating the Minimum Chain Completion problem. Inf. Process. Lett. 109(17): 980-985 (2009)

Tomás Feder, Pavol Hell: On realizations of point determining graphs, and obstructions to full homomorphisms. Discrete Mathematics 308(9): 1639-1652 (2008)

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)

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)

Tomás Feder, Shubha U. Nabar, Evimaria Terzi: Anonymizing Graphs. CoRR abs/0810.5578 (2008)

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)

Tomás Feder, Pavol Hell, Wing Xie: Matrix Partitions with Finitely Many Obstructions. Electr. J. Comb. 14(1) (2007)

Tomás Feder, Pavol Hell, Jing Huang: List homomorphisms of graphs with bounded degrees. Discrete Mathematics 307(3-5): 386-392 (2007)

Tomás Feder, Pavol Hell, Jing Huang: The structure of bi-arc trees. Discrete Mathematics 307(3-5): 393-401 (2007)

Tomás Feder, Pavol Hell, Wing Xie: Matrix Partitions with Finitely Many Obstructions. Electronic Notes in Discrete Mathematics 28: 371-378 (2007)

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

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)

Tomás Feder, Hamid Nazerzadeh, Amin Saberi: Approximating nash equilibria using small-support strategies. ACM Conference on Electronic Commerce 2007: 352-354

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)

Tomás Feder, Pavol Hell, Kim Tucker-Nally: Digraph matrix partitions and trigraph homomorphisms. Discrete Applied Mathematics 154(17): 2458-2469 (2006)

Tomás Feder, Pavol Hell: Matrix partitions of perfect graphs. Discrete Mathematics 306(19-20): 2450-2460 (2006)

Tomás Feder, Pavol Hell: Full Constraint Satisfaction Problems. SIAM J. Comput. 36(1): 230-246 (2006)

Tomás Feder: A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings. SIAM J. Discrete Math. 20(2): 291-301 (2006)

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)

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

Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu: Achieving anonymity via clustering. PODS 2006: 153-162

Tomás Feder, Carlos S. Subi: On Barnette's conjecture. Electronic Colloquium on Computational Complexity (ECCC)(015) (2006)

Tomás Feder, Carlos S. Subi: Partition into k-vertex subgraphs of k-partite graphs. Electronic Colloquium on Computational Complexity (ECCC)(016) (2006)

Tomás Feder: Constraint satisfaction: a personal perspective. Electronic Colloquium on Computational Complexity (ECCC) 13(021) (2006)

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)

Tomás Feder, Rajeev Motwani, An Zhu: k-connected spanning subgraphs of low degree. Electronic Colloquium on Computational Complexity (ECCC) 13(041) (2006)

Tomás Feder, Rajeev Motwani: Finding large cycles in Hamiltonian graphs. Electronic Colloquium on Computational Complexity (ECCC) 13(156) (2006)

Tomás Feder, Phokion G. Kolaitis: Closures and dichotomies for quantified constraints. Electronic Colloquium on Computational Complexity (ECCC) 13(160) (2006)

Tomás Feder, Carlos S. Subi: Disks on a Tree: Analysis of a Combinatorial Game. SIAM J. Discrete Math. 19(3): 543-552 (2005)

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)

Gagan Aggarwal, Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu: Algorithms for the Database Layout Problem. ICDT 2005: 189-203

Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, An Zhu: Anonymizing Tables. ICDT 2005: 246-258

Tomás Feder, Rajeev Motwani: Finding large cycles in Hamiltonian graphs. SODA 2005: 166-175

Tomás Feder, Pavol Hell, Daniel Král, Jiri Sgall: Two algorithms for general list matrix partitions. SODA 2005: 870-876

Tomás Feder: Constraint Satisfaction on Finite Groups with Near Subgroups. Electronic Colloquium on Computational Complexity (ECCC)(005) (2005)

Tomás Feder, Daniel K. Ford: Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection. Electronic Colloquium on Computational Complexity (ECCC)(016) (2005)

Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani: Incremental Clustering and Dynamic Information Retrieval. SIAM J. Comput. 33(6): 1417-1440 (2004)

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)

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)

Gagan Aggarwal, Tomás Feder, Rajeev Motwani, An Zhu: Algorithms for Multi-product Pricing. ICALP 2004: 72-83

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

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)

Tomás Feder, Pavol Hell, Jing Huang: Bi-arc graphs and the complexity of list homomorphisms. Journal of Graph Theory 42(1): 61-80 (2003)

Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom: Computing the Median with Uncertainty. SIAM J. Comput. 32(2): 538-547 (2003)

Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani: List Partitions. SIAM J. Discrete Math. 16(3): 449-478 (2003)

Tomás Feder, Pavol Hell, Bojan Mohar: Acyclic Homomorphisms and Circular Colorings of Digraphs. SIAM J. Discrete Math. 17(1): 161-169 (2003)

Tomás Feder, Moshe Y. Vardi: Homomorphism Closed vs. Existential Positive. LICS 2003: 311-320

Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy: Representing Graph Metrics with Fewest Edges. STACS 2003: 355-366

Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy: Computing Shortest Paths with Uncertainty. STACS 2003: 367-378

Tomás Feder, Rajeev Motwani: Worst-case time bounds for coloring and satisfiability problems. J. Algorithms 45(2): 192-201 (2002)

Tomás Feder, Rajeev Motwani, Carlos S. Subi: Approximating the Longest Cycle Problem in Sparse Graphs. SIAM J. Comput. 31(5): 1596-1607 (2002)

Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu: Web caching with request reordering. SODA 2002: 104-105

Tomás Feder: Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability. SIAM J. Discrete Math. 14(4): 471-480 (2001)

Tomás Feder: Fanout limitations on constraint systems. Theor. Comput. Sci. 255(1-2): 281-293 (2001)

Tomás Feder, Nimrod Megiddo, Serge A. Plotkin: A sublinear parallel algorithm for stable matching. Theor. Comput. Sci. 233(1-2): 297-308 (2000)

Tomás Feder, Rajeev Motwani, Carlos S. Subi: Finding long paths and cycles in sparse Hamiltonian graphs. STOC 2000: 524-529

Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom: Computing the median with uncertainty. STOC 2000: 602-607

Tomás Feder, Pavol Hell, Jing Huang: List Homomorphisms and Circular Arc Graphs. Combinatorica 19(4): 487-505 (1999)

Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani: Complexity of Graph Partition Problems. STOC 1999: 464-472

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

Tomás Feder, Pavol Hell: List Homomorphisms to Reflexive Graphs. J. Comb. Theory, Ser. B 72(2): 236-250 (1998)

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)

Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani: Incremental Clustering and Dynamic Information Retrieval. STOC 1997: 626-635

Rajeev Alur, Tomás Feder, Thomas A. Henzinger: The Benefits of Relaxing Punctuality. J. ACM 43(1): 116-146 (1996)

Tomás Feder, Rajeev Motwani: Clique Partitions, Graph Compression and Speeding-Up Algorithms. J. Comput. Syst. Sci. 51(2): 261-272 (1995)

Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan: Amortized Communication Complexity. SIAM J. Comput. 24(4): 736-750 (1995)

Tomás Feder: Network Flow and 2-Satisfiability. Algorithmica 11(3): 291-319 (1994)

Tomás Feder, Nimrod Megiddo, Serge A. Plotkin: A Sublinear Parallel Algorithm for Stable Matching. SODA 1994: 632-637

Tomás Feder, Moshe Y. Vardi: Monotone monadic SNP and constraint satisfaction. STOC 1993: 612-622

Tomás Feder: A New Fixed Point Approach for Stable Networks and Stable Marriages. J. Comput. Syst. Sci. 45(2): 233-284 (1992)

Tomás Feder: Product graph representations. Journal of Graph Theory 16(5): 467-488 (1992)

Danny Dolev, Tomás Feder: Determinism vs. Nondeterminism in Multiparty Communication Complexity. SIAM J. Comput. 21(5): 889-895 (1992)

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

Tomás Feder, Milena Mihail: Balanced Matroids. STOC 1992: 26-38

Tomás Feder, Eyal Kushilevitz, Moni Naor: Amortized Communication Complexity (Preliminary Version). FOCS 1991: 239-248

Rajeev Alur, Tomás Feder, Thomas A. Henzinger: The Benefits of Relaxing Punctuality. PODC 1991: 139-152

Tomás Feder, Rajeev Motwani: Clique Partitions, Graph Compression, and Speeding-Up Algorithms. STOC 1991: 123-133

Tomás Feder: Reliable computation by networks in the presence of noise. IEEE Transactions on Information Theory 35(3): 569-571 (1989)

Danny Dolev, Tomás Feder: Multiparty Communication Complexity. FOCS 1989: 428-433

Tomás Feder: A New Fixed Point Approach for Stable Networks and Stable Marriages. STOC 1989: 513-522

Tomás Feder, Daniel H. Greene: Optimal Algorithms for Approximate Clustering. STOC 1988: 434-444