Tomás Feder

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 17

Top Venues

CoRR

Discret. Appl. Math.

Eur. J. Comb.

Fundam. Informaticae

Publications

Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List homomorphisms to separable signed graphs. Theor. Comput. Sci. 1001 (2024)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List homomorphisms to separable signed graphs. CoRR (2023)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List homomorphism problems for signed trees. Discret. Math. 346 (3) (2023)
Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi
On Finding Hamiltonian Cycles in Barnette Graphs. Fundam. Informaticae 188 (1) (2022)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List Homomorphisms to Separable Signed Graphs. CALDAM (2022)
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) (2021)
Tomás Feder, Pavol Hell, Carlos S. Subi
Distance-two colourings of Barnette graphs. Eur. J. Comb. 91 (2021)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List homomorphism problems for signed graphs. CoRR (2020)
Tomás Feder, Pavol Hell
Complexity of correspondence H-colourings. Discret. Appl. Math. 281 (2020)
Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
List Homomorphism Problems for Signed Graphs. MFCS (2020)
Tomás Feder, Pavol Hell, Carlos S. Subi
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints. CoRR (2019)
Tomás Feder, Pavol Hell, Carlos S. Subi
Distance-Two Coloring of Barnette Graphs. CCCG (2018)
Tomás Feder, Pavol Hell, Carlos S. Subi
Distance-Two Colorings of Barnette Graphs. CoRR (2018)
Tomás Feder, Pavol Hell
Correspondence Homomorphisms to Reflexive Graphs. Electron. Notes Discret. Math. 62 (2017)
Tomás Feder, Pavol Hell
Complexity of Correspondence Homomorphisms. CoRR (2017)
Tomás Feder, Pavol Hell, César Hernández-Cruz
Colourings, homomorphisms, and partitions of transitive digraphs. Eur. J. Comb. 60 (2017)
Arash Rafiey, Jeff Kinne, Tomás Feder
Dichotomy for Digraph Homomorphism Problems. CoRR (2017)
Tomás Feder, Pavol Hell, Oren Shklarsky
Matrix partitions of split graphs. Discret. Appl. Math. 166 (2014)
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) (2014)
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) (2013)
Tomás Feder, Carlos S. Subi
On hypercube labellings and antipodal monochromatic paths. Discret. Appl. Math. 161 (10-11) (2013)
Tomás Feder, Pavol Hell, Oren Shklarsky
Matrix Partitions of Split Graphs. CoRR (2013)
Tomás Feder, Carlos S. Subi
Edge-coloring almost bipartite multigraphs. Inf. Process. Lett. 113 (18) (2013)
Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi
Obstructions to partitions of chordal graphs. Discret. Math. 313 (19) (2013)
Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discret. Appl. Math. 160 (6) (2012)
Manuel Bodirsky, Hubie Chen, Tomás Feder
On the Complexity of MMSNP. SIAM J. Discret. Math. 26 (1) (2012)
Vignesh Ganapathy, Dilys Thomas, Tomás Feder, Hector Garcia-Molina, Rajeev Motwani
Distributing Data for Secure Database Services. Trans. Data Priv. 5 (1) (2012)
Tomás Feder, Carlos S. Subi
Packing Edge-Disjoint Triangles in Given Graphs. Electron. Colloquium Comput. Complex. 19 (2012)
Vignesh Ganapathy, Dilys Thomas, Tomás Feder, Hector Garcia-Molina, Rajeev Motwani
Distributing data for secure database services. PAIS (2011)
Tomás Feder, Carlos S. Subi
Maximum gap labelings of graphs. Inf. Process. Lett. 111 (4) (2011)
Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho
Dichotomy for tree-structured trigraph list homomorphism problems. Discret. Appl. Math. 159 (12) (2011)
Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi
Partitioning Chordal Graphs. Electron. Notes Discret. Math. 38 (2011)
Tomás Feder, Rajeev Motwani
Finding large cycles in Hamiltonian graphs. Discret. Appl. Math. 158 (8) (2010)
Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh
Retractions to Pseudoforests. SIAM J. Discret. Math. 24 (1) (2010)
Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho
Dichotomy for tree-structured trigraph list homomorphism problems CoRR (2010)
Gagan Aggarwal, Rina Panigrahy, Tomás Feder, Dilys Thomas, Krishnaram Kenthapadi, Samir Khuller, An Zhu
Achieving anonymity via clustering. ACM Trans. Algorithms 6 (3) (2010)
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) (2009)
Tomás Feder, Heikki Mannila, Evimaria Terzi
Approximating the Minimum Chain Completion problem. Inf. Process. Lett. 109 (17) (2009)
Tomás Feder, Rajeev Motwani
On the graph turnpike problem. Inf. Process. Lett. 109 (14) (2009)
Tomás Feder, Pavol Hell, Jing Huang
Extension problems with degree bounds. Discret. Appl. Math. 157 (7) (2009)
Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey
Adjusted Interval Digraphs. Electron. Notes Discret. Math. 32 (2009)
Tomás Feder, Pavol Hell, Jing Huang
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms. SIAM J. Discret. Math. 22 (1) (2008)
Tomás Feder, Shubha U. Nabar, Evimaria Terzi
Anonymizing Graphs CoRR (2008)
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) (2008)
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. 15 (087) (2008)
Tomás Feder, Pavol Hell
On realizations of point determining graphs, and obstructions to full homomorphisms. Discret. Math. 308 (9) (2008)
Tomás Feder, Pavol Hell, Wing Xie
Matrix Partitions with Finitely Many Obstructions. Electron. Notes Discret. Math. 28 (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 Trans. Algorithms 3 (1) (2007)
Tomás Feder, Carlos S. Subi
Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations. Electron. Colloquium Comput. Complex. 14 (063) (2007)
Tomás Feder, Pavol Hell, Wing Xie
Matrix Partitions with Finitely Many Obstructions. Electron. J. Comb. 14 (1) (2007)
Tomás Feder, Pavol Hell, Jing Huang
List homomorphisms of graphs with bounded degrees. Discret. Math. 307 (3-5) (2007)
Tomás Feder, Hamid Nazerzadeh, Amin Saberi
Approximating nash equilibria using small-support strategies. EC (2007)
Tomás Feder, Pavol Hell, Jing Huang
The structure of bi-arc trees. Discret. Math. 307 (3-5) (2007)
Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy
Computing shortest paths with uncertainty. J. Algorithms 62 (1) (2007)
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)
Tomás Feder, Phokion G. Kolaitis
Closures and dichotomies for quantified constraints. Electron. Colloquium Comput. Complex. 13 (160) (2006)
Tomás Feder, Pavol Hell, Kim Tucker-Nally
Digraph matrix partitions and trigraph homomorphisms. Discret. Appl. Math. 154 (17) (2006)
Tomás Feder, Carlos S. Subi
Partition into k-vertex subgraphs of k-partite graphs Electron. Colloquium Comput. Complex. (016) (2006)
Tomás Feder, Pavol Hell
Full Constraint Satisfaction Problems. SIAM J. Comput. 36 (1) (2006)
Tomás Feder, Rajeev Motwani, An Zhu
k-connected spanning subgraphs of low degree. Electron. Colloquium Comput. Complex. 13 (041) (2006)
Tomás Feder, Pavol Hell
Matrix partitions of perfect graphs. Discret. Math. 306 (19-20) (2006)
Tomás Feder, Daniel K. Ford
Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection. SIAM J. Discret. Math. 20 (2) (2006)
Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu
Achieving anonymity via clustering. PODS (2006)
Tomás Feder
A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings. SIAM J. Discret. Math. 20 (2) (2006)
Tomás Feder, Carlos S. Subi
On Barnette's conjecture Electron. Colloquium Comput. Complex. (015) (2006)
Tomás Feder
Constraint satisfaction: a personal perspective. Electron. Colloquium Comput. Complex. 13 (021) (2006)
Tomás Feder, Rajeev Motwani
Finding large cycles in Hamiltonian graphs. Electron. Colloquium Comput. Complex. 13 (156) (2006)
Tomás Feder, Gagan Aggarwal, Rajeev Motwani, An Zhu
Channel assignment in wireless networks and classification of minimum graph homomorphism. Electron. Colloquium Comput. Complex. 13 (040) (2006)
Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, An Zhu
Anonymizing Tables. ICDT (2005)
Tomás Feder, Daniel K. Ford
Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection Electron. Colloquium Comput. Complex. (016) (2005)
Gagan Aggarwal, Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu
Algorithms for the Database Layout Problem. ICDT (2005)
Tomás Feder, Pavol Hell, Daniel Král, Jirí Sgall
Two algorithms for general list matrix partitions. SODA (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) (2005)
Tomás Feder, Carlos S. Subi
Disks on a Tree: Analysis of a Combinatorial Game. SIAM J. Discret. Math. 19 (3) (2005)
Tomás Feder
Constraint Satisfaction on Finite Groups with Near Subgroups Electron. Colloquium Comput. Complex. (005) (2005)
Tomás Feder, Rajeev Motwani
Finding large cycles in Hamiltonian graphs. SODA (2005)
Gagan Aggarwal, Tomás Feder, Rajeev Motwani, An Zhu
Algorithms for Multi-product Pricing. ICALP (2004)
Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani
Incremental Clustering and Dynamic Information Retrieval. SIAM J. Comput. 33 (6) (2004)
Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
List Partitions of Chordal Graphs. LATIN (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) (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) (2004)
Tomás Feder, Moshe Y. Vardi
Homomorphism Closed vs. Existential Positive. LICS (2003)
Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy
Representing Graph Metrics with Fewest Edges. STACS (2003)
Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom
Computing the Median with Uncertainty. SIAM J. Comput. 32 (2) (2003)
Tomás Feder, Pavol Hell, Bojan Mohar
Acyclic Homomorphisms and Circular Colorings of Digraphs. SIAM J. Discret. Math. 17 (1) (2003)
Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani
List Partitions. SIAM J. Discret. Math. 16 (3) (2003)
Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy
Computing Shortest Paths with Uncertainty. STACS (2003)
Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani, Rina Panigrahy
A combinatorial algorithm for MAX CSP. Inf. Process. Lett. 85 (6) (2003)
Tomás Feder, Pavol Hell, Jing Huang
Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory 42 (1) (2003)
Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu
Web caching with request reordering. SODA (2002)
Tomás Feder, Rajeev Motwani
Worst-case time bounds for coloring and satisfiability problems. J. Algorithms 45 (2) (2002)
Tomás Feder, Rajeev Motwani, Carlos S. Subi
Approximating the Longest Cycle Problem in Sparse Graphs. SIAM J. Comput. 31 (5) (2002)
Tomás Feder
Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability. SIAM J. Discret. Math. 14 (4) (2001)
Tomás Feder
Fanout limitations on constraint systems. Theor. Comput. Sci. 255 (1-2) (2001)
Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom
Computing the median with uncertainty. STOC (2000)
Tomás Feder, Rajeev Motwani, Carlos S. Subi
Finding long paths and cycles in sparse Hamiltonian graphs. STOC (2000)
Tomás Feder, Nimrod Megiddo, Serge A. Plotkin
A sublinear parallel algorithm for stable matching. Theor. Comput. Sci. 233 (1-2) (2000)
Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani
Complexity of Graph Partition Problems. STOC (1999)
Tomás Feder, Pavol Hell, Jing Huang
List Homomorphisms and Circular Arc Graphs. Comb. 19 (4) (1999)
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) (1998)

Tomás Feder.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tomás Feder