Tomás Feder

Affiliations:
  • Stanford University, USA


According to our database1, Tomás Feder authored at least 103 papers between 1988 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
List homomorphisms to separable signed graphs.
Theor. Comput. Sci., 2024

2023
List homomorphism problems for signed trees.
Discret. Math., 2023

2022
On Finding Hamiltonian Cycles in Barnette Graphs.
Fundam. Informaticae, 2022

2021
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture.
J. Graph Theory, 2021

Distance-two colourings of Barnette graphs.
Eur. J. Comb., 2021

2020
Complexity of correspondence H-colourings.
Discret. Appl. Math., 2020

List Homomorphism Problems for Signed Graphs.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints.
CoRR, 2019

2018
Distance-Two Colorings of Barnette Graphs.
CoRR, 2018

Distance-Two Coloring of Barnette Graphs.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Correspondence Homomorphisms to Reflexive Graphs.
Electron. Notes Discret. Math., 2017

Colourings, homomorphisms, and partitions of transitive digraphs.
Eur. J. Comb., 2017

Dichotomy for Digraph Homomorphism Problems.
CoRR, 2017

Complexity of Correspondence Homomorphisms.
CoRR, 2017

2014
Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case.
SIAM J. Discret. Math., 2014

Matrix partitions of split graphs.
Discret. Appl. Math., 2014

2013
Graphs Admitting k-NU Operations. Part 1: The Reflexive Case.
SIAM J. Discret. Math., 2013

Edge-coloring almost bipartite multigraphs.
Inf. Process. Lett., 2013

Obstructions to partitions of chordal graphs.
Discret. Math., 2013

On hypercube labellings and antipodal monochromatic paths.
Discret. Appl. Math., 2013

2012
Distributing Data for Secure Database Services.
Trans. Data Priv., 2012

On the Complexity of MMSNP.
SIAM J. Discret. Math., 2012

Packing Edge-Disjoint Triangles in Given Graphs.
Electron. Colloquium Comput. Complex., 2012

Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms.
Discret. Appl. Math., 2012

2011
Maximum gap labelings of graphs.
Inf. Process. Lett., 2011

Partitioning Chordal Graphs.
Electron. Notes Discret. Math., 2011

Dichotomy for tree-structured trigraph list homomorphism problems.
Discret. Appl. Math., 2011

2010
Achieving anonymity via clustering.
ACM Trans. Algorithms, 2010

Retractions to Pseudoforests.
SIAM J. Discret. Math., 2010

Finding large cycles in Hamiltonian graphs.
Discret. Appl. Math., 2010

2009
Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations.
Inf. Process. Lett., 2009

Approximating the Minimum Chain Completion problem.
Inf. Process. Lett., 2009

On the graph turnpike problem.
Inf. Process. Lett., 2009

Adjusted Interval Digraphs.
Electron. Notes Discret. Math., 2009

Extension problems with degree bounds.
Discret. Appl. Math., 2009

2008
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms.
SIAM J. Discret. Math., 2008

Near-Unanimity Functions and Varieties of Reflexive Graphs.
SIAM J. Discret. Math., 2008

Nearly Tight Bounds on the Number of Hamiltonian Circuits of the Hypercube and Generalizations (revised).
Electron. Colloquium Comput. Complex., 2008

On realizations of point determining graphs, and obstructions to full homomorphisms.
Discret. Math., 2008

Anonymizing Graphs
CoRR, 2008

2007
Querying priced information in databases: The conjunctive case.
ACM Trans. Algorithms, 2007

Computing shortest paths with uncertainty.
J. Algorithms, 2007

Matrix Partitions with Finitely Many Obstructions.
Electron. Notes Discret. Math., 2007

The structure of bi-arc trees.
Discret. Math., 2007

List homomorphisms of graphs with bounded degrees.
Discret. Math., 2007

Approximating nash equilibria using small-support strategies.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

2006
A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings.
SIAM J. Discret. Math., 2006

Full Constraint Satisfaction Problems.
SIAM J. Comput., 2006

k-connected spanning subgraphs of low degree.
Electron. Colloquium Comput. Complex., 2006

Closures and dichotomies for quantified constraints.
Electron. Colloquium Comput. Complex., 2006

Channel assignment in wireless networks and classification of minimum graph homomorphism.
Electron. Colloquium Comput. Complex., 2006

Constraint satisfaction: a personal perspective.
Electron. Colloquium Comput. Complex., 2006

Partition into k-vertex subgraphs of k-partite graphs
Electron. Colloquium Comput. Complex., 2006

On Barnette's conjecture
Electron. Colloquium Comput. Complex., 2006

Matrix partitions of perfect graphs.
Discret. Math., 2006

Digraph matrix partitions and trigraph homomorphisms.
Discret. Appl. Math., 2006

A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
List matrix partitions of chordal graphs.
Theor. Comput. Sci., 2005

Disks on a Tree: Analysis of a Combinatorial Game.
SIAM J. Discret. Math., 2005

Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection
Electron. Colloquium Comput. Complex., 2005

Constraint Satisfaction on Finite Groups with Near Subgroups
Electron. Colloquium Comput. Complex., 2005

Two algorithms for general list matrix partitions.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Algorithms for the Database Layout Problem.
Proceedings of the Database Theory, 2005

Anonymizing Tables.
Proceedings of the Database Theory, 2005

2004
Dichotomies for classes of homomorphism problems involving unary functions.
Theor. Comput. Sci., 2004

Combining request scheduling with web caching.
Theor. Comput. Sci., 2004

Incremental Clustering and Dynamic Information Retrieval.
SIAM J. Comput., 2004

List Partitions of Chordal Graphs.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Algorithms for Multi-product Pricing.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
Acyclic Homomorphisms and Circular Colorings of Digraphs.
SIAM J. Discret. Math., 2003

List Partitions.
SIAM J. Discret. Math., 2003

Computing the Median with Uncertainty.
SIAM J. Comput., 2003

Bi-arc graphs and the complexity of list homomorphisms.
J. Graph Theory, 2003

A combinatorial algorithm for MAX CSP.
Inf. Process. Lett., 2003

Representing Graph Metrics with Fewest Edges.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Homomorphism Closed vs. Existential Positive.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

2002
Approximating the Longest Cycle Problem in Sparse Graphs.
SIAM J. Comput., 2002

Worst-case time bounds for coloring and satisfiability problems.
J. Algorithms, 2002

Web caching with request reordering.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Fanout limitations on constraint systems.
Theor. Comput. Sci., 2001

Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability.
SIAM J. Discret. Math., 2001

2000
A sublinear parallel algorithm for stable matching.
Theor. Comput. Sci., 2000

Finding long paths and cycles in sparse Hamiltonian graphs.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
List Homomorphisms and Circular Arc Graphs.
Comb., 1999

Complexity of Graph Partition Problems.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory.
SIAM J. Comput., 1998

List Homomorphisms to Reflexive Graphs.
J. Comb. Theory B, 1998

Online Channel Allocation in FDMA Networks with Reuse Constraints.
Inf. Process. Lett., 1998

1996
The Benefits of Relaxing Punctuality.
J. ACM, 1996

1995
Amortized Communication Complexity.
SIAM J. Comput., 1995

Clique Partitions, Graph Compression and Speeding-Up Algorithms.
J. Comput. Syst. Sci., 1995

1994
Network Flow and 2-Satisfiability.
Algorithmica, 1994

1993
Monotone monadic SNP and constraint satisfaction.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992
Determinism vs. Nondeterminism in Multiparty Communication Complexity.
SIAM J. Comput., 1992

Product graph representations.
J. Graph Theory, 1992

A New Fixed Point Approach for Stable Networks and Stable Marriages.
J. Comput. Syst. Sci., 1992

Balanced Matroids
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Decidability and Undecidability of Equivalence for Linear Datalog with Applications to Normal-Form Optimizations.
Proceedings of the Database Theory, 1992

1991
Stable networks and product graphs.
PhD thesis, 1991

Amortized Communication Complexity (Preliminary Version)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1989
Reliable computation by networks in the presence of noise.
IEEE Trans. Inf. Theory, 1989

Multiparty Communication Complexity
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
Optimal Algorithms for Approximate Clustering
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988


  Loading...