教員情報 - 陳　致中 | 東京電機大学

チェン　チチュウ CHEN Zhi-Zhong
陳　致中

所属東京電機大学理工学部理工学科　情報システムデザイン学系

職種教授

著書・論文歴
1.	論文	Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time Algorithmica 86 (5),1400-1427頁 (共著) 2024/05
2.	論文	An Approximation Algorithm for Covering Vertices by 4+-Paths Proceedings of the 17th International Conference on Combinatorial Optimization and Applications (COCOA2023) 14461,459-470頁 (共著) 2023/12/15
3.	論文	Approximation algorithms for the maximally balanced connected graph tripartition problem Journal of Combinatorial Optimization 44 (3),1753-1773頁 (共著) 2022/10
4.	論文	Identifying Duplications and Lateral Gene Transfers Simultaneously and Rapidly Journal of Bioinformatics and Computational Biology 20 (1),2150033-1-2150033-26頁 (共著) 2022/01
5.	論文	Approximation Algorithms for Maximally Balanced Connected Graph Partition Algorithmica 83 (12),3715-3740頁 (共著) 2021/01
6.	論文	A randomized approximation algorithm for metric triangle packing Journal of Combinatorial Optimization 41 (1),12-27頁 (共著) 2021/01
7.	論文	Approximation Algorithms for the Directed Path Partition Problems Lecture Notes in Computer Science 12874,23-36頁 (共著) 2021/08
8.	論文	Improved Practical Algorithms for rSPR Distance and Hybridization Number. Journal of Computational Biology 27 (9),1422-1432頁 (共著) 2020/09
9.	論文	Computing a Consensus Phylogeny via Leaf Removal. Journal of Computational Biology 27 (2),175-188頁 (共著) 2020/02
10.	論文	Faster Exact Computation of rSPR Distance via Better Approximation IEEE ACM Trans. Comput. Biol. Bioinform. 17 (3),916-929頁 (共著) 2020/02
11.	論文	Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs Algorithmica 82 (10),3041-3064頁 (共著) 2020/01
12.	論文	Computing a Consensus Phylogeny via Leaf Removal Proceedings of 15th International Symposium on Bioinformatics Research and Applications,3-15頁 (共著) 2019
13.	論文	Better Practical Algorithms for rSPR Distance and Hybridization Number Porceedings of 19th Workshop on Algorithms in Bioinformatics,5:1-5:12頁 (共著) 2019
14.	論文	A Randomized Approximation Algorithm for Metric Triangle Packing Porceedings of 13th Annual International Conference on Combinatorial Optimization and Applications,119-129頁 (共著) 2019
15.	論文	Approximation Algorithms for Maximally Balanced Connected Graph Partition Porceedings of 13th Annual International Conference on Combinatorial Optimization and Applications,130-141頁 (共著) 2019
16.	論文	Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem Algorithmica 81 (11-12),4167-4199頁 (共著) 2019
17.	論文	Better Practical Algorithms for rSPR Distance and Hybridization Number Porceedings of WABI 2019 143,5:1-5:12頁 (共著) 2019/09
18.	論文	Computing a Consensus Phylogeny via Leaf Removal Lecture Notes in Bioinformatics (Proceedings of ISBRA 2019) 11490,3-15頁 (共著) 2019/06
19.	論文	Designing and Implementing Algorithms for the Closest String Problem Theoretical Computer Science 786,32-43頁 (共著) 2019
20.	論文	Finding a Center Tree of Phylogenetic Trees via Leaf Removal Proceedings of BIBM 2018 (共著) 2018
21.	論文	Better ILP Models for Haplotype Assembly BMC Bioinformatics 19-S(1),11-21頁 (共著) 2018
22.	論文	An Approximation Algorithm for Maximum Internal Spanning Tree Journal of Combinatorial Optimization 35 (3),995-979頁 (共著) 2018
23.	論文	Approximation Algorithms for the Scaffolding Problem and Its Generalizations. Theoretical Computer Science 734,131-141頁 (共著) 2018
24.	論文	Algorithms for Pedigree Comparison 15 (2),422-431頁 (共著) 2018
25.	論文	Better ILP-Based Approaches to Haplotype Assembly Journal of Computational Biology 23 (7),537-552頁 (共著) 2018
26.	論文	A New 2-Approximation Algorithm for rSPR Distance Proceedings of ISBRA 2017,128-139頁 (共著) 2017
27.	論文	Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem Proceedings of COCOON 2017,124-136頁 (共著) 2017
28.	論文	Parameterized Algorithms for Disjoint Matchings in Weighted Graphs with Applications. IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences E99-A (6),1050-1058頁 (共著) 2016
29.	論文	Randomized Fixed-Parameter Algorithms for the Closest String Problem Algorithmica 74 (1),466-484頁 (共著) 2016
30.	論文	An Approximation Algorithm for rSPR Distance Lecture Notes in Computer Science 9797,468-479頁 (共著) 2016
31.	論文	Faster Exact Computation of rSPR Distance Journal of Combinatorial Optimization 29 (3),605-635頁 (共著) 2015
32.	論文	The Parameterized Complexity of the Shared Center Problem Algorithmica 69 (2),269-293頁 (共著) 2014
33.	論文	Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings Theoretical Computer Science 556,85-93頁 (共著) 2014
34.	論文	Exact Algorithms for Haplotype Assembly from Whole-Genome Sequence Data Bioinformatics 29 (16),1938-1945頁 (共著) 2013
35.	論文	An Ultrafast Tool for Minimum Reticulate Networks 20 (1),38-41 (共著) 2013
36.	論文	Identifying Duplications and Lateral Gene Transfers Simultaneously and Rapidly Proceedings of 2013 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational,128-135頁 (共著) 2013
37.	論文	Simultaneous Identification of Duplications, Losses, and Lateral Gene Transfers (共著) 2012
38.	論文	Algorithms for Reticulate Networks of Multiple Phylogenetic Trees (共著) 2012
39.	論文	Mutation Region Detection for Closely Related Individuals without a Known Pedigree (共著) 2012
40.	論文	A Fast Tool for Minimum Hybridization Networks (共著) 2012
41.	論文	A Three-String Approach to the Closest String Problem (共著) 2012
42.	論文	An Improved Approximation Algorithm for the Bandpass-2 Problem Lecture Notes in Computer Science 7402,188-199頁 (共著) 2012
43.	論文	An Approximation Algorithm for the Minimum Co-Path Set Problem (共著) 2011
44.	論文	Fast Exact Algorithms for the Closest String and Substring Problems with Application to the Planted (L,d)-Motif Model (共著) 2011
45.	論文	HybridNET: a Tool for Constructing Hybridization Networks 26 (22),2912-2913 (共著) 2010
46.	論文	Approximating Maximum Edge 2-Coloring in Simple Graphs 158,1894-1901 (共著) 2010
47.	論文	A 3.4713-Approximation Algorithm for the Capacitated Multicast Tree Routing Problem 410 (52),5415-5424 (共著) 2009
48.	論文	Approximating Maximum Edge 2-Coloring in Simple Graphs via Local Improvement 410 (45),4543-4553 (共著) 2009
49.	論文	Improved Approximation Algorithms for Reconstructing the History of Tandem Repeats 6 (3),438-453 (共著) 2009
50.	論文	Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats 54 (4),501-529 (共著) 2009
51.	論文	An Improved Randomized Approximation Algorithm for Maximum Triangle Packing 157,1640-1646 (共著) 2009
52.	論文	Optimizing Deletion Cost for Secure Multicast Key Management 401 (1-3),52-61 (共著) 2008
53.	論文	Approximation Algorithms for Bounded Degree Phylogenetic Roots 51 (1),1-23 (単著) 2008
54.	論文	An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs 6 (2),205-215 (共著) 2008
55.	論文	New Bounds on the Edge Number of a k-Map Graph 55 (4),267-290 (単著) 2007
56.	論文	Improved Approximation Algorithms for Metric Max TSP 13,321-336 (共著) 2007
57.	著書	確率アルゴリズム情報システムと情報技術事典 (共著) 2006/06
58.	論文	Recognizing Hole-Free 4-Map Graphs in Cubic Time. 45,227-262 (共著) 2006
59.	論文	Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard. 363 (1),43-59 (共著) 2006
60.	論文	Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs. 59 (2),125-148 (共著) 2006
61.	論文	More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling 12 (2),129-146 (共著) 2005
62.	論文	Improved Deterministic Approximation Algorithms for Max TSP 95 (2),333-342 (共著) 2005
63.	論文	Heuristic search in constrained bipartite matching with applications to protein NMR backbone resonance assignment 3 (6),1331-1350 (共著) 2005
64.	論文	An Improved Randomized Approximation Algorithm for Max TSP. 9 (4),401-432 (共著) 2005
65.	論文	A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs. 43 (3),147-177 (共著) 2005
66.	論文	Disc Embeddings of Planar Graphs 38 (4),539-576 (共著) 2004
67.	論文	A Space Efficient Algorithm for Sequence Alignment with Inversions and Reversals 325,361-372 (共著) 2004
68.	論文	Computing Phylogenetic Roots with Bounded Degrees and Errors 32 (4),864-879 (共著) 2003
69.	論文	Computational Assignment of Protein Backbone NMR Peaks by Efficient Bounding and Filtering 1,387--410 (共著) 2003
70.	論文	Common-face Embeddings of Planar Graphs 32 (2),408-434 (共著) 2003
71.	論文	Approximation Algorithms for NMR Spectral Peak Assignment 299,211-229 (共著) 2003
72.	論文	Upper Bound on the Number of Edges in a Bipartite K3,3-free or K5-free Graph with an Application 84 (3),141--145 (共著) 2002
73.	論文	The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations 65 (3),465-480 (共著) 2002
74.	論文	Map Graphs 49 (2),127-138 (共著) 2002
75.	論文	Finding Double Euler Trails of Planar Graphs in Linear Time 31 (4),1255-1285 (共著) 2002
76.	著書	確率アルゴリズムアルゴリズム工学 --計算困難問題への挑戦--,60-66 (共著) 2001
77.	論文	Approximation Algorithms for Independent Sets in Map Graphs 41,20-40 (単著) 2001
78.	論文	Approximating Unweighted Connectivity Problems in Parallel 171,125-136 (単著) 2001
79.	論文	Reducing Randomness via Irrational Numbers 29 (4),1247-1256 (共著) 2000
80.	論文	Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs 76,13-17 (共著) 2000
81.	論文	Fast RNC and NC Algorithms for Maximal Path Sets 215,89-98 (共著) 1999
82.	論文	Efficient Algorithms for Acyclic Colorings of Graphs 230,75-95 (単著) 1999
83.	論文	An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications 29 (1),65-80 (共著) 1999
84.	論文	Efficient Approximation Schemes for Maximization Problems on K3,3-free or K5-free Graphs 26,166-187 (単著) 1998
85.	論文	Parallel Algorithms for Maximal Linear Forests E80-A,627-634 (共著) 1997
86.	論文	Parallel Algorithms for Maximal Acylic Sets 19,354-368 (共著) 1997
87.	論文	Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings 161,1-21 (単著) 1996
88.	論文	Parallel Complexity of Partitioning a Planar Graph into Vertex-Induced Forests 69,183-198 (共著) 1996
89.	論文	The Maximal f-Dependent Set Problem for Planar Graphs Is in NC 143,309-318 (単著) 1995
90.	論文	The Complexity of Selecting Maximal Solutions 119,231-239 (共著) 1995
91.	論文	A Fast and Efficieint NC Algorithm for Maximal Matching 55,303-307 (単著) 1995
92.	論文	A Parallel Algorithm for Finding a Triconnected Component Separator with an Application 52,265-271 (単著) 1994
93.	論文	Parallel Algorithms for the Maximal Tree Cover Problems E75-D,30-34 (共著) 1992
94.	論文	A Simple Parallel Algorithm for Computing the Diameters of All Vertices in a Tree and Its Application 42,243-248 (単著) 1992
95.	論文	A Fast and Efficient Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Boolean Formula 43,191-193 (単著) 1992
96.	論文	On the Complexity of Computing Optimal Solutions 2,207-220 (共著) 1991
97.	論文	A Randomized NC Algorithm for the Maximal Tree Cover Problem 40,241-246 (単著) 1991
98.	論文	Grammatical Characterizations of P and PSPACE E73 (9),1540-1548 (共著) 1990
99.	論文	確率プッシュダウンオートマトンについて電子情報通信学会論文誌 J71-D (5),766-773 (共著) 1988