default search action
Tian Liu 0001
Person information
- affiliation: Peking University, School of Electronic Engineering and Computer Science, MOE Key Laboratory of High Confidence Software Technologies, Beijing, China
- affiliation (PhD 1999): Peking University, Department of Computer Science and Technology, Beijing, China
Other persons with the same name
- Tian Liu — disambiguation page
- Tian Liu 0002
— Hong Kong University of Science and Technology, Department of Electronic and Computer Engineering, Hong Kong
- Tian Liu 0003
- Tian Liu 0004 — Emory University, Department of Radiation Oncology and Winship Cancer Institute, Atlanta, USA
- Tian Liu 0005
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j14]Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin
Approximation algorithms for the maximally balanced connected graph tripartition problem. J. Comb. Optim. 44(3): 1753-1773 (2022) - 2020
- [j13]Yong Chen, Guohui Lin
A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. J. Comb. Optim. 40(3): 806-824 (2020)
2010 – 2019
- 2018
- [c26]Tian Liu
Balanced Random Constraint Satisfaction: Phase Transition and Hardness. FAW 2018: 238-250 - 2017
- [c25]Hao Chen, Tian Liu:
Maximum Edge Bicliques in Tree Convex Bipartite Graphs. FAW 2017: 47-55 - [c24]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: 66:1-66:12 - 2016
- [j12]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): 95-110 (2016) - [c23]Tian Liu:
Fractional Edge Cover Number of Model RB. FAW 2016: 102-110 - 2015
- [j11]Tian Liu, Zhao Lu, Ke Xu:
Tractable connected domination for restricted bipartite graphs. J. Comb. Optim. 29(1): 247-256 (2015) - [j10]Tian Liu, Chaoyi Wang, Ke Xu:
Large hypertree width for sparse random hypergraphs. J. Comb. Optim. 29(3): 531-540 (2015) - [j9]Liqin Huang, Weitian Tong
A 0.5358-approximation for Bandpass-2. J. Comb. Optim. 30(3): 612-626 (2015) - [j8]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong
Improved parameterized and exact algorithms for cut problems on trees. Theor. Comput. Sci. 607: 455-470 (2015) - [c22]Tian Liu, Ke Xu:
Union Closed Tree Convex Sets. FAW 2015: 198-203 - [i6]Wei Xu, Pan Zhang, Tian Liu, Fuzhou Gong:
Solution space structure of random constraint satisfaction problems with growing domains. CoRR abs/1505.06802 (2015) - 2014
- [j7]Tian Liu, Min Lu, Zhao Lu, Ke Xu:
Circular convex bipartite graphs: Feedback vertex sets. Theor. Comput. Sci. 556: 55-62 (2014) - [j6]Weitian Tong
Approximating the maximum multiple RNA interaction problem. Theor. Comput. Sci. 556: 63-70 (2014) - [c21]Tian Liu:
Restricted Bipartite Graphs: Comparison and Hardness Results. AAIM 2014: 241-252 - [c20]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong
Algorithms for Cut Problems on Trees. COCOA 2014: 283-298 - [c19]Chaoyi Wang, Hao Chen, Zihan Lei, Ziyang Tang, Tian Liu, Ke Xu:
Tree Convex Bipartite Graphs: NP -Complete Domination, Hamiltonicity and Treewidth. FAW 2014: 252-263 - [c18]Min Lu, Tian Liu, Weitian Tong
Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems. TAMC 2014: 248-258 - 2013
- [j5]Liang Li, Tian Liu, Ke Xu:
Variable-Centered Consistency in Model RB. Minds Mach. 23(1): 95-103 (2013) - [j4]Wei Jiang, Tian Liu, Chaoyi Wang, Ke Xu:
Feedback vertex sets on restricted bipartite graphs. Theor. Comput. Sci. 507: 41-51 (2013) - [c17]Min Lu, Tian Liu, Ke Xu:
Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs. FAW-AAIM 2013: 142-152 - [c16]Chaoyi Wang, Tian Liu, Ke Xu:
Large Hypertree Width for Sparse Random Hypergraphs. FAW-AAIM 2013: 294-302 - [c15]Weitian Tong
Approximation Algorithms for the Maximum Multiple RNA Interaction Problem. COCOA 2013: 49-59 - [c14]Zhao Lu, Min Lu, Tian Liu, Ke Xu:
Circular Convex Bipartite Graphs: Feedback Vertex Set. COCOA 2013: 272-283 - [c13]Zhao Lu, Tian Liu, Ke Xu:
Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract). COCOON 2013: 721-728 - [i5]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 abs/1304.3653 (2013) - 2012
- [c12]Yu Song, Tian Liu, Ke Xu:
Independent Domination on Tree Convex Bipartite Graphs. FAW-AAIM 2012: 129-138 - [c11]Chaoyi Wang, Tian Liu, Wei Jiang, Ke Xu:
Feedback Vertex Sets on Tree Convex Bipartite Graphs. COCOA 2012: 95-102 - 2011
- [c10]Wei Jiang, Tian Liu, Tienan Ren, Ke Xu:
Two Hardness Results on Feedback Vertex Sets. FAW-AAIM 2011: 233-243 - [c9]Wei Jiang, Tian Liu, Ke Xu:
Tractable Feedback Vertex Sets in Restricted Bipartite Graphs. COCOA 2011: 424-434 - [c8]Peng Cui, Tian Liu, Ke Xu:
On Unique Games with Negative Weights. COCOA 2011: 480-490 - [c7]Chaoyi Wang, Tian Liu, Peng Cui, Ke Xu:
A Note on Treewidth in Random Graphs. COCOA 2011: 491-499 - [c6]Tian Liu, Xiaxiang Lin, Chaoyi Wang, Kaile Su
Large Hinge Width on Sparse Random Hypergraphs. IJCAI 2011: 611-616 - 2010
- [j3]Xin Li, Tian Liu:
On exponential time lower bound of Knapsack under backtracking. Theor. Comput. Sci. 411(16-18): 1883-1888 (2010)
2000 – 2009
- 2009
- [c5]Hao Yan, Xiang Peng, Xiaxiang Lin, Wei Jiang, Tian Liu, Hong Guo:
Efficiency of Winnow Protocol in Secret Key Reconciliation. CSIE (3) 2009: 238-242 - [c4]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: 243-247 - 2008
- [c3]Xu Wang, Liyan Qian, Jianjun Wu, Tian Liu:
An Energy and Distance Based Clustering Protocol for Wireless Sensor Networks. TeNe 2008: 409-412 - [c2]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: 637-641 - [i4]Liang Li, Xin Li, Tian Liu, Ke Xu:
From k-SAT to k-CSP: Two Generalized Algorithms. CoRR abs/0801.3147 (2008) - [i3]Liang Li, Tian Liu, Ke Xu:
Exact phase transition of backtrack-free search with implications on the power of greedy algorithms. CoRR abs/0811.3055 (2008) - 2007
- [c1]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: 624-631 - [i2]Xin Li, Tian Liu:
On Exponential Time Lower Bound of Knapsack under Backtracking. CoRR abs/0712.3348 (2007) - 2006
- [i1]Xin Li, Tian Liu, Han Peng, Hongtao Sun, Jiaqi Zhu:
Improved Exponential Time Lower Bound of Knapsack Problem under BT model. CoRR abs/cs/0606064 (2006) - 2000
- [j2]Tian Liu:
A Note on Closeness between NP-Hard Sets and C=P. J. Comput. Sci. Technol. 15(2): 194-195 (2000) - [j1]Tian Liu:
Some Structural Properties of SAT. J. Comput. Sci. Technol. 15(5): 439-444 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: