The following pages link to G. Gutin (Q168084):
Displaying 50 items.
- Acyclic Digraphs (Q3120435) (← links)
- Note on Perfect Forests (Q3188659) (← links)
- (Q3374248) (← links)
- (Q3415356) (← links)
- Characterization of edge-colored complete graphs with properly colored Hamilton paths (Q3418198) (← links)
- The Linear Arrangement Problem Parameterized Above Guaranteed Value (Q3434570) (← links)
- Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints (Q3452559) (← links)
- Fixed-Parameter Complexity of Minimum Profile Problems (Q3499724) (← links)
- Minimum Cost Homomorphism Dichotomy for Oriented Cycles (Q3511431) (← links)
- Minimum Leaf Out-Branching Problems (Q3511432) (← links)
- Tolerance-based Algorithms for the Traveling Salesman Problem (Q3542361) (← links)
- (Q3565872) (← links)
- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables (Q3586474) (← links)
- (Q3615793) (← links)
- Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs (Q3648516) (← links)
- Local Search Heuristics for the Multidimensional Assignment Problem (Q3655144) (← links)
- Properly Coloured Cycles and Paths: Results and Open Problems (Q3655153) (← links)
- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (Q3656864) (← links)
- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds (Q3656865) (← links)
- A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (Q4242916) (← links)
- Generalizations of tournaments: A survey (Q4242937) (← links)
- (Q4325297) (← links)
- Hamiltonian paths and cycles in hypertournaments (Q4351315) (← links)
- Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments (Q4354587) (← links)
- Properly colored Hamilton cycles in edge-colored complete graphs (Q4358434) (← links)
- (Q4390605) (← links)
- (Q4405643) (← links)
- Steiner type problems for digraphs that are locally semicomplete or extended semicomplete (Q4446892) (← links)
- (Q4461908) (← links)
- (Q4461912) (← links)
- (Q4487469) (← links)
- (Q4500916) (← links)
- (Q4539516) (← links)
- (Q4552170) (← links)
- Finding a Longest Path in a Complete Multipartite Digraph (Q4695387) (← links)
- On the number of quasi-kernels in digraphs (Q4736769) (← links)
- Algorithms with large domination ratio (Q4819698) (← links)
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey (Q4842704) (← links)
- Sufficient conditions for a digraph to be hamiltonian (Q4888111) (← links)
- Kings in semicomplete multipartite digraphs (Q4948513) (← links)
- (Q4993600) (← links)
- <i>r</i> -Simple <i>k</i> -Path and Related Problems Parameterized by <i>k</i> / <i>r</i> (Q5028347) (← links)
- Proper orientation number of triangle‐free bridgeless outerplanar graphs (Q5066921) (← links)
- Arc‐disjoint strong spanning subdigraphs of semicomplete compositions (Q5066922) (← links)
- Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths (Q5088514) (← links)
- k-Distinct In- and Out-Branchings in Digraphs (Q5111389) (← links)
- Path-Contractions, Edge Deletions and Connectivity Preservation (Q5111736) (← links)
- Spanning Directed Trees with Many Leaves (Q5189530) (← links)
- Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints (Q5232784) (← links)
- On <i>r</i>-Simple <i>k</i>-Path and Related Problems Parameterized by <i>k/r</i> (Q5236289) (← links)
