Edit Profile (opens in new tab) Nagamochi, Hiroshi Co-Author Distance Author ID: nagamochi.hiroshi Published as: Nagamochi, Hiroshi; Nagamochi, H. Homepage: https://www-or.amp.i.kyoto-u.ac.jp/members/nag/index-e.html External Links: MGP · ORCID · dblp · GND Documents Indexed: 262 Publications since 1989, including 1 Book and 3 Additional arXiv Preprints 5 Contributions as Editor Co-Authors: 101 Co-Authors with 247 Joint Publications 2,088 Co-Co-Authors all top 5 Co-Authors 20 single-authored 73 Ibaraki, Toshihide 27 Xiao, Mingyu 25 Hong, Seok-Hee 25 Ishii, Toshimasa 21 Fukunaga, Takuro 15 Karuno, Yoshiyuki 12 Zhao, Liang 9 Morsy, Ehab 9 Shurbevski, Aleksandar 7 Haraguchi, Kazuya 6 Akutsu, Tatsuya 6 Imamichi, Takashi 5 Azam, Naveed Ahmed 5 Deng, Xiao-Tie 5 Hasunuma, Toru 5 Ito, Hiro 5 Zhuang, Bingbing 4 Eades, Peter 4 Nakao, Yoshitaka 4 Yagiura, Mutsunori 3 Abe, Yuusuke 3 Frank, András 3 Iwata, Kengo 3 Nonobe, Koji 3 Okada, Kohei 3 Ota, Shunsuke 2 Akiyama, Yoko 2 Arahori, Yohei 2 Asano, Tetsuo 2 Feng, Qingwen 2 Fujishige, Satoru 2 Fujita, Hitoshi 2 Halldórsson, Magnús Mar 2 Imada, Tomoki 2 Iwaide, Ken 2 Jordán, Tibor 2 Kameda, Tiko 2 Kamidoi, Yoko 2 Karakawa, Seigo 2 Katayama, Shigeki 2 Kawada, Taizo 2 Kawaguchi, Akifumi 2 Kuroya, Katsutoshi 2 Makino, Kazuhisa 2 Nishimura, Kazuhiro 2 Okumoto, Kazumasa 2 Ono, Tadashi 2 Oomine, Morito 2 Sakashita, Mariko 2 Shiraki, Takashi 2 Sun, Zheng 2 Yamamoto, Shigeyuki 2 Zhu, Jianshen 1 Aota, Hirofumi 1 Berger, André 1 Cao, Shengjuan 1 Eumthurapojn, Pipaporn 1 Fujikawa, Naoki 1 Fujita, Masato 1 Fujito, Toshihiro 1 Fukushima, Masao 1 Gim, Jaeseong 1 Glover, Fred W. 1 Harada, Hideaki 1 Ibara, Ken 1 Ido, Ryota 1 Igarashi, Yoshihide 1 Kabutoya, Naohisa 1 Kameda, Tsunehiko 1 Karzanov, Aleksandr V. 1 Katoh, Naoki 1 Kenmochi, Mitsutoshi 1 Koga, Yuichi 1 Kojima, Kenya 1 Komiya, Akira 1 Lin, Xuemin 1 Matsui, Tomomi 1 Matsumoto, Kazuki 1 Md Yunos, Norhazwani 1 Miller, Mirka 1 Miyano, Satoru 1 Mochizuki, Koji 1 Momoi, Yusuke 1 Nakamura, S. 1 Nakamura, Shuji 1 Nishida, Yukihiro 1 Ohnishi, Takaharu 1 Ohshima, Tatsuya 1 Parekh, Ojas D. 1 Shimizu, Toshihiro 1 Slamin, Slamin 1 Sugiyama, Yosuke 1 Suri, Subhash 1 Suzuki, Takahisa 1 Umetani, Shunji 1 Wang, Jiexun 1 Wang, Xiaoming 1 Yamada, Nobuyasu 1 Yoshida, Noriyoshi 1 Zang, Wenan ...and 1 more Co-Authors all top 5 Serials 24 Discrete Applied Mathematics 19 Theoretical Computer Science 16 Algorithmica 14 RIMS Kokyuroku 11 Information Processing Letters 9 Journal of Combinatorial Optimization 6 Journal of the Operations Research Society of Japan 6 Journal of Graph Algorithms and Applications 5 Networks 5 Mathematical Programming. Series A. Series B 4 SIAM Journal on Discrete Mathematics 4 Japan Journal of Industrial and Applied Mathematics 4 Discrete Optimization 3 Journal of Algorithms 3 Journal of Discrete Algorithms 2 IEEE Transactions on Reliability 2 Mathematics of Operations Research 2 Combinatorica 2 International Journal of Computational Geometry & Applications 2 Theory of Computing Systems 2 Lecture Notes in Computer Science 1 Discrete Mathematics 1 INFOR 1 Journal of Graph Theory 1 SIAM Journal on Computing 1 Discrete & Computational Geometry 1 Information and Computation 1 Computers & Operations Research 1 Annals of Operations Research 1 Computational Geometry 1 International Journal of Foundations of Computer Science 1 European Journal of Operational Research 1 Distributed Computing 1 Memoirs of the Faculty of Engineering and Design. Kyoto Institute of Technology. Series of Science and Technology 1 The Electronic Journal of Combinatorics 1 Journal of Mathematical Chemistry 1 Journal of Scheduling 1 Pacific Journal of Optimization 1 Encyclopedia of Mathematics and Its Applications 1 RIMS Kôkyûroku Bessatsu all top 5 Fields 161 Computer science (68-XX) 160 Combinatorics (05-XX) 104 Operations research, mathematical programming (90-XX) 11 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 7 Convex and discrete geometry (52-XX) 5 General and overarching topics; collections (00-XX) 3 Biology and other natural sciences (92-XX) 2 Numerical analysis (65-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 196 Publications have been cited 1,375 times in 925 Documents Cited by ▼ Year ▼ A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph. Zbl 0763.05065 Nagamochi, Hiroshi; Ibaraki, Toshihide 82 1992 Computing edge-connectivity in multigraphs and capacitated graphs. Zbl 0754.05062 Nagamochi, Hiroshi; Ibaraki, Toshihide 76 1992 Algorithmic aspects of the core of combinatorial optimization games. Zbl 1064.91505 Deng, Xiaotie; Ibaraki, Toshihide; Nagamochi, Hiroshi 73 1999 Algorithmic aspects of graph connectivity. Zbl 1172.05003 Nagamochi, Hiroshi; Ibaraki, Toshihide 36 2008 Exact algorithms for the two-dimensional strip packing problem with and without rotations. Zbl 1163.90803 Kenmochi, Mitsutoshi; Imamichi, Takashi; Nonobe, Koji; Yagiura, Mutsunori; Nagamochi, Hiroshi 35 2009 A 2-approximation algorithm for the minimum weight edge dominating set problem. Zbl 1016.68061 Fujito, Toshihiro; Nagamochi, Hiroshi 34 2002 An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. Zbl 1012.68226 Nagamochi, Hiroshi 28 2003 Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Zbl 1092.68105 Eades, Peter; Feng, Qingwen; Lin, Xuemin; Nagamochi, Hiroshi 28 2006 Exact algorithms for maximum independent set. Zbl 1371.68126 Xiao, Mingyu; Nagamochi, Hiroshi 25 2017 Independent spanning trees with small depths in iterated line digraphs. Zbl 0983.05023 Hasunuma, Toru; Nagamochi, Hiroshi 22 2001 Totally balanced combinatorial optimization games. Zbl 0978.91005 Deng, Xiaotie; Ibaraki, Toshihide; Nagamochi, Hiroshi; Zang, Wenan 20 2000 Convex drawings of graphs with non-convex boundary constraints. Zbl 1144.05023 Hong, Seok-Hee; Nagamochi, Hiroshi 20 2008 Exact algorithms for maximum independent set. Zbl 1406.68047 Xiao, Mingyu; Nagamochi, Hiroshi 19 2013 On sparse subgraphs preserving connectivity properties. Zbl 0788.05061 Frank, András; Ibaraki, Toshihide; Nagamochi, Hiroshi 18 1993 Minimum cost source location problem with vertex-connectivity requirements in digraphs. Zbl 1003.68110 Nagamochi, Hiroshi; Ishii, Toshimasa; Ito, Hiro 17 2001 Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs. Zbl 1259.68263 Xiao, Mingyu; Nagamochi, Hiroshi 17 2013 Characterizing mechanisms in obnoxious facility game. Zbl 1358.91061 Ibara, Ken; Nagamochi, Hiroshi 16 2012 Computing all small cuts in an undirected network. Zbl 0884.05060 Nagamochi, Hiroshi; Nishimura, Kazuhiro; Ibaraki, Toshihide 15 1997 An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Zbl 1179.90285 Imamichi, Takashi; Yagiura, Mutsunori; Nagamochi, Hiroshi 15 2009 Vehicle scheduling on a tree with release and handling times. Zbl 0880.90037 Karuno, Yoshiyuki; Nagamochi, Hiroshi; Ibaraki, Toshihide 15 1997 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. Zbl 1034.68122 Karuno, Yoshiyuki; Nagamochi, Hiroshi 15 2003 Convex drawings of hierarchical planar graphs and clustered planar graphs. Zbl 1231.05184 Hong, Seok-Hee; Nagamochi, Hiroshi 15 2010 Implementing an efficient minimum capacity cut algorithm. Zbl 0821.90130 Nagamochi, Hiroshi; Ono, Tadashi; Ibaraki, Toshihide 14 1994 Approximability of the capacitated \(b\)-edge dominating set problem. Zbl 1124.68115 Berger, André; Fukunaga, Takuro; Nagamochi, Hiroshi; Parekh, Ojas 14 2007 A deterministic algorithm for finding all minimum \(k\)-way cuts. Zbl 1124.05083 Kamidoi, Yoko; Yoshida, Noriyoshi; Nagamochi, Hiroshi 14 2006 Greedy splitting algorithms for approximating multiway partition problems. Zbl 1177.90403 Zhao, Liang; Nagamochi, Hiroshi; Ibaraki, Toshihide 14 2005 A linear time algorithm for computing 3-edge-connected components in a multigraph. Zbl 0761.05089 Nagamochi, Hiroshi; Ibaraki, Toshihide 14 1992 Graph connectivity and its augmentation: Applications of MA orderings. Zbl 0995.05081 Nagamochi, Hiroshi; Ibaraki, Toshihide 14 2002 Approximating the minmax rooted-tree cover in a tree. Zbl 1184.68646 Nagamochi, Hiroshi; Okada, Kohei 12 2007 An improved bound on the one-sided minimum crossing number in two-layered drawings. Zbl 1066.05059 Nagamochi, Hiroshi 12 2005 A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons. Zbl 0914.90110 Ibaraki, Toshihide; Karzanov, Alexander V.; Nagamochi, Hiroshi 11 1998 Polynomial time 2-approximation algorithms for the minmax subtree cover problem. Zbl 1205.68518 Nagamochi, Hiroshi; Okada, Kohei 11 2003 Testing full outer-2-planarity in linear time. Zbl 1417.05212 Hong, Seok-Hee; Nagamochi, Hiroshi 11 2016 Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Zbl 1024.90008 Karuno, Yoshiyuki; Nagamochi, Hiroshi; Ibaraki, Toshihide 11 2002 A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree. Zbl 1061.90096 Nagamochi, Hiroshi; Okada, Kohei 10 2004 Simpler algorithms for testing two-page book embedding of partitioned graphs. Zbl 1425.05151 Hong, Seok-Hee; Nagamochi, Hiroshi 10 2014 Linear layouts in submodular systems. Zbl 1260.90160 Nagamochi, Hiroshi 10 2012 Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs. Zbl 0895.90172 Nagamochi, Hiroshi; Ibaraki, Toshihide 9 1997 An approximability result of the multi-vehicle scheduling problem on a path with release and handling times. Zbl 1067.90143 Karuno, Yoshiyuki; Nagamochi, Hiroshi 9 2004 Orthogonal drawings for plane graphs with specified face areas. Zbl 1200.68171 Kawaguchi, Akifumi; Nagamochi, Hiroshi 8 2007 Drawing clustered graphs on an orthogonal grid. Zbl 0960.05042 Eades, Peter; Feng, Qingwen; Nagamochi, Hiroshi 8 1999 Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts. Zbl 1135.05316 Zhao, Liang; Nagamochi, Hiroshi; Ibaraki, Toshihide 8 2001 A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem. Zbl 1173.68874 Zhao, Liang; Nagamochi, Hiroshi; Ibaraki, Toshihide 8 2003 Graph algorithms for network connectivity problems. Zbl 1106.05091 Nagamochi, Hiroshi 8 2004 Counting the number of minimum cuts in undirected multigraphs. Zbl 0739.90026 Nagamochi, Hiroshi; Sun, Zheng; Ibaraki, Toshihide 8 1991 An exact strip packing algorithm based on canonical forms. Zbl 1349.90704 Arahori, Yohei; Imamichi, Takashi; Nagamochi, Hiroshi 8 2012 Re-embedding a 1-plane graph into a straight-line drawing in linear time. Zbl 1478.68244 Hong, Seok-Hee; Nagamochi, Hiroshi 8 2016 Robust cost colorings. Zbl 1192.90071 Fukunaga, Takuro; Halldórsson, Magnús M.; Nagamochi, Hiroshi 8 2008 An improved approximation algorithm for capacitated multicast routings in networks. Zbl 1135.68064 Morsy, Ehab; Nagamochi, Hiroshi 7 2008 Canonical cactus representation for miminum cuts. Zbl 0814.05067 Nagamochi, Hiroshi; Kameda, Tiko 7 1994 Complexity of the single vehicle scheduling problem on graphs. Zbl 0894.90081 Nagamochi, Hiroshi; Mochizuki, Koji; Ibaraki, Toshihide 7 1997 Vehicle scheduling on a tree to minimize maximum lateness. Zbl 0873.90051 Karuno, Yoshiyuki; Nagamochi, Hiroshi; Ibaraki, Toshihide 7 1996 The source location problem with local 3-vertex-connectivity requirements. Zbl 1127.90009 Ishii, Toshimasa; Fujita, Hitoshi; Nagamochi, Hiroshi 7 2007 An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure. Zbl 1348.90559 Xiao, Mingyu; Nagamochi, Hiroshi 7 2016 A note on minimizing submodular functions. Zbl 1339.90285 Nagamochi, Hiroshi; Ibaraki, Toshihide 7 1998 Parameterized edge dominating set in graphs with degree bounded by 3. Zbl 1325.05132 Xiao, Mingyu; Nagamochi, Hiroshi 7 2013 Star-shaped drawings of graphs with fixed embedding and concave corner constraints. Zbl 1148.68549 Hong, Seok-Hee; Nagamochi, Hiroshi 6 2008 Minimum transversals in posimodular systems. Zbl 1207.68168 Sakashita, Mariko; Makino, Kazuhisa; Nagamochi, Hiroshi; Fujishige, Satoru 6 2009 Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems. Zbl 1239.05153 Okumoto, Kazumasa; Fukunaga, Takuro; Nagamochi, Hiroshi 6 2012 Minimum cost subpartitions in graphs. Zbl 1185.05139 Nagamochi, Hiroshi; Kamidoi, Yoko 6 2007 A fast algorithm for computing minimum 3-way and 4-way cuts. Zbl 0986.90068 Nagamochi, Hiroshi; Ibaraki, Toshihide 6 2000 A better approximation for the two-machine flowshop scheduling problem with time lags. Zbl 1205.90125 Karuno, Yoshiyuki; Nagamochi, Hiroshi 6 2003 Augmenting forests to meet odd diameter requirements. Zbl 1101.90078 Ishii, Toshimasa; Yamamoto, Shigeyuki; Nagamochi, Hiroshi 6 2006 Complexity and kernels for bipartition into degree-bounded induced graphs. Zbl 1355.68131 Xiao, Mingyu; Nagamochi, Hiroshi 6 2017 A fast algorithm for cactus representations of minimum cuts. Zbl 1306.90165 Nagamochi, Hiroshi; Nakao, Yoshitaka; Ibaraki, Toshihide 6 2000 Exact algorithms for dominating induced matching based on graph partition. Zbl 1316.05102 Xiao, Mingyu; Nagamochi, Hiroshi 6 2015 An exact algorithm for maximum independent set in degree-5 graphs. Zbl 1326.05115 Xiao, Mingyu; Nagamochi, Hiroshi 6 2016 A linear-time algorithm for testing full outer-2-planarity. Zbl 1405.05036 Hong, Seok-Hee; Nagamochi, Hiroshi 6 2019 Minmax tree cover in the Euclidean space. Zbl 1276.05115 Karakawa, Seigo; Morsy, Ehab; Nagamochi, Hiroshi 6 2011 Minimum cost source location problem with local 3-vertex-connectivity requirements. Zbl 1110.68101 Ishii, Toshimasa; Fujita, Hitoshi; Nagamochi, Hiroshi 5 2007 “Rent-or-buy” scheduling and cost coloring problems. Zbl 1135.90344 Fukunaga, Takuro; Halldórsson, Magnús M.; Nagamochi, Hiroshi 5 2007 Minimum degree orderings. Zbl 1187.68352 Nagamochi, Hiroshi 5 2010 Computing all small cuts in undirected networks. Zbl 0953.68578 Nagamochi, Hiroshi; Nishimura, Kazuhiro; Ibaraki, Toshihide 5 1994 A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs. Zbl 0952.68114 Nagamochi, H.; Nakamura, S.; Ibaraki, T. 5 2000 Bounds on the number of isolates in sum graph labeling. Zbl 0987.05084 Nagamochi, Hiroshi; Miller, Mirka; Slamin 5 2001 Augmenting edge-connectivity over the entire range in \(\widetilde O(nm)\) time. Zbl 0923.68096 Nagamochi, Hiroshi; Ibaraki, Toshihide 5 1999 An algorithm for constructing star-shaped drawings of plane graphs. Zbl 1219.05101 Hong, Seok-Hee; Nagamochi, Hiroshi 5 2010 Complexity of the minimum base game on matroids. Zbl 0871.90121 Nagamochi, Hiroshi; Zeng, Dao-Zhi; Kabutoya, Naohisa; Ibaraki, Toshihide 5 1997 Complexity and kernels for bipartition into degree-bounded induced graphs. Zbl 1432.68197 Xiao, Mingyu; Nagamochi, Hiroshi 5 2014 A refined exact algorithm for edge dominating set. Zbl 1304.05142 Xiao, Mingyu; Nagamochi, Hiroshi 5 2014 An approximation algorithm for dissecting a rectangle into rectangles with specified areas. Zbl 1107.68122 Nagamochi, Hiroshi; Abe, Yuusuke 4 2007 Drawing \(c\)-planar biconnected clustered graphs. Zbl 1118.05022 Nagamochi, Hiroshi; Kuroya, Katsutoshi 4 2007 Approximating a vehicle scheduling problem with time windows and handling times. Zbl 1182.90049 Nagamochi, Hiroshi; Ohnishi, Takaharu 4 2008 Cop-robber guarding game with cycle robber-region. Zbl 1237.91044 Nagamochi, Hiroshi 4 2011 Vehicle scheduling on a tree with release and handling times. Zbl 0925.90223 Karuno, Yoshiyuki; Nagamochi, Hiroshi; Ibaraki, Toshihide 4 1993 An FPT algorithm for edge subset feedback edge set. Zbl 1233.68142 Xiao, Mingyu; Nagamochi, Hiroshi 4 2012 On the one-dimensional stock cutting problem in the paper tube industry. Zbl 1222.90048 Matsumoto, Kazuki; Umetani, Shunji; Nagamochi, Hiroshi 4 2011 Simpler algorithms for testing two-page book embedding of partitioned graphs. Zbl 1390.68502 Hong, Seok-Hee; Nagamochi, Hiroshi 4 2018 On the minimum augmentation of an \(\ell\)-connected graph to a \(k\)-connected graph. Zbl 0966.68006 Ishii, Toshimasa; Nagamochi, Hiroshi 4 2000 A faster algorithm for computing minimum 5-way and 6-way cuts in graphs. Zbl 1028.90074 Nagamochi, Hiroshi; Katayama, Shigeki; Ibaraki, Toshihide 4 2000 A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling times. Zbl 1159.90405 Karuno, Yoshiyuki; Nagamochi, Hiroshi 4 2001 On the one-sided crossing minimization in a bipartite graph with large degrees. Zbl 1142.68461 Nagamochi, Hiroshi 4 2005 Maximum flows in probabilistic networks. Zbl 0751.90032 Nagamochi, Hiroshi; Ibaraki, Toshihide 4 1991 Constructing cactus representation for all minimum cuts in an undirected network. Zbl 0870.90098 Nagamochi, Hiroshi; Kameda, Tiko 4 1996 A path relinking approach for the multi-resource generalized quadratic assignment problem. Zbl 1134.68500 Yagiura, Mutsunori; Komiya, Akira; Kojima, Kenya; Nonobe, Koji; Nagamochi, Hiroshi; Ibaraki, Toshihide; Glover, Fred 4 2007 Network design with weighted degree constraints. Zbl 1241.90159 Fukunaga, Takuro; Nagamochi, Hiroshi 4 2010 A refined exact algorithm for edge dominating set. Zbl 1354.05136 Xiao, Mingyu; Nagamochi, Hiroshi 4 2012 An improved algorithm for parameterized edge dominating set problem. Zbl 1331.05171 Iwaide, Ken; Nagamochi, Hiroshi 4 2016 A polynomial-space exact algorithm for TSP in degree-6 graphs. Zbl 1482.68275 Md Yunos, Norhazwani; Shurbevski, Aleksandar; Nagamochi, Hiroshi 4 2016 Convex drawings of graphs with non-convex boundary. Zbl 1167.68456 Hong, Seok-Hee; Nagamochi, Hiroshi 4 2006 Enumeration of support-closed subsets in confluent systems. Zbl 07517136 Haraguchi, Kazuya; Nagamochi, Hiroshi 2 2022 A method for enumerating pairwise compatibility graphs with a given number of vertices. Zbl 1472.05068 Azam, Naveed Ahmed; Shurbevski, Aleksandar; Nagamochi, Hiroshi 3 2021 Re-embedding a 1-plane graph for a straight-line drawing in linear time. Zbl 1514.68219 Hong, Seok-Hee; Nagamochi, Hiroshi 1 2021 Some reduction operations to pairwise compatibility graphs. Zbl 1481.05150 Xiao, Mingyu; Nagamochi, Hiroshi 4 2020 Characterizing star-PCGs. Zbl 1479.05340 Xiao, Mingyu; Nagamochi, Hiroshi 3 2020 Path-monotonic upward drawings of graphs. Zbl 07336098 Hong, Seok-Hee; Nagamochi, Hiroshi 1 2020 On the enumeration of minimal non-pairwise compatibility graphs. Zbl 07336119 Azam, Naveed Ahmed; Shurbevski, Aleksandar; Nagamochi, Hiroshi 1 2020 A linear-time algorithm for testing full outer-2-planarity. Zbl 1405.05036 Hong, Seok-Hee; Nagamochi, Hiroshi 6 2019 COOMA: a components overlaid mining algorithm for enumerating connected subgraphs with common itemsets. Zbl 1420.05168 Haraguchi, Kazuya; Momoi, Yusuke; Shurbevski, Aleksandar; Nagamochi, Hiroshi 2 2019 Simpler algorithms for testing two-page book embedding of partitioned graphs. Zbl 1390.68502 Hong, Seok-Hee; Nagamochi, Hiroshi 4 2018 Characterizing star-PCGs. Zbl 1459.05317 Xiao, Mingyu; Nagamochi, Hiroshi 2 2018 Exact algorithms for maximum independent set. Zbl 1371.68126 Xiao, Mingyu; Nagamochi, Hiroshi 25 2017 Complexity and kernels for bipartition into degree-bounded induced graphs. Zbl 1355.68131 Xiao, Mingyu; Nagamochi, Hiroshi 6 2017 Parameterization of strategy-proof mechanisms in the obnoxious facility game. Zbl 1409.91108 Oomine, Morito; Shurbevski, Aleksandar; Nagamochi, Hiroshi 1 2017 Testing full outer-2-planarity in linear time. Zbl 1417.05212 Hong, Seok-Hee; Nagamochi, Hiroshi 11 2016 Re-embedding a 1-plane graph into a straight-line drawing in linear time. Zbl 1478.68244 Hong, Seok-Hee; Nagamochi, Hiroshi 8 2016 An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure. Zbl 1348.90559 Xiao, Mingyu; Nagamochi, Hiroshi 7 2016 An exact algorithm for maximum independent set in degree-5 graphs. Zbl 1326.05115 Xiao, Mingyu; Nagamochi, Hiroshi 6 2016 An improved algorithm for parameterized edge dominating set problem. Zbl 1331.05171 Iwaide, Ken; Nagamochi, Hiroshi 4 2016 A polynomial-space exact algorithm for TSP in degree-6 graphs. Zbl 1482.68275 Md Yunos, Norhazwani; Shurbevski, Aleksandar; Nagamochi, Hiroshi 4 2016 An improved exact algorithm for TSP in graphs of maximum degree 4. Zbl 1336.68276 Xiao, Mingyu; Nagamochi, Hiroshi 2 2016 Parameterization of strategy-proof mechanisms in the obnoxious facility game. Zbl 1478.91053 Oomine, Morito; Shurbevski, Aleksandar; Nagamochi, Hiroshi 1 2016 Exact algorithms for dominating induced matching based on graph partition. Zbl 1316.05102 Xiao, Mingyu; Nagamochi, Hiroshi 6 2015 An improved exact algorithm for undirected feedback vertex set. Zbl 1327.90272 Xiao, Mingyu; Nagamochi, Hiroshi 3 2015 Simpler algorithms for testing two-page book embedding of partitioned graphs. Zbl 1425.05151 Hong, Seok-Hee; Nagamochi, Hiroshi 10 2014 Complexity and kernels for bipartition into degree-bounded induced graphs. Zbl 1432.68197 Xiao, Mingyu; Nagamochi, Hiroshi 5 2014 A refined exact algorithm for edge dominating set. Zbl 1304.05142 Xiao, Mingyu; Nagamochi, Hiroshi 5 2014 Approximating the bipartite TSP and its biased generalization. Zbl 1408.90262 Shurbevski, Aleksandar; Nagamochi, Hiroshi; Karuno, Yoshiyuki 3 2014 Unranking of small combinations from large sets. Zbl 1308.68147 Shimizu, Toshihiro; Fukunaga, Takuro; Nagamochi, Hiroshi 1 2014 Exact algorithms for maximum independent set. Zbl 1406.68047 Xiao, Mingyu; Nagamochi, Hiroshi 19 2013 Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs. Zbl 1259.68263 Xiao, Mingyu; Nagamochi, Hiroshi 17 2013 Parameterized edge dominating set in graphs with degree bounded by 3. Zbl 1325.05132 Xiao, Mingyu; Nagamochi, Hiroshi 7 2013 An improved exact algorithm for undirected feedback vertex set. Zbl 1407.68375 Xiao, Mingyu; Nagamochi, Hiroshi 4 2013 An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure. Zbl 1382.90097 Xiao, Mingyu; Nagamochi, Hiroshi 3 2013 An exact algorithm for maximum independent set in degree-5 graphs. Zbl 1303.05201 Xiao, Mingyu; Nagamochi, Hiroshi 2 2013 Characterizing mechanisms in obnoxious facility game. Zbl 1358.91061 Ibara, Ken; Nagamochi, Hiroshi 16 2012 Linear layouts in submodular systems. Zbl 1260.90160 Nagamochi, Hiroshi 10 2012 An exact strip packing algorithm based on canonical forms. Zbl 1349.90704 Arahori, Yohei; Imamichi, Takashi; Nagamochi, Hiroshi 8 2012 Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems. Zbl 1239.05153 Okumoto, Kazumasa; Fukunaga, Takuro; Nagamochi, Hiroshi 6 2012 An FPT algorithm for edge subset feedback edge set. Zbl 1233.68142 Xiao, Mingyu; Nagamochi, Hiroshi 4 2012 A refined exact algorithm for edge dominating set. Zbl 1354.05136 Xiao, Mingyu; Nagamochi, Hiroshi 4 2012 An improved exact algorithm for TSP in degree-4 graphs. Zbl 1364.68236 Xiao, Mingyu; Nagamochi, Hiroshi 3 2012 A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners. Zbl 1239.05129 Hong, Seok-Hee; Nagamochi, Hiroshi 3 2012 Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints. Zbl 1246.05109 Hong, Seok-Hee; Nagamochi, Hiroshi 1 2012 Minmax tree cover in the Euclidean space. Zbl 1276.05115 Karakawa, Seigo; Morsy, Ehab; Nagamochi, Hiroshi 6 2011 Cop-robber guarding game with cycle robber-region. Zbl 1237.91044 Nagamochi, Hiroshi 4 2011 On the one-dimensional stock cutting problem in the paper tube industry. Zbl 1222.90048 Matsumoto, Kazuki; Umetani, Shunji; Nagamochi, Hiroshi 4 2011 Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming. Zbl 1221.92085 Imada, Tomoki; Ota, Shunsuke; Nagamochi, Hiroshi; Akutsu, Tatsuya 3 2011 Parameterized edge dominating set in cubic graphs (extended abstract). Zbl 1329.05288 Xiao, Mingyu; Nagamochi, Hiroshi 3 2011 An A* algorithm framework for the point-to-point time-dependent shortest path problem. Zbl 1349.68297 Ohshima, Tatsuya; Eumthurapojn, Pipaporn; Zhao, Liang; Nagamochi, Hiroshi 2 2011 Extending Steinitz’s theorem to upward star-shaped polyhedra and spherical polyhedra. Zbl 1235.05097 Hong, Seok-Hee; Nagamochi, Hiroshi 2 2011 Further improvement on maximum independent set in degree-4 graphs. Zbl 1342.05107 Xiao, Mingyu; Nagamochi, Hiroshi 1 2011 Efficient branch-and-bound algorithms for weighted MAX-2-SAT. Zbl 1216.90073 Ibaraki, Toshihide; Imamichi, Takashi; Koga, Yuichi; Nagamochi, Hiroshi; Nonobe, Koji; Yagiura, Mutsunori 1 2011 Convex drawings of hierarchical planar graphs and clustered planar graphs. Zbl 1231.05184 Hong, Seok-Hee; Nagamochi, Hiroshi 15 2010 Minimum degree orderings. Zbl 1187.68352 Nagamochi, Hiroshi 5 2010 An algorithm for constructing star-shaped drawings of plane graphs. Zbl 1219.05101 Hong, Seok-Hee; Nagamochi, Hiroshi 5 2010 Network design with weighted degree constraints. Zbl 1241.90159 Fukunaga, Takuro; Nagamochi, Hiroshi 4 2010 A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs. Zbl 1205.68262 Hong, Seok-Hee; Nagamochi, Hiroshi 2 2010 Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs. Zbl 1187.05042 Ishii, Toshimasa; Akiyama, Yoko; Nagamochi, Hiroshi 1 2010 Exact algorithms for the two-dimensional strip packing problem with and without rotations. Zbl 1163.90803 Kenmochi, Mitsutoshi; Imamichi, Takashi; Nonobe, Koji; Yagiura, Mutsunori; Nagamochi, Hiroshi 35 2009 An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Zbl 1179.90285 Imamichi, Takashi; Yagiura, Mutsunori; Nagamochi, Hiroshi 15 2009 Minimum transversals in posimodular systems. Zbl 1207.68168 Sakashita, Mariko; Makino, Kazuhisa; Nagamochi, Hiroshi; Fujishige, Satoru 6 2009 Network design with edge-connectivity and degree constraints. Zbl 1192.68895 Fukunaga, Takuro; Nagamochi, Hiroshi 3 2009 Drawing slicing graphs with face areas. Zbl 1162.68026 Kawaguchi, Akifumi; Nagamochi, Hiroshi 3 2009 A detachment algorithm for inferring a graph from path frequency. Zbl 1172.68049 Nagamochi, Hiroshi 3 2009 Cop-robber guarding game with cycle robber region. Zbl 1248.91018 Nagamochi, Hiroshi 3 2009 Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems. Zbl 1272.68337 Okumoto, Kazumasa; Fukunaga, Takuro; Nagamochi, Hiroshi 2 2009 Network design with weighted degree constraints. Zbl 1211.68284 Fukunaga, Takuro; Nagamochi, Hiroshi 2 2009 Removing node overlaps using multi-sphere scheme. Zbl 1213.68458 Imamichi, Takashi; Arahori, Yohei; Gim, Jaeseong; Hong, Seok-Hee; Nagamochi, Hiroshi 2 2009 Upward star-shaped polyhedral graphs. Zbl 1273.52019 Hong, Seok-Hee; Nagamochi, Hiroshi 1 2009 Bipartite graph representation of multiple decision table classifiers. Zbl 1260.68331 Haraguchi, Kazuya; Hong, Seok-Hee; Nagamochi, Hiroshi 1 2009 Eulerian detachments with local edge-connectivity. Zbl 1173.05330 Fukunaga, Takuro; Nagamochi, Hiroshi 1 2009 Algorithmic aspects of graph connectivity. Zbl 1172.05003 Nagamochi, Hiroshi; Ibaraki, Toshihide 36 2008 Convex drawings of graphs with non-convex boundary constraints. Zbl 1144.05023 Hong, Seok-Hee; Nagamochi, Hiroshi 20 2008 Robust cost colorings. Zbl 1192.90071 Fukunaga, Takuro; Halldórsson, Magnús M.; Nagamochi, Hiroshi 8 2008 An improved approximation algorithm for capacitated multicast routings in networks. Zbl 1135.68064 Morsy, Ehab; Nagamochi, Hiroshi 7 2008 Star-shaped drawings of graphs with fixed embedding and concave corner constraints. Zbl 1148.68549 Hong, Seok-Hee; Nagamochi, Hiroshi 6 2008 Approximating a vehicle scheduling problem with time windows and handling times. Zbl 1182.90049 Nagamochi, Hiroshi; Ohnishi, Takaharu 4 2008 Approximating the generalized capacitated tree-routing problem. Zbl 1148.68420 Morsy, Ehab; Nagamochi, Hiroshi 2 2008 Approximating crossing minimization in radial layouts. Zbl 1136.68464 Hong, Seok-Hee; Nagamochi, Hiroshi 1 2008 Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15–17, 2008. Proceedings. Zbl 1154.68014 1 2008 Approximability of the capacitated \(b\)-edge dominating set problem. Zbl 1124.68115 Berger, André; Fukunaga, Takuro; Nagamochi, Hiroshi; Parekh, Ojas 14 2007 Approximating the minmax rooted-tree cover in a tree. Zbl 1184.68646 Nagamochi, Hiroshi; Okada, Kohei 12 2007 Orthogonal drawings for plane graphs with specified face areas. Zbl 1200.68171 Kawaguchi, Akifumi; Nagamochi, Hiroshi 8 2007 The source location problem with local 3-vertex-connectivity requirements. Zbl 1127.90009 Ishii, Toshimasa; Fujita, Hitoshi; Nagamochi, Hiroshi 7 2007 Minimum cost subpartitions in graphs. Zbl 1185.05139 Nagamochi, Hiroshi; Kamidoi, Yoko 6 2007 Minimum cost source location problem with local 3-vertex-connectivity requirements. Zbl 1110.68101 Ishii, Toshimasa; Fujita, Hitoshi; Nagamochi, Hiroshi 5 2007 “Rent-or-buy” scheduling and cost coloring problems. Zbl 1135.90344 Fukunaga, Takuro; Halldórsson, Magnús M.; Nagamochi, Hiroshi 5 2007 An approximation algorithm for dissecting a rectangle into rectangles with specified areas. Zbl 1107.68122 Nagamochi, Hiroshi; Abe, Yuusuke 4 2007 Drawing \(c\)-planar biconnected clustered graphs. Zbl 1118.05022 Nagamochi, Hiroshi; Kuroya, Katsutoshi 4 2007 A path relinking approach for the multi-resource generalized quadratic assignment problem. Zbl 1134.68500 Yagiura, Mutsunori; Komiya, Akira; Kojima, Kenya; Nonobe, Koji; Nagamochi, Hiroshi; Ibaraki, Toshihide; Glover, Fred 4 2007 \(BI\)-criteria food packing by dynamic programming. Zbl 1142.90386 Karuno, Yoshiyuki; Nagamochi, Hiroshi; Wang, Xiaoming 3 2007 Bisecting a 4-connected graph with three resource sets. Zbl 1142.05068 Ishii, Toshimasa; Iwata, Kengo; Nagamochi, Hiroshi 2 2007 Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds. Zbl 1142.90471 Fukunaga, Takuro; Nagamochi, Hiroshi 2 2007 Approximation to the minimum cost edge installation problem. Zbl 1193.68287 Morsy, Ehab; Nagamochi, Hiroshi 2 2007 Approximating capacitated tree-routings in networks. Zbl 1198.68300 Morsy, Ehab; Nagamochi, Hiroshi 2 2007 A multi-sphere scheme for 2D and 3D packing problems. Zbl 1134.90472 Imamichi, Takashi; Nagamochi, Hiroshi 2 2007 Minimum degree orderings. Zbl 1193.68198 Nagamochi, Hiroshi 1 2007 The set connector problem in graphs. Zbl 1136.90490 Fukunaga, Takuro; Nagamochi, Hiroshi 1 2007 Generalizing the induced matching by edge capacity constraints. Zbl 1163.90606 Fukunaga, Takuro; Nagamochi, Hiroshi 1 2007 ...and 96 more Documents all cited Publications top 5 cited Publications all top 5 Cited by 1,444 Authors 90 Nagamochi, Hiroshi 29 Xiao, Mingyu 22 Hong, Seok-Hee 17 Ishii, Toshimasa 17 Nutov, Zeev 16 Ibaraki, Toshihide 14 Frati, Fabrizio 13 Da Lozzo, Giordano 13 Fang, Qizhi 12 Fomin, Fedor V. 12 Fukunaga, Takuro 11 Angelini, Patrizio 10 Okamoto, Yoshio 10 Yu, Wei 9 Golovach, Petr A. 9 Kobourov, Stephen G. 9 Liu, Zhaohui 9 Makino, Kazuhisa 8 Cardinal, Jean 8 Chang, Jou-Ming 8 Di Battista, Giuseppe 8 Fujito, Toshihiro 8 Kamiyama, Naoyuki 8 Kobayashi, Yusuke 8 Mchedlidze, Tamara 8 Rutter, Ignaz 8 Schmidt, Jens M. 7 Bekos, Michael A. 7 Biedl, Therese C. 7 Chandrasekaran, Karthekeyan 7 Fernau, Henning 7 Ito, Hiro 7 Katoh, Naoki 7 Kaufmann, Michael 7 Mei, Lili 7 Patrignani, Maurizio 7 Tóth, Csaba D. 7 Wei, Lijun 7 Xiao, Han 7 Xu, Chao 6 Bang-Jensen, Jørgen 6 Chekuri, Chandra S. 6 Cheriyan, Joseph 6 Deng, Xiao-Tie 6 Didimo, Walter 6 Förster, Henry 6 Haraguchi, Kazuya 6 Hoefer, Martin 6 Jordán, Tibor 6 Kakimura, Naonori 6 Kortsarz, Guy 6 Lokshtanov, Daniel 6 Rauch Henzinger, Monika 6 Saurabh, Saket 6 Shurbevski, Aleksandar 6 Wolff, Alexander 6 Zhang, Guochuan 5 Fox, Kyle 5 Fujishige, Satoru 5 Fulek, Radoslav 5 Georgiadis, Loukas 5 Hamers, Herbert 5 Iori, Manuel 5 Könemann, Jochen 5 Lubiw, Anna 5 Montecchiani, Fabrizio 5 Morsy, Ehab 5 Nöllenburg, Martin 5 Parekh, Ojas D. 5 Roselli, Vincenzo 5 Strash, Darren 5 Tsin, Yung Hyang 5 Wahlström, Magnus 5 Wang, Jianxin 5 Xu, Zhou 5 Yang, Jinn-Shyong 5 Ye, Deshi 5 Zhang, Peng 4 Aissi, Hassene 4 Babenko, Maxim A. 4 Bazgan, Cristina 4 Bérczi, Kristóf 4 Cai, Zhipeng 4 Chambers, Erin Wolf 4 Dujmović, Vida 4 Eades, Peter 4 Ekim, Tınaz 4 Erickson, Jeff 4 Fu, Bin 4 Hirai, Hiroshi 4 Hurtado, Ferran 4 Imamichi, Takashi 4 Italiano, Giuseppe Francesco 4 Ito, Takehiro 4 Iwata, Satoru 4 Karuno, Yoshiyuki 4 Kern, Walter 4 Kobayashi, Yasuaki 4 Langerman, Stefan 4 Letchford, Adam N. ...and 1,344 more Authors all top 5 Cited in 114 Serials 92 Theoretical Computer Science 81 Discrete Applied Mathematics 59 Algorithmica 35 Information Processing Letters 32 European Journal of Operational Research 28 Journal of Combinatorial Optimization 23 Computers & Operations Research 21 Mathematical Programming. Series A. Series B 20 Operations Research Letters 19 Networks 19 Discrete Optimization 17 Theory of Computing Systems 15 Journal of Discrete Algorithms 14 Annals of Operations Research 12 SIAM Journal on Computing 12 Computational Geometry 12 Journal of Graph Algorithms and Applications 11 Discrete Mathematics 11 SIAM Journal on Discrete Mathematics 10 Journal of Computer and System Sciences 8 Journal of Combinatorial Theory. Series B 8 International Transactions in Operational Research 7 Discrete & Computational Geometry 7 International Journal of Foundations of Computer Science 5 Artificial Intelligence 5 Information and Computation 5 Japan Journal of Industrial and Applied Mathematics 5 Journal of Scheduling 4 Mathematics of Operations Research 4 Games and Economic Behavior 4 4OR 4 Optimization Letters 4 Computer Science Review 3 International Journal of Game Theory 3 Combinatorica 3 Graphs and Combinatorics 3 Journal of Global Optimization 3 Applied Mathematical Modelling 3 Top 3 Journal of Heuristics 3 INFORMS Journal on Computing 3 Mathematical Problems in Engineering 3 Mathematical Methods of Operations Research 3 International Game Theory Review 3 Journal of the Operations Research Society of China 2 Applied Mathematics and Computation 2 Automatica 2 Information Sciences 2 Journal of Graph Theory 2 Operations Research 2 European Journal of Combinatorics 2 Mathematical Social Sciences 2 Mathematical and Computer Modelling 2 Neural Networks 2 The Electronic Journal of Combinatorics 2 Discussiones Mathematicae. Graph Theory 2 AKCE International Journal of Graphs and Combinatorics 2 International Journal of Operations Research (Taichung) 2 Algorithms 2 ACM Transactions on Algorithms 2 Theory of Computing 2 CGT. Computing in Geometry and Topology 1 Acta Informatica 1 Journal of Mathematical Physics 1 Physica A 1 Journal of Computational and Applied Mathematics 1 Journal of Functional Analysis 1 Naval Research Logistics 1 Theory and Decision 1 OR Spektrum 1 Computer Aided Geometric Design 1 Optimization 1 Journal of Computer Science and Technology 1 Asia-Pacific Journal of Operational Research 1 Applied Mathematics Letters 1 Journal of Parallel and Distributed Computing 1 International Journal of Computational Geometry & Applications 1 Automation and Remote Control 1 International Journal of Computer Mathematics 1 Distributed Computing 1 International Journal of Robust and Nonlinear Control 1 Cybernetics and Systems Analysis 1 Computational Optimization and Applications 1 Journal of Computer and Systems Sciences International 1 Fractals 1 Filomat 1 The Journal of Artificial Intelligence Research (JAIR) 1 Journal of Mathematical Chemistry 1 Parallel Algorithms and Applications 1 Annals of Combinatorics 1 Journal of Applied Statistics 1 CEJOR. Central European Journal of Operations Research 1 RAIRO. Operations Research 1 Annales Henri Poincaré 1 Journal of Modern Optics 1 Review of Economic Design 1 OR Spectrum 1 Natural Computing 1 ACM Journal of Experimental Algorithmics 1 Journal of Control Theory and Applications ...and 14 more Serials all top 5 Cited in 20 Fields 513 Computer science (68-XX) 470 Combinatorics (05-XX) 364 Operations research, mathematical programming (90-XX) 109 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 17 Convex and discrete geometry (52-XX) 8 Information and communication theory, circuits (94-XX) 7 Numerical analysis (65-XX) 7 Systems theory; control (93-XX) 3 Quantum theory (81-XX) 3 Biology and other natural sciences (92-XX) 2 Probability theory and stochastic processes (60-XX) 2 Statistics (62-XX) 2 Statistical mechanics, structure of matter (82-XX) 1 History and biography (01-XX) 1 Measure and integration (28-XX) 1 Partial differential equations (35-XX) 1 Harmonic analysis on Euclidean spaces (42-XX) 1 General topology (54-XX) 1 Algebraic topology (55-XX) 1 Manifolds and cell complexes (57-XX) Citations by Year