Xianmin Liu

From MaRDI portal
Person:492586

Available identifiers

zbMath Open liu.xianminMaRDI QIDQ492586

List of research outcomes





PublicationDate of PublicationType
Efficient top-\(k\) high utility itemset mining on massive data2022-04-19Paper
On the complexity and approximability of repair position selection problem2021-11-25Paper
How hard is completeness reasoning for conjunctive queries?2021-04-21Paper
Parameterized complexity of completeness reasoning for conjunctive queries2021-04-08Paper
Recognizing the tractability in big data computing2020-09-01Paper
Recognizing the tractability in big data computing2020-05-13Paper
Functional dependency restricted insertion propagation2020-04-08Paper
Vertex cover in conflict graphs2019-06-25Paper
Tree size reduction with keeping distinguishability2018-12-05Paper
Repair position selection for inconsistent data2018-02-26Paper
On the Complexity of Bounded Deletion Propagation2017-02-01Paper
On the Complexity of Extracting Subtree with Keeping Distinguishability2017-02-01Paper
On the Complexity of Insertion Propagation with Functional Dependency Constraints2016-09-02Paper
Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation2016-02-05Paper
On the hardness of labeled correlation clustering problem: a parameterized complexity view2015-12-11Paper
On the complexity of sampling query feedback restricted database repair of functional dependency violations2015-12-11Paper
Multiplication operator with BMO symbols and Berezin transform2015-08-20Paper
On the hardness of learning queries from tree structured data2015-05-11Paper
Algorithms and complexity results for labeled correlation clustering problem2015-02-16Paper
On the Parameterized Complexity of Labelled Correlation Clustering Problem2014-09-26Paper
Sampling Query Feedback Restricted Repairs of Functional Dependency Violations: Complexity and Algorithm2014-09-26Paper

Research outcomes over time

This page was built for person: Xianmin Liu