Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Hideaki OTSUKI
Inapproximability of the Minimum Biclique Edge Partition Problem
IEICE Transactions on Information and Systems
Electronic Engineering
Pattern Recognition
Hardware
Computer Vision
Electrical
Architecture
Artificial Intelligence
Software
Related publications
On the Minimum Common Integer Partition Problem
ACM Transactions on Algorithms
Mathematics
A Heuristic for the Minimum Cost Chromatic Partition Problem
RAIRO - Operations Research
Management Science
Computer Science Applications
Operations Research
Theoretical Computer Science
An Integer Programming Formulation of the Minimum Common String Partition Problem
PLoS ONE
Multidisciplinary
An Edge-Based Crossover for the Capacitated Minimum Spanning Tree Problem
Fully Dynamic Quasi-Biclique Edge Covers via Boolean Matrix Factorizations
Balanced Partition of Minimum Spanning Trees
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The Minimum K-Cover Problem
Applied Mathematical Sciences
Simulation as Coarsest Partition Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The Complexity of the List Partition Problem for Graphs
SIAM Journal on Discrete Mathematics
Mathematics
