| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Mingyu Xiao, Hiroshi Nagamochi |
An FPT algorithm for edge subset feedback edge set.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi |
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomoki Imada, Hiroshi Nagamochi |
Indexing All Rooted Subgraphs of a Rooted Graph. |
IEICE Transactions |
2012 |
DBLP BibTeX RDF |
|
| 1 | Hiroshi Nagamochi |
Submodular Minimization via Pathwidth. |
TAMC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyu Xiao, Hiroshi Nagamochi |
A Refined Exact Algorithm for Edge Dominating Set. |
TAMC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshiyuki Karuno, Hiroshi Nagamochi, Aleksandar Shurbevski |
An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots. |
JACIII |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ehab Morsy, Hiroshi Nagamochi |
Approximating capacitated tree-routings in networks. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi |
Cop-robber guarding game with cycle robber-region. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
Editorial: ISAAC 2008 Special Issue. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bingbing Zhuang, Hiroshi Nagamochi |
Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs. |
IEICE Transactions |
2011 |
DBLP BibTeX RDF |
|
| 1 | Tatsuya Akutsu, Hiroshi Nagamochi |
Kernel Methods for Chemical Compounds: From Classification to Design. |
IEICE Transactions |
2011 |
DBLP BibTeX RDF |
|
| 1 | Bingbing Zhuang, Hiroshi Nagamochi |
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs. |
IEICE Transactions |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kazuki Matsumoto, Shunji Umetani, Hiroshi Nagamochi |
On the one-dimensional stock cutting problem in the paper tube industry. |
J. Scheduling |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura |
Efficient branch-and-bound algorithms for weighted MAX-2-SAT. |
Math. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi |
Minmax Tree Cover in the Euclidean Space. |
J. Graph Algorithms Appl. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Hirofumi Aota, Takuro Fukunaga, Hiroshi Nagamochi |
An Approximation Algorithm for Locating Maximal Disks within Convex Polygons. |
Int. J. Comput. Geometry Appl. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
Guest Editors' Foreword. |
Int. J. Comput. Geometry Appl. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Hasunuma, Hiroshi Nagamochi |
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyu Xiao, Hiroshi Nagamochi |
Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract). |
FAW-AAIM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyu Xiao, Hiroshi Nagamochi |
Further Improvement on Maximum Independent Set in Degree-4 Graphs. |
COCOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Takuro Fukunaga, Hiroshi Nagamochi |
Network design with weighted degree constraints. |
Discrete Optimization |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi |
A plane graph representation of triconnected graphs. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi |
Minimum Degree Orderings. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi |
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehab Morsy, Hiroshi Nagamochi |
Approximation to the Minimum Cost Edge Installation Problem. |
IEICE Transactions |
2010 |
DBLP BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
An algorithm for constructing star-shaped drawings of plane graphs. |
Comput. Geom. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehab Morsy, Hiroshi Nagamochi |
On the approximation of the generalized capacitated tree-routing problem. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
Convex drawings of hierarchical planar graphs and clustered planar graphs. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi |
FPTAS's for Some Cut Problems in Weighted Trees. |
FAW |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bingbing Zhuang, Hiroshi Nagamochi |
Constant Time Generation of Biconnected Rooted Plane Graphs. |
FAW |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bingbing Zhuang, Hiroshi Nagamochi |
Generating Internally Triconnected Rooted Plane Graphs. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatsuya Ohshima, Pipaporn Eumthurapojn, Liang Zhao, Hiroshi Nagamochi |
An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem. |
CGGA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bingbing Zhuang, Hiroshi Nagamochi |
Listing Triconnected Rooted Plane Graphs. |
COCOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bingbing Zhuang, Hiroshi Nagamochi |
Generating Trees on Multisets. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi |
Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables. |
LION |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bingbing Zhuang, Hiroshi Nagamochi |
Enumerating Rooted Graphs with Reflectional Block Structures. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Imamichi, Mutsunori Yagiura, Hiroshi Nagamochi |
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. |
Discrete Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Akifumi Kawaguchi, Hiroshi Nagamochi |
Drawing slicing graphs with face areas. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi |
A Detachment Algorithm for Inferring a Graph from Path Frequency. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Detachment algorithm, Graph inference, Connectivity, Multigraphs |
| 1 | Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi |
Exact algorithms for the two-dimensional strip packing problem with and without rotations. |
European Journal of Operational Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige |
Minimum Transversals in Posimodular Systems. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Takuro Fukunaga, Hiroshi Nagamochi |
Network Design with Edge-Connectivity and Degree Constraints. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Degree constraint, (m,n)-VRP, Approximation algorithm, TSP, Vehicle routing problem, Edge-connectivity |
| 1 | Takuro Fukunaga, Hiroshi Nagamochi |
Eulerian detachments with local edge-connectivity. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
New Approximation to the One-sided Radial Crossing Minimization. |
J. Graph Algorithms Appl. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Hiroshi Nagamochi |
Cop-Robber Guarding Game with Cycle Robber Region. |
FAW |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Takuro Fukunaga, Hiroshi Nagamochi |
Network Design with Weighted Degree Constraints. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi |
Minmax Tree Cover in the Euclidean Space. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
Minmax Tree Cover, Balanced Partition, Tree Cover, Approximation Algorithms, Graph Algorithms |
| 1 | Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi |
Bipartite Graph Representation of Multiple Decision Table Classifiers. |
SAGA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshitaka Nakao, Hiroshi Nagamochi |
Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
Upward Star-Shaped Polyhedral Graphs. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi |
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu |
Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Takaharu Ohnishi |
Approximating a vehicle scheduling problem with time windows and handling times. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehab Morsy, Hiroshi Nagamochi |
An improved approximation algorithm for capacitated multicast routings in networks. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshitaka Nakao, Hiroshi Nagamochi |
Worst Case Analysis for Pickup and Delivery Problems with Transfer. |
IEICE Transactions |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Imamichi, Hiroshi Nagamochi |
Performance Analysis of a Collision Detection Algorithm of Spheres Based on Slab Partitioning. |
IEICE Transactions |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
Convex drawings of graphs with non-convex boundary constraints. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi |
Robust cost colorings. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
Approximating Crossing Minimization in Radial Layouts. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi |
Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehab Morsy, Hiroshi Nagamochi |
Approximating the Generalized Capacitated Tree-Routing Problem. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga (eds.) |
Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi |
Removing Node Overlaps Using Multi-sphere Scheme. |
Graph Drawing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Takuro Fukunaga, Hiroshi Nagamochi |
Generalizing the induced matching by edge capacity constraints. |
Discrete Optimization |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Yoko Kamidoi |
Minimum cost subpartitions in graphs. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Kohei Okada |
Approximating the minmax rooted-tree cover in a tree. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh |
Approximability of the capacitated b-edge dominating set problem. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi |
Minimum cost source location problem with local 3-vertex-connectivity requirements. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi |
Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex. |
IEICE Transactions |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Takuro Fukunaga, Hiroshi Nagamochi |
Approximating a Generalization of Metric TSP. |
IEICE Transactions |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehab Morsy, Hiroshi Nagamochi |
Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. |
IEICE Transactions |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kouji Hirata, Takahiro Matsuda, Hiroshi Nagamochi, Tetsuya Takine |
Contention-Free lambda-Planes in Optically Burst-Switched WDM Networks. |
IEICE Transactions |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Katsutoshi Kuroya |
Drawing c-planar biconnected clustered graphs. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi, Yuusuke Abe |
An approximation algorithm for dissecting a rectangle into rectangles with specified areas. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshimasa Ishii, Kengo Iwata, Hiroshi Nagamochi |
Bisecting a 4-connected graph with three resource sets. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshimasa Ishii, Hitoshi Fujita, Hiroshi Nagamochi |
The source location problem with local 3-vertex-connectivity requirements. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoko Kamidoi, Noriyoshi Yoshida, Hiroshi Nagamochi |
A Deterministic Algorithm for Finding All Minimum k-Way Cuts. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu |
An Efficient Algorithm for Generating Colored Outerplanar Graphs. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Akifumi Kawaguchi, Hiroshi Nagamochi |
Orthogonal Drawings for Plane Graphs with Specified Face Areas. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehab Morsy, Hiroshi Nagamochi |
Approximating Capacitated Tree-Routings in Networks. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
Tree Cover, Approximation Algorithm, Graph Algorithm, Network Optimization, Routing Problems |
| 1 | Kazuya Haraguchi, Hiroshi Nagamochi |
Extension of ICF Classifiers to Real World Data Sets. |
IEA/AIE |
2007 |
DBLP DOI BibTeX RDF |
iteratively composed features, machine learning, classification, discretization |
| 1 | Morihiro Hayashida, Tatsuya Akutsu, Hiroshi Nagamochi |
A Novel Clustering Method for Analysis of Biological Networks using Maximal Components of Graphs. |
APBC |
2007 |
DBLP BibTeX RDF |
|
| 1 | Takuro Fukunaga, Hiroshi Nagamochi |
The Set Connector Problem in Graphs. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Liang Zhao, A. Shimae, Hiroshi Nagamochi |
Linear-tree rule structure for firewall optimization. |
Communications, Internet, and Information Technology |
2007 |
DBLP BibTeX RDF |
|
| 1 | Hiroshi Nagamochi |
Minimum Degree Orderings. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehab Morsy, Hiroshi Nagamochi |
Approximation to the Minimum Cost Edge Installation Problem. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Graph algorithm, Network optimization, Routing problem |
| 1 | Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi |
"Rent-or-Buy" Scheduling and Cost Coloring Problems. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Imamichi, Hiroshi Nagamochi |
A Multi-sphere Scheme for 2D and 3D Packing Problems. |
SLS |
2007 |
DBLP DOI BibTeX RDF |
multi-sphere scheme, unconstrained nonlinear program, iterated local search, packing problem |
| 1 | Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred Glover |
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. |
SLS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Takuro Fukunaga, Hiroshi Nagamochi |
Some Theorems on Detachments Preserving Local-Edge-Connectivity. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi |
Augmenting forests to meet odd diameter requirements. |
Discrete Optimization |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi |
Packing Soft Rectangles. |
Int. J. Found. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi |
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Automatic graph drawing, Computational geometry, Hierarchical graph, Clustered graph, Straight-line drawing |
| 1 | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Undirected multigraph, Graph augmentation, Deterministic algorithm, Edge-connectivity, Vertex-connectivity, Polynomial time approximation algorithm |
| 1 | Hiroshi Nagamochi |
A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs. |
IEICE Transactions |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Nagamochi |
Increasing the Edge-Connectivity by Contracting a Vertex Subset in Graphs. |
IEICE Transactions |
2006 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")