The following pages link to Tomás Feder (Q293381):
Displaying 50 items.
- (Q197726) (redirect page) (← links)
- Online channel allocation in FDMA networks with reuse constraints (Q293383) (← links)
- Colourings, homomorphisms, and partitions of transitive digraphs (Q338575) (← links)
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- The structure of bi-arc trees (Q864126) (← links)
- Finding large cycles in Hamiltonian graphs (Q972323) (← links)
- Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations (Q976091) (← links)
- On the graph turnpike problem (Q989483) (← links)
- Approximating the Minimum Chain Completion problem (Q989547) (← links)
- A combinatorial algorithm for MAX CSP (Q1007550) (← links)
- Matrix partitions with finitely many obstructions (Q1010616) (← links)
- (Q1028133) (redirect page) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- List homomorphisms to reflexive graphs (Q1127870) (← links)
- A new fixed point approach for stable networks and stable marriages (Q1201153) (← links)
- Network flow and 2-satisfiability (Q1317481) (← links)
- A sublinear parallel algorithm for stable matching (Q1575960) (← links)
- Strong near subgroups and left gyrogroups (Q1867305) (← links)
- Dichotomies for classes of homomorphism problems involving unary functions (Q1884913) (← links)
- Combining request scheduling with web caching (Q1887085) (← links)
- Clique partitions, graph compression and speeding-up algorithms (Q1900930) (← links)
- Maximum gap labelings of graphs (Q1944065) (← links)
- List homomorphisms and circular arc graphs (Q1977431) (← links)
- List homomorphism problems for signed trees (Q2111917) (← links)
- Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
- Distance-two colourings of Barnette graphs (Q2225415) (← links)
- Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
- Correspondence homomorphisms to reflexive graphs (Q2413143) (← links)
- Matrix partitions of perfect graphs (Q2433706) (← links)
- Edge-coloring almost bipartite multigraphs (Q2444912) (← links)
- On hypercube labellings and antipodal monochromatic paths (Q2446321) (← links)
- On realizations of point determining graphs, and obstructions to full homomorphisms (Q2477389) (← links)
- Matrix partitions of split graphs (Q2636832) (← links)
- Classification of Homomorphisms to Oriented Cycles and of <i>k</i>-Partite Satisfiability (Q2753538) (← links)
- Complexity of graph partition problems (Q2819579) (← links)
- Adjusted Interval Digraphs (Q2839215) (← links)
- (Q2857366) (← links)
- On the Complexity of MMSNP (Q2902910) (← links)
- (Q2921667) (← links)
- (Q2921752) (← links)
- Achieving anonymity via clustering (Q2930330) (← links)
- Querying priced information in databases (Q2944545) (← links)
- Retractions to Pseudoforests (Q3084215) (← links)
- (Q3128926) (← links)
- Approximating the Longest Cycle Problem in Sparse Graphs (Q3149885) (← links)
- Finding long paths and cycles in sparse Hamiltonian graphs (Q3192021) (← links)
