PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Guo, Jiong"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithm design techniques for parameterized graph modification problems.

. Ausgezeichnete Informatikdissertationen, volume D-7 of LNI, GI, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yanan Guo University of Stuttgart

 

Other publications of authors with the same name

Editing Graphs into Disjoint Unions of Dense Clusters., , , and . Algorithmica, 61 (4): 949-970 (2011)Graph-based data clustering with overlaps., , , , and . Discrete Optimization, 8 (1): 2-17 (2011)Kernelization of Two Path Searching Problems on Split Graphs., , , and . FAW, volume 9711 of Lecture Notes in Computer Science, page 238-249. Springer, (2016)Neighborhood-Preserving Mapping between Trees., , and . WADS, volume 8037 of Lecture Notes in Computer Science, page 427-438. Springer, (2013)Error Compensation in Leaf Root Problems., , , and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 389-401. Springer, (2004)Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs.. ISAAC, volume 4835 of Lecture Notes in Computer Science, page 915-926. Springer, (2007)Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs., and . WALCOM, volume 8344 of Lecture Notes in Computer Science, page 286-297. Springer, (2014)The Parameterized Complexity of Some Minimum Label Problems., , and . WG, volume 5911 of Lecture Notes in Computer Science, page 88-99. (2009)Exact algorithms for weighted and unweighted Borda manipulation problems., and . Theor. Comput. Sci., (2016)Red-blue covering problems and the consecutive ones property., , , and . J. Discrete Algorithms, 6 (3): 393-407 (2008)