The following pages link to Tian Liu (Q300226):
Displaying 45 items.
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Approximating the maximum multiple RNA interaction problem (Q300233) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- A 0.5358-approximation for Bandpass-2 (Q498435) (← links)
- Multilocus genomics of outcrossing plant populations (Q615642) (← links)
- Balanced random constraint satisfaction: phase transition and hardness (Q777299) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- On exponential time lower bound of Knapsack under backtracking (Q964408) (← links)
- Exponential-time and subexponential-time sets (Q1261474) (← links)
- Some structural properties of SAT (Q1587336) (← links)
- A Bayesian algorithm for functional mapping of dynamic complex traits (Q1662468) (← links)
- A high-accuracy protein structural class prediction algorithm using predicted secondary structural information (Q1733003) (← links)
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
- A new probabilistic algorithm for approximate model counting (Q1799093) (← links)
- A note on closeness between \(NP\)-hard sets and \(C_= P\) (Q1975447) (← links)
- A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem (Q2023131) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← links)
- A group algebraic approach to NPN classification of Boolean functions (Q2322710) (← links)
- Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
- Tractable connected domination for restricted bipartite graphs (Q2354310) (← links)
- Approximation Algorithms for the Maximum Multiple RNA Interaction Problem (Q2867107) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- Independent Domination on Tree Convex Bipartite Graphs (Q2897988) (← links)
- Algorithms for Cut Problems on Trees (Q2942406) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- Feedback Vertex Sets on Tree Convex Bipartite Graphs (Q3167352) (← links)
- Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth (Q3188853) (← links)
- (Q3307633) (← links)
- Union Closed Tree Convex Sets (Q3452566) (← links)
- (Q4428135) (← links)
- Estimation and testing for semiparametric mixtures of partially linear models (Q4586600) (← links)
- Fractional Edge Cover Number of Model RB (Q4632176) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract) (Q4925288) (← links)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem (Q5136287) (← links)
- Tractable Feedback Vertex Sets in Restricted Bipartite Graphs (Q5199168) (← links)
- On Unique Games with Negative Weights (Q5199173) (← links)
- A Note on Treewidth in Random Graphs (Q5199174) (← links)
- Restricted Bipartite Graphs: Comparison and Hardness Results (Q5251649) (← links)
- Statistical inference of partially linear panel data regression models with fixed individual and time effects (Q5368770) (← links)
- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs (Q5405924) (← links)
- Large Hypertree Width for Sparse Random Hypergraphs (Q5405941) (← links)
- Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems (Q5410647) (← links)
- Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model (Q5425476) (← links)
