
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search
A novel framework has recently been proposed for designing the molecular...
read it

An Inverse QSAR Method Based on Linear Regression and Integer Programming
Recently a novel framework has been proposed for designing the molecular...
read it

BoundedDegree Cut is FixedParameter Tractable
In the boundeddegree cut problem, we are given a multigraph G=(V,E), tw...
read it

A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming
Analysis of chemical graphs is becoming a major research topic in comput...
read it

A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branchheight Based on Artificial Neural Networks and Integer Programming
Analysis of chemical graphs is a major research topic in computational m...
read it

Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications
Enumerating chemical graphs satisfying given constraints is a fundamenta...
read it

Polynomialdelay Enumeration Algorithms in Set Systems
We consider a set system (V, 𝒞⊆ 2^V) on a finite set V of elements, wher...
read it

Enumerating Chemical Graphs with Monoblock 2Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies
We consider a problem of enumerating chemical graphs from given constrai...
read it

Design of Polynomialdelay Enumeration Algorithms in Transitive Systems
In this paper, as a new notion, we define a transitive system to be a se...
read it

Characterizing StarPCGs
A graph G is called a pairwise compatibility graph (PCG, for short) if i...
read it

Some Reduction Operations to Pairwise Compatibility Graphs
A graph G=(V,E) with a vertex set V and an edge set E is called a pairwi...
read it
Hiroshi Nagamochi
is this you? claim profile