Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs.

Y. Liu, J. Wang, C. Xu, J. Guo, and J. Chen. J. Comb. Optim., 29 (1): 257-275 (2015)

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

Parameterized computational complexity of Dodgson and Young elections.N. Betzler, J. Guo, and R. Niedermeier. Inf. Comput., 208 (2): 165-177 (2010)Data Reduction and Problem Kernels (Dagstuhl Seminar 12241).M. Fellows, J. Guo, D. Marx, and S. Saurabh. Dagstuhl Reports, 2 (6): 26-50 (2012)Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation.J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Theory Comput. Syst., 38 (4): 373-392 (2005)Parameterized Complexity of Vertex Cover Variants.J. Guo, R. Niedermeier, and S. Wernicke. Theory Comput. Syst., 41 (3): 501-520 (2007)Editing Graphs into Disjoint Unions of Dense Clusters.J. Guo, I. Kanj, C. Komusiewicz, and J. Uhlmann. Algorithmica, 61 (4): 949-970 (2011)The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions.S. Wernicke, J. Alber, J. Gramm, J. Guo, and R. Niedermeier. Int. J. Found. Comput. Sci., 17 (6): 1467-1484 (2006)Fixed-parameter tractability results for full-degree spanning tree and its dual.J. Guo, R. Niedermeier, and S. Wernicke. Networks, 56 (2): 116-130 (2010)On the parameterized complexity of consensus clustering.M. Dörnfelder, J. Guo, C. Komusiewicz, and M. Weller. Theor. Comput. Sci., (2014)Computing the similarity of two sequences with nested arc annotations.J. Alber, J. Gramm, J. Guo, and R. Niedermeier. Theor. Comput. Sci., 312 (2-3): 337-358 (2004)Exact algorithms and applications for Tree-like Weighted Set Cover.J. Guo, and R. Niedermeier. J. Discrete Algorithms, 4 (4): 608-622 (2006)

PUMA

Disambiguation of "Guo, Jiong"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs.

Please choose a person to relate this publication to

Yanan Guo University of Stuttgart

Other publications of authors with the same name

Disambiguation

PUMA

Disambiguation of "Guo, Jiong"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs.

Please choose a person to relate this publication to

Yanan Guo University of Stuttgart

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs.