Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Koh Aoki
Motoharu Sonogashira
Bhupendra Singh
David Feller
Yingjun Wu
Yusuf Sait Erdem
David J. Westover
Yu-Wei Chang
Sebastian Magda
David MacDonald
Home
/
Author
/
XIANMIN LIU
Author Info
Open Visualization
Name
Affiliation
Papers
XIANMIN LIU
Harbin Institute of Technology, Harbin, China
14
Collaborators
Citations
PageRank
10
12
5.00
Referers
Referees
References
24
234
121
Search Limit
100
234
Publications (14 rows)
Collaborators (10 rows)
Referers (24 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Efficient top-k high utility itemset mining on massive data
0
0.34
2021
Parameterized Complexity Of Completeness Reasoning For Conjunctive Queries
0
0.34
2021
The Computation of Optimal Subset Repairs.
0
0.34
2020
The Computation of Optimal Subset Repairs
1
0.35
2020
Recognizing the tractability in big data computing.
0
0.34
2020
How Hard Is Completeness Reasoning for Conjunctive Queries
0
0.34
2020
Functional dependency restricted insertion propagation
0
0.34
2020
On the Complexity of Bounded Deletion Propagation.
0
0.34
2016
On the hardness of labeled correlation clustering problem: A parameterized complexity view.
0
0.34
2016
On the complexity of sampling query feedback restricted database repair of functional dependency violations.
7
0.53
2016
On the Complexity of Extracting Subtree with Keeping Distinguishability.
0
0.34
2016
TKAP: Efficiently processing top-k query on massive data by adaptive pruning.
3
0.39
2016
Algorithms and complexity results for labeled correlation clustering problem
1
0.35
2015
On the hardness of learning queries from tree structured data
0
0.34
2015
1