The following pages link to Tomás Feder (Q293381):
Displayed 46 items.
- Computing the median with uncertainty (Q3192032) (← links)
- Graphs Admitting $k$-NU Operations. Part 2: The Irreflexive Case (Q3192166) (← links)
- Near-Unanimity Functions and Varieties of Reflexive Graphs (Q3393427) (← links)
- (Q3424776) (← links)
- Computing shortest paths with uncertainty (Q3437091) (← links)
- Matrix Partitions with Finitely Many Obstructions (Q3439607) (← links)
- A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings (Q3440257) (← links)
- Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms (Q3614191) (← links)
- Reliable computation by networks in the presence of noise (Q3832476) (← links)
- Toetjes (Q3984360) (← links)
- Determinism vs. Nondeterminism in Multiparty Communication Complexity (Q4015973) (← links)
- Product graph representations (Q4020705) (← links)
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory (Q4210136) (← links)
- The benefits of relaxing punctuality (Q4371517) (← links)
- (Q4418664) (← links)
- (Q4418665) (← links)
- List Partitions (Q4443101) (← links)
- Acyclic Homomorphisms and Circular Colorings of Digraphs (Q4443128) (← links)
- (Q4527030) (← links)
- Incremental Clustering and Dynamic Information Retrieval (Q4651519) (← links)
- Computing the Median with Uncertainty (Q4706217) (← links)
- Bi‐arc graphs and the complexity of list homomorphisms (Q4798127) (← links)
- Worst-case time bounds for coloring and satisfiability problems (Q4806606) (← links)
- (Q4828920) (← links)
- Stable networks and product graphs (Q4841789) (← links)
- Amortized Communication Complexity (Q4852622) (← links)
- (Q5089181) (← links)
- Monotone monadic SNP and constraint satisfaction (Q5248532) (← links)
- The benefits of relaxing punctuality (Q5255815) (← links)
- Database Theory - ICDT 2005 (Q5316594) (← links)
- Database Theory - ICDT 2005 (Q5316598) (← links)
- Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case (Q5408602) (← links)
- Automata, Languages and Programming (Q5466539) (← links)
- Full Constraint Satisfaction Problems (Q5470753) (← links)
- Disks on a Tree: Analysis of a Combinatorial Game (Q5470778) (← links)
- On Finding Hamiltonian Cycles in Barnette Graphs (Q5880941) (← links)
- LATIN 2004: Theoretical Informatics (Q5901630) (← links)
- Fanout limitations on constraint systems (Q5941073) (← links)
- Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture (Q6055393) (← links)
- List homomorphisms to separable signed graphs (Q6102261) (← links)
- Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture (Q6303011) (← links)
- On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs (Q6303161) (← links)
- Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints (Q6321242) (← links)
- List homomorphism problems for signed trees (Q6340513) (← links)
- On finding hamiltonian cycles in Barnette graphs (Q6419640) (← links)
- List homomorphisms to separable signed graphs (Q6439891) (← links)