Xianmin Liu

Orcid: 0000-0002-4229-636X

According to our database¹, Xianmin Liu authored at least 35 papers between 2007 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

MulRF: A Multi-Dimensional Range Filter for Sublinear Time Range Query Processing.

[BibT_eX]

[DOI]

Shuai Han

Xianmin Liu

Jianzhong Li

IEEE Trans. Knowl. Data Eng., November, 2024

Personalized Federated Learning on Flowing Data Heterogeneity under Restricted Storage.

[BibT_eX]

[DOI]

Sixing Tan

Xianmin Liu

CoRR, 2024

2023

Chunk-oriented dimension ordering for efficient range query processing on sparse multidimensional data.

[BibT_eX]

[DOI]

Shuai Han

Xianmin Liu

Jianzhong Li

World Wide Web (WWW), July, 2023

Detecting maximum <i>k</i>-durable structures on temporal graphs.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2023

2022

The design of the tablet hardness tester.

[BibT_eX]

[DOI]

Salah Aldeen Abdo Alghurbani

Proceedings of the ICMIP 2022: 7th International Conference on Multimedia and Image Processing, Tianjin, China, January 14, 2022

Research on the Reform of Online and Offline Blended Teaching Mode for Analog Circuit Course.

[BibT_eX]

[DOI]

Dan Cheng

Chaoqun Zhang

Xianmin Liu

Proceedings of the ICDEL 2022: The 7th International Conference on Distance Education and Learning, Beijing, China, May 20, 2022

2021

Parameterized complexity of completeness reasoning for conjunctive queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On the complexity and approximability of repair position selection problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Efficient top-k high utility itemset mining on massive data.

[BibT_eX]

[DOI]

Inf. Sci., 2021

2020

Functional dependency restricted insertion propagation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Recognizing the tractability in big data computing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

The Computation of Optimal Subset Repairs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Dynamic Near Maximum Independent Set with Time Independent of Graph Size.

[BibT_eX]

[DOI]

CoRR, 2020

Complexity and Efficient Algorithms for Data Inconsistency Evaluating and Repairing.

[BibT_eX]

[DOI]

CoRR, 2020

How Hard Is Completeness Reasoning for Conjunctive Queries?

[BibT_eX]

[DOI]

Xianmin Liu

Jianzhong Li

Yingshu Li

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Vertex cover in conflict graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Efficiently Mining Frequent Itemsets on Massive Data.

[BibT_eX]

[DOI]

IEEE Access, 2019

2018

Tree size reduction with keeping distinguishability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

2017

Repair Position Selection for Inconsistent Data.

[BibT_eX]

[DOI]

Xianmin Liu

Yingshu Li

Jianzhong Li

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

On the complexity of sampling query feedback restricted database repair of functional dependency violations.

[BibT_eX]

[DOI]

Dongjing Miao

Xianmin Liu

Jianzhong Li

Theor. Comput. Sci., 2016

On the hardness of labeled correlation clustering problem: A parameterized complexity view.

[BibT_eX]

[DOI]

Xianmin Liu

Jianzhong Li

Hong Gao

Theor. Comput. Sci., 2016

TKAP: Efficiently processing top-k query on massive data by adaptive pruning.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2016

On the Complexity of Insertion Propagation with Functional Dependency Constraints.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

On the Complexity of Bounded Deletion Propagation.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

On the Complexity of Extracting Subtree with Keeping Distinguishability.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

On the hardness of learning queries from tree structured data.

[BibT_eX]

[DOI]

Xianmin Liu

Jianzhong Li

J. Comb. Optim., 2015

Algorithms and complexity results for labeled correlation clustering problem.

[BibT_eX]

[DOI]

Xianmin Liu

Jianzhong Li

J. Comb. Optim., 2015

Discovery of Field Functional Dependencies.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Intelligent Systems and Knowledge Engineering, 2015

Flexible Aggregation on Heterogeneous Information Networks.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2015

Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Sampling Query Feedback Restricted Repairs of Functional Dependency Violations: Complexity and Algorithm.

[BibT_eX]

[DOI]

Dongjing Miao

Xianmin Liu

Jianzhong Li

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

On the Parameterized Complexity of Labelled Correlation Clustering Problem.

[BibT_eX]

[DOI]

Xianmin Liu

Jianzhong Li

Hong Gao

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2012

Partial Evaluation for Distributed XPath Query Processing and Beyond.

[BibT_eX]

[DOI]

Gao Cong

Wenfei Fan

Anastasios Kementsietsidis

Jianzhong Li

Xianmin Liu

ACM Trans. Database Syst., 2012

2009

Query Optimization for Complex Path Queries on XML Data.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2009

2007

SAM: An Efficient Algorithm for F&B-Index Construction.

[BibT_eX]

[DOI]

Xianmin Liu

Jianzhong Li

Hongzhi Wang

Proceedings of the Advances in Data and Web Management, 2007

Xianmin Liu

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...