Tian Liu

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