Zhi-Zhong Chen

Kuniteru Hayashi

Algorithmica, May, 2024

2023

Randomized algorithms for fully online multiprocessor scheduling with testing.

[BibT_eX]

[DOI]

Mingyang Gong

CoRR, 2023

An Approximation Algorithm for Covering Vertices by 4^+-Paths.

[BibT_eX]

[DOI]

CoRR, 2023

An Approximation Algorithm for Covering Vertices by 4+-Paths.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Approximation algorithms for the maximally balanced connected graph tripartition problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Identifying duplications and lateral gene transfers simultaneously and rapidly.

[BibT_eX]

[DOI]

Fei Deng

J. Bioinform. Comput. Biol., 2022

2021

A randomized approximation algorithm for metric triangle packing.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Approximation Algorithms for Maximally Balanced Connected Graph Partition.

[BibT_eX]

[DOI]

Algorithmica, 2021

Approximation Algorithms for the Directed Path Partition Problems.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Algorithmics - International Joint Conference, 2021

2020

Faster Exact Computation of rSPR Distance via Better Approximation.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2020

Improved Practical Algorithms for Rooted Subtree Prune and Regraft (rSPR) Distance and Hybridization Number.

[BibT_eX]

[DOI]

Kohei Yamada

J. Comput. Biol., 2020

Computing a Consensus Phylogeny via Leaf Removal.

[BibT_eX]

[DOI]

J. Comput. Biol., 2020

Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2020

2019

Designing and implementing algorithms for the closest string problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem.

[BibT_eX]

[DOI]

Algorithmica, 2019

Better Practical Algorithms for rSPR Distance and Hybridization Number.

[BibT_eX]

[DOI]

Kohei Yamada

Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

2018

Approximation algorithms for the scaffolding problem and its generalizations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Algorithms for Pedigree Comparison.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2018

An approximation algorithm for maximum internal spanning tree.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Better ILP models for haplotype assembly.

[BibT_eX]

[DOI]

BMC Bioinform., 2018

Finding a Center Tree of Phylogenetic Trees via Leaf Removal.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018

2017

A New 2-Approximation Algorithm for rSPR Distance.

[BibT_eX]

[DOI]

Youta Harada

Proceedings of the Bioinformatics Research and Applications - 13th International Symposium, 2017

2016

Better ILP-Based Approaches to Haplotype Assembly.

[BibT_eX]

[DOI]

J. Comput. Biol., 2016

Computational Complexity of Predicting Periodicity in the Models of Lorentz Lattice Gas Cellular Automata.

[BibT_eX]

[DOI]

Takeo Hagiwara

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Parameterized Algorithms for Disjoint Matchings in Weighted Graphs with Applications.

[BibT_eX]

[DOI]

Hiroki Yamada

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

A Cubic-Time 2-Approximation Algorithm for rSPR Distance.

[BibT_eX]

[DOI]

Eita Machida

CoRR, 2016

Approximation algorithms for the maximum weight internal spanning tree problem.

[BibT_eX]

[DOI]

CoRR, 2016

An Approximation Algorithm for Maximum Internal Spanning Tree.

[BibT_eX]

[DOI]

Youta Harada

CoRR, 2016

Randomized Fixed-Parameter Algorithms for the Closest String Problem.

[BibT_eX]

[DOI]

Bin Ma

Algorithmica, 2016

Better Approximation Algorithms for Scaffolding Problems.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

An Improved Approximation Algorithm for rSPR Distance.

[BibT_eX]

[DOI]

Eita Machida

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Faster exact computation of rSPR distance.

[BibT_eX]

[DOI]

Ying Fan

J. Comb. Optim., 2015

2014

Parameterized and approximation algorithms for finding two disjoint matchings.

[BibT_eX]

[DOI]

Ying Fan

Theor. Comput. Sci., 2014

The Parameterized Complexity of the Shared Center Problem.

[BibT_eX]

[DOI]

Wenji Ma

Algorithmica, 2014

Randomized and Parameterized Algorithms for the Closest String Problem.

[BibT_eX]

[DOI]

Bin Ma

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

An Ultrafast Tool for Minimum Reticulate Networks.

[BibT_eX]

[DOI]

J. Comput. Biol., 2013

An approximation algorithm for the Bandpass-2 problem.

[BibT_eX]

[DOI]

CoRR, 2013

Exact algorithms for haplotype assembly from whole-genome sequence data.

[BibT_eX]

[DOI]

Fei Deng

Bioinform., 2013

Faster Exact Computation of rSPR Distance.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2013

2012

Mutation Region Detection for Closely Related Individuals without a Known Pedigree.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Algorithms for Reticulate Networks of Multiple Phylogenetic Trees.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Simultaneous Identification of Duplications, Losses, and Lateral Gene Transfers.

[BibT_eX]

[DOI]

Fei Deng

IEEE ACM Trans. Comput. Biol. Bioinform., 2012

A three-string approach to the closest string problem.

[BibT_eX]

[DOI]

Bin Ma

J. Comput. Syst. Sci., 2012

A fast tool for minimum hybridization networks.

[BibT_eX]

[DOI]

Satoshi Yamanaka

BMC Bioinform., 2012

An Improved Approximation Algorithm for the Bandpass-2 Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2012

2011

Fast Exact Algorithms for the Closest String and Substring Problems with Application to the Planted (L, d)-Motif Model.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

An Approximation Algorithm for the Minimum Co-Path Set Problem.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

A Deterministic Approximation Algorithm for Maximum 2-Path Packing.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2010

Erratum to "An improved randomized approximation algorithm for maximum triangle packing" [Discrete Appl. Math. 157 (2009) 1640-1646]

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Approximating maximum edge 2-coloring in simple graphs.

[BibT_eX]

[DOI]

Sayuri Konno

Yuki Matsushita

Discret. Appl. Math., 2010

HybridNET: a tool for constructing hybridization networks.

[BibT_eX]

[DOI]

Bioinform., 2010

A Linear Kernel for Co-Path/Cycle Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

Approximating maximum edge 2-coloring in simple graphs via local improvement.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A 3.4713-approximation algorithm for the capacitated multicast tree routing problem.

[BibT_eX]

[DOI]

Zhipeng Cai

Theor. Comput. Sci., 2009

Improved Approximation Algorithms for Reconstructing the History of Tandem Repeats.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2009

An improved randomized approximation algorithm for maximum triangle packing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats.

[BibT_eX]

[DOI]

Zhanyong Wang

Algorithmica, 2009

2008

Optimizing deletion cost for secure multicast key management.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

An improved approximation algorithm for maximum edge 2-coloring in simple graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Approximation Algorithms for Bounded Degree Phylogenetic Roots.

[BibT_eX]

[DOI]

Algorithmica, 2008

An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Preface.

[BibT_eX]

[DOI]

Xiaotie Deng

Ding-Zhu Du

Theor. Comput. Sci., 2007

New bounds on the edge number of a k-map graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

Improved approximation algorithms for metric MaxTSP.

[BibT_eX]

[DOI]

Takayuki Nagoya

J. Comb. Optim., 2007

An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Computing phylogenetic roots with bounded degrees and errors is NP-complete.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Computing bounded-degree phylogenetic roots of disconnected graphs.

[BibT_eX]

[DOI]

J. Algorithms, 2006

Recognizing Hole-Free 4-Map Graphs in Cubic Time.

[BibT_eX]

[DOI]

Algorithmica, 2006

2005

An Improved Randomized Approximation Algorithm for Max TSP.

[BibT_eX]

[DOI]

J. Comb. Optim., 2005

More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling.

[BibT_eX]

[DOI]

J. Comput. Biol., 2005

Heuristic Search in Constrained Bipartite Matching with Applications to Protein Nmr Backbone Resonance Assignment.

[BibT_eX]

[DOI]

Theodore Tegos

J. Bioinform. Comput. Biol., 2005

Improved deterministic approximation algorithms for Max TSP.

[BibT_eX]

[DOI]

Yuusuke Okamoto

Inf. Process. Lett., 2005

A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs.

[BibT_eX]

[DOI]

Mitsuharu Kouno

Algorithmica, 2005

Improved Approximation Algorithms for Metric Max TSP.

[BibT_eX]

[DOI]

Takayuki Nagoya

Proceedings of the Algorithms, 2005

2004

A space-efficient algorithm for sequence alignment with inversions and reversals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Disk Embeddings of Planar Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2004

Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

New Bounds on the Number of Edges in a k-Map Graph.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Approximation algorithms for NMR spectral peak assignment.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Computing Phylogenetic Roots with Bounded Degrees and Errors.

[BibT_eX]

[DOI]

Tao Jiang

SIAM J. Comput., 2003

Common-Face Embeddings of Planar Graphs.

[BibT_eX]

[DOI]

Ming-Yang Kao

SIAM J. Comput., 2003

Computational Assignment of Protein Backbone Nmr Peaks Byefficient Bounding and Filtering.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2003

A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs.

[BibT_eX]

[DOI]

Mitsuharu Kouno

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

A Space Efficient Algorithm for Sequence Alignment with Inversions.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Finding Double Euler Trails of Planar Graphs in Linear Time.

[BibT_eX]

[DOI]

Chun-Hsi Huang

SIAM J. Comput., 2002

The longest common subsequence problem for sequences with nested arc annotations.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

Map graphs.

[BibT_eX]

[DOI]

J. ACM, 2002

Tight upper bound on the number of edges in a bipartite K3, 3-free or K5-free graph with an application.

[BibT_eX]

[DOI]

Shiqing Zhang

Inf. Process. Lett., 2002

Improved Approximation Algorithms for NMR Spectral Peak Assignment.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks.

[BibT_eX]

[DOI]

Proceedings of the 1st IEEE Computer Society Bioinformatics Conference, 2002

2001

Approximation Algorithms for Independent Sets in Map Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 2001

Approximating Unweighted Connectivity Problems in Parallel.

[BibT_eX]

[DOI]

Inf. Comput., 2001

2000

Efficient Algorithms for Acyclic Colorings of Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Reducing Randomness via Irrational Numbers.

[BibT_eX]

[DOI]

Ming-Yang Kao

SIAM J. Comput., 2000

Parallel approximation algorithms for maximum weighted matching in general graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2000

Hierarchical Topological Inference on Planar Disc Maps.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Fast RNC and NC Algorithms for Maximal Path Sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Nonplanar Topological Inference and Political-Map Graphs.

[BibT_eX]

[DOI]

Ming-Yang Kao

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Efficient Approximation Schemes for Maximization Problems on K3,3-free or K5-free Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1998

Planar Map Graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997

Parallel Algorithms for Maximal Acyclic Sets.

[BibT_eX]

[DOI]

Algorithmica, 1997

Panarity, Revisited (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Shortest Path in Complete Bipartite Digraph Problem and its Applications.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

The Complexity of Selecting Maximal Solutions

[BibT_eX]

[DOI]

Seinosuke Toda

Inf. Comput., June, 1995

The Maximal f-Dependent Set Problem for Planar Graphs is in NC.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

A Fast and Efficient NC Algorithm for Maximal Matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994

A Parallel Algorithm for Finding a Triconnected Component Separator with an Application.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

1992

A Fast and Efficient Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

A Simple Parallel Algorithm for Computing the Diameters of all Vertices in a Tree and its Application.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

1991

A Randomized NC Algorithm for the Maximal Tree Cover Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

On the Complexity of Computing Optimal Solutions.

[BibT_eX]

[DOI]

Seinosuke Toda

Int. J. Found. Comput. Sci., 1991

1989

Probabilistic automata push-down.

[BibT_eX]

[DOI]