The following pages link to Boting Yang (Q202651):
Displayed 50 items.
- Triangulations without minimum-weight drawing (Q294766) (← links)
- Euclidean chains and their shortcuts (Q391221) (← links)
- Fast-mixed searching and related problems on graphs (Q393051) (← links)
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
- Fast searching games on graphs (Q411259) (← links)
- Algebraic methods proving Sauer's bound for teaching complexity (Q465250) (← links)
- Lower bounds for positive semidefinite zero forcing and their applications (Q512866) (← links)
- The fast search number of a Cartesian product of graphs (Q526821) (← links)
- On the red/blue spanning tree problem (Q534557) (← links)
- Fast edge searching and fast searching on graphs (Q631784) (← links)
- Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
- Strong-mixed searching and pathwidth (Q867027) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- The complexity of zero-visibility cops and robber (Q897941) (← links)
- Time constrained graph searching (Q930887) (← links)
- Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
- Monotonicity in digraph search problems (Q955030) (← links)
- Standard directed search strategies and their applications (Q1029267) (← links)
- Sweeping graphs with large clique number (Q1045071) (← links)
- A recursive quadric programming algorithm that uses new nondifferentiable penalty functions (Q1333897) (← links)
- The class Steiner minimal tree problem: A lower bound and test problem generation (Q1591047) (← links)
- On some polyhedra covering problems (Q1592841) (← links)
- Maximum weight triangulation and graph drawing (Q1606921) (← links)
- Infection in hypergraphs (Q1701092) (← links)
- The cop number of the one-cop-moves game on planar graphs (Q1708611) (← links)
- The fast search number of a complete \(k\)-partite graph (Q1799234) (← links)
- Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\) (Q1850059) (← links)
- Minimal tetrahedralizations of a class of polyhedra (Q1888167) (← links)
- A successive quadratic programming method that uses new corrections for search directions (Q1919937) (← links)
- On a homogeneous recurrence relation for the determinants of general pentadiagonal Toeplitz matrices (Q2006651) (← links)
- Computing the one-visibility copnumber of trees (Q2039691) (← links)
- The one-cop-moves game on planar graphs (Q2051905) (← links)
- One-visibility cops and robber on trees: optimal cop-win strategies (Q2079862) (← links)
- Computing the one-visibility cop-win strategies for trees (Q2149861) (← links)
- A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313) (← links)
- The one-cop-moves game on graphs of small treewidth (Q2180181) (← links)
- The one-cop-moves game on graphs with some special structures (Q2210510) (← links)
- Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph'' (Q2217786) (← links)
- Properties of a \(q\)-analogue of zero forcing (Q2227980) (← links)
- Correction to: ``Properties of a \(q\)-analogue of zero forcing'' (Q2227981) (← links)
- One-visibility cops and robber on trees (Q2232598) (← links)
- Four-searchable biconnected outerplanar graphs (Q2243137) (← links)
- A partition approach to lower bounds for zero-visibility cops and robber (Q2301762) (← links)
- Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (Q2302881) (← links)
- Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902) (← links)
- Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) (← links)
- The optimal capture time of the one-cop-moves game (Q2348264) (← links)
- Monotonicity of strong searching on digraphs (Q2426650) (← links)
- Compressed cliques graphs, clique coverings and positive zero forcing (Q2636506) (← links)
- Aggregating preferences represented by conditional preference networks (Q2695422) (← links)