Tian Liu

From MaRDI portal
Person:300226

Available identifiers

zbMath Open liu.tianMaRDI QIDQ300226

List of research outcomes

PublicationDate of PublicationType
Approximation algorithms for the maximally balanced connected graph tripartition problem2022-10-04Paper
A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem2021-05-03Paper
https://portal.mardi4nfdi.de/entity/Q51362872020-11-25Paper
https://portal.mardi4nfdi.de/entity/Q33076332020-08-12Paper
Balanced random constraint satisfaction: phase transition and hardness2020-07-07Paper
A group algebraic approach to NPN classification of Boolean functions2019-09-05Paper
Fractional Edge Cover Number of Model RB2019-04-26Paper
Maximum Edge Bicliques in Tree Convex Bipartite Graphs2019-04-26Paper
A high-accuracy protein structural class prediction algorithm using predicted secondary structural information2019-03-26Paper
A new probabilistic algorithm for approximate model counting2018-10-18Paper
A Bayesian algorithm for functional mapping of dynamic complex traits2018-08-20Paper
A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints2018-05-30Paper
Estimation and testing for semiparametric mixtures of partially linear models2017-10-27Paper
Statistical inference of partially linear panel data regression models with fixed individual and time effects2017-10-10Paper
Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs2016-10-20Paper
Circular convex bipartite graphs: feedback vertex sets2016-06-27Paper
Approximating the maximum multiple RNA interaction problem2016-06-27Paper
Improved parameterized and exact algorithms for cut problems on trees2015-12-11Paper
Union Closed Tree Convex Sets2015-11-12Paper
A 0.5358-approximation for Bandpass-22015-09-28Paper
Algorithms for Cut Problems on Trees2015-09-11Paper
Tractable connected domination for restricted bipartite graphs2015-07-10Paper
Restricted Bipartite Graphs: Comparison and Hardness Results2015-05-20Paper
Large hypertree width for sparse random hypergraphs2015-05-11Paper
Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth2014-09-02Paper
Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems2014-04-16Paper
Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs2014-04-03Paper
Large Hypertree Width for Sparse Random Hypergraphs2014-04-03Paper
Feedback vertex sets on restricted bipartite graphs2014-01-16Paper
Approximation Algorithms for the Maximum Multiple RNA Interaction Problem2013-12-10Paper
Circular Convex Bipartite Graphs: Feedback Vertex Set2013-12-10Paper
Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract)2013-06-11Paper
Feedback Vertex Sets on Tree Convex Bipartite Graphs2012-11-02Paper
Independent Domination on Tree Convex Bipartite Graphs2012-07-16Paper
Tractable Feedback Vertex Sets in Restricted Bipartite Graphs2011-08-12Paper
On Unique Games with Negative Weights2011-08-12Paper
A Note on Treewidth in Random Graphs2011-08-12Paper
Two Hardness Results on Feedback Vertex Sets2011-06-03Paper
Multilocus genomics of outcrossing plant populations2011-01-05Paper
On exponential time lower bound of Knapsack under backtracking2010-04-15Paper
Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model2007-11-13Paper
https://portal.mardi4nfdi.de/entity/Q44281352003-09-14Paper
Some structural properties of SAT2001-05-28Paper
A note on closeness between \(NP\)-hard sets and \(C_= P\)2000-04-27Paper
Exponential-time and subexponential-time sets1993-09-16Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Tian Liu