7 citations · 17 across the 15 of their papers we have counts for
16 papers
The Minimum Number of Edges in -Saturated Graphs
Xiaoteng Zhou, Kazuya Haraguchi, Hanchun Yuan
Given a family of graphs , a graph is -saturated if it is -free but the addition of any missing edge creates a copy of some $F \in \mathc…
Enumeration of Bases in Matroid with Exponentially Large Ground Set
Yuki Nishimura, Kazuya Haraguchi
When we deal with a matroid , we usually assume that it is implicitly given by means of the independence (IND) oracle. Time complexity of many existi…
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi +3
A novel framework for designing the molecular structure of chemical compounds with a desired chemical property has recently been proposed. The framework infers a desired chemical g…
A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs
Takumi Tada, Kazuya Haraguchi
For a set system , we call a subset a component. A nonempty subset is a minimal removable set (MRS) of if $C\se…
Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model
Jianshen Zhu, Naveed Ahmed Azam, Shengjuan Cao +5
A novel framework has recently been proposed for designing the molecular structure of chemical compounds with a desired chemical property, where design of novel drugs is an importa…
A Method for Inferring Polymers Based on Linear Regression and Integer Programming
Ryota Ido, Shengjuan Cao, Jianshen Zhu +5
A novel framework has recently been proposed for designing the molecular structure of chemical compounds with a desired chemical property using both artificial neural networks and…
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search
Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi +3
A novel framework has recently been proposed for designing the molecular structure of chemical compounds with a desired chemical property using both artificial neural networks and…
An Inverse QSAR Method Based on Linear Regression and Integer Programming
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi +3
Recently a novel framework has been proposed for designing the molecular structure of chemical compounds using both artificial neural networks (ANNs) and mixed integer linear progr…
A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming
Tatsuya Akutsu, Hiroshi Nagamochi
Analysis of chemical graphs is becoming a major research topic in computational molecular biology due to its potential applications to drug design. One of the major approaches in s…
Design of Polynomial-delay Enumeration Algorithms in Transitive Systems
Kazuya Haraguchi, Hiroshi Nagamochi
In this paper, as a new notion, we define a transitive system to be a set system on a finite set of elements such that every three sets $X,Y,Z\…
Polynomial-delay Enumeration Algorithms in Set Systems
Kazuya Haraguchi, Hiroshi Nagamochi
We consider a set system on a finite set of elements, where we call a set a component. We assume that two oracles $\mathrm{…
Maximum Weighted Matching with Few Edge Crossings for 2-Layered Bipartite Graph
Kazuya Haraguchi, Kotaro Torii, Motomu Endo
Let c denote a non-negative constant. Suppose that we are given an edge-weighted bipartite graph G=(V,E) with its 2-layered drawing and a family X of intersecting edge pairs. We co…
Recycling Solutions for Vertex Coloring Heuristics
Yasutaka Uchida, Kaito Yajima, Kazuya Haraguchi
The vertex coloring problem is a well-known NP-hard problem and has many applications in operations research and in scheduling. A conventional approach to the problem solves the k-…
An Efficient Local Search for the Minimum Independent Dominating Set Problem
Kazuya Haraguchi
In the present paper, we propose an efficient local search for the minimum independent dominating set problem. We consider a local search that uses -swap as the neighborhood ope…
On A Generalization of "Eight Blocks to Madness"
Kazuya Haraguchi
We consider a puzzle such that a set of colored cubes is given as an instance. Each cube has unit length on each edge and its surface is colored so that what we call the Surface Co…
An Efficient Local Search for Partial Latin Square Extension Problem
Kazuya Haraguchi
A partial Latin square (PLS) is a partial assignment of n symbols to an nxn grid such that, in each row and in each column, each symbol appears at most once. The partial Latin squa…