Hiroshi Nagamochi
Orcid: 0000-0002-8332-1517
According to our database1,
Hiroshi Nagamochi
authored at least 277 papers
between 1989 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes.
CoRR, 2023
2022
A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022
J. Comb. Optim., 2022
Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model.
CoRR, 2022
A new approach to the design of acyclic chemical compounds using skeleton trees and integer linear programming.
Appl. Intell., 2022
Proceedings of the ICBBB 2022: 12th International Conference on Bioscience, Biochemistry and Bioinformatics, Tokyo, Japan, January 7, 2022
Proceedings of the 15th International Joint Conference on Biomedical Engineering Systems and Technologies, 2022
2021
Theor. Comput. Sci., 2021
A method for enumerating pairwise compatibility graphs with a given number of vertices.
Discret. Appl. Math., 2021
CoRR, 2021
CoRR, 2021
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming.
Algorithms Mol. Biol., 2021
An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures.
Proceedings of the Advances and Trends in Artificial Intelligence. Artificial Intelligence Practices, 2021
Proceedings of the Intelligent Computing Theories and Application, 2021
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2021
2020
Inf. Process. Lett., 2020
Entropy, 2020
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.
Entropy, 2020
A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming.
CoRR, 2020
Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications.
CoRR, 2020
Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies.
CoRR, 2020
A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming.
Algorithms, 2020
A New Integer Linear Programming Formulation to the Inverse QSAR/QSPR for Acyclic Chemical Compounds Using Skeleton Trees.
Proceedings of the Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices, 2020
A Method for the Inverse QSAR/QSPR Based on Artificial Neural Networks and Mixed Integer Linear Programming.
Proceedings of the ICBBB 2020: 10th International Conference on Bioscience, 2020
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020
A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility.
Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2020), 2020
2019
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets.
J. Graph Algorithms Appl., 2019
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019
Discret. Appl. Math., 2019
A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019
2018
Theor. Comput. Sci., 2018
IEEE ACM Trans. Comput. Biol. Bioinform., 2018
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
IEICE Trans. Inf. Syst., 2018
Proceedings of the 8th International Conference on Bioscience, 2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
Theor. Comput. Sci., 2017
J. Inf. Process., 2017
Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route.
J. Inf. Process., 2017
J. Graph Algorithms Appl., 2017
J. Comb. Optim., 2017
2016
Theory Comput. Syst., 2016
J. Graph Algorithms Appl., 2016
Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees.
IEICE Trans. Inf. Syst., 2016
Discret. Appl. Math., 2016
An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure.
Algorithmica, 2016
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016
Proceedings of the 9th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2016), 2016
2015
J. Comb. Optim., 2015
IEICE Trans. Inf. Syst., 2015
Discret. Appl. Math., 2015
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015
2014
J. Cheminformatics, 2014
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014
2013
Theor. Comput. Sci., 2013
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs.
Theor. Comput. Sci., 2013
J. Bioinform. Comput. Biol., 2013
Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3.
IEICE Trans. Inf. Syst., 2013
IEICE Trans. Inf. Syst., 2013
Proceedings of the ICT Innovations 2013, 2013
2012
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints.
Theor. Comput. Sci., 2012
Protein complex prediction via improved verification methods using constrained domain-domain matching.
Int. J. Bioinform. Res. Appl., 2012
Algorithmica, 2012
A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners.
Algorithmica, 2012
Proceedings of the Theory and Applications of Models of Computation, 2012
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012
Proceedings of the Combinatorial Optimization and Applications, 2012
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012
2011
J. Sched., 2011
Efficient Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming.
J. Chem. Inf. Model., 2011
An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots.
J. Adv. Comput. Intell. Intell. Informatics, 2011
Int. J. Comput. Geom. Appl., 2011
Kansei engineering, humans and computers: efficient dynamic programming algorithms for combinatorial food packing problems.
Int. J. Biom., 2011
IEICE Trans. Inf. Syst., 2011
Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs.
IEICE Trans. Inf. Syst., 2011
IEICE Trans. Inf. Syst., 2011
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies.
BMC Bioinform., 2011
Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra.
Algorithmica, 2011
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011
Proceedings of the Combinatorial Optimization and Applications, 2011
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011
2010
J. Discrete Algorithms, 2010
J. Discrete Algorithms, 2010
Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut.
J. Chem. Inf. Model., 2010
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010
Comput. Geom., 2010
Algorithmica, 2010
A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs.
Algorithmica, 2010
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010
Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables.
Proceedings of the Learning and Intelligent Optimization, 4th International Conference, 2010
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010
Proceedings of the Combinatorial Optimization and Applications, 2010
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010
An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem.
Proceedings of the Computational Geometry, Graphs and Applications, 2010
2009
Theory Comput. Syst., 2009
J. Graph Algorithms Appl., 2009
Exact algorithms for the two-dimensional strip packing problem with and without rotations.
Eur. J. Oper. Res., 2009
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem.
Discret. Optim., 2009
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009
Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
2008
Theor. Comput. Sci., 2008
Theor. Comput. Sci., 2008
J. Chem. Inf. Model., 2008
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008
Performance Analysis of a Collision Detection Algorithm of Spheres Based on Slab Partitioning.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008
Discret. Appl. Math., 2008
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Proceedings of the LATIN 2008: Theoretical Informatics, 2008
Proceedings of the Graph Drawing, 16th International Symposium, 2008
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
Encyclopedia of Mathematics and its Applications 123, Cambridge University Press, ISBN: 9780511721649, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Theor. Comput. Sci., 2007
Theor. Comput. Sci., 2007
Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex.
IEICE Trans. Inf. Syst., 2007
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007
IEICE Trans. Commun., 2007
Discret. Optim., 2007
An approximation algorithm for dissecting a rectangle into rectangles with specified areas.
Discret. Appl. Math., 2007
Discret. Appl. Math., 2007
Proceedings of the Theory and Applications of Models of Computation, 2007
Proceedings of the Theory and Applications of Models of Computation, 2007
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
Proceedings of the Integer Programming and Combinatorial Optimization, 2007
Proceedings of the New Trends in Applied Artificial Intelligence, 2007
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007
Linear-tree rule structure for firewall optimization.
Proceedings of the Sixth IASTED International Conference on Communications, 2007
A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007
2006
IEICE Trans. Inf. Syst., 2006
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006
Electron. Notes Discret. Math., 2006
Discret. Appl. Math., 2006
Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph.
Algorithmica, 2006
Algorithmica, 2006
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006
2005
Theor. Comput. Sci., 2005
Theor. Comput. Sci., 2005
Math. Program., 2005
A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph.
J. Algorithms, 2005
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
IEICE Trans. Inf. Syst., 2005
Discret. Comput. Geom., 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Approximation Algorithms for the <i>b</i>-Edge Dominating Set Problem and Its Related Problems.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
2004
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times.
Theor. Comput. Sci., 2004
Discret. Appl. Math., 2004
A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree.
Discret. Appl. Math., 2004
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
2003
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem.
Inf. Process. Lett., 2003
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003
Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs.
Proceedings of the Computing: the Australasian Theory Symposiumm, 2003
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs.
Discret. Appl. Math., 2003
Discret. Appl. Math., 2003
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree.
Discret. Appl. Math., 2003
2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
Discret. Appl. Math., 2003
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
Proceedings of the Graph Drawing, 11th International Symposium, 2003
Proceedings of the Graph Drawing, 11th International Symposium, 2003
2002
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks.
Networks, 2002
Discret. Appl. Math., 2002
Discret. Appl. Math., 2002
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002
A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
2001
Multigraph augmentation under biconnectivity and general edge-connectivity requirements.
Networks, 2001
J. Comb. Optim., 2001
J. Comb. Optim., 2001
J. Algorithms, 2001
Minimum cost source location problem with vertex-connectivity requirements in digraphs.
Inf. Process. Lett., 2001
Discret. Appl. Math., 2001
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.
Proceedings of the STACS 2001, 2001
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times.
Proceedings of the Algorithms, 2001
2000
J. Comb. Optim., 2000
Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph.
J. Comb. Optim., 2000
Discret. Appl. Math., 2000
Algorithmica, 2000
On the Minimum Augmentation of an <i>l</i>-Connected Graph to a <i>k</i>-Connected Graph.
Proceedings of the Algorithm Theory, 2000
Simultaneous Augmentation of Two Graphs to an <i>l</i>-Edge-Connected Graph and a Biconnected Graph.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
1999
Math. Oper. Res., 1999
J. Algorithms, 1999
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph.
Proceedings of the Algorithms, 1999
An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999
1998
A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations.
Comb., 1998
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998
Proceedings of the Integer Programming and Combinatorial Optimization, 1998
1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997
1996
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996
1995
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995
A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
1994
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994
1993
1992
SIAM J. Discret. Math., 1992
A Linear-Time Algorithm for Finding a Sparse k-Connected Spanning Subgraph of a k-Connected Graph.
Algorithmica, 1992
Proceedings of the 12th International Conference on Distributed Computing Systems, 1992
1991
1990
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities.
Networks, 1990
Proceedings of the Algorithms, 1990
1989
On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks.
Inf. Process. Lett., 1989