Tian Liu

According to our database, Tian Liu authored at least 43 papers between 2000 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Approximation algorithms for the maximally balanced connected graph tripartition problem.

Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Tian Liu, An Zhang

J. Comb. Optim., 2022

2020

A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem.

Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang

J. Comb. Optim., 2020

2018

Balanced Random Constraint Satisfaction: Phase Transition and Hardness.

Tian Liu, Chaoyi Wang, Wei Xu

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017

A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem.

Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Maximum Edge Bicliques in Tree Convex Bipartite Graphs.

Hao Chen, Tian Liu

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

2016

Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs.

Hao Chen, Zihan Lei, Tian Liu, Ziyang Tang, Chaoyi Wang, Ke Xu

J. Comb. Optim., 2016

Fractional Edge Cover Number of Model RB.

Tian Liu

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015

Improved parameterized and exact algorithms for cut problems on trees.

Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu

Theor. Comput. Sci., 2015

Large hypertree width for sparse random hypergraphs.

Tian Liu, Chaoyi Wang, Ke Xu

J. Comb. Optim., 2015

Tractable connected domination for restricted bipartite graphs.

Tian Liu, Zhao Lu, Ke Xu

J. Comb. Optim., 2015

A 0.5358-approximation for Bandpass-2.

Liqin Huang, Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin

J. Comb. Optim., 2015

Solution space structure of random constraint satisfaction problems with growing domains.

Wei Xu, Pan Zhang, Tian Liu, Fuzhou Gong

CoRR, 2015

Union Closed Tree Convex Sets.

Tian Liu, Ke Xu

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

2014

Approximating the maximum multiple RNA interaction problem.

Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin

Theor. Comput. Sci., 2014

Circular convex bipartite graphs: Feedback vertex sets.

Tian Liu, Min Lu, Zhao Lu, Ke Xu

Theor. Comput. Sci., 2014

Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems.

Min Lu, Tian Liu, Weitian Tong, Guohui Lin, Ke Xu

Proceedings of the Theory and Applications of Models of Computation, 2014

Tree Convex Bipartite Graphs: <i>NP</i> -Complete Domination, Hamiltonicity and Treewidth.

Chaoyi Wang, Hao Chen, Zihan Lei, Ziyang Tang, Tian Liu, Ke Xu

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Algorithms for Cut Problems on Trees.

Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu

Proceedings of the Combinatorial Optimization and Applications, 2014

Restricted Bipartite Graphs: Comparison and Hardness Results.

Tian Liu

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Feedback vertex sets on restricted bipartite graphs.

Wei Jiang, Tian Liu, Chaoyi Wang, Ke Xu

Theor. Comput. Sci., 2013

Variable-Centered Consistency in Model RB.

Liang Li, Tian Liu, Ke Xu

Minds Mach., 2013

Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract).

Zhao Lu, Tian Liu, Ke Xu

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Approximation Algorithms for the Maximum Multiple RNA Interaction Problem.

Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin

Proceedings of the Combinatorial Optimization and Applications, 2013

Circular Convex Bipartite Graphs: Feedback Vertex Set.

Zhao Lu, Min Lu, Tian Liu, Ke Xu

Proceedings of the Combinatorial Optimization and Applications, 2013

Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs.

Min Lu, Tian Liu, Ke Xu

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

Feedback Vertex Sets on Tree Convex Bipartite Graphs.

Chaoyi Wang, Tian Liu, Wei Jiang, Ke Xu

Proceedings of the Combinatorial Optimization and Applications, 2012

Independent Domination on Tree Convex Bipartite Graphs.

Yu Song, Tian Liu, Ke Xu

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Large Hinge Width on Sparse Random Hypergraphs.

Tian Liu, Xiaxiang Lin, Chaoyi Wang, Kaile Su, Ke Xu

Proceedings of the IJCAI 2011, 2011

A Note on Treewidth in Random Graphs.

Chaoyi Wang, Tian Liu, Peng Cui, Ke Xu

Proceedings of the Combinatorial Optimization and Applications, 2011

Tractable Feedback Vertex Sets in Restricted Bipartite Graphs.

Wei Jiang, Tian Liu, Ke Xu

Proceedings of the Combinatorial Optimization and Applications, 2011

On Unique Games with Negative Weights.

Peng Cui, Tian Liu, Ke Xu

Proceedings of the Combinatorial Optimization and Applications, 2011

Two Hardness Results on Feedback Vertex Sets.

Wei Jiang, Tian Liu, Tienan Ren, Ke Xu

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

On exponential time lower bound of Knapsack under backtracking.

Xin Li, Tian Liu

Theor. Comput. Sci., 2010

2009

Efficiency of Winnow Protocol in Secret Key Reconciliation.

Hao Yan, Xiang Peng, Xiaxiang Lin, Wei Jiang, Tian Liu, Hong Guo

Proceedings of the CSIE 2009, 2009 WRI World Congress on Computer Science and Information Engineering, March 31, 2009

An Implementation of Post-Processing Software in Quantum Key Distribution.

Xiaxiang Lin, Xiang Peng, Hao Yan, Wei Jiang, Tian Liu, Hong Guo

Proceedings of the CSIE 2009, 2009 WRI World Congress on Computer Science and Information Engineering, March 31, 2009

2008

Exact phase transition of backtrack-free search with implications on the power of greedy algorithms

Liang Li, Tian Liu, Ke Xu

CoRR, 2008

From k-SAT to k-CSP: Two Generalized Algorithms

Liang Li, Xin Li, Tian Liu, Ke Xu

CoRR, 2008

Information Reconciliation Protocol in Quantum Key Distribution System.

Hao Yan, Tienan Ren, Xiang Peng, Xiaxiang Lin, Wei Jiang, Tian Liu, Hong Guo

Proceedings of the Fourth International Conference on Natural Computation, 2008

An Energy and Distance Based Clustering Protocol for Wireless Sensor Networks.

Xu Wang, Liyan Qian, Jianjun Wu, Tian Liu

Proceedings of the Novel Algorithms and Techniques in Telecommunications and Networking, 2008

2007

Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model.

Xin Li, Tian Liu, Han Peng, Liyan Qian, Hongtao Sun, Jin Xu, Ke Xu, Jiaqi Zhu

Proceedings of the Theory and Applications of Models of Computation, 2007

2006

Improved Exponential Time Lower Bound of Knapsack Problem under BT model

Xin Li, Tian Liu, Han Peng, Hongtao Sun, Jiaqi Zhu

CoRR, 2006

2000

Some Structural Properties of SAT.

Tian Liu

J. Comput. Sci. Technol., 2000

A Note on Closeness between NP-Hard Sets and C=P.

Tian Liu

J. Comput. Sci. Technol., 2000