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, Jianer"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Edge deletion problems: Branching facilitated by modular decomposition
Yunlong Liu
,
Jianxin Wang
,
Jie You
,
Jianer Chen
,
Yixin Cao
Theoretical Computer Science
573
, 2015, pp. 63-70
An
O^\ast(1.84^k)
parameterized algorithm for the multiterminal cut problem
Yixin Cao
,
Jianer Chen
,
J.-H. Fan
Information Processing Letters
114
(4), 2014, pp. 167-173
Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
Jianer Chen
,
Jia-Hao Fan
,
Sing-Hoi Sze
Theoretical Computer Science
562
, 2014, pp. 496-512
Matching and weighted
P_2
-packing: Algorithms and kernels
Qilong Feng
,
Jianxin Wang
,
Jianer Chen
Theoretical Computer Science
522
, 2014, pp. 85-94
Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
Qilong Feng
,
Jianxin Wang
,
Chao Xu
,
Jinyi Yao
,
Jianer Chen
Theoretical Computer Science
560, Part 2
, 2014, pp. 158-171
Deeper local search for better approximation on maximum internal spanning trees
Wenjun Li
,
Jianer Chen
,
Jianxin Wang
Lecture Notes in Computer Science
8737
, 2014, pp. 642-653
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks
Weizhong Luo
,
Jianxin Wang
,
Jiong Guo
,
Jianer Chen
Theoretical Computer Science
518
, 2014, pp. 32-41
Approximation algorithms for maximum agreement forest on multiple trees
Feng Shi
,
Jianer Chen
,
Qilong Feng
,
Jianxin Wang
Lecture Notes in Computer Science
8591
, 2014, pp. 381-392
Algorithms for parameterized maximum agreement forest problem on multiple trees
Feng Shi
,
Jianxin Wang
,
Jianer Chen
,
Qilong Feng
,
Jiong Guo
Theoretical Computer Science
554
, 2014, pp. 207-216
Parameterized and approximation algorithms for the MAF problem in multifurcating trees
Jianer Chen
,
Jia-Hao Fan
,
Sing-Hoi Sze
Lecture Notes in Computer Science
8165
, 2013, pp. 152-164
Parameterized top-
K
algorithms
Jianer Chen
,
Iyad A. Kanj
,
Jie Meng
,
Ge Xia
,
Fenghui Zhang
Theoretical Computer Science
470
, 2013, pp. 105-119
Random methods for parameterized problems
Qilong Feng
,
Jianxin Wang
,
Shaohua Li
,
Jianer Chen
Lecture Notes in Computer Science
7936
, 2013, pp. 89-100
An effective branching strategy for some parameterized edge modification problems with multiple forbidden induced subgraphs
Yunlong Liu
,
Jianxin Wang
,
Chao Xu
,
Jiong Guo
,
Jianer Chen
Lecture Notes in Computer Science
7936
, 2013, pp. 555-566
Improved linear problem kernel for planar connected dominating set
Weizhong Luo
,
Jianxin Wang
,
Qilong Feng
,
Jiong Guo
,
Jianer Chen
Theoretical Computer Science
511
, 2013, pp. 2-12
Parameterized algorithms for maximum agreement forest on multiple trees
Feng Shi
,
Jianer Chen
,
Qilong Feng
,
Jianxin Wang
Lecture Notes in Computer Science
7936
, 2013, pp. 567-578
Planar graph vertex partition for linear problem kernels
Jianxin Wang
,
Yongjie Yang
,
Jiong Guo
,
Jianer Chen
Journal of Computer and System Sciences
79
(5), 2013, pp. 609-621
Cluster editing: Kernelization based on edge cuts
Yixin Cao
,
Jianer Chen
Algorithmica
64
(1), 2012, pp. 152-169
Multicut in trees viewed through the eyes of vertex cover
Jianer Chen
,
Jia-Hao Fan
,
Iyad Kanj
,
Yang Liu
,
Fenghui Zhang
Journal of Computer and System Sciences
78
(5), 2012, pp. 1637-1650
A
2k
kernel for the cluster editing problem
Jianer Chen
,
Jie Meng
Journal of Computer and System Sciences
78
(1), 2012, pp. 211-220
Complexity and parameterized algorithms for Cograph Editing
Yunlong Liu
,
Jianxin Wang
,
Jiong Guo
,
Jianer Chen
Theoretical Computer Science
461
, 2012, pp. 45-54
Multicut in trees viewed through the eyes of vertex cover
Jianer Chen
,
Jia-Hao Fan
,
Iyad A. Kanj
,
Yang Liu
,
Fenghui Zhang
Lecture Notes in Computer Science
6844
, 2011, pp. 219-230
Improved deterministic algorithms for weighted matching and packing problems
Jianer Chen
,
Qilong Feng
,
Yang Liu
,
Songjian Lu
,
Jianxin Wang
Theoretical Computer Science
412
(23), 2011, pp. 2503-2512
Matching and
P_2
-packing: Weighted versions
Qilong Feng
,
Jianxin Wang
,
Jianer Chen
Lecture Notes in Computer Science
6842
, 2011, pp. 343-353
Cograph editing: Complexity and parameterized algorithms
Yunlong Liu
,
Jianxin Wang
,
Jiong Guo
,
Jianer Chen
Lecture Notes in Computer Science
6842
, 2011, pp. 110-121
An
O^*(3.53^{3k})
-time parameterized algorithm for the 3-set packing problem
Jianxin Wang
,
Qilong Feng
,
Jianer Chen
Theoretical Computer Science
412
(18), 2011, pp. 1745-1753
Seiten 1
2
3
4
5
>