The following pages link to G. Gutin (Q168084):
Displaying 50 items.
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths (Q264204) (← links)
- Polynomial kernels and user reductions for the workflow satisfiability problem (Q309799) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Algorithms for the workflow satisfiability problem engineered for counting constraints (Q328681) (← links)
- Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← links)
- Corrigendum to: ``The linear arrangement problem parameterized above guaranteed value'' (Q385510) (← links)
- Maximum balanced subgraph problem parameterized above lower bound (Q391973) (← links)
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- Parameterized Eulerian strong component arc deletion problem on tournaments (Q437687) (← links)
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- An algorithm for finding input-output constrained convex sets in an acyclic digraph (Q450526) (← links)
- Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
- Local search heuristics for the multidimensional assignment problem (Q544814) (← links)
- (Q592311) (redirect page) (← links)
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- A probabilistic approach to problems parameterized above or below tight bounds (Q632807) (← links)
- Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- (Q697572) (redirect page) (← links)
- Ideal clutters (Q697573) (← links)
- Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width (Q713329) (← links)
- Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- Hamilton cycles in digraphs of unitary matrices (Q856886) (← links)
- Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
- Tight lower bounds for the workflow satisfiability problem based on the strong exponential time hypothesis (Q903190) (← links)
- A problem of finding an acceptable variant in generalized project networks (Q930769) (← links)
- Minimum cost homomorphisms to semicomplete multipartite digraphs (Q947134) (← links)
- Fixed-parameter complexity of minimum profile problems (Q958202) (← links)
- On complexity of minimum leaf out-branching problem (Q967352) (← links)
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops (Q968147) (← links)
- A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
- Convex sets in acyclic digraphs (Q1016095) (← links)
- On the number of connected convex subgraphs of a connected acyclic digraph (Q1028149) (← links)
- Minimum leaf out-branching and related problems (Q1035689) (← links)
- Algorithms for generating convex sets in acyclic digraphs (Q1044043) (← links)
- The independence number of the strong product of cycles (Q1125025) (← links)
- On nearly regular co-critical graphs (Q1126306) (← links)
- Routing and timetabling by topological search (Q1126868) (← links)
- Decompositions of complete multigraphs related to Hadamard matrices (Q1268621) (← links)
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem (Q1272469) (← links)
- The path-partition problem in bipartite distance-hereditary graphs (Q1272711) (← links)
- Edge-coloring cliques with three colors on all 4-cliques (Q1280308) (← links)
- Optimal binary trees with order constraints (Q1283811) (← links)
- A simple algorithm for constructing Szemerédi's regularity partition (Q1283876) (← links)
