The following pages link to Boting Yang (Q202651):
Displayed 50 items.
- Fast searching on cactus graphs (Q2696935) (← links)
- (Q2728899) (← links)
- (Q2766838) (← links)
- Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes (Q2938738) (← links)
- Algorithms for Cut Problems on Trees (Q2942406) (← links)
- The Complexity of the Positive Semidefinite Zero Forcing (Q2942442) (← links)
- Fast Searching on Complete k-partite Graphs (Q2958311) (← links)
- Fast Searching on Cartesian Products of Graphs (Q2988858) (← links)
- (Q3024785) (← links)
- Fast Edge-Searching and Related Problems (Q3066461) (← links)
- (Q3124914) (← links)
- Sauer’s Bound for a Notion of Teaching Complexity (Q3164813) (← links)
- Fast-Mixed Searching on Graphs (Q3167374) (← links)
- The Complexity of Zero-Visibility Cops and Robber (Q3188833) (← links)
- Positive Semidefinite Zero Forcing: Complexity and Lower Bounds (Q3449859) (← links)
- Non-breaking Similarity of Genomes with Gene Repetitions (Q3506914) (← links)
- Searching Trees with Sources and Targets (Q3507331) (← links)
- On the Monotonicity of Weak Searching (Q3511312) (← links)
- On the Fast Searching Problem (Q3511423) (← links)
- Parameterized Complexity of Even/Odd Subgraph Problems (Q3562994) (← links)
- Lower Bounds on Edge Searching (Q3611939) (← links)
- Searching Cycle-Disjoint Graphs (Q3611949) (← links)
- Arc Searching Digraphs Without Jumping (Q3611989) (← links)
- On the Red/Blue Spanning Tree Problem (Q3630196) (← links)
- Lower Bounds on Fast Searching (Q3652283) (← links)
- (Q3836909) (← links)
- (Q4218404) (← links)
- (Q4264789) (← links)
- (Q4264911) (← links)
- (Q4302568) (← links)
- (Q4382879) (← links)
- (Q4388600) (← links)
- (Q4397456) (← links)
- (Q4525730) (← links)
- Positive Zero Forcing and Edge Clique Coverings (Q4632169) (← links)
- A New Lower Bound for Positive Zero Forcing (Q4632220) (← links)
- Ovoids of generalized quadrangles of order and Delsarte cocliques in related strongly regular graphs (Q4685302) (← links)
- Detecting tetrahedralizations of a set of line segments (Q4826761) (← links)
- (Q4876308) (← links)
- Euclidean Chains and Their Shortcuts (Q5199146) (← links)
- Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem (Q5199158) (← links)
- A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS (Q5247063) (← links)
- Genomic Scaffold Filling Revisited. (Q5369550) (← links)
- (Q5387690) (← links)
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (Q5394495) (← links)
- Zero-Visibility Cops and Robber Game on a Graph (Q5405928) (← links)
- Directed Searching Digraphs: Monotonicity and Complexity (Q5425427) (← links)
- Digraph Strong Searching: Monotonicity and Complexity (Q5434421) (← links)
- An Efficient Algorithm for Inference in Rough Set Flow Graphs (Q5449847) (← links)
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance (Q5458565) (← links)