8 citations · 13 across the 7 of their papers we have counts for
7 papers
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree
Costas Busch, Da Qi Chen, Arnold Filtser +3
A spanning tree of graph is a -approximate universal Steiner tree (UST) for root vertex if, for any subset of vertices containing , the cost of the minimal su…
Unit Perturbations in Budgeted Spanning Tree Problems
Hassene Aissi, Solal Attias, Da Qi Chen +1
The minimum spanning tree of a graph is a well-studied structure that is the basis of countless graph theoretic and optimization problem. We study the minimum spanning tree (MST) p…
Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models
Da Qi Chen, Lin An, Aidin Niaparast +2
We consider an information dissemination problem where the root of an undirected graph constantly updates its information. The goal is to keep every other node in the graph about t…
Minimizing the number of edges in -saturated bipartite graphs
Debsoumya Chakraborti, Da Qi Chen, Mihir Hasabnis
This paper considers an edge minimization problem in saturated bipartite graphs. An by bipartite graph is -saturated if does not contain a subgraph isomorphic to…
Exact results on generalized Erdős-Gallai problems
Debsoumya Chakraborti, Da Qi Chen
Generalized Turán problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem is maximizing the number of cliques of siz…
Many cliques with few edges and bounded maximum degree
Debsoumya Chakraborti, Da Qi Chen
Generalized Turán problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem, maximizing the number of cliques of a fix…
Downgrading to Minimize Connectivity
Hassene Aissi, Da Qi Chen, R. Ravi
We study the problem of interdicting a directed graph by deleting nodes with the goal of minimizing the local edge connectivity of the remaining graph from a given source to a sink…