The following pages link to (Q4414647):
Displaying 50 items.
- An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← links)
- MP or not MP: that is the question (Q283264) (← links)
- Parallel family trees for transfer matrices in the Potts model (Q337713) (← links)
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- On an extension of the Sort \& Search method with application to scheduling theory (Q392015) (← links)
- Moderately exponential approximation for makespan minimization on related machines (Q392019) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- Covering moving points with anchored disks (Q421753) (← links)
- Bicolored independent sets and bicliques (Q436317) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- Finding and enumerating Hamilton cycles in 4-regular graphs (Q638522) (← links)
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian (Q659809) (← links)
- On maximum independent sets in \(P_{5}\)-free graphs (Q708334) (← links)
- Cluster editing with locally bounded modifications (Q713321) (← links)
- Concerning infeasibility of the wave functions of the universe (Q747858) (← links)
- Optimal 2-constraint satisfaction via sum-product algorithms (Q844150) (← links)
- An improved exact algorithm for the domatic number problem (Q845906) (← links)
- Complexity issues in color-preserving graph embeddings (Q846361) (← links)
- Reformulation of global constraints based on constraints checkers (Q850448) (← links)
- A hybrid exact algorithm for complete set partitioning (Q901033) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- Finding a dominating set on bipartite graphs (Q963425) (← links)
- On exponential time lower bound of Knapsack under backtracking (Q964408) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Sort and Search: exact algorithms for generalized domination (Q989487) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 (Q1026228) (← links)
- A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
- Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks (Q1652107) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme (Q1701902) (← links)
- Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
