The following pages link to G. Gutin (Q168084):
Displaying 50 items.
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- On optimal orientations of Cartesian products with a bipartite graph (Q1961236) (← links)
- On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles (Q1969779) (← links)
- Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian (Q1970581) (← links)
- On the Hajós number of graphs (Q1970708) (← links)
- Bipartite covering graphs (Q1972129) (← links)
- Perfection thickness of graphs (Q1974539) (← links)
- Uniqueness of \(DP\)-Nash subgraphs and \(D\)-sets in weighted graphs of Netflix games (Q2019479) (← links)
- Smallest number of vertices in a 2-arc-strong digraph without good pairs (Q2087467) (← links)
- On \(d\)-panconnected tournaments with large semidegrees (Q2142665) (← links)
- The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings (Q2149881) (← links)
- Component order connectivity in directed graphs (Q2165039) (← links)
- Extended path partition conjecture for semicomplete and acyclic compositions (Q2166278) (← links)
- Proximity and remoteness in directed and undirected graphs (Q2222950) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- Branching in digraphs with many and few leaves: structural and algorithmic results (Q2315577) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- When the greedy algorithm fails (Q2386197) (← links)
- Clustering without replication in combinatorial circuits (Q2424822) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- The linear arrangement problem parameterized above guaranteed value (Q2464326) (← links)
- Kernels in planar digraphs (Q2485283) (← links)
- Further extension of the TSP assign neighborhood (Q2491321) (← links)
- Level of repair analysis and minimum cost homomorphisms of graphs (Q2492189) (← links)
- Minimum cost and list homomorphisms to semicomplete digraphs (Q2492190) (← links)
- Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs (Q2494815) (← links)
- On \(n\)-partite tournaments with unique \(n\)-cycle (Q2502031) (← links)
- The minimum diameter of orientations of complete multipartite graphs (Q2563422) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- Proper orientation, proper biorientation and semi-proper orientation numbers of graphs (Q2680602) (← links)
- Fixed parameterized algorithms for generalized feedback vertex set problems (Q2693637) (← links)
- Exact capacitated domination: on the computational complexity of uniqueness (Q2696625) (← links)
- Preference swaps for the stable matching problem (Q2699977) (← links)
- Remarks on Hamiltonian digraphs (Q2712516) (← links)
- Graph imperfection and channel assignment (Q2758339) (← links)
- The search and the node-search number of dual graphs (Q2782692) (← links)
- Cryptographic Enforcement of Information Flow Policies Without Public Information (Q2794512) (← links)
- A Multivariate Approach for Checking Resiliency in Access Control (Q2830068) (← links)
- The mixed Chinese postman problem parameterized by pathwidth and treedepth (Q2835842) (← links)
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems (Q2839214) (← links)
- Fixed-Parameter Tractability of Satisfying beyond the Number of Variables (Q2843339) (← links)
- Generalized traveling salesman problem reduction algorithms (Q2867371) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- Simultaneously satisfying linear equations over \(\mathbb {F}_2\): MaxLin2 and Max-\(r\)-Lin2 parameterized above average (Q2911627) (← links)
- Parameterized Study of the Test Cover Problem (Q2912727) (← links)
- Parameterized Complexity of the k-Arc Chinese Postman Problem (Q2921440) (← links)
- Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem (Q2946020) (← links)
- (Q3012393) (← links)
- (Q3084797) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
