The following pages link to (Q4258216):
Displaying 50 items.
- Inequity aversion pricing over social networks: approximation algorithms and hardness results (Q2031049) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
- Analyzing unit read-once refutations in difference constraint systems (Q2055789) (← links)
- Positive influence domination in graphs (Q2082361) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- A PCP of proximity for real algebraic polynomials (Q2117096) (← links)
- Robust regression via error tolerance (Q2134056) (← links)
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- Perfect Italian domination in graphs: complexity and algorithms (Q2161253) (← links)
- Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
- On the analysis of optimization problems in arc-dependent networks (Q2172089) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- The generalized definitions of the two-dimensional largest common substructure problems (Q2182100) (← links)
- Algorithm and hardness results on neighborhood total domination in graphs (Q2201995) (← links)
- Approximation algorithms for geometric conflict free covering problems (Q2206716) (← links)
- Global total \(k\)-domination: approximation and hardness results (Q2216425) (← links)
- The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? (Q2220833) (← links)
- Face-guarding polyhedra (Q2248737) (← links)
- Rounding on the standard simplex: regular grids for global optimization (Q2250080) (← links)
- Compositional multiprocessor scheduling: the GMPR interface (Q2251410) (← links)
- On the complexity of the identifiable subgraph problem (Q2255039) (← links)
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs (Q2257297) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Capacity inverse minimum cost flow problem (Q2268762) (← links)
- On the computational complexity of weighted voting games (Q2268913) (← links)
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity (Q2271865) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- The Stackelberg model in territorial planning (Q2290306) (← links)
- Algorithmic results on double Roman domination in graphs (Q2292130) (← links)
- Complexity results on planar multifacility location problems with forbidden regions (Q2311127) (← links)
- Minimal distance of propositional models (Q2322705) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Comparing incomplete sequences via longest common subsequence (Q2333802) (← links)
- Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma (Q2334078) (← links)
- Algorithm and hardness results on hop domination in graphs (Q2338219) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- A combinatorial approach to the design of vaccines (Q2339974) (← links)
- Reprint of: Face-guarding polyhedra (Q2341695) (← links)
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756) (← links)
- Lemmings is PSPACE-complete (Q2347006) (← links)
- On the complexity of the vector connectivity problem (Q2354404) (← links)
- Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management (Q2355922) (← links)
- Inferring local transition functions of discrete dynamical systems from observations of system behavior (Q2357112) (← links)
- On the uniform edge-partition of a tree (Q2370420) (← links)
- Complexity and approximation of the minimum recombinant haplotype configuration problem (Q2371806) (← links)
