Tian Liu

Publication Activity (10 Years)

Years Active: 2000-2020
Publications (10 Years): 12

Top Topics

Bipartite Graph

Random Constraint Satisfaction Problems

Exact Algorithms

Top Venues

J. Comb. Optim.

Theor. Comput. Sci.

Publications

Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang
A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. J. Comb. Optim. 40 (3) (2020)
Tian Liu, Chaoyi Wang, Wei Xu
Balanced Random Constraint Satisfaction: Phase Transition and Hardness. FAW (2018)
Hao Chen, Tian Liu
Maximum Edge Bicliques in Tree Convex Bipartite Graphs. FAW (2017)
Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem. ISAAC (2017)
Tian Liu
Fractional Edge Cover Number of Model RB. FAW (2016)
Hao Chen, Zihan Lei, Tian Liu, Ziyang Tang, Chaoyi Wang, Ke Xu
Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs. J. Comb. Optim. 32 (1) (2016)
Tian Liu, Ke Xu
Union Closed Tree Convex Sets. FAW (2015)
Wei Xu, Pan Zhang, Tian Liu, Fuzhou Gong
Solution space structure of random constraint satisfaction problems with growing domains. CoRR (2015)
Tian Liu, Zhao Lu, Ke Xu
Tractable connected domination for restricted bipartite graphs. J. Comb. Optim. 29 (1) (2015)
Tian Liu, Chaoyi Wang, Ke Xu
Large hypertree width for sparse random hypergraphs. J. Comb. Optim. 29 (3) (2015)
Liqin Huang, Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin
A 0.5358-approximation for Bandpass-2. J. Comb. Optim. 30 (3) (2015)
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
Improved parameterized and exact algorithms for cut problems on trees. Theor. Comput. Sci. 607 (2015)
Tian Liu, Min Lu, Zhao Lu, Ke Xu
Circular convex bipartite graphs: Feedback vertex sets. Theor. Comput. Sci. 556 (2014)
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
Algorithms for Cut Problems on Trees. COCOA (2014)
Tian Liu
Restricted Bipartite Graphs: Comparison and Hardness Results. AAIM (2014)
Chaoyi Wang, Hao Chen, Zihan Lei, Ziyang Tang, Tian Liu, Ke Xu
-Complete Domination, Hamiltonicity and Treewidth. FAW (2014)
Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin
Approximating the maximum multiple RNA interaction problem. Theor. Comput. Sci. 556 (2014)
Min Lu, Tian Liu, Weitian Tong, Guohui Lin, Ke Xu
Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems. TAMC (2014)
Liang Li, Tian Liu, Ke Xu
Variable-Centered Consistency in Model RB. Minds Mach. 23 (1) (2013)
Min Lu, Tian Liu, Ke Xu
Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs. FAW-AAIM (2013)
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
Algorithms for Cut Problems on Trees CoRR (2013)
Zhao Lu, Min Lu, Tian Liu, Ke Xu
Circular Convex Bipartite Graphs: Feedback Vertex Set. COCOA (2013)
Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin
Approximation Algorithms for the Maximum Multiple RNA Interaction Problem. COCOA (2013)
Zhao Lu, Tian Liu, Ke Xu
Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract). COCOON (2013)
Wei Jiang, Tian Liu, Chaoyi Wang, Ke Xu
Feedback vertex sets on restricted bipartite graphs. Theor. Comput. Sci. 507 (2013)
Chaoyi Wang, Tian Liu, Ke Xu
Large Hypertree Width for Sparse Random Hypergraphs. FAW-AAIM (2013)
Yu Song, Tian Liu, Ke Xu
Independent Domination on Tree Convex Bipartite Graphs. FAW-AAIM (2012)
Chaoyi Wang, Tian Liu, Wei Jiang, Ke Xu
Feedback Vertex Sets on Tree Convex Bipartite Graphs. COCOA (2012)
Wei Jiang, Tian Liu, Ke Xu
Tractable Feedback Vertex Sets in Restricted Bipartite Graphs. COCOA (2011)
Wei Jiang, Tian Liu, Tienan Ren, Ke Xu
Two Hardness Results on Feedback Vertex Sets. FAW-AAIM (2011)
Peng Cui, Tian Liu, Ke Xu
On Unique Games with Negative Weights. COCOA (2011)
Chaoyi Wang, Tian Liu, Peng Cui, Ke Xu
A Note on Treewidth in Random Graphs. COCOA (2011)
Tian Liu, Xiaxiang Lin, Chaoyi Wang, Kaile Su, Ke Xu
Large Hinge Width on Sparse Random Hypergraphs. IJCAI (2011)
Xin Li, Tian Liu
On exponential time lower bound of Knapsack under backtracking. Theor. Comput. Sci. 411 (16-18) (2010)
Xiaxiang Lin, Xiang Peng, Hao Yan, Wei Jiang, Tian Liu, Hong Guo
An Implementation of Post-Processing Software in Quantum Key Distribution. CSIE (3) (2009)
Hao Yan, Xiang Peng, Xiaxiang Lin, Wei Jiang, Tian Liu, Hong Guo
Efficiency of Winnow Protocol in Secret Key Reconciliation. CSIE (3) (2009)
Hao Yan, Tienan Ren, Xiang Peng, Xiaxiang Lin, Wei Jiang, Tian Liu, Hong Guo
Information Reconciliation Protocol in Quantum Key Distribution System. ICNC (3) (2008)
Xu Wang, Liyan Qian, Jianjun Wu, Tian Liu
An Energy and Distance Based Clustering Protocol for Wireless Sensor Networks. TeNe (2008)
Liang Li, Xin Li, Tian Liu, Ke Xu
From k-SAT to k-CSP: Two Generalized Algorithms CoRR (2008)
Liang Li, Tian Liu, Ke Xu
Exact phase transition of backtrack-free search with implications on the power of greedy algorithms CoRR (2008)
Xin Li, Tian Liu, Han Peng, Liyan Qian, Hongtao Sun, Jin Xu, Ke Xu, Jiaqi Zhu
Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model. TAMC (2007)
Xin Li, Tian Liu
On Exponential Time Lower Bound of Knapsack under Backtracking CoRR (2007)
Xin Li, Tian Liu, Han Peng, Hongtao Sun, Jiaqi Zhu
Improved Exponential Time Lower Bound of Knapsack Problem under BT model CoRR (2006)
Tian Liu
A Note on Closeness between NP-Hard Sets and C=P. J. Comput. Sci. Technol. 15 (2) (2000)
Tian Liu
Some Structural Properties of SAT. J. Comput. Sci. Technol. 15 (5) (2000)