Hiroshi Nagamochi

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat A Method for Inferring Polymers Based on Linear Regression and Integer Programming 2024 Ryota Ido
Shengjuan Cao
Jianshen Zhu
Naveed Ahmed Azam
Kazuya Haraguchi
Liang Zhao
Hiroshi Nagamochi
Tatsuya Akutsu
+ PDF Chat Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes 2024 Jianshen Zhu
Naveed Ahmed Azam
Kazuya Haraguchi
Liang Zhao
Hiroshi Nagamochi
Tatsuya Akutsu
+ PDF Chat Polynomial-delay enumeration algorithms in set systems 2023 Kazuya Haraguchi
Hiroshi Nagamochi
+ Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes 2023 Jianshen Zhu
Naveed Ahmed Azam
Kazuya Haraguchi
Liang Zhao
Hiroshi Nagamochi
Tatsuya Akutsu
+ PDF Chat An Inverse QSAR Method Based on Linear Regression and Integer Programming 2022 Jianshen Zhu
Naveed Ahmed Azam
Kazuya Haraguchi
Liang Zhao
Hiroshi Nagamochi
Tatsuya Akutsu
+ Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model 2022 Jianshen Zhu
Naveed Ahmed Azam
Shengjuan Cao
Ryota Ido
Kazuya Haraguchi
Liang Zhao
Hiroshi Nagamochi
Tatsuya Akutsu
+ PDF Chat Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search 2021 Naveed Ahmed Azam
Jianshen Zhu
Kazuya Haraguchi
Liang Zhao
Hiroshi Nagamochi
Tatsuya Akutsu
+ Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search 2021 Naveed Ahmed Azam
Jianshen Zhu
Kazuya Haraguchi
Liang Zhao
Hiroshi Nagamochi
Tatsuya Akutsu
+ A Method for Inferring Polymers Based on Linear Regression and Integer Programming 2021 Ryota Ido
Shengjuan Cao
Jianshen Zhu
Naveed Ahmed Azam
Kazuya Haraguchi
Liang Zhao
Hiroshi Nagamochi
Tatsuya Akutsu
+ An Inverse QSAR Method Based on Linear Regression and Integer Programming 2021 Jianshen Zhu
Naveed Ahmed Azam
Kazuya Haraguchi
Liang Zhao
Hiroshi Nagamochi
Tatsuya Akutsu
+ PDF Chat A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branch-height Based on Artificial Neural Networks and Integer Programming 2020 Naveed Ahmed Azam
Jianshen Zhu
Yanming Sun
Yu Shi
Aleksandar Shurbevski
Liang Zhao
Hiroshi Nagamochi
Tatsuya Akutsu
+ PDF Chat Characterizing Star-PCGs 2020 Mingyu Xiao
Hiroshi Nagamochi
+ Design of Polynomial-delay Enumeration Algorithms in Transitive Systems 2020 Kazuya Haraguchi
Hiroshi Nagamochi
+ Polynomial-delay Enumeration Algorithms in Set Systems 2020 Kazuya Haraguchi
Hiroshi Nagamochi
+ Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies 2020 Yuui Tamura
Yuhei Nishiyama
Chenxi Wang
Yanming Sun
Aleksandar Shurbevski
Hiroshi Nagamochi
Tatsuya Akutsu
+ Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications 2020 Kyousuke Yamashita
Ryuji Masui
Xiang Zhou
Chenxi Wang
Aleksandar Shurbevski
Hiroshi Nagamochi
Tatsuya Akutsu
+ A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branch-height Based on Artificial Neural Networks and Integer Programming 2020 Naveed Ahmed Azam
Jianshen Zhu
Yanming Sun
Yu Shi
Aleksandar Shurbevski
Liang Zhao
Hiroshi Nagamochi
Tatsuya Akutsu
+ A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming 2020 Tatsuya Akutsu
Hiroshi Nagamochi
+ Bounded-Degree Cut is Fixed-Parameter Tractable 2020 Mingyu Xiao
Hiroshi Nagamochi
+ PDF Chat Some reduction operations to pairwise compatibility graphs 2019 Mingyu Xiao
Hiroshi Nagamochi
+ Some Reduction Operations to Pairwise Compatibility Graphs 2018 Mingyu Xiao
Hiroshi Nagamochi
+ PDF Chat Characterizing Star-PCGs 2018 Mingyu Xiao
Hiroshi Nagamochi
+ Exact algorithms for maximum independent set 2017 Mingyu Xiao
Hiroshi Nagamochi
+ Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time 2016 Seok-Hee Hong
Hiroshi Nagamochi
+ A Linear-time Algorithm for Integral Multiterminal Flows in Trees 2016 Mingyu Xiao
Hiroshi Nagamochi
+ PDF Chat Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time 2016 Seok-Hee Hong
Hiroshi Nagamochi
+ Exact algorithms for dominating induced matching based on graph partition 2015 Mingyu Xiao
Hiroshi Nagamochi
+ PDF Chat An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure 2015 Mingyu Xiao
Hiroshi Nagamochi
+ A method for generating colorings over graph automorphism 2015 Fei He
Hiroshi Nagamochi
+ Unranking of small combinations from large sets 2014 Toshihiro Shimizu
T. Fukunaga
Hiroshi Nagamochi
+ Exact Algorithms for Dominating Induced Matching Based on Graph Partition 2014 Mingyu Xiao
Hiroshi Nagamochi
+ Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs 2014 Mingyu Xiao
Hiroshi Nagamochi
+ PDF Chat An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure 2013 Mingyu Xiao
Hiroshi Nagamochi
+ PDF Chat Exact Algorithms for Maximum Independent Set 2013 Mingyu Xiao
Hiroshi Nagamochi
+ Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints 2012 Seok-Hee Hong
Hiroshi Nagamochi
+ PDF Chat Indexing All Rooted Subgraphs of a Rooted Graph 2012 Tomoki Imada
Hiroshi Nagamochi
+ PDF Chat Generating Trees on Multisets 2010 Bingbing Zhuang
Hiroshi Nagamochi
+ Cut Enumeration 2008 Hiroshi Nagamochi
Toshihide Ibaraki
+ Approximating Minimum k-partitions in Submodular Systems 2007 Hiroshi Nagamochi
+ An approximation algorithm for dissecting a rectangle into rectangles with specified areas 2006 Hiroshi Nagamochi
Yuusuke Abe
+ PDF Chat Packing Unit Squares in a Rectangle 2005 Hiroshi Nagamochi
+ On 2-Approximation to the Vertex-Connectivity in Graphs 2005 Hiroshi Nagamochi
+ On generalized greedy splitting algorithms for multiway partition problems 2004 Liang Zhao
Hiroshi Nagamochi
Toshihide Ibaraki
+ Bounds on the number of isolates in sum graph labeling 2001 Hiroshi Nagamochi
Mirka Miller
Slamin Slamin
+ Independent spanning trees with small depths in iterated line digraphs 2001 Toru Hasunuma
Hiroshi Nagamochi
+ None 2001 Hiroshi Nagamochi
Takashi Shiraki
Toshihide Ibaraki
+ PDF Chat Polyhedral Structure of Submodular and Posi-modular Systems 1998 Hiroshi Nagamochi
Toshihide Ibaraki
+ Independent Spanning Trees with Small Depths in Iterated Line Digraphs. 1998 Toru Hasunuma
Hiroshi Nagamochi
+ Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities 1990 Hiroshi Nagamochi
Masao Fukushima
Toshihide Lbaraki
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat ChemTS: an efficient python library for <i>de novo</i> molecular generation 2017 Xiufeng Yang
Jinzhe Zhang
Kazuki Yoshizoe
Kei Terayama
Koji Tsuda
6
+ On graphs that are not PCGs 2015 Stéphane Durocher
Debajyoti Mondal
Md. Saidur Rahman
4
+ Automatic Chemical Design Using a Data-Driven Continuous Representation of Molecules 2018 Rafael Gómez‐Bombarelli
Jennifer N. Wei
David Duvenaud
José Miguel Hernández-Lobato
Benjamín Sánchez-Lengeling
Dennis Sheberla
Jorge Aguilera‐Iparraguirre
Timothy Hirzel
Ryan P. Adams
Alán Aspuru‐Guzik
4
+ On pairwise compatibility graphs having Dilworth number two 2013 Tiziana Calamoneri
Rossella Petreschi
4
+ PDF Chat All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs 2012 Tiziana Calamoneri
Dario Frascaria
Blerina Sinaimeri
4
+ GraphNVP: an Invertible Flow-based Model for Generating Molecular Graphs 2019 Kaushalya Madhawa
Katsuhiko Ishiguro
Kosuke Nakago
Motoki Abe
3
+ MolGAN: An implicit generative model for small molecular graphs 2018 Nicola De Cao
Thomas Kipf
3
+ Pairwise compatibility graphs 2008 Muhammad Nur Yanhaona
K. S. M. Tozammel Hossain
Md. Saidur Rahman
3
+ GraphAF: a Flow-based Autoregressive Model for Molecular Graph Generation 2020 Chence Shi
Minkai Xu
Zhaocheng Zhu
Weinan Zhang
Ming Zhang
Jian Tang
3
+ Regression Shrinkage and Selection Via the Lasso 1996 Robert Tibshirani
3
+ ON THE PAIRWISE COMPATIBILITY PROPERTY OF SOME SUPERCLASSES OF THRESHOLD GRAPHS 2013 Tiziana Calamoneri
Rossella Petreschi
Blerina Sinaimeri
3
+ Semi-Supervised Classification with Graph Convolutional Networks 2016 Thomas Kipf
Max Welling
3
+ Semi-Supervised Classification with Graph Convolutional Networks 2016 Thomas Kipf
Max Welling
2
+ Submodular functions, matroids, and certain polyhedra 1970 Jack Edmonds
2
+ Cases in which Parsimony or Compatibility Methods will be Positively Misleading 1978 Joe Felsenstein
2
+ A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branch-height Based on Artificial Neural Networks and Integer Programming 2020 Naveed Ahmed Azam
Jianshen Zhu
Yanming Sun
Yu Shi
Aleksandar Shurbevski
Liang Zhao
Hiroshi Nagamochi
Tatsuya Akutsu
2
+ PDF Chat An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure 2015 Mingyu Xiao
Hiroshi Nagamochi
2
+ A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming 2020 Tatsuya Akutsu
Hiroshi Nagamochi
2
+ GraphAF: a Flow-based Autoregressive Model for Molecular Graph Generation 2020 Chence Shi
Minkai Xu
Zhaocheng Zhu
Weinan Zhang
Ming Zhang
Jian Tang
2
+ PDF Chat An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching 2013 Min Chih Lin
Michel J. Mizrahi
Jayme L. Szwarcfiter
2
+ Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications 2020 Kyousuke Yamashita
Ryuji Masui
Xiang Zhou
Chenxi Wang
Aleksandar Shurbevski
Hiroshi Nagamochi
Tatsuya Akutsu
2
+ PDF Chat Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search 2021 Naveed Ahmed Azam
Jianshen Zhu
Kazuya Haraguchi
Liang Zhao
Hiroshi Nagamochi
Tatsuya Akutsu
2
+ Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies 2020 Yuui Tamura
Yuhei Nishiyama
Chenxi Wang
Yanming Sun
Aleksandar Shurbevski
Hiroshi Nagamochi
Tatsuya Akutsu
2
+ GraphNVP: An Invertible Flow Model for Generating Molecular Graphs 2019 Kaushalya Madhawa
Katushiko Ishiguro
Kosuke Nakago
Motoki Abe
2
+ The Traveling Salesman Problem for Cubic Graphs 2007 David Eppstein
2
+ PDF Chat Dominating Induced Matchings for P 7-Free Graphs in Linear Time 2012 Andreas Brandstädt
Raffaele Mosca
2
+ Parameterized Complexity of 1-Planarity 2017 Michael J. Bannister
Sergio Cabello
David Eppstein
2
+ Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties 2008 Sara Cohen
Benny Kimelfeld
Yehoshua Sagiv
2
+ Exact algorithms for dominating induced matchings 2013 Min Chih Lin
Michel J. Mizrahi
Jayme L. Szwarcfiter
2
+ A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs 2010 Mingyu Xiao
2
+ PDF Chat Determinant Sums for Undirected Hamiltonicity 2010 Andreas Björklund
2
+ PDF Chat Minimal Obstructions for 1‐Immersions and Hardness of 1‐Planarity Testing 2012 Vladimir P. Korzhik
Bojan Mohar
2
+ PDF Chat Indexing All Rooted Subgraphs of a Rooted Graph 2012 Tomoki Imada
Hiroshi Nagamochi
2
+ MolGAN: An implicit generative model for small molecular graphs 2018 Nicola De Cao
Thomas Kipf
2
+ Covering symmetric supermodular functions by graphs 1999 András A. Benczúr
András Frank
1
+ PDF Chat Expander flows, geometric embeddings and graph partitioning 2004 Sanjeev Arora
Satish Rao
Umesh Vazirani
1
+ Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs 1988 Joseph Cheriyan
Sachin Maheshwari
1
+ Convex Representations of Graphs 1960 W. T. Tutte
1
+ Decomposing graphs under degree constraints 1996 Michael Stiebitz
1
+ Diameter vulnerability of iterated line digraphs 1996 Carles Padró
Paz Morillo
1
+ PDF Chat An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure 2013 Mingyu Xiao
Hiroshi Nagamochi
1
+ Disproof of a conjecture about independent branchings in <i>k</i>‐connected directed graphs 1995 Andreas Huck
1
+ PDF Chat Designing FPT Algorithms for Cut Problems Using Randomized Contractions 2012 Rajesh Chitnis
Marek Cygan
MohammadTaghi Hajiaghayi
Marcin Pilipczuk
Michał Pilipczuk
1
+ Formula periodic table for acyclic hydrocarbon isomer classes: combinatorially averaged graph invariants 1999 Laimutis Bytautas
Douglas J. Klein
1
+ PDF Chat On Relaxing the Constraints in Pairwise Compatibility Graphs 2012 Tiziana Calamoneri
Rossella Petreschi
Blerina Sinaimeri
1
+ Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees 1987 Hans L. Bodlaender
1
+ Linear-Time Ranking of Permutations 2007 Martin Mareš
Milan Straka
1
+ Efficient edge domination in regular graphs 2008 Domingos M. Cardoso
Jorge Orestes Cerdeira
Charles Delorme
Pedro C. Silva
1
+ An $O^*(1.1939^n)$ time algorithm for minimum weighted dominating induced matching 2013 Min Chih Lin
Michel J. Mizrahi
Jayme L. Szwarcfiter
1
+ Linear algorithms to recognize outerplanar and maximal outerplanar graphs 1979 S. Mitchell
1