Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Chen, Wenbin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Solving the maximum duo-preservation string mapping problem with linear programming
Wenbin Chen
,
Zhengzhang Chen
,
Nagiza F. Samatova
,
Lingxi Peng
,
Jianxiong Wang
,
Maobin Tang
Theoretical Computer Science
530
, 2014, pp. 1-11
Inapproximability results for the minimum integral solution problem with preprocessing over
\ell_{\infty}
norm
Wenbin Chen
,
Lingxi Peng
,
Jianxiong Wang
,
Fufang Li
,
Maobin Tang
,
Wei Xiong
,
Songtao Wang
Theoretical Computer Science
478
, 2013, pp. 127-131
Inapproximability results for equations over infinite groups
WenBin Chen
,
Dengpan Yin
,
Zhengzhang Chen
Theoretical Computer Science
411
(26-28), 2010, pp. 2513-2519
On parameterized complexity of the Multi-MCS problem
Wenbin Chen
,
Matthew C. Schmidt
,
Nagiza F. Samatova
Theoretical Computer Science
410
(21-23), 2009, pp. 2024-2032
An improved lower bound for approximating minimum GCD multiplier in
l \infty
norm
(GCDM \infty)
WenBin Chen
,
Jiangtao Meng
,
Dengpan Yin
Theoretical Computer Science
396
(1-3), 2008, pp. 1-9
An improved lower bound for approximating Shortest Integer Relation in
l _\infty
norm
(SIR _\infty)
Wenbin Chen
,
Jiangtao Meng
Information Processing Letters
101
(4), 2007, pp. 174-179
Hardness of approximating the Minimum Solutions of Linear Diophantine Equations
Wenbin Chen
,
Jiangtao Meng
Theoretical Computer Science
374
(1-3), 2007, pp. 191-195