The following pages link to G. Gutin (Q168084):
Displaying 50 items.
- Note on Perfect Forests in Digraphs (Q5272922) (← links)
- Parameterized Resiliency Problems via Integer Linear Programming (Q5283365) (← links)
- (Q5284651) (← links)
- An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph (Q5302056) (← links)
- (Q5417644) (← links)
- Parameterized Algorithms for Directed Maximum Leaf Problems (Q5428822) (← links)
- Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems (Q5443521) (← links)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844) (← links)
- (Q5487898) (← links)
- Digraphs (Q5502988) (← links)
- (Q5503350) (← links)
- Algorithmic Applications in Management (Q5710145) (← links)
- Parameterized Traveling Salesman Problem: Beating the Average (Q5743554) (← links)
- Spectral Theory and Analysis (Q5747542) (← links)
- (Q5755519) (← links)
- (Q5755528) (← links)
- Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
- (Q5874290) (← links)
- Construction heuristics for the asymmetric TSP. (Q5928379) (← links)
- On recognizing Cartesian graph bundles (Q5936045) (← links)
- On optimal orientations of Cartesian products of trees (Q5936094) (← links)
- The ratio of the longest cycle and longest path in semicomplete multipartite digraphs (Q5937609) (← links)
- TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)
- Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs (Q5952385) (← links)
- On dijoins (Q5957710) (← links)
- Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic (Q5957756) (← links)
- Evaluation of The Contract Or-Patch Heuristic Eor The Asymmetric Tsp<sup>1</sup> (Q6039443) (← links)
- Results on the small quasi-kernel conjecture (Q6041861) (← links)
- \((1,1)\)-cluster editing is polynomial-time solvable (Q6048436) (← links)
- Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments (Q6055389) (← links)
- Kings in multipartite hypertournaments (Q6056795) (← links)
- Perfect forests in graphs and their extensions (Q6057643) (← links)
- Component order connectivity in directed graphs (Q6068236) (← links)
- Lower Bounds for Maximum Weighted Cut (Q6100613) (← links)
- On Seymour's and Sullivan's second neighbourhood conjectures (Q6144918) (← links)
- (Q6168471) (← links)
- Unique stable matchings (Q6176757) (← links)
- Exact capacitated domination: on the computational complexity of uniqueness (Q6336822) (← links)
- Preference Swaps for the Stable Matching Problem (Q6387166) (← links)
- Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees (Q6517979) (← links)
- On the $k$-anti-traceability Conjecture (Q6528179) (← links)
- Convergence and correctness of belief propagation for weighted min-max flow (Q6558678) (← links)
- Public goods in networks with constraints on sharing (Q6564056) (← links)
- Note on disjoint cycles in multipartite tournaments (Q6570049) (← links)
- Bounds on maximum weight directed cut (Q6606913) (← links)
- On \(k\)-anti-traceability of oriented graphs (Q6658061) (← links)
- Finding all stable matchings with assignment constraints (Q6665678) (← links)
- Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials (Q6737752) (← links)
- Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree (Q6744108) (← links)
- Oriented discrepancy of Hamilton cycles and paths in digraphs (Q6761870) (← links)
