Hongyu Liang

On rainbow-k-connectivity of random graphs

A path in an edge-colored graph is called a \emph{rainbow path} if all edges on it have pairwise distinct colors. For

Controlling infection by blocking nodes and links simultaneously

k\geq 1

Reversing longest previous factor tables is hard

, the \emph{rainbow-

Complexity of total {k}-domination and related problems

k

An improved approximation algorithm for spanning star forest in dense graphs

-connectivity} of a graph

On variants of the spanning star forest problem

G

Limiting negations in bounded treewidth and upward planar circuits

, denoted

Satisfiability with Index Dependency

rc_k(G)

Word-reordering for Statistical Machine Translation Using Trigram Language Model

, is the minimum number of colors required to color the edges of

Detecting the Structure of Social Networks using (\alpha, \beta)-Communities

G