| Publication | Date of Publication | Type |
|---|
The MaxIS-Shapley value in perfect graphs
| 2024-09-16 | Paper |
A balm: defend the clique-based attack from a fundamental aspect
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
Sublinear-time reductions for big data computing
Theoretical Computer Science | 2022-09-16 | Paper |
Sublinear-time reductions for big data computing
Combinatorial Optimization and Applications | 2022-06-29 | Paper |
Efficient feature selection for logical analysis of large-scale multi-class datasets
Journal of Combinatorial Optimization | 2021-08-11 | Paper |
New results on the complexity of deletion propagation
| 2021-07-05 | Paper |
Maximum reachability preserved graph cut
Theoretical Computer Science | 2020-09-17 | Paper |
The parameterized complexity and kernelization of resilience for database queries
Theoretical Computer Science | 2020-09-17 | Paper |
Recognizing the tractability in big data computing
Theoretical Computer Science | 2020-09-01 | Paper |
Recognizing the tractability in big data computing
Lecture Notes in Computer Science | 2020-05-13 | Paper |
Functional dependency restricted insertion propagation
Theoretical Computer Science | 2020-04-08 | Paper |
On the hardness of Reachability Reduction
| 2020-02-24 | Paper |
The hardness of resilience for nested aggregation query
Theoretical Computer Science | 2019-12-27 | Paper |
Defend the clique-based attack for data privacy
| 2019-10-11 | Paper |
On the complexity of resilience for aggregation queries
| 2019-10-11 | Paper |
Triangle edge deletion on planar glasses-free RGB-digraphs
Theoretical Computer Science | 2019-08-09 | Paper |
Vertex cover in conflict graphs
Theoretical Computer Science | 2019-06-25 | Paper |
SEF view deletion under bounded condition
Theoretical Computer Science | 2018-12-05 | Paper |
Tree size reduction with keeping distinguishability
Theoretical Computer Science | 2018-12-05 | Paper |
A refined characteristic of minimum contingency set for conjunctive query
| 2018-02-26 | Paper |
Approximation for vertex cover in \(\beta\)-conflict graphs
Journal of Combinatorial Optimization | 2017-11-09 | Paper |
On the complexity of bounded deletion propagation
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On the Complexity of Extracting Subtree with Keeping Distinguishability
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On the Complexity of Insertion Propagation with Functional Dependency Constraints
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
On the complexity of sampling query feedback restricted database repair of functional dependency violations
Theoretical Computer Science | 2015-12-11 | Paper |
Sampling query feedback restricted repairs of functional dependency violations: complexity and algorithm
Lecture Notes in Computer Science | 2014-09-26 | Paper |
