default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomás Feder
Person information
- affiliation: Stanford University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j69]Jan Bok
, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. Theor. Comput. Sci. 1001: 114580 (2024)- 2023
- [j68]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphism problems for signed trees. Discret. Math. 346(3): 113257 (2023) - [i21]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. CoRR abs/2306.06449 (2023) - 2022
- [j67]Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi:
On Finding Hamiltonian Cycles in Barnette Graphs. Fundam. Informaticae 188(1): 1-14 (2022) - [c31]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List Homomorphisms to Separable Signed Graphs. CALDAM 2022: 22-35 - 2021
- [j66]Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-two colourings of Barnette graphs. Eur. J. Comb. 91: 103210 (2021) - [j65]Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi:
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture. J. Graph Theory 96(2): 269-288 (2021) - 2020
- [j64]Tomás Feder, Pavol Hell:
Complexity of correspondence H-colourings. Discret. Appl. Math. 281: 235-245 (2020) - [c30]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List Homomorphism Problems for Signed Graphs. MFCS 2020: 20:1-20:14 - [i20]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphism problems for signed graphs. CoRR abs/2005.05547 (2020)
2010 – 2019
- 2019
- [i19]Tomás Feder, Pavol Hell, Carlos S. Subi:
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints. CoRR abs/1907.00061 (2019) - 2018
- [c29]Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-Two Coloring of Barnette Graphs. CCCG 2018: 304-310 - [i18]Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-Two Colorings of Barnette Graphs. CoRR abs/1807.01410 (2018) - 2017
- [j63]Tomás Feder, Pavol Hell, César Hernández-Cruz:
Colourings, homomorphisms, and partitions of transitive digraphs. Eur. J. Comb. 60: 55-65 (2017) - [j62]Tomás Feder, Pavol Hell:
Correspondence Homomorphisms to Reflexive Graphs. Electron. Notes Discret. Math. 62: 9-14 (2017) - [i17]Arash Rafiey, Jeff Kinne, Tomás Feder:
Dichotomy for Digraph Homomorphism Problems. CoRR abs/1701.02409 (2017) - [i16]Tomás Feder, Pavol Hell:
Complexity of Correspondence Homomorphisms. CoRR abs/1703.05881 (2017) - 2014
- [j61]Tomás Feder, Pavol Hell, Oren Shklarsky:
Matrix partitions of split graphs. Discret. Appl. Math. 166: 91-96 (2014) - [j60]Tomás Feder, Pavol Hell, Benoît Larose, Mark H. Siggers, Claude Tardif:
Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. SIAM J. Discret. Math. 28(2): 817-834 (2014) - 2013
- [j59]Tomás Feder, Carlos S. Subi:
On hypercube labellings and antipodal monochromatic paths. Discret. Appl. Math. 161(10-11): 1421-1426 (2013) - [j58]Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi:
Obstructions to partitions of chordal graphs. Discret. Math. 313(19): 1861-1871 (2013) - [j57]Tomás Feder, Carlos S. Subi:
Edge-coloring almost bipartite multigraphs. Inf. Process. Lett. 113(18): 685-689 (2013) - [j56]Tomás Feder, Pavol Hell, Benoît Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif:
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. SIAM J. Discret. Math. 27(4): 1940-1963 (2013) - [i15]Tomás Feder, Pavol Hell, Oren Shklarsky:
Matrix Partitions of Split Graphs. CoRR abs/1306.1967 (2013) - 2012
- [j55]Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey:
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discret. Appl. Math. 160(6): 697-707 (2012) - [j54]Manuel Bodirsky, Hubie Chen, Tomás Feder:
On the Complexity of MMSNP. SIAM J. Discret. Math. 26(1): 404-414 (2012) - [j53]Vignesh Ganapathy, Dilys Thomas, Tomás Feder, Hector Garcia-Molina, Rajeev Motwani:
Distributing Data for Secure Database Services. Trans. Data Priv. 5(1): 253-272 (2012) - [i14]Tomás Feder, Carlos S. Subi:
Packing Edge-Disjoint Triangles in Given Graphs. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j52]Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho:
Dichotomy for tree-structured trigraph list homomorphism problems. Discret. Appl. Math. 159(12): 1217-1224 (2011) - [j51]Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi:
Partitioning Chordal Graphs. Electron. Notes Discret. Math. 38: 325-330 (2011) - [j50]Tomás Feder, Carlos S. Subi:
Maximum gap labelings of graphs. Inf. Process. Lett. 111(4): 169-173 (2011) - [c28]Vignesh Ganapathy, Dilys Thomas, Tomás Feder, Hector Garcia-Molina, Rajeev Motwani:
Distributing data for secure database services. PAIS 2011: 8 - 2010
- [j49]Tomás Feder, Rajeev Motwani:
Finding large cycles in Hamiltonian graphs. Discret. Appl. Math. 158(8): 882-893 (2010) - [j48]Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh:
Retractions to Pseudoforests. SIAM J. Discret. Math. 24(1): 101-112 (2010) - [j47]Gagan Aggarwal, Rina Panigrahy, Tomás Feder, Dilys Thomas, Krishnaram Kenthapadi, Samir Khuller, An Zhu:
Achieving anonymity via clustering. ACM Trans. Algorithms 6(3): 49:1-49:19 (2010) - [i13]Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho:
Dichotomy for tree-structured trigraph list homomorphism problems. CoRR abs/1009.0358 (2010)
2000 – 2009
- 2009
- [j46]Tomás Feder, Pavol Hell, Jing Huang:
Extension problems with degree bounds. Discret. Appl. Math. 157(7): 1592-1599 (2009) - [j45]Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey:
Adjusted Interval Digraphs. Electron. Notes Discret. Math. 32: 83-91 (2009) - [j44]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) - [j43]Tomás Feder, Rajeev Motwani:
On the graph turnpike problem. Inf. Process. Lett. 109(14): 774-776 (2009) - [j42]Tomás Feder, Heikki Mannila, Evimaria Terzi:
Approximating the Minimum Chain Completion problem. Inf. Process. Lett. 109(17): 980-985 (2009) - 2008
- [j41]Tomás Feder, Pavol Hell:
On realizations of point determining graphs, and obstructions to full homomorphisms. Discret. Math. 308(9): 1639-1652 (2008) - [j40]Tomás Feder, Pavol Hell, Jing Huang:
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms. SIAM J. Discret. Math. 22(1): 1-14 (2008) - [j39]Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray:
Near-Unanimity Functions and Varieties of Reflexive Graphs. SIAM J. Discret. Math. 22(3): 938-960 (2008) - [i12]Tomás Feder, Shubha U. Nabar, Evimaria Terzi:
Anonymizing Graphs. CoRR abs/0810.5578 (2008) - [i11]Tomás Feder, Carlos S. Subi:
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised). Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j38]Tomás Feder, Pavol Hell, Wing Xie:
Matrix Partitions with Finitely Many Obstructions. Electron. J. Comb. 14(1) (2007) - [j37]Tomás Feder, Pavol Hell, Jing Huang:
List homomorphisms of graphs with bounded degrees. Discret. Math. 307(3-5): 386-392 (2007) - [j36]Tomás Feder, Pavol Hell, Jing Huang:
The structure of bi-arc trees. Discret. Math. 307(3-5): 393-401 (2007) - [j35]Tomás Feder, Pavol Hell, Wing Xie:
Matrix Partitions with Finitely Many Obstructions. Electron. Notes Discret. Math. 28: 371-378 (2007) - [j34]Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy:
Computing shortest paths with uncertainty. J. Algorithms 62(1): 1-18 (2007) - [j33]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 Trans. Algorithms 3(1): 9:1-9:22 (2007) - [c27]Tomás Feder, Hamid Nazerzadeh, Amin Saberi:
Approximating nash equilibria using small-support strategies. EC 2007: 352-354 - [i10]Tomás Feder, Carlos S. Subi:
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j32]Tomás Feder, Pavol Hell, Kim Tucker-Nally:
Digraph matrix partitions and trigraph homomorphisms. Discret. Appl. Math. 154(17): 2458-2469 (2006) - [j31]Tomás Feder, Pavol Hell:
Matrix partitions of perfect graphs. Discret. Math. 306(19-20): 2450-2460 (2006) - [j30]Tomás Feder, Pavol Hell:
Full Constraint Satisfaction Problems. SIAM J. Comput. 36(1): 230-246 (2006) - [j29]Tomás Feder:
A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings. SIAM J. Discret. Math. 20(2): 291-301 (2006) - [j28]Tomás Feder, Daniel K. Ford:
Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection. SIAM J. Discret. Math. 20(2): 372-394 (2006) - [c26]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 - [c25]Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu:
Achieving anonymity via clustering. PODS 2006: 153-162 - [i9]Tomás Feder, Carlos S. Subi:
On Barnette's conjecture. Electron. Colloquium Comput. Complex. TR06 (2006) - [i8]Tomás Feder, Carlos S. Subi:
Partition into k-vertex subgraphs of k-partite graphs. Electron. Colloquium Comput. Complex. TR06 (2006) - [i7]Tomás Feder:
Constraint satisfaction: a personal perspective. Electron. Colloquium Comput. Complex. TR06 (2006) - [i6]Tomás Feder, Gagan Aggarwal, Rajeev Motwani, An Zhu:
Channel assignment in wireless networks and classification of minimum graph homomorphism. Electron. Colloquium Comput. Complex. TR06 (2006) - [i5]Tomás Feder, Phokion G. Kolaitis:
Closures and dichotomies for quantified constraints. Electron. Colloquium Comput. Complex. TR06 (2006) - [i4]Tomás Feder, Rajeev Motwani:
Finding large cycles in Hamiltonian graphs. Electron. Colloquium Comput. Complex. TR06 (2006) - [i3]Tomás Feder, Rajeev Motwani, An Zhu:
k-connected spanning subgraphs of low degree. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j27]Tomás Feder, Carlos S. Subi:
Disks on a Tree: Analysis of a Combinatorial Game. SIAM J. Discret. Math. 19(3): 543-552 (2005) - [j26]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) - [c24]Gagan Aggarwal, Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu:
Algorithms for the Database Layout Problem. ICDT 2005: 189-203 - [c23]Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, An Zhu:
Anonymizing Tables. ICDT 2005: 246-258 - [c22]Tomás Feder, Rajeev Motwani:
Finding large cycles in Hamiltonian graphs. SODA 2005: 166-175 - [c21]Tomás Feder, Pavol Hell, Daniel Král, Jirí Sgall:
Two algorithms for general list matrix partitions. SODA 2005: 870-876 - [i2]Tomás Feder:
Constraint Satisfaction on Finite Groups with Near Subgroups. Electron. Colloquium Comput. Complex. TR05 (2005) - [i1]Tomás Feder, Daniel K. Ford:
Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j25]Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani:
Incremental Clustering and Dynamic Information Retrieval. SIAM J. Comput. 33(6): 1417-1440 (2004) - [j24]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) - [j23]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) - [c20]Gagan Aggarwal, Tomás Feder, Rajeev Motwani, An Zhu:
Algorithms for Multi-product Pricing. ICALP 2004: 72-83 - [c19]Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
List Partitions of Chordal Graphs. LATIN 2004: 100-108 - 2003
- [j22]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) - [j21]Tomás Feder, Pavol Hell, Jing Huang:
Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory 42(1): 61-80 (2003) - [j20]Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom:
Computing the Median with Uncertainty. SIAM J. Comput. 32(2): 538-547 (2003) - [j19]Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani:
List Partitions. SIAM J. Discret. Math. 16(3): 449-478 (2003) - [j18]Tomás Feder, Pavol Hell, Bojan Mohar:
Acyclic Homomorphisms and Circular Colorings of Digraphs. SIAM J. Discret. Math. 17(1): 161-169 (2003) - [c18]Tomás Feder, Moshe Y. Vardi:
Homomorphism Closed vs. Existential Positive. LICS 2003: 311-320 - [c17]Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy:
Representing Graph Metrics with Fewest Edges. STACS 2003: 355-366 - [c16]Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy:
Computing Shortest Paths with Uncertainty. STACS 2003: 367-378 - 2002
- [j17]Tomás Feder, Rajeev Motwani:
Worst-case time bounds for coloring and satisfiability problems. J. Algorithms 45(2): 192-201 (2002) - [j16]Tomás Feder, Rajeev Motwani, Carlos S. Subi:
Approximating the Longest Cycle Problem in Sparse Graphs. SIAM J. Comput. 31(5): 1596-1607 (2002) - [c15]Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu:
Web caching with request reordering. SODA 2002: 104-105 - 2001
- [j15]Tomás Feder:
Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability. SIAM J. Discret. Math. 14(4): 471-480 (2001) - [j14]Tomás Feder:
Fanout limitations on constraint systems. Theor. Comput. Sci. 255(1-2): 281-293 (2001) - 2000
- [j13]Tomás Feder, Nimrod Megiddo, Serge A. Plotkin:
A sublinear parallel algorithm for stable matching. Theor. Comput. Sci. 233(1-2): 297-308 (2000) - [c14]Tomás Feder, Rajeev Motwani, Carlos S. Subi:
Finding long paths and cycles in sparse Hamiltonian graphs. STOC 2000: 524-529 - [c13]Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom:
Computing the median with uncertainty. STOC 2000: 602-607
1990 – 1999
- 1999
- [j12]Tomás Feder, Pavol Hell, Jing Huang:
List Homomorphisms and Circular Arc Graphs. Comb. 19(4): 487-505 (1999) - [c12]Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani:
Complexity of Graph Partition Problems. STOC 1999: 464-472 - 1998
- [j11]Tomás Feder, Sunil M. Shende:
Online Channel Allocation in FDMA Networks with Reuse Constraints. Inf. Process. Lett. 67(6): 295-302 (1998) - [j10]Tomás Feder, Pavol Hell:
List Homomorphisms to Reflexive Graphs. J. Comb. Theory B 72(2): 236-250 (1998) - [j9]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
- [c11]Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani:
Incremental Clustering and Dynamic Information Retrieval. STOC 1997: 626-635 - 1996
- [j8]Rajeev Alur, Tomás Feder, Thomas A. Henzinger:
The Benefits of Relaxing Punctuality. J. ACM 43(1): 116-146 (1996) - 1995
- [j7]Tomás Feder, Rajeev Motwani:
Clique Partitions, Graph Compression and Speeding-Up Algorithms. J. Comput. Syst. Sci. 51(2): 261-272 (1995) - [j6]Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan:
Amortized Communication Complexity. SIAM J. Comput. 24(4): 736-750 (1995) - 1994
- [j5]Tomás Feder:
Network Flow and 2-Satisfiability. Algorithmica 11(3): 291-319 (1994) - [c10]Tomás Feder, Nimrod Megiddo, Serge A. Plotkin:
A Sublinear Parallel Algorithm for Stable Matching. SODA 1994: 632-637 - 1993
- [c9]Tomás Feder, Moshe Y. Vardi:
Monotone monadic SNP and constraint satisfaction. STOC 1993: 612-622 - 1992
- [j4]Tomás Feder:
A New Fixed Point Approach for Stable Networks and Stable Marriages. J. Comput. Syst. Sci. 45(2): 233-284 (1992) - [j3]Tomás Feder:
Product graph representations. J. Graph Theory 16(5): 467-488 (1992) - [j2]Danny Dolev, Tomás Feder:
Determinism vs. Nondeterminism in Multiparty Communication Complexity. SIAM J. Comput. 21(5): 889-895 (1992) - [c8]Tomás Feder, Yatin P. Saraiya:
Decidability and Undecidability of Equivalence for Linear Datalog with Applications to Normal-Form Optimizations. ICDT 1992: 297-311 - [c7]Tomás Feder, Milena Mihail:
Balanced Matroids. STOC 1992: 26-38 - 1991
- [b1]Tomás Feder:
Stable networks and product graphs. Stanford University, USA, 1991 - [c6]Tomás Feder, Eyal Kushilevitz, Moni Naor:
Amortized Communication Complexity (Preliminary Version). FOCS 1991: 239-248 - [c5]Rajeev Alur, Tomás Feder, Thomas A. Henzinger:
The Benefits of Relaxing Punctuality. PODC 1991: 139-152 - [c4]Tomás Feder, Rajeev Motwani:
Clique Partitions, Graph Compression, and Speeding-Up Algorithms. STOC 1991: 123-133
1980 – 1989
- 1989
- [j1]Tomás Feder:
Reliable computation by networks in the presence of noise. IEEE Trans. Inf. Theory 35(3): 569-571 (1989) - [c3]Danny Dolev, Tomás Feder:
Multiparty Communication Complexity. FOCS 1989: 428-433 - [c2]Tomás Feder:
A New Fixed Point Approach for Stable Networks and Stable Marriages. STOC 1989: 513-522 - 1988
- [c1]