← Search

Ya Liu

6 accepted papers

2026

A Scalable and Exact Relaxation for Densest k-Subgraph via Error Bounds

AAAI 2026technical

Given an undirected graph and a size parameter k, the Densest k-Subgraph (DkS) problem extracts the subgraph on k vertices with the largest number of induced edges. While DkS is NP--hard and difficult to approximate, penalty-based continuous relaxations of the problem have recently enjoyed practical

Cited by 0SourcePDFScholar
2024

Cardinality-Constrained Binary Quadratic Optimization via Extreme Point Pursuit, with Application to the Densest K-Subgraph Problem

ICASSP 2024accepted

Cardinality-constrained binary quadratic optimization appears in various applications such as finding a densest size-constrained subgraph from a graph. It is a challenging combinatorial problem, and in this paper we tackle the problem by a continuous optimization approach. Our method, called the ext…

Cited by 0SourceScholar
2024

Design and Human-Robot Coupling Performance Analysis of Flexible Ankle Rehabilitation Robot

RA-L 2024

In response to the problems of mismatched human-robot motion and poor human-robot coupling (HRC) performance in ankle rehabilitation robots, this study proposes a cable-driven flexible ankle rehabilitation robot (FARR) based on biomimetic design and analyzes its HRC performance. Firstly, based on th

Cited by 16SourceScholar
2024

Design of Human-Machine Compatible Ankle Rehabilitation Robot Based on Equivalent Human Ankle Model

RA-L 2024

In this letter, a human–machine compatible ankle rehabilitation robot (HMCARR) is proposed to help stroke patients with motion dysfunction recover their motor function. The HMCARR can make the human ankle center-of-rotation (H-CoR) and the ankle rehabilitation robot center-of-rotation (R-CoR) coinci

Cited by 6SourceScholar