×

zbMATH — the first resource for mathematics

Nagamochi, Hiroshi

Compute Distance To:
Author ID: nagamochi.hiroshi Recent zbMATH articles by "Nagamochi, Hiroshi"
Published as: Nagamochi, H.; Nagamochi, Hiroshi
Homepage: https://www-or.amp.i.kyoto-u.ac.jp/members/nag/index-e.html
External Links: MGP · ORCID · dblp · GND
Documents Indexed: 255 Publications since 1989, including 5 Books
all top 5

Co-Authors

20 single-authored
71 Ibaraki, Toshihide
26 Xiao, Mingyu
25 Ishii, Toshimasa
24 Hong, Seok-Hee
21 Fukunaga, Takuro
15 Karuno, Yoshiyuki
12 Zhao, Liang
9 Morsy, Ehab
7 Shurbevski, Aleksandar
6 Imamichi, Takashi
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 Akutsu, Tatsuya
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 Frank, András
2 Fujishige, Satoru
2 Fujita, Hitoshi
2 Halldórsson, Magnús Mar
2 Haraguchi, Kazuya
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
1 Aota, Hirofumi
1 Azam, Naveed Ahmed
1 Berger, André
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 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
1 Shimizu, Toshihiro
1 Slamin, S.
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
1 Zeng, Daozhi

Publications by Year

Citations contained in zbMATH Open

181 Publications have been cited 996 times in 656 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
62
1992
Computing edge-connectivity in multigraphs and capacitated graphs. Zbl 0754.05062
Nagamochi, Hiroshi; Ibaraki, Toshihide
56
1992
Algorithmic aspects of the core of combinatorial optimization games. Zbl 1064.91505
Deng, Xiaotie; Ibaraki, Toshihide; Nagamochi, Hiroshi
55
1999
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
31
2009
Algorithmic aspects of graph connectivity. Zbl 1172.05003
Nagamochi, Hiroshi; Ibaraki, Toshihide
25
2008
A 2-approximation algorithm for the minimum weight edge dominating set problem. Zbl 1016.68061
Fujito, Toshihiro; Nagamochi, Hiroshi
24
2002
Exact algorithms for maximum independent set. Zbl 1406.68047
Xiao, Mingyu; Nagamochi, Hiroshi
18
2013
Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Zbl 1092.68105
Eades, Peter; Feng, Qingwen; Lin, Xuemin; Nagamochi, Hiroshi
18
2006
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. Zbl 1012.68226
Nagamochi, Hiroshi
17
2003
Independent spanning trees with small depths in iterated line digraphs. Zbl 0983.05023
Hasunuma, Toru; Nagamochi, Hiroshi
17
2001
On sparse subgraphs preserving connectivity properties. Zbl 0788.05061
Frank, András; Ibaraki, Toshihide; Nagamochi, Hiroshi
16
1993
Minimum cost source location problem with vertex-connectivity requirements in digraphs. Zbl 1003.68110
Nagamochi, Hiroshi; Ishii, Toshimasa; Ito, Hiro
15
2001
Totally balanced combinatorial optimization games. Zbl 0978.91005
Deng, Xiaotie; Ibaraki, Toshihide; Nagamochi, Hiroshi; Zang, Wenan
15
2000
2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. Zbl 1034.68122
Karuno, Yoshiyuki; Nagamochi, Hiroshi
14
2003
Graph connectivity and its augmentation: Applications of MA orderings. Zbl 0995.05081
Nagamochi, Hiroshi; Ibaraki, Toshihide
13
2002
Vehicle scheduling on a tree with release and handling times. Zbl 0880.90037
Karuno, Yoshiyuki; Nagamochi, Hiroshi; Ibaraki, Toshihide
13
1997
Implementing an efficient minimum capacity cut algorithm. Zbl 0821.90130
Nagamochi, Hiroshi; Ono, Tadashi; Ibaraki, Toshihide
13
1994
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Zbl 1179.90285
Imamichi, Takashi; Yagiura, Mutsunori; Nagamochi, Hiroshi
12
2009
A linear time algorithm for computing 3-edge-connected components in a multigraph. Zbl 0761.05089
Nagamochi, Hiroshi; Ibaraki, Toshihide
12
1992
Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs. Zbl 1259.68263
Xiao, Mingyu; Nagamochi, Hiroshi
11
2013
Convex drawings of graphs with non-convex boundary constraints. Zbl 1144.05023
Hong, Seok-Hee; Nagamochi, Hiroshi
11
2008
Approximability of the capacitated \(b\)-edge dominating set problem. Zbl 1124.68115
Berger, André; Fukunaga, Takuro; Nagamochi, Hiroshi; Parekh, Ojas
11
2007
An improved bound on the one-sided minimum crossing number in two-layered drawings. Zbl 1066.05059
Nagamochi, Hiroshi
10
2005
Greedy splitting algorithms for approximating multiway partition problems. Zbl 1177.90403
Zhao, Liang; Nagamochi, Hiroshi; Ibaraki, Toshihide
10
2005
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks. Zbl 1024.90008
Karuno, Yoshiyuki; Nagamochi, Hiroshi; Ibaraki, Toshihide
10
2002
Computing all small cuts in an undirected network. Zbl 0884.05060
Nagamochi, Hiroshi; Nishimura, Kazuhiro; Ibaraki, Toshihide
10
1997
Characterizing mechanisms in obnoxious facility game. Zbl 1358.91061
Ibara, Ken; Nagamochi, Hiroshi
9
2012
A deterministic algorithm for finding all minimum \(k\)-way cuts. Zbl 1124.05083
Kamidoi, Yoko; Yoshida, Noriyoshi; Nagamochi, Hiroshi
9
2006
Simpler algorithms for testing two-page book embedding of partitioned graphs. Zbl 1425.05151
Hong, Seok-Hee; Nagamochi, Hiroshi
8
2014
Linear layouts in submodular systems. Zbl 1260.90160
Nagamochi, Hiroshi
8
2012
Convex drawings of hierarchical planar graphs and clustered planar graphs. Zbl 1231.05184
Hong, Seok-Hee; Nagamochi, Hiroshi
8
2010
Approximating the minmax rooted-tree cover in a tree. Zbl 1184.68646
Nagamochi, Hiroshi; Okada, Kohei
8
2007
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
8
1998
Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs. Zbl 0895.90172
Nagamochi, Hiroshi; Ibaraki, Toshihide
8
1997
Exact algorithms for maximum independent set. Zbl 1371.68126
Xiao, Mingyu; Nagamochi, Hiroshi
7
2017
An exact strip packing algorithm based on canonical forms. Zbl 1349.90704
Arahori, Yohei; Imamichi, Takashi; Nagamochi, Hiroshi
7
2012
Robust cost colorings. Zbl 1192.90071
Fukunaga, Takuro; Halldórsson, Magnús M.; Nagamochi, Hiroshi
7
2008
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times. Zbl 1067.90143
Karuno, Yoshiyuki; Nagamochi, Hiroshi
7
2004
A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree. Zbl 1061.90096
Nagamochi, Hiroshi; Okada, Kohei
7
2004
A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem. Zbl 1173.68874
Zhao, Liang; Nagamochi, Hiroshi; Ibaraki, Toshihide
7
2003
Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts. Zbl 1135.05316
Zhao, Liang; Nagamochi, Hiroshi; Ibaraki, Toshihide
7
2001
Drawing clustered graphs on an orthogonal grid. Zbl 0960.05042
Eades, Peter; Feng, Qingwen; Nagamochi, Hiroshi
7
1999
Vehicle scheduling on a tree to minimize maximum lateness. Zbl 0873.90051
Karuno, Yoshiyuki; Nagamochi, Hiroshi; Ibaraki, Toshihide
7
1996
Counting the number of minimum cuts in undirected multigraphs. Zbl 0739.90026
Nagamochi, Hiroshi; Sun, Zheng; Ibaraki, Toshihide
7
1991
The source location problem with local 3-vertex-connectivity requirements. Zbl 1127.90009
Ishii, Toshimasa; Fujita, Hitoshi; Nagamochi, Hiroshi
6
2007
Graph algorithms for network connectivity problems. Zbl 1106.05091
Nagamochi, Hiroshi
6
2004
A better approximation for the two-machine flowshop scheduling problem with time lags. Zbl 1205.90125
Karuno, Yoshiyuki; Nagamochi, Hiroshi
6
2003
Polynomial time 2-approximation algorithms for the minmax subtree cover problem. Zbl 1205.68518
Nagamochi, Hiroshi; Okada, Kohei
6
2003
A note on minimizing submodular functions. Zbl 1339.90285
Nagamochi, Hiroshi; Ibaraki, Toshihide
6
1998
An exact algorithm for maximum independent set in degree-5 graphs. Zbl 1326.05115
Xiao, Mingyu; Nagamochi, Hiroshi
5
2016
Exact algorithms for dominating induced matching based on graph partition. Zbl 1316.05102
Xiao, Mingyu; Nagamochi, Hiroshi
5
2015
Complexity and kernels for bipartition into degree-bounded induced graphs. Zbl 1432.68197
Xiao, Mingyu; Nagamochi, Hiroshi
5
2014
Parameterized edge dominating set in graphs with degree bounded by 3. Zbl 1325.05132
Xiao, Mingyu; Nagamochi, Hiroshi
5
2013
Star-shaped drawings of graphs with fixed embedding and concave corner constraints. Zbl 1148.68549
Hong, Seok-Hee; Nagamochi, Hiroshi
5
2008
An improved approximation algorithm for capacitated multicast routings in networks. Zbl 1135.68064
Morsy, Ehab; Nagamochi, Hiroshi
5
2008
Orthogonal drawings for plane graphs with specified face areas. Zbl 1200.68171
Kawaguchi, Akifumi; Nagamochi, Hiroshi
5
2007
Convex drawings of graphs with non-convex boundary. Zbl 1167.68456
Hong, Seok-Hee; Nagamochi, Hiroshi
5
2006
Augmenting forests to meet odd diameter requirements. Zbl 1101.90078
Ishii, Toshimasa; Yamamoto, Shigeyuki; Nagamochi, Hiroshi
5
2006
A fast algorithm for cactus representations of minimum cuts. Zbl 1306.90165
Nagamochi, Hiroshi; Nakao, Yoshitaka; Ibaraki, Toshihide
5
2000
A fast algorithm for computing minimum 3-way and 4-way cuts. Zbl 0986.90068
Nagamochi, Hiroshi; Ibaraki, Toshihide
5
2000
A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs. Zbl 0952.68114
Nagamochi, H.; Nakamura, S.; Ibaraki, T.
5
2000
Augmenting edge-connectivity over the entire range in \(\widetilde O(nm)\) time. Zbl 0923.68096
Nagamochi, Hiroshi; Ibaraki, Toshihide
5
1999
Complexity of the single vehicle scheduling problem on graphs. Zbl 0894.90081
Nagamochi, Hiroshi; Mochizuki, Koji; Ibaraki, Toshihide
5
1997
Canonical cactus representation for miminum cuts. Zbl 0814.05067
Nagamochi, Hiroshi; Kameda, Tiko
5
1994
Testing full outer-2-planarity in linear time. Zbl 1417.05212
Hong, Seok-Hee; Nagamochi, Hiroshi
4
2016
An improved exact algorithm for undirected feedback vertex set. Zbl 1407.68375
Xiao, Mingyu; Nagamochi, Hiroshi
4
2013
A refined exact algorithm for edge dominating set. Zbl 1354.05136
Xiao, Mingyu; Nagamochi, Hiroshi
4
2012
Minmax tree cover in the Euclidean space. Zbl 1276.05115
Karakawa, Seigo; Morsy, Ehab; Nagamochi, Hiroshi
4
2011
Network design with weighted degree constraints. Zbl 1241.90159
Fukunaga, Takuro; Nagamochi, Hiroshi
4
2010
Minimum degree orderings. Zbl 1187.68352
Nagamochi, Hiroshi
4
2010
An algorithm for constructing star-shaped drawings of plane graphs. Zbl 1219.05101
Hong, Seok-Hee; Nagamochi, Hiroshi
4
2010
Minimum transversals in posimodular systems. Zbl 1207.68168
Sakashita, Mariko; Makino, Kazuhisa; Nagamochi, Hiroshi; Fujishige, Satoru
4
2009
Minimum cost source location problem with local 3-vertex-connectivity requirements. Zbl 1110.68101
Ishii, Toshimasa; Fujita, Hitoshi; Nagamochi, Hiroshi
4
2007
An approximation algorithm for dissecting a rectangle into rectangles with specified areas. Zbl 1107.68122
Nagamochi, Hiroshi; Abe, Yuusuke
4
2007
On the minimum augmentation of an \(\ell\)-connected graph to a \(k\)-connected graph. Zbl 0966.68006
Ishii, Toshimasa; Nagamochi, Hiroshi
4
2000
Complexity of the minimum base game on matroids. Zbl 0871.90121
Nagamochi, Hiroshi; Zeng, Dao-Zhi; Kabutoya, Naohisa; Ibaraki, Toshihide
4
1997
Constructing cactus representation for all minimum cuts in an undirected network. Zbl 0870.90098
Nagamochi, Hiroshi; Kameda, Tiko
4
1996
Computing all small cuts in undirected networks. Zbl 0953.68578
Nagamochi, Hiroshi; Nishimura, Kazuhiro; Ibaraki, Toshihide
4
1994
Complexity and kernels for bipartition into degree-bounded induced graphs. Zbl 1355.68131
Xiao, Mingyu; Nagamochi, Hiroshi
3
2017
Approximating the bipartite TSP and its biased generalization. Zbl 1408.90262
Shurbevski, Aleksandar; Nagamochi, Hiroshi; Karuno, Yoshiyuki
3
2014
Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems. Zbl 1239.05153
Okumoto, Kazumasa; Fukunaga, Takuro; Nagamochi, Hiroshi
3
2012
Parameterized edge dominating set in cubic graphs (extended abstract). Zbl 1329.05288
Xiao, Mingyu; Nagamochi, Hiroshi
3
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
A detachment algorithm for inferring a graph from path frequency. Zbl 1172.68049
Nagamochi, Hiroshi
3
2009
Approximating a vehicle scheduling problem with time windows and handling times. Zbl 1182.90049
Nagamochi, Hiroshi; Ohnishi, Takaharu
3
2008
Minimum cost subpartitions in graphs. Zbl 1185.05139
Nagamochi, Hiroshi; Kamidoi, Yoko
3
2007
“Rent-or-buy” scheduling and cost coloring problems. Zbl 1135.90344
Fukunaga, Takuro; Halldórsson, Magnús M.; Nagamochi, Hiroshi
3
2007
Drawing \(c\)-planar biconnected clustered graphs. Zbl 1118.05022
Nagamochi, Hiroshi; Kuroya, Katsutoshi
3
2007
Packing soft rectangles. Zbl 1103.68142
Nagamochi, Hiroshi
3
2006
Scheduling vehicles on trees. Zbl 1274.90459
Karuno, Yoshiyuki; Nagamochi, Hiroshi
3
2005
Packing unit squares in a rectangle. Zbl 1080.52012
Nagamochi, Hiroshi
3
2005
Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs. Zbl 1270.05093
Ishii, Toshimasa; Akiyama, Yoko; Nagamochi, Hiroshi
3
2003
Augmenting forests to meet odd diameter requirements. Zbl 1205.05224
Ishii, Toshimasa; Yamamoto, Shigeyuki; Nagamochi, Hiroshi
3
2003
A polynomial time approximation scheme for the multi-vehicle scheduling problem on a path with release and handling times. Zbl 1077.68956
Karuno, Yoshiyuki; Nagamochi, Hiroshi
3
2001
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
3
2001
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs. Zbl 1028.90074
Nagamochi, Hiroshi; Katayama, Shigeki; Ibaraki, Toshihide
3
2000
Computational complexity of the traveling salesman problem on a line with deadlines and general handling times. Zbl 0970.90107
Karuno, Yoshiyuki; Nagamochi, Hiroshi; Ibaraki, Toshihide
3
1996
Re-embedding a 1-plane graph into a straight-line drawing in linear time. Zbl 06687306
Hong, Seok-Hee; Nagamochi, Hiroshi
2
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
2
2016
An improved exact algorithm for undirected feedback vertex set. Zbl 1327.90272
Xiao, Mingyu; Nagamochi, Hiroshi
2
2015
Some reduction operations to pairwise compatibility graphs. Zbl 07134470
Xiao, Mingyu; Nagamochi, Hiroshi
1
2020
A linear-time algorithm for testing full outer-2-planarity. Zbl 1405.05036
Hong, Seok-Hee; Nagamochi, Hiroshi
1
2019
Characterizing star-PCGs. Zbl 06946812
Xiao, Mingyu; Nagamochi, Hiroshi
1
2018
Exact algorithms for maximum independent set. Zbl 1371.68126
Xiao, Mingyu; Nagamochi, Hiroshi
7
2017
Complexity and kernels for bipartition into degree-bounded induced graphs. Zbl 1355.68131
Xiao, Mingyu; Nagamochi, Hiroshi
3
2017
Parameterization of strategy-proof mechanisms in the obnoxious facility game. Zbl 1409.91108
Oomine, Morito; Shurbevski, Aleksandar; Nagamochi, Hiroshi
1
2017
An exact algorithm for maximum independent set in degree-5 graphs. Zbl 1326.05115
Xiao, Mingyu; Nagamochi, Hiroshi
5
2016
Testing full outer-2-planarity in linear time. Zbl 1417.05212
Hong, Seok-Hee; Nagamochi, Hiroshi
4
2016
Re-embedding a 1-plane graph into a straight-line drawing in linear time. Zbl 06687306
Hong, Seok-Hee; Nagamochi, Hiroshi
2
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
2
2016
A polynomial-space exact algorithm for TSP in degree-6 graphs. Zbl 06679463
Md Yunos, Norhazwani; Shurbevski, Aleksandar; Nagamochi, Hiroshi
1
2016
An improved exact algorithm for TSP in graphs of maximum degree 4. Zbl 1336.68276
Xiao, Mingyu; Nagamochi, Hiroshi
1
2016
Exact algorithms for dominating induced matching based on graph partition. Zbl 1316.05102
Xiao, Mingyu; Nagamochi, Hiroshi
5
2015
An improved exact algorithm for undirected feedback vertex set. Zbl 1327.90272
Xiao, Mingyu; Nagamochi, Hiroshi
2
2015
Simpler algorithms for testing two-page book embedding of partitioned graphs. Zbl 1425.05151
Hong, Seok-Hee; Nagamochi, Hiroshi
8
2014
Complexity and kernels for bipartition into degree-bounded induced graphs. Zbl 1432.68197
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
A refined exact algorithm for edge dominating set. Zbl 1304.05142
Xiao, Mingyu; Nagamochi, Hiroshi
2
2014
Exact algorithms for maximum independent set. Zbl 1406.68047
Xiao, Mingyu; Nagamochi, Hiroshi
18
2013
Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs. Zbl 1259.68263
Xiao, Mingyu; Nagamochi, Hiroshi
11
2013
Parameterized edge dominating set in graphs with degree bounded by 3. Zbl 1325.05132
Xiao, Mingyu; Nagamochi, Hiroshi
5
2013
An improved exact algorithm for undirected feedback vertex set. Zbl 1407.68375
Xiao, Mingyu; Nagamochi, Hiroshi
4
2013
An exact algorithm for maximum independent set in degree-5 graphs. Zbl 1303.05201
Xiao, Mingyu; Nagamochi, Hiroshi
2
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
2
2013
Characterizing mechanisms in obnoxious facility game. Zbl 1358.91061
Ibara, Ken; Nagamochi, Hiroshi
9
2012
Linear layouts in submodular systems. Zbl 1260.90160
Nagamochi, Hiroshi
8
2012
An exact strip packing algorithm based on canonical forms. Zbl 1349.90704
Arahori, Yohei; Imamichi, Takashi; Nagamochi, Hiroshi
7
2012
A refined exact algorithm for edge dominating set. Zbl 1354.05136
Xiao, Mingyu; Nagamochi, Hiroshi
4
2012
Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems. Zbl 1239.05153
Okumoto, Kazumasa; Fukunaga, Takuro; Nagamochi, Hiroshi
3
2012
An improved exact algorithm for TSP in degree-4 graphs. Zbl 1364.68236
Xiao, Mingyu; Nagamochi, Hiroshi
2
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
2
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
An FPT algorithm for edge subset feedback edge set. Zbl 1233.68142
Xiao, Mingyu; Nagamochi, Hiroshi
1
2012
Minmax tree cover in the Euclidean space. Zbl 1276.05115
Karakawa, Seigo; Morsy, Ehab; Nagamochi, Hiroshi
4
2011
Parameterized edge dominating set in cubic graphs (extended abstract). Zbl 1329.05288
Xiao, Mingyu; Nagamochi, Hiroshi
3
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
Cop-robber guarding game with cycle robber-region. Zbl 1237.91044
Nagamochi, Hiroshi
2
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
1
2011
On the one-dimensional stock cutting problem in the paper tube industry. Zbl 1222.90048
Matsumoto, Kazuki; Umetani, Shunji; Nagamochi, Hiroshi
1
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
8
2010
Network design with weighted degree constraints. Zbl 1241.90159
Fukunaga, Takuro; Nagamochi, Hiroshi
4
2010
Minimum degree orderings. Zbl 1187.68352
Nagamochi, Hiroshi
4
2010
An algorithm for constructing star-shaped drawings of plane graphs. Zbl 1219.05101
Hong, Seok-Hee; 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
31
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
12
2009
Minimum transversals in posimodular systems. Zbl 1207.68168
Sakashita, Mariko; Makino, Kazuhisa; Nagamochi, Hiroshi; Fujishige, Satoru
4
2009
A detachment algorithm for inferring a graph from path frequency. Zbl 1172.68049
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 edge-connectivity and degree constraints. Zbl 1192.68895
Fukunaga, Takuro; Nagamochi, Hiroshi
2
2009
Cop-robber guarding game with cycle robber region. Zbl 1248.91018
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
Drawing slicing graphs with face areas. Zbl 1162.68026
Kawaguchi, Akifumi; Nagamochi, Hiroshi
1
2009
Removing node overlaps using multi-sphere scheme. Zbl 1213.68458
Imamichi, Takashi; Arahori, Yohei; Gim, Jaeseong; Hong, Seok-Hee; Nagamochi, Hiroshi
1
2009
Network design with weighted degree constraints. Zbl 1211.68284
Fukunaga, Takuro; Nagamochi, Hiroshi
1
2009
Algorithmic aspects of graph connectivity. Zbl 1172.05003
Nagamochi, Hiroshi; Ibaraki, Toshihide
25
2008
Convex drawings of graphs with non-convex boundary constraints. Zbl 1144.05023
Hong, Seok-Hee; Nagamochi, Hiroshi
11
2008
Robust cost colorings. Zbl 1192.90071
Fukunaga, Takuro; Halldórsson, Magnús M.; Nagamochi, Hiroshi
7
2008
Star-shaped drawings of graphs with fixed embedding and concave corner constraints. Zbl 1148.68549
Hong, Seok-Hee; Nagamochi, Hiroshi
5
2008
An improved approximation algorithm for capacitated multicast routings in networks. Zbl 1135.68064
Morsy, Ehab; Nagamochi, Hiroshi
5
2008
Approximating a vehicle scheduling problem with time windows and handling times. Zbl 1182.90049
Nagamochi, Hiroshi; Ohnishi, Takaharu
3
2008
Approximating the generalized capacitated tree-routing problem. Zbl 1148.68420
Morsy, Ehab; Nagamochi, Hiroshi
1
2008
Approximating crossing minimization in radial layouts. Zbl 1136.68464
Hong, Seok-Hee; Nagamochi, Hiroshi
1
2008
Approximability of the capacitated \(b\)-edge dominating set problem. Zbl 1124.68115
Berger, André; Fukunaga, Takuro; Nagamochi, Hiroshi; Parekh, Ojas
11
2007
Approximating the minmax rooted-tree cover in a tree. Zbl 1184.68646
Nagamochi, Hiroshi; Okada, Kohei
8
2007
The source location problem with local 3-vertex-connectivity requirements. Zbl 1127.90009
Ishii, Toshimasa; Fujita, Hitoshi; Nagamochi, Hiroshi
6
2007
Orthogonal drawings for plane graphs with specified face areas. Zbl 1200.68171
Kawaguchi, Akifumi; Nagamochi, Hiroshi
5
2007
Minimum cost source location problem with local 3-vertex-connectivity requirements. Zbl 1110.68101
Ishii, Toshimasa; Fujita, Hitoshi; Nagamochi, Hiroshi
4
2007
An approximation algorithm for dissecting a rectangle into rectangles with specified areas. Zbl 1107.68122
Nagamochi, Hiroshi; Abe, Yuusuke
4
2007
Minimum cost subpartitions in graphs. Zbl 1185.05139
Nagamochi, Hiroshi; Kamidoi, Yoko
3
2007
“Rent-or-buy” scheduling and cost coloring problems. Zbl 1135.90344
Fukunaga, Takuro; Halldórsson, Magnús M.; Nagamochi, Hiroshi
3
2007
Drawing \(c\)-planar biconnected clustered graphs. Zbl 1118.05022
Nagamochi, Hiroshi; Kuroya, Katsutoshi
3
2007
Approximation to the minimum cost edge installation problem. Zbl 1193.68287
Morsy, Ehab; Nagamochi, Hiroshi
2
2007
\(BI\)-criteria food packing by dynamic programming. Zbl 1142.90386
Karuno, Yoshiyuki; Nagamochi, Hiroshi; Wang, Xiaoming
2
2007
Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds. Zbl 1142.90471
Fukumaga, Takuro; Nagamochi, Hiroshi
2
2007
Bisecting a 4-connected graph with three resource sets. Zbl 1142.05068
Ishii, Toshimasa; Iwata, Kengo; Nagamochi, Hiroshi
2
2007
Minimum degree orderings. Zbl 1193.68198
Nagamochi, Hiroshi
1
2007
Network design with edge-connectivity and degree constraints. Zbl 1129.90364
Fukunaga, Takuro; Nagamochi, Hiroshi
1
2007
Generalizing the induced matching by edge capacity constraints. Zbl 1163.90606
Fukunaga, Takuro; Nagamochi, Hiroshi
1
2007
A multi-sphere scheme for 2D and 3D packing problems. Zbl 1134.90472
Imamichi, Takashi; Nagamochi, Hiroshi
1
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
1
2007
The set connector problem in graphs. Zbl 1136.90490
Fukunaga, Takuro; Nagamochi, Hiroshi
1
2007
Approximating capacitated tree-routings in networks. Zbl 1198.68300
Morsy, Ehab; Nagamochi, Hiroshi
1
2007
Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Zbl 1092.68105
Eades, Peter; Feng, Qingwen; Lin, Xuemin; Nagamochi, Hiroshi
18
2006
A deterministic algorithm for finding all minimum \(k\)-way cuts. Zbl 1124.05083
Kamidoi, Yoko; Yoshida, Noriyoshi; Nagamochi, Hiroshi
9
2006
Convex drawings of graphs with non-convex boundary. Zbl 1167.68456
Hong, Seok-Hee; Nagamochi, Hiroshi
5
2006
Augmenting forests to meet odd diameter requirements. Zbl 1101.90078
Ishii, Toshimasa; Yamamoto, Shigeyuki; Nagamochi, Hiroshi
5
2006
Packing soft rectangles. Zbl 1103.68142
Nagamochi, Hiroshi
3
2006
Minimum transversals in posi-modular systems. Zbl 1131.05321
Sakashita, Mariko; Makino, Kazuhisa; Nagamochi, Hiroshi; Fujishige, Satoru
2
2006
A detachment algorithm for inferring a graph from path frequency. Zbl 1162.05362
Nagamochi, Hiroshi
2
2006
Some theorems on detachments preserving local-edge-connectivity. Zbl 1202.05077
Fukunaga, Takuro; Nagamochi, Hiroshi
1
2006
Sparse connectivity certificates via MA orderings in graphs. Zbl 1129.05025
Nagamochi, Hiroshi
1
2006
Minmax subtree cover problem on cacti. Zbl 1103.68143
Nagamochi, Hiroshi; Kawada, Taizo
1
2006
An improved bound on the one-sided minimum crossing number in two-layered drawings. Zbl 1066.05059
Nagamochi, Hiroshi
10
2005
Greedy splitting algorithms for approximating multiway partition problems. Zbl 1177.90403
Zhao, Liang; Nagamochi, Hiroshi; Ibaraki, Toshihide
10
2005
...and 81 more Documents
all top 5

Cited by 1,067 Authors

80 Nagamochi, Hiroshi
21 Xiao, Mingyu
16 Hong, Seok-Hee
15 Ishii, Toshimasa
14 Ibaraki, Toshihide
14 Nutov, Zeev
12 Fukunaga, Takuro
10 Frati, Fabrizio
9 Fang, Qizhi
8 Fomin, Fedor V.
7 Angelini, Patrizio
7 Cardinal, Jean-Paul
7 Chang, Jou-Ming
7 Da Lozzo, Giordano
7 Fujito, Toshihiro
7 Kaufmann, Michael
7 Liu, Zhaohui
7 Makino, Kazuhisa
7 Okamoto, Yoshio
7 Yu, Wei
6 Deng, Xiao-Tie
6 Ito, Hiro
6 Jordán, Tibor
6 Kobourov, Stephen G.
6 Kortsarz, Guy
6 Wei, Lijun
5 Biedl, Therese C.
5 Chekuri, Chandra S.
5 Di Battista, Giuseppe
5 Fujishige, Satoru
5 Fulek, Radoslav
5 Golovach, Petr A.
5 Kamiyama, Naoyuki
5 Katoh, Naoki
5 Kobayashi, Yusuke
5 Lokshtanov, Daniel
5 Parekh, Ojas
5 Rutter, Ignaz
5 Tóth, Csaba D.
5 Xu, Chao
5 Xu, Zhou
5 Yang, Jinn-Shyong
4 Bang-Jensen, Jørgen
4 Cheriyan, Joseph
4 Dujmović, Vida
4 Fernau, Henning
4 Hamers, Herbert
4 Hirai, Hiroshi
4 Hurtado, Ferran
4 Iori, Manuel
4 Kakimura, Naonori
4 Karuno, Yoshiyuki
4 Kern, Walter
4 Kobayashi, Yasuaki
4 Könemann, Jochen
4 Langerman, Stefan
4 Letchford, Adam N.
4 Leung, Stephen C. H.
4 Lin, Min Chih
4 Mchedlidze, Tamara
4 Mei, Lili
4 Morsy, Ehab
4 Rauch Henzinger, Monika
4 Roselli, Vincenzo
4 Saurabh, Saket
4 Schmidt, Jens M.
4 Tsin, Yung Hyang
4 Wahlström, Magnus
4 Williamson, David P.
4 Ye, Deshi
4 Zhang, Guochuan
3 Aissi, Hassene
3 Babenko, Maxim A.
3 Bazgan, Cristina
3 Bekos, Michael A.
3 Bernáth, Attila
3 Biró, Peter
3 Cai, Zhipeng
3 Cicalese, Ferdinando
3 Cornelsen, Sabine
3 Côté, Jean-François
3 Cygan, Marek
3 Ekim, Tınaz
3 Felsner, Stefan
3 Fiorini, Samuel
3 Fox, Kyle
3 Fu, Bin
3 Garcia, Alfredo Daniel
3 Georgiadis, Loukas
3 Hoefer, Martin
3 Imahori, Shinji
3 Imamichi, Takashi
3 Italiano, Giuseppe Francesco
3 Iwata, Satoru
3 Joret, Gwenaël
3 Karger, David R.
3 Lim, Andrew
3 Lin, Guohui
3 Lingas, Andrzej
3 McCormick, S. Thomas
...and 967 more Authors
all top 5

Cited in 95 Serials

75 Theoretical Computer Science
72 Discrete Applied Mathematics
50 Algorithmica
32 Information Processing Letters
28 European Journal of Operational Research
20 Journal of Combinatorial Optimization
19 Discrete Optimization
18 Operations Research Letters
16 Mathematical Programming. Series A. Series B
15 Computers & Operations Research
15 Journal of Discrete Algorithms
14 Networks
12 Theory of Computing Systems
11 Computational Geometry
10 Annals of Operations Research
9 Discrete Mathematics
9 SIAM Journal on Computing
8 Journal of Computer and System Sciences
8 Journal of Graph Algorithms and Applications
7 Discrete & Computational Geometry
7 SIAM Journal on Discrete Mathematics
6 Journal of Combinatorial Theory. Series B
6 International Journal of Foundations of Computer Science
5 Japan Journal of Industrial and Applied Mathematics
5 International Transactions in Operational Research
5 Journal of Scheduling
4 Artificial Intelligence
4 Optimization Letters
3 Combinatorica
3 Information and Computation
3 Journal of Global Optimization
3 Games and Economic Behavior
3 Journal of Heuristics
3 Mathematical Problems in Engineering
3 International Game Theory Review
3 Computer Science Review
2 Automatica
2 Information Sciences
2 International Journal of Game Theory
2 Mathematics of Operations Research
2 Operations Research
2 European Journal of Combinatorics
2 Mathematical Social Sciences
2 Mathematical and Computer Modelling
2 Neural Networks
2 Applied Mathematical Modelling
2 Top
2 INFORMS Journal on Computing
2 Mathematical Methods of Operations Research
2 Algorithms
2 Journal of the Operations Research Society of China
1 Journal of Mathematical Physics
1 Applied Mathematics and Computation
1 Journal of Graph Theory
1 Naval Research Logistics
1 Theory and Decision
1 OR Spektrum
1 Computer Aided Geometric Design
1 Optimization
1 Graphs and Combinatorics
1 Journal of Computer Science and Technology
1 Applied Mathematics Letters
1 Journal of Parallel and Distributed Computing
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 The Journal of Artificial Intelligence Research (JAIR)
1 Discussiones Mathematicae. Graph Theory
1 Journal of Mathematical Chemistry
1 Parallel Algorithms and Applications
1 Annals of Combinatorics
1 CEJOR. Central European Journal of Operations Research
1 RAIRO. Operations Research
1 Annales Henri Poincaré
1 Journal of Modern Optics
1 OR Spectrum
1 Natural Computing
1 4OR
1 Journal of Control Theory and Applications
1 Journal of Industrial and Management Optimization
1 Frontiers of Mathematics in China
1 Serdica Journal of Computing
1 Discrete Mathematics, Algorithms and Applications
1 Mathematical Programming Computation
1 Science China. Information Sciences
1 RAIRO. Theoretical Informatics and Applications
1 Games
1 Frontiers of Computer Science
1 ACM Transactions on Computation Theory
1 Journal of Mathematical Modelling and Algorithms in Operations Research
1 Sahand Communications in Mathematical Analysis

Citations by Year