7 citations · 12 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2010★ 7 cited
Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes
James Nastos, Yong Gao
Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingl…
cs.DM2009
A note on the hardness of graph diameter augmentation problems
James Nastos, Yong Gao
A graph has \emph{diameter} D if every pair of vertices are connected by a path of at most D edges. The Diameter-D Augmentation problem asks how to add the a number of edges to a g…