Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Co-authors
(104)
Toshihide Ibaraki
83
Toshimasa ISHII (石井利昌)
27
Seok-hee Hong
19
Takuro Fukunaga (福永拓郎)
19
Liang Zhao
16
Conferences
(32)
ISAAC
28
COCOON
6
SODA
5
IPCO
4
TAMC
4
Journals
(37)
DAM
21
IEICE
13
JCO
12
Algorithmica
11
TCS
10
Keywords
(232)
Embed
Subscribe
Academic
Authors
Hiroshi Nagamochi
Edit
Hiroshi Nagamochi (永持仁)
Kyoto University
Publications: 251
|
Citations: 1774
|
G-Index: 34
|
H-Index: 19
The information is calculated based on the tens of millions of scholarly articles currently discoverable within Microsoft Academic Search. As more content gets indexed, the accuracy and completeness will continue to improve.
Interests:
Algorithms & Theory
,
Scientific Computing
,
Networks & Communications
View FAQ about top research area and research interests
Collaborated with
104 co-authors
from 1988 to 2011
; Cited by
1226 authors
Homepage
|
Bing
Cumulative
Annual
Order by:
Publications
(251)
BibTeX
|
RIS
|
RefWorks
Download
Efficient branch-and-bound algorithms for weighted MAX2SAT
(
Citations: 1
)
Toshihide Ibaraki
,
Takashi Imamichi
,
Yuichi Koga
,
Hiroshi Nagamochi
,
Koji Nonobe
,
Mutsunori Yagiura
Journal:
Mathematical Programming
, vol. 127, no. 2, pp. 297-343, 2011
Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming
Tomoki Imada
,
Shunsuke Ota
,
Hiroshi Nagamochi
,
Tatsuya Akutsu
Published in 2011.
On the one-dimensional stock cutting problem in the paper tube industry
Kazuki Matsumoto
,
Shunji Umetani
,
Hiroshi Nagamochi
Journal:
Journal of Scheduling - SCHEDULING
, vol. 14, no. 3, pp. 281-290, 2011
Approximating capacitated tree-routings in networks
Ehab Morsy
,
Hiroshi Nagamochi
Journal:
Journal of Combinatorial Optimization - JCO
, vol. 21, no. 2, pp. 254-267, 2011
Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs
Bingbing Zhuang
,
Hiroshi Nagamochi
Journal:
Ieice Transactions - IEICE
, vol. 94-D, no. 2, pp. 211-219, 2011
Order by:
Citations
(1774 times by 1026 publications)
Survey of local algorithms
(
Citations: 14
)
Jukka Suomela
Published in 2012.
On packing squares into a rectangle
(
Citations: 6
)
Stefan Hougardy
Journal:
Computational Geometry: Theory and Applications - COMGEO
, vol. 44, no. 8, pp. 456-463, 2011
Certifying algorithms
(
Citations: 3
)
Ross M. McConnell
,
Kurt Mehlhorn
,
Stefan Näher
,
Pascal Schweitzer
Journal:
Computer Science Review
, vol. 5, no. 2, pp. 119-161, 2011
Speedup in the Traveling Repairman Problem with Constrained Time Windows
(
Citations: 2
)
Greg N. Frederickson
,
Barry Wittman
Published in 2011.
A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
(
Citations: 1
)
Guy Even
,
Guy Kortsarz
,
Zeev Nutov
Journal:
Information Processing Letters - IPL
, vol. 111, no. 6, pp. 296-300, 2011
Comments