Tomás Feder - RankMe

122 papers A* 21A 5B 2Journal 90Unranked 3

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	List homomorphisms to separable signed graphs. Theor. Comput. Sci. Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
2023	J	`jnl`	List homomorphism problems for signed trees. Discret. Math. Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
2023	J	`jnl`	List homomorphisms to separable signed graphs. CoRR Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
2022	—	`conf`	List Homomorphisms to Separable Signed Graphs. CALDAM Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
2022	J	`jnl`	On Finding Hamiltonian Cycles in Barnette Graphs. Fundam. Informaticae Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi
2021	J	`jnl`	Distance-two colourings of Barnette graphs. Eur. J. Comb. Tomás Feder, Pavol Hell, Carlos S. Subi
2021	J	`jnl`	Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture. J. Graph Theory Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi
2020	J	`jnl`	Complexity of correspondence H-colourings. Discret. Appl. Math. Tomás Feder, Pavol Hell
2020	B	`conf`	List Homomorphism Problems for Signed Graphs. MFCS Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
2020	J	`jnl`	List homomorphism problems for signed graphs. CoRR Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková
2019	J	`jnl`	Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints. CoRR Tomás Feder, Pavol Hell, Carlos S. Subi
2018	—	`conf`	Distance-Two Coloring of Barnette Graphs. CCCG Tomás Feder, Pavol Hell, Carlos S. Subi
2018	J	`jnl`	Distance-Two Colorings of Barnette Graphs. CoRR Tomás Feder, Pavol Hell, Carlos S. Subi
2017	J	`jnl`	Colourings, homomorphisms, and partitions of transitive digraphs. Eur. J. Comb. Tomás Feder, Pavol Hell, César Hernández-Cruz
2017	J	`jnl`	Complexity of Correspondence Homomorphisms. CoRR Tomás Feder, Pavol Hell
2017	J	`jnl`	Correspondence Homomorphisms to Reflexive Graphs. Electron. Notes Discret. Math. Tomás Feder, Pavol Hell
2017	J	`jnl`	Dichotomy for Digraph Homomorphism Problems. CoRR Arash Rafiey, Jeff Kinne, Tomás Feder
2014	J	`jnl`	Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Benoît Larose, Mark H. Siggers, Claude Tardif
2014	J	`jnl`	Matrix partitions of split graphs. Discret. Appl. Math. Tomás Feder, Pavol Hell, Oren Shklarsky
2013	J	`jnl`	Edge-coloring almost bipartite multigraphs. Inf. Process. Lett. Tomás Feder, Carlos S. Subi
2013	J	`jnl`	Graphs Admitting k-NU Operations. Part 1: The Reflexive Case. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Benoît Larose, Cynthia Loten, Mark H. Siggers, Claude Tardif
2013	J	`jnl`	Matrix Partitions of Split Graphs. CoRR Tomás Feder, Pavol Hell, Oren Shklarsky
2013	J	`jnl`	Obstructions to partitions of chordal graphs. Discret. Math. Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi
2013	J	`jnl`	On hypercube labellings and antipodal monochromatic paths. Discret. Appl. Math. Tomás Feder, Carlos S. Subi
2012	J	`jnl`	Distributing Data for Secure Database Services. Trans. Data Priv. Vignesh Ganapathy, Dilys Thomas, Tomás Feder, Hector Garcia-Molina, Rajeev Motwani
2012	J	`jnl`	Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discret. Appl. Math. Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey
2012	J	`jnl`	On the Complexity of MMSNP. SIAM J. Discret. Math. Manuel Bodirsky, Hubie Chen, Tomás Feder
2012	J	`jnl`	Packing Edge-Disjoint Triangles in Given Graphs. Electron. Colloquium Comput. Complex. Tomás Feder, Carlos S. Subi
2011	J	`jnl`	Dichotomy for tree-structured trigraph list homomorphism problems. Discret. Appl. Math. Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho
2011	—	`conf`	Distributing data for secure database services. PAIS Vignesh Ganapathy, Dilys Thomas, Tomás Feder, Hector Garcia-Molina, Rajeev Motwani
2011	J	`jnl`	Maximum gap labelings of graphs. Inf. Process. Lett. Tomás Feder, Carlos S. Subi
2011	J	`jnl`	Partitioning Chordal Graphs. Electron. Notes Discret. Math. Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi
2010	J	`jnl`	Achieving anonymity via clustering. ACM Trans. Algorithms Gagan Aggarwal, Rina Panigrahy, Tomás Feder, Dilys Thomas, Krishnaram Kenthapadi, Samir Khuller, An Zhu
2010	J	`jnl`	Dichotomy for tree-structured trigraph list homomorphism problems CoRR Tomás Feder, Pavol Hell, David G. Schell, Juraj Stacho
2010	J	`jnl`	Finding large cycles in Hamiltonian graphs. Discret. Appl. Math. Tomás Feder, Rajeev Motwani
2010	J	`jnl`	Retractions to Pseudoforests. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Peter Jonsson, Andrei A. Krokhin, Gustav Nordh
2009	J	`jnl`	Adjusted Interval Digraphs. Electron. Notes Discret. Math. Tomás Feder, Pavol Hell, Jing Huang, Arash Rafiey
2009	J	`jnl`	Approximating the Minimum Chain Completion problem. Inf. Process. Lett. Tomás Feder, Heikki Mannila, Evimaria Terzi
2009	J	`jnl`	Extension problems with degree bounds. Discret. Appl. Math. Tomás Feder, Pavol Hell, Jing Huang
2009	J	`jnl`	Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations. Inf. Process. Lett. Tomás Feder, Carlos S. Subi
2009	J	`jnl`	On the graph turnpike problem. Inf. Process. Lett. Tomás Feder, Rajeev Motwani
2008	J	`jnl`	Anonymizing Graphs CoRR Tomás Feder, Shubha U. Nabar, Evimaria Terzi
2008	J	`jnl`	Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Jing Huang
2008	J	`jnl`	Near-Unanimity Functions and Varieties of Reflexive Graphs. SIAM J. Discret. Math. Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray
2008	J	`jnl`	Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised). Electron. Colloquium Comput. Complex. Tomás Feder, Carlos S. Subi
2008	J	`jnl`	On realizations of point determining graphs, and obstructions to full homomorphisms. Discret. Math. Tomás Feder, Pavol Hell
2007	A*	`conf`	Approximating nash equilibria using small-support strategies. EC Tomás Feder, Hamid Nazerzadeh, Amin Saberi
2007	J	`jnl`	Computing shortest paths with uncertainty. J. Algorithms Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy
2007	J	`jnl`	List homomorphisms of graphs with bounded degrees. Discret. Math. Tomás Feder, Pavol Hell, Jing Huang
2007	J	`jnl`	Matrix Partitions with Finitely Many Obstructions. Electron. J. Comb. Tomás Feder, Pavol Hell, Wing Xie
2007	J	`jnl`	Matrix Partitions with Finitely Many Obstructions. Electron. Notes Discret. Math. Tomás Feder, Pavol Hell, Wing Xie
2007	J	`jnl`	Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations. Electron. Colloquium Comput. Complex. Tomás Feder, Carlos S. Subi
2007	J	`jnl`	Querying priced information in databases: The conjunctive case. ACM Trans. Algorithms Renato Carmo, Tomás Feder, Yoshiharu Kohayakawa, Eduardo Sany Laber, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy, Dilys Thomas
2007	J	`jnl`	The structure of bi-arc trees. Discret. Math. Tomás Feder, Pavol Hell, Jing Huang
2006	J	`jnl`	A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings. SIAM J. Discret. Math. Tomás Feder
2006	A*	`conf`	A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks. FOCS Tomás Feder, Adam Guetz, Milena Mihail, Amin Saberi
2006	A*	`conf`	Achieving anonymity via clustering. PODS Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu
2006	J	`jnl`	Channel assignment in wireless networks and classification of minimum graph homomorphism. Electron. Colloquium Comput. Complex. Tomás Feder, Gagan Aggarwal, Rajeev Motwani, An Zhu
2006	J	`jnl`	Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection. SIAM J. Discret. Math. Tomás Feder, Daniel K. Ford
2006	J	`jnl`	Closures and dichotomies for quantified constraints. Electron. Colloquium Comput. Complex. Tomás Feder, Phokion G. Kolaitis
2006	J	`jnl`	Constraint satisfaction: a personal perspective. Electron. Colloquium Comput. Complex. Tomás Feder
2006	J	`jnl`	Digraph matrix partitions and trigraph homomorphisms. Discret. Appl. Math. Tomás Feder, Pavol Hell, Kim Tucker-Nally
2006	J	`jnl`	Finding large cycles in Hamiltonian graphs. Electron. Colloquium Comput. Complex. Tomás Feder, Rajeev Motwani
2006	J	`jnl`	Full Constraint Satisfaction Problems. SIAM J. Comput. Tomás Feder, Pavol Hell
2006	J	`jnl`	Matrix partitions of perfect graphs. Discret. Math. Tomás Feder, Pavol Hell
2006	J	`jnl`	On Barnette's conjecture Electron. Colloquium Comput. Complex. Tomás Feder, Carlos S. Subi
2006	J	`jnl`	Partition into k-vertex subgraphs of k-partite graphs Electron. Colloquium Comput. Complex. Tomás Feder, Carlos S. Subi
2006	J	`jnl`	k-connected spanning subgraphs of low degree. Electron. Colloquium Comput. Complex. Tomás Feder, Rajeev Motwani, An Zhu
2005	A	`conf`	Algorithms for the Database Layout Problem. ICDT Gagan Aggarwal, Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu
2005	A	`conf`	Anonymizing Tables. ICDT Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Rajeev Motwani, Rina Panigrahy, Dilys Thomas, An Zhu
2005	J	`jnl`	Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection Electron. Colloquium Comput. Complex. Tomás Feder, Daniel K. Ford
2005	J	`jnl`	Constraint Satisfaction on Finite Groups with Near Subgroups Electron. Colloquium Comput. Complex. Tomás Feder
2005	J	`jnl`	Disks on a Tree: Analysis of a Combinatorial Game. SIAM J. Discret. Math. Tomás Feder, Carlos S. Subi
2005	A*	`conf`	Finding large cycles in Hamiltonian graphs. SODA Tomás Feder, Rajeev Motwani
2005	J	`jnl`	List matrix partitions of chordal graphs. Theor. Comput. Sci. Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2005	A*	`conf`	Two algorithms for general list matrix partitions. SODA Tomás Feder, Pavol Hell, Daniel Král, Jirí Sgall
2004	A*	`conf`	Algorithms for Multi-product Pricing. ICALP Gagan Aggarwal, Tomás Feder, Rajeev Motwani, An Zhu
2004	J	`jnl`	Combining request scheduling with web caching. Theor. Comput. Sci. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Steven S. Seiden, Rob van Stee, An Zhu
2004	J	`jnl`	Dichotomies for classes of homomorphism problems involving unary functions. Theor. Comput. Sci. Tomás Feder, Florent R. Madelaine, Iain A. Stewart
2004	J	`jnl`	Incremental Clustering and Dynamic Information Retrieval. SIAM J. Comput. Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani
2004	B	`conf`	List Partitions of Chordal Graphs. LATIN Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2003	J	`jnl`	A combinatorial algorithm for MAX CSP. Inf. Process. Lett. Mayur Datar, Tomás Feder, Aristides Gionis, Rajeev Motwani, Rina Panigrahy
2003	J	`jnl`	Acyclic Homomorphisms and Circular Colorings of Digraphs. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Bojan Mohar
2003	J	`jnl`	Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory Tomás Feder, Pavol Hell, Jing Huang
2003	A	`conf`	Computing Shortest Paths with Uncertainty. STACS Tomás Feder, Rajeev Motwani, Liadan O'Callaghan, Chris Olston, Rina Panigrahy
2003	J	`jnl`	Computing the Median with Uncertainty. SIAM J. Comput. Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom
2003	A*	`conf`	Homomorphism Closed vs. Existential Positive. LICS Tomás Feder, Moshe Y. Vardi
2003	J	`jnl`	List Partitions. SIAM J. Discret. Math. Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani
2003	A	`conf`	Representing Graph Metrics with Fewest Edges. STACS Tomás Feder, Adam Meyerson, Rajeev Motwani, Liadan O'Callaghan, Rina Panigrahy
2002	J	`jnl`	Approximating the Longest Cycle Problem in Sparse Graphs. SIAM J. Comput. Tomás Feder, Rajeev Motwani, Carlos S. Subi
2002	A*	`conf`	Web caching with request reordering. SODA Tomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu
2002	J	`jnl`	Worst-case time bounds for coloring and satisfiability problems. J. Algorithms Tomás Feder, Rajeev Motwani
2001	J	`jnl`	Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability. SIAM J. Discret. Math. Tomás Feder
2001	J	`jnl`	Fanout limitations on constraint systems. Theor. Comput. Sci. Tomás Feder
2000	J	`jnl`	A sublinear parallel algorithm for stable matching. Theor. Comput. Sci. Tomás Feder, Nimrod Megiddo, Serge A. Plotkin
2000	A*	`conf`	Computing the median with uncertainty. STOC Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom
2000	A*	`conf`	Finding long paths and cycles in sparse Hamiltonian graphs. STOC Tomás Feder, Rajeev Motwani, Carlos S. Subi
1999	A*	`conf`	Complexity of Graph Partition Problems. STOC Tomás Feder, Pavol Hell, Sulamita Klein, Rajeev Motwani
1999	J	`jnl`	List Homomorphisms and Circular Arc Graphs. Comb. Tomás Feder, Pavol Hell, Jing Huang
1998	J	`jnl`	List Homomorphisms to Reflexive Graphs. J. Comb. Theory B Tomás Feder, Pavol Hell
1998	J	`jnl`	Online Channel Allocation in FDMA Networks with Reuse Constraints. Inf. Process. Lett. Tomás Feder, Sunil M. Shende
1998	J	`jnl`	The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. SIAM J. Comput. Tomás Feder, Moshe Y. Vardi
1997	A*	`conf`	Incremental Clustering and Dynamic Information Retrieval. STOC Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani
1996	J	`jnl`	The Benefits of Relaxing Punctuality. J. ACM Rajeev Alur, Tomás Feder, Thomas A. Henzinger
1995	J	`jnl`	Amortized Communication Complexity. SIAM J. Comput. Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan
1995	J	`jnl`	Clique Partitions, Graph Compression and Speeding-Up Algorithms. J. Comput. Syst. Sci. Tomás Feder, Rajeev Motwani
1994	A*	`conf`	A Sublinear Parallel Algorithm for Stable Matching. SODA Tomás Feder, Nimrod Megiddo, Serge A. Plotkin
1994	J	`jnl`	Network Flow and 2-Satisfiability. Algorithmica Tomás Feder
1993	A*	`conf`	Monotone monadic SNP and constraint satisfaction. STOC Tomás Feder, Moshe Y. Vardi
1992	J	`jnl`	A New Fixed Point Approach for Stable Networks and Stable Marriages. J. Comput. Syst. Sci. Tomás Feder
1992	A*	`conf`	Balanced Matroids STOC Tomás Feder, Milena Mihail
1992	A	`conf`	Decidability and Undecidability of Equivalence for Linear Datalog with Applications to Normal-Form Optimizations. ICDT Tomás Feder, Yatin P. Saraiya
1992	J	`jnl`	Determinism vs. Nondeterminism in Multiparty Communication Complexity. SIAM J. Comput. Danny Dolev, Tomás Feder
1992	J	`jnl`	Product graph representations. J. Graph Theory Tomás Feder
1991	A*	`conf`	Amortized Communication Complexity (Preliminary Version) FOCS Tomás Feder, Eyal Kushilevitz, Moni Naor
1991	A*	`conf`	Clique Partitions, Graph Compression, and Speeding-Up Algorithms STOC Tomás Feder, Rajeev Motwani
1991	—	`—`	Stable networks and product graphs. Tomás Feder
1991	A*	`conf`	The Benefits of Relaxing Punctuality. PODC Rajeev Alur, Tomás Feder, Thomas A. Henzinger
1989	A*	`conf`	A New Fixed Point Approach for Stable Networks and Stable Marriages STOC Tomás Feder
1989	A*	`conf`	Multiparty Communication Complexity FOCS Danny Dolev, Tomás Feder
1989	J	`jnl`	Reliable computation by networks in the presence of noise. IEEE Trans. Inf. Theory Tomás Feder
1988	A*	`conf`	Optimal Algorithms for Approximate Clustering STOC Tomás Feder, Daniel H. Greene