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

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

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

職種教授

学会発表
1.	2024/08/24	Approximately Covering Vertices by Order-5 or Longer Paths (The 30th International Computing and Combinatorics Conference)
2.	2023/12/16	An Approximation Algorithm for Covering Vertices by 4+-Paths (The 13th Annual International Conference on Combinatorial Optimization and Applications)
3.	2021/08/18	Approximation algorithms for the directed path partition problems (The 15th International Frontiers of Algorithmics Workshop (FAW'2021))
4.	2019/12/14	Approximation Algorithms for Maximally Balanced Connected Graph Partition (The 13th Annual International Conference on Combinatorial Optimization and Applications)
5.	2019/12/14	A Randomized Approximation Algorithm for Metric Triangle Packing (The 13th Annual International Conference on Combinatorial Optimization and Applications)
6.	2019/09/09	Better Practical Algorithms for rSPR Distance and Hybridization Number (The 19th Workshop on Algorithms in Bioinformatics)
7.	2019/06/04	Computing a Consensus Phylogeny via Leaf Removal (The 15th International Symposium on Bioinformatics Research and Applications)
8.	2018/12/04	Finding a Center Tree of Phylogenetic Trees via Leaf Removal (2018 IEEE International Conference on Bioinformatics and Biomedicine)
9.	2017/11/01	Better ILP Models for Haplotype Assembly (The 28th International Conference on Genome Informatics: bioinformatics)
10.	2017/08/04	Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem (The 23rd International Computing and Combinatorics Conference)
11.	2017/06/24	Designing and Implementing Algorithms for the Closest String Problem (The 11th International Frontiers of Algorithmics Workshop)
12.	2017/05/30	A New 2-Approximation Algorithm for rSPR Distance (The 13th International Symposium on Bioinformatics Research and Applications)
13.	2017/03/30	An Approximation Algorithm for Maximum Internal Spanning Tree (The 11th International Conference and Workshops on Algorithms and Computation)
14.	2016/08/03	An Approximation Algorithm for rSPR Distance (The 22nd International Computing and Combinatorics Conference)
15.	2016/07/01	Better Approximation Algorithms for Scaffolding Problems (The 10th International Frontiers of Algorithmics Workshop)
16.	2016/01/11	Algorithms for Pedigree Comparison (The 14th Asia Pacific Bioinformatics Conference (APBC'2016))
17.	2014	Randomized and Parameterized Algorithms for the Closest String Problem (25th Annual International Symposium on Combinatorial Pattern Matching)
18.	2013	Faster Exact Computation of rSPR Distance (3rd Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management)
19.	2013	Identifying Duplications and Lateral Gene Transfers Simultaneously and Rapidly (2013 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology)
20.	2013	Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (7th Annual International Conference on Combinatorial Optimization and Applications)
21.	2012	The Parameterized Complexity of the Shared Center String Problem (The 23rd Annual International Symposium on Combinatorial Pattern Matching, (CPM'2012))
22.	2012	An Improved Approximation Algorithm for the Bandpass-2 Problem (The 6th Annual International Conference on Combinatorial Optimization and Applications, (COCOA'12))
23.	2010/06	Approximating Maximum Edge 2-Coloring in Simple Graphs (The 6th International Conference on Algorithmic Aspects in Information and Management (AAIM'2010))
24.	2010/06	A Three-String Approach to the Closest String Problem (16th Annual International Computing and Combinatorics Conference (COCOON 2010))
25.	2010/06	A Linear Kernel for Co-Path/Cycle Packing (The 6th International Conference on Algorithmic Aspects in Information and Management (AAIM'2010))
26.	2008/08	An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem (2nd International Conference on Combinatorial Optimization and Applications)
27.	2008/06	Approximating Maximum Edge 2-Coloring in Simple Graphs via Local Improvement (4th International Conference on Algorithmic Aspects in Information and Management)
28.	2008/06	An Improved Randomized Approximation Algorithm for Maximum Triangle Packing (4th International Conference on Algorithmic Aspects in Information and Management)
29.	2007/06	Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats (13th Annual International Computing and Combinatorics Conference)
30.	2007/06	An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs (3rd International Conference on Algorithmic Aspects in Information and Management)
31.	2005/03/01	Inproved Approximation Algorithm for Metric Max TSP, International Workshop on New Horizon in Computing
32.	2005/01/31	Inproved Randomized Approximation Algorithm for Max TSP,冬のシンポジウム
33.	2005/01/31	Improved Deterministic Approximation Algrithms for Max TSP,冬のＬＡシンポジウム
34.	2005	Improved Approximation Algorithms for Metric Max TSP (13th European Symposium on Algorithms (ESA2005))
35.	2004/08	New Bounds on the Number of Edges in a k-Map Graph (10th Annual International Computing and Combinatorics Conference (COCOON2004))
36.	2004/03/19	Computing Bounded-Degree phylogenetic Roots of Disconnected Graphs (情報処理学会アルゴリズム研究会)
37.	2004/02/02	Computing phylogenetic Roots with Bounded Degrees and Errors is Hard, 冬のＬＡシンポジウム
38.	2004/02/02	1－平面グラフを7－彩色する線形時間アルゴリズム、冬のLAシンポジウム
39.	2004	Protein NMR Peak Assignment: Algorithms and Complexity (8th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI2004))
40.	2004	Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard (10th Annual International Computing and Combinatorics Conference (COCOON2004))
41.	2004	Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs (30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2004))
42.	2003	More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling (11th European Symposium on Algorithms (ESA2003))
43.	2003	A Space Efficient Algorithm for Sequence Alignment with Inversions (9th Annual International Computing and Combinatorics Conference (COCOON2003))
44.	2003	A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs (28th International Symposium on Mathematical Foundations of Computer Science (MFCS2003))
45.	2002	マップグラフ上の最大点独立集合問題の近似アルゴリズム (電子情報通信学会コンピュ‐テーション研究会研究報告)
46.	2002	Combinatorial Optimization Algorithms for Assignment of Protein Backbone NMR Peaks (6th ACM Annual International Conference on Research in Computational Molecular Biology (RECOMB 2002))
47.	2002	Better Approximation Algorithms for NMR Spectral Peak Assignment (2nd Workshop on Algorithms in Bioinformatics (WABI2002))
48.	2002	An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks (CSB2002 (the IEEE Computer Society Bioinformatics Conference))
49.	2001/11	Approximation Algorithms for the Constrained Bipartite Matching Problem (日本OR学会関西支部　「離散アルゴリズム研究部会」（招待公演）)
50.	2001/03/13	多面体の表面をガードするためのより効果的なアルゴリズム (情報処理学会第64回全国大会)
51.	2001	The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations (28th International Colloquium on Automata, Languages, and Programming (ICALP2001))
52.	2001	Computing Phylogenetic Roots with Bounded Degrees and Errors (7th International Workshop on Algorithms and Data Structures (WADS2001))
53.	2000	Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs (IFIP International Conference on Theoretical Computer Science (IFIP TCS2000))
54.	2000	Hierarchical Topological Inference on Planar Disc Maps (6th Annual International Computing and Combinatorics Conference (COCOON2000))
55.	2000	Approximation Algorithms for Independent Sets in Map Graphs (6th Annual International Computing and Combinatorics Conference (COCOON2000))
56.	1999	Nonplanar Topological Inference and Political-map Graphs (Annual ACM-SAIM Symposium on Discrete Algorithms (SODA99))
57.	1999	Finding Double Euler Trails of Planar Graphs in Linear Time (40th Annual IEEE Symposium on Foundations of Computer Science (FOCS99))
58.	1998	Planarity, Revisited (Extended Abstract) (5th International Workshop on Algorithms and Data Structures)
59.	1998	Planar Map Graphs (30th Annual ACM Symposium on Theory of Computing (STOC98))
60.	1997	Shortest Path in Complete Bipartite Digraph Problem and its Applications (8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA97))
61.	1997	Reducing Randomness via Irrational Numbers (29th Annual ACM Symposium on Theory of Computing (STOC97))
62.	1997	Parallel Algorithms for Maximal Linear Forests (2nd Workshop on Randomized Parallel Computing)
63.	1997	Approximating Unweighted Connectivity Problems in Parallel (8th International Symposium on Algorithms and Computation (ISAAC97))
64.	1996	Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K3,3-free or K5-free Graphs (23rd International Colloquium on Automata, Languages, and Programming (ICALP96))
65.	1996	Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application (2nd Annual International Computing and Combinatorics Conference (COCOON96))
66.	1995	Parallel Algorithms for Maximal Acyclic Sets (Aizu International Symposium on Parallel Algorithm/Architecture Synthesis)
67.	1995	NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application (6th International Symposium on Algorithms and Computation (ISAAC95))
68.	1995	NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems (21st International Workshop on Graph-Theoretic Concepts in Computer Science (WG95))
69.	1995	NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings (22nd International Colloquium on Automata, Languages, and Programming (ICALP95))
70.	1994	The Maximal f-Dependent Set Problem Is in NC (20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG94))
71.	1993	The Complexity of Selecting Maximal Solutions (8th IEEE Conference on Structure in Complexity Theory (SICT93))
72.	1993	The Complexity of Finding a Minimal Satisfying Truth Assignment to a Boolean Formula (3rd International Conference for Young Computer Scientists (ICYCS93))