The following pages link to (Q3002782):
Displaying 50 items.
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- Improved approximation for orienting mixed graphs (Q261342) (← links)
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- Average-case complexity of backtrack search for coloring sparse random graphs (Q394742) (← links)
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
- Approximability of constrained LCS (Q439929) (← links)
- On the inapproximability of maximum intersection problems (Q456103) (← links)
- Regular inference as vertex coloring (Q465248) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
- On the chromatic number of non-sparse random intersection graphs (Q519889) (← links)
- Observable graphs (Q548270) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Expressive markets for donating to charities (Q646531) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- Computing the partition function for graph homomorphisms (Q681595) (← links)
- New results on optimizing rooted triplets consistency (Q708349) (← links)
- Combinatorial filter reduction: special cases, approximation, and fixed-parameter tractability (Q730503) (← links)
- Approximating the minimum independent dominating set in perturbed graphs (Q744108) (← links)
- Connected greedy coloring of \(H\)-free graphs (Q777440) (← links)
- Chromatic numbers of simplicial manifolds (Q784756) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- An APTAS for bin packing with clique-graph conflicts (Q832868) (← links)
- Independent sets in semi-random hypergraphs (Q832900) (← links)
- Computing the partition function for graph homomorphisms with multiplicities (Q889510) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- Coalition structure generation: a survey (Q900307) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- Minimum entropy coloring (Q1016051) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
- Optimal approximation algorithms for maximum distance-bounded subgraph problems (Q1635712) (← links)
- On the complexity of rainbow coloring problems (Q1647834) (← links)
- On the complexity of submap isomorphism and maximum common submap problems (Q1677051) (← links)
- On the \(b\)-continuity of the lexicographic product of graphs (Q1684933) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Computing large independent sets in a single round (Q1699422) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- Sparsification and subexponential approximation (Q1702300) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- Graphs with small fall-spectrum (Q1720325) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- Stable marriage and roommates problems with restricted edges: complexity and approximability (Q1751156) (← links)
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
- On the complexity of wafer-to-wafer integration (Q1751193) (← links)
