Wenbin Chen

Works (3)

Updated: July 5th, 2023 15:50

2010 journal article

Inapproximability results for equations over infinite groups

Theoretical Computer Science, 411(26-28), 2513–2519.

By: W. Chen, D. Yin & Z. Chen

Source: NC State University Libraries
Added: August 6, 2018

2009 journal article

On parameterized complexity of the Multi-MCS problem

THEORETICAL COMPUTER SCIENCE, 410(21-23), 2024–2032.

By: W. Chen n, M. Schmidt n & N. Samatova n

author keywords: Algorithms; Maximum common subgraph; Parameterized complexity; Linear FPT reduction
TL;DR: The maximum common subgraph problem for multiple graphs (Multi-MCS) inspired by various biological applications such as multiple alignments of gene sequences, protein structures, metabolic pathways, or protein-protein interaction networks is introduced. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Source: Web Of Science
Added: August 6, 2018

2009 journal article

On the parameterized complexity of the Multi-MCT and Multi-MCST problems

JOURNAL OF COMBINATORIAL OPTIMIZATION, 21(2), 151–158.

By: W. Chen n, M. Schmidt n & N. Samatova n

author keywords: Multi-MCT; Multi-MCST; W-hierarchy; Parameterized complexity; Computational complexity
TL;DR: This paper proves parameterized complexity hardness results for the different parameterized versions of the Multi-MCT and Multi-MCST problem under isomorphic embeddings. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2025) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.