論文
公開件数:119件
No. 種別 査読の有無 標題 単著・共著区分 著者 誌名 巻号頁 出版日 ISSN DOI URL
1 一般論文

On the characterization of 1-sided error strongly-testable graph properties for bounded-degree graphs
共著
Hiro Ito, Areej Khoury, and Ilan Newman
Journal of Computational Complexity
29/ Article 1, 1-45
2020

10.1007/s00037-020-00191-6

2 一般論文

Hyperfiniteness of real-world newtorks
共著
Yutaro Honda, Yoshitake Inoue, Hiro Ito, Munehiro Sasajima, Junichi Teruyama, and Yushi Uno
The Review of Socionetwork Strategies
13/ 2, 123-141
2019

10.1007/s12626-019-00051-3

3 一般論文

What graph properties are constant-time testable? --- dense graphs, sparse graphs, and complex networks
単著
ITO Hiro
The Review of Socionetwork Strategies
13/ 2, 101-121
2019



4 一般論文

Cookie Clicker
共著
Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
Graphs and Combinatorics
未定
2019



5 一般論文

Generalized shogi, chess, and xiangqui are constant-time testable
共著
ITO Hiro, NAGAO Atsuki, and PARK Teagun
IEICE Transactions
E102-A/ 9, 1126-1133
2019/09



6 一般論文

Modulation-Adaptive Link-Disjoint Path Selection Model for 1+1 Protected Elastic Optical Networks
共著
Yuto Kishi, Nattapong Kitsuwan, Hiro Ito, Bijoy Chand Chatterjee, and Eiji Oki
IEEE Access
7/ 1, 25422-25437
2019/02

10.1109/ACCESS.2019.2901018

7 一般論文

Energy efficiency and renewable energy management with multi-state power-down system
共著
James Andro-Vasko, Wolfgang Bein, and Hiro Ito
Information
10/ 2, 44:1-44:21
2018/12

10.3390/info10020044

8 一般論文

Bumpy pyramid folding
共著
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink, and Ryuhei Uehara
Computational Geometry
75, 22-31
2018/12

10.1016/j.comgeo.2018.06.007

9 一般論文

Transforming Graphs with the Same Graphic Sequence
共著
ITO Hiro and Sergey BEREG
Journal of Information Processing
25/ 8
2017/08



10 一般論文

Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares
共著
Zach Abel, Brad Ballinger, Erik Demaine, Martin Demaine, Jeff Erickson, Adam Hesterberg, Hiro Ito, Irina Kostitsyna, Jayson Lynch, and Ryuhei Uehara
Journal of Information Processing
25/ 8
2017/08



11 一般論文

A much faster algorithm for finding a maximum clique with computational experiments
共著
TOMITA Etsuji, MATSUZAKI Sora, NAGAO Atsuki, ITO Hiro, and WAKATSUKI Mitsuo
Journal of Information Processing
25/ 8, 未定-未定
2017/08



12 一般論文

Folding a Paper Strip to Minimize Thickness
共著
Erik D Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Journal of Discrete Algorithms
36, 18-26
2016



13 一般論文

Cannibal animal games: a new variant of tic-tac-toe
共著
Jean CARDINAL, Sebastien COLETTE, Hiro ITO, Matias KORMAN, Stefan LANGERMAN, Hikaru SAKIDANI, Perouz TASLAKIAN
Journal of Information Processing
23/ 3, 418-435
2015



14 一般論文

Generalized river crossing problems
共著
ITO Hiro, Stefan LANGERMAN, and YOSHIDA Yuichi
Theory of Computing Systems
to appear
2014



15 一般論文

Testing outerplanarity of bounded degree graphs
共著
YOSHIDA Yuichi and ITO Hiro
Algorithmica
to appear
2014



16 一般論文

Helly numbers of polyominoes

Jean CARDINAL, ITO Hiro, Matias KORMAN, and Stefan LANGERMAN
Graphs and Combinatorics
29/ 5, 1221-1234
2013



17 一般論文

On computational complexity of graph inference from counting

Szilard Zsolt Fazekas, Hiro Ito, Yasushi Okuno, Shinnosuke Seki, and Kei Taneishi
Natural Computing
12/ 4, 589-603
2013



18 一般論文

Complexity of the stamp folding problem

UMESATO Takuya, SAITOH Toshiki, UEHARA Ryuhei, ITO Hiro, and OKAMOTO Yoshio
Theoretical Computer Science
497/ 29, 13-19
2012



19 一般論文

An improved constant-time approximation algorithm for maximum matchings and other optimization problems

YOSHIDA Yuichi, YAMAMOTO Masaki, and ITO Hiro
SIAM Journal on Computing
41/ 4, 1074-1093
2012



20 一般論文

Property testing on k-vertex connectivity of graphs

YOSHIDA Yuichi and ITO Hiro
Algorithmica
62/ 3--4, 701--712-
2012



21 一般論文

An almost optimal algorithm for Winkler's sorting pairs in bins

ITO Hiro, TERUYAMA Junichi, and YOSHIDA Yuichi
Progress in Informatics
9, 3--7-
2012



22 一般論文

Arrangements of n points whose incident-line-numbers are at most n/2

AKIYAMA Jin, ITO Hiro, KOBAYASHI Midori and NAKAMURA Gisaku
Graphs and Combinatorics
27/ 3, 321--326-
2011



23 一般論文

Testing k-edge-connectivity of digraphs

YOSHIDA Yuichi and ITO Hiro
Journal of System Science and Complexity
23, 91--101-
2010



24 一般論文

Query-number preserving reductions and linear lower bounds for testing

YOSHIDA Yuichi and ITO Hiro
IEICE Transactions
E93-D/ 2, 233--240-
2010



25 一般論文

Maximum-cover source location problems with objective edge-connectivity three

SUGIHARA Kenya and ITO Hiro
Mathematical Methods of Operations Research
70/ 1, 183--193-
2009



26 一般論文

Multi-commodity source location problems and the price of greed

ITO Hiro, Mike PATERSON, and SUGIHARA Kenya
Journal of Graph Algorithms and Applications
13/ 1, 55--73-
2009



27 一般論文

Enumeration of isolated cliques and pseudo-cliques

ITO Hiro and IWAMA Kazuo
ACM Transactions on Algorithms
5/ 4, Article 40-
2009



28 一般論文

Inferring pedigrees from genetic distances

ITO Hiro, IWAMA Kazuo, and TAMURA Takeyuki
IEICE Transactions
E91-D/ 2, 162--169-
2008



29 一般論文

Semi-distance codes and Steiner systems

ITO Hiro, KOBAYASHI Midori, and NAKAMURA Gisaku
Akiyama-Chvatal Festschrift, Supplement of "Graphs and Combinatorics," Springer
283--290-
2007



30 一般論文

Winning ways of weighted poset games

ITO Hiro, NAKAMURA Gisaku, and TAKATA Satoshi
Akiyama-Chvatal Festschrift, Supplement of "Graphs and Combinatorics," Springer
291--306-
2007



31 一般論文

Two equivalent measures on weighted hypergraphs

ITO Hiro and NAGAMOCHI Hiroshi
Discrete Applied Mathematics
154, 2330--2334-
2006



32 一般論文

Efficient methods of determining DNA probe sequences

ITO Hiro, IWAMA Kazuo, and TAMURA Takeyuki
IEICE Transactions
E89-A/ 5, 1292--1298-
2006



33 一般論文

Maximum-cover source location problems

SUGIHARA Kenya and ITO Hiro
IEICE Transactions
E89-A/ 5, 1370--1377-
2006



34 一般論文

Single-backup-table schemes for shortest-path routing

ITO Hiro, IWAMA Kazuo, OKABE Yasuo, and YOSHIHIRO Takuya
Theoretical Computer Science
333/ 3, 347--353-
2005



35 一般論文

\overline C_7_-coloring problem

UEJIMA Akihiro, ITO Hiro, and TSUKIJI Tatsuie
IEICE Transactions
E87-A/ 5, 1243--1250-
2004



36 一般論文

NA-edge-connectivity augmentation problems by adding edges

MIWA Hiroyoshi and ITO Hiro
Journal of the Operations Reserch Society of Japan
47/ 4, 224--243-
2004



37 一般論文

Sum of edge lengths of a multigraph drawn on a convex polygon

ITO Hiro
Computational Geometry
24/ 1, 41--47-
2003



38 一般論文

Avoiding routing loops on the Internet

ITO Hiro, IWAMA Kazuo, OKABE Yasuo, and YOSHIHIRO Takuya
Theory of Computing Systems
36/ 6, 597--609-
2003



39 一般論文

Source location problem with flow requirements in directed networks

ITO Hiro, MAKINO Kazuhisa, ARATA Kouji, HONAMI Shoji, ITATSU Yuichiro, and FUJISHIGE Satoru
Optimization Methods and Software
18/ 4, 427--435-
2003/08



40 一般論文

Channel assignment scheme for integrated voice and data traffic in reservation-type packet radio network

UEHARA Hideyuki, YOKOYAMA Mitsuo, and ITO Hiro
IEICE Transactions
E85-B/ 1, 191--198-
2002



41 一般論文

加群上の畳込み符号による可変レートMPSK符号化変調方式

小西たつ美, 横山光雄, 上原秀幸, 伊藤大雄
信学論
J85-A/ 3, 334--339-
2002



42 一般論文

On H-coloring problems with H expressed by complements of cycles, bipartite graphs, and chordal graphs

UEJIMA Akihiro and ITO Hiro
IEICE Transactions
E85-A/ 5, 1026--1030-
2002



43 一般論文

Coloring problem with restrictions of adjacent colors

UEJIMA Akihiro, ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo
International Transactions in Operational Research
9/ 2, 183--194-
2002



44 一般論文

Source location problems considering vertex-connectivity and edge-connectivity simultaneously

ITO Hiro, ITO Motoyasu, ITATSU Yuichiro, NAKAI Kazuhiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo
Networks
40/ 2, 63--70-
2002



45 一般論文

端末のパケット中継機能を用いた安否確認ネットワークの検討

織田将人, 上原秀幸, 横山光雄, 伊藤大雄
信学論
J85-B/ 12, 2037--2044-
2002



46 一般論文

マルチホップ無線ネットワークにおける優先領域に基づく中継制御法

北岸弓子, 上原秀幸, 山本亮, 横山光雄, 伊藤大雄
信学論
J85-B/ 12, 2119--2128-
2002



47 一般論文

手数制限付き一般化詰め将棋のPSPACE 完全性について

横田雅也, 築地立家, 藤井愼二, 伊藤大雄
信学論
J84-D-I/ 1, 58--61-
2001



48 一般論文

レイリーフェージング通信路に有効な環上の畳込み符号

小西たつ美, 横山光雄, 上原秀幸, 伊藤大雄
信学論
J84-A/ 3, 834--839-
2001



49 一般論文

A generalization of 2-dimension ham sandwich theorem

ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo
IEICE Transactions
E84-A/ 5, 1144--1151-
2001



50 一般論文

Minimum cost source location problem with vertex-connectivity requirements in digraphs

NAGAMOCHI Hiroshi, ISHII Toshimasa, and ITO Hiro
Information Processing Letters
80/ 6, 287--294-
2001



51 一般論文

Lengths of tours and permutations on a vertex set of a convex polygon

ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo
Discrete Applied Mathematics
115/ 1, 63--72-
2001



52 一般論文

NP-hardness of rotation type cell-mazes

AOKI Shiro, ITO Hiro, UEHARA Hideyuki, YOKOYAMA Mitsuo, and HORINOUCHI Tsuyoshi
IEICE Transactions
E83-A/ 3, 492--496-
2000



53 一般論文

NP-completeness of reallocation problems with restricted block volume

MIWA Hiroyoshi and ITO Hiro
IEICE Transactions
E83-A/ 4, 590--597-
2000



54 一般論文

A faster and flexible algorithm for a location problem on undirected flow networks

ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo
IEICE Transactions
E83-A/ 4, 704--712-
2000



55 一般論文

Edge connectivity between nodes and node-subsets

ITO Hiro and YOKOYAMA Mitsuo
Networks
31/ 3, 157--164-
1998



56 一般論文

Sparse spanning subgraphs preserving connectivity and distance between vertices and vertex subsets

MIWA Hiroyoshi and ITO Hiro
IEICE Transactions
E81-A/ 5, 832--841-
1998



57 一般論文

Linear time algorithms for graph search and connectivity determination on complement graphs

ITO Hiro and YOKOYAMA Mitsuo
Information Processing Letters
66/ 4, 209--213-
1998



58 一般論文

A linear-time algorithm for determining the order of moving products in reallocation problems

MIWA Hiroyoshi and ITO Hiro
IEICE Transactions
E80-A/ 3, 534--543-
1997



59 一般論文

Complexity and algorithm for reallocation problem

MIWA Hiroyoshi and ITO Hiro
IEICE Transactions
E79-A/ 3, 461--468-
1996



60 一般論文

Computational complexity of multicommodity flow problems with uniform assignment of flow

ITO Hiro
Electronics and Communications in Japan
78/ 8, 52--62-
1995



61 一般論文

Connectivity problem on area graphs for locally striking disasters --- direct NA-connection

ITO Hiro
IEICE Transactions
E78-A/ 3, 363--370-
1995



62 一般論文

フロー割当によるネットワーク性能推定法

松崎隆一, 伊藤大雄
信学論
J78-B-I/ 3, 825--836-
1995



63 一般論文

グラフにおける節点・領域連結度について

伊藤大雄
電気学会論文誌
114-C/ 4, 463--469-
1994



64 一般論文

経由枝数に制限を持つ多品種流問題

伊藤大雄
信学論
J75-A/ 3, 643--645-
1992



65 一般論文

ダイナミックルーチングのための迂回候補群作成法

伊藤大雄, 井上明也
信学論
J75-B-I/ 5, 323--332-
1992



66 一般論文

Advanced call-level routing schemes for hybrid controlled dynamic routing

INOUE Akiya, YAMAMOTO Hisao, ITO Hiro and MASE Kenichi
IEICE Transactions
E74/ 12, 4025--4033-
1991



67 招待論文

ハラリイの一般化三並べ

伊藤大雄
信学論
J89-A/ 6, 458--469-
2006



68 国際会議プロシーディングス等

Number of ties and undefeated signs on a generalized janken
共著
Hiro Ito and Yoshinao Shiono
Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015), LNCS
9943, 143-154
2017



69 国際会議プロシーディングス等

Single-Player and Two-Player Buttons & Scissors Games
共著
Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffman, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Loffler, Christiane Schmidt, Ryuhei Uehara, Yushi Uno and Aaron Williams
Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015), LNCS
9943, 60-72
2017



70 国際会議プロシーディングス等

Constant-time algorithms for complex networks
単著
Hiro ITO
Proceedings of the Asia-Pacific World Congress on Computer Science 2016 (APWConCS2016)
to appear
2016



71 国際会議プロシーディングス等

Every property is testable on a natural class of scale-free multigraphs
単著
Hiro ITO
Proceedings of the 24th European Symposium of Algorithms (ESA 2016)
57, 51:1-51:12
2016



72 国際会議プロシーディングス等

Single-Player and Two-Player Buttons & Scissors Games

Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffman, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Loffler, Christiane Schmidt, Ryuhei Uehara, Yushi Uno and Aaron Williams
Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015), LNCS, Springer
to appear
2016



73 国際会議プロシーディングス等

Number of ties and undefeated signs on a generalized janken

Hiro ITO and Yoshinao SHIONO
Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2015), LNCS, Springer
to appear
2016



74 国際会議プロシーディングス等

How to solve the cake-cutting problem in sublinear time

Hiro ITO and Takahiro UEDA
Proceedings of the 8th International Conference on Fun with Algorithms (FUN2016)
to appear
2016/06



75 国際会議プロシーディングス等

A Much Faster Algorithm for Finding a Maximum Clique

Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito and Mitsuo Wakatsuki
Proceedings of the 10th International Frontiers of Algorithmics Workshop (FAW2016), LNCS, Springer
to appear
2016/06



76 国際会議プロシーディングス等

Computational complexity of inverse word search problem
共著
Hiro ITO and Shinnosuke SEKI
Proceedings of the 12th International Symposium on Operations Research & Its Applications (ISORA 2015), IET Digital Library
41-44
2015



77 国際会議プロシーディングス等

Generalized shogi and chess are constant-time tastable
共著
Hiro ITO, Atsuki NAGAO, and Teagun PARK
Proceedings of the 12th International Symposium on Operations Research & Its Applications (ISORA 2015), IET Digital Library
1-6
2015



78 国際会議プロシーディングス等

Folding a Paper Strip to Minimizing Thickness
共著
Erik D. DEMAINE, David EPPSTEIN, Adam HESTERBERG, Hiro ITO, Anna LUBIW, Ryuhei UEHARA, and Yushi UNO
Proceeding of Workshop on Algorithms and Computation 2015 (WALCOM 2015)
113-124
2015



79 国際会議プロシーディングス等

How to generalize janken --- rock-paper-scissors-king-flea

ITO Hiro
Proceedings of TJJCCGG 2012, LNCS
8296, 85-94
2013



80 国際会議プロシーディングス等

Constant-time approximation algorithms for the optimum branching problem on sparse graphs

KUSUMOTO Mitsuru, YOSHIDA Yuichi, and ITO Hiro
Proceedings of the Workshop on Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems, Proceedings of The Third International Conference on Networking and Computing (ICNC'12)
407--413-
2012



81 国際会議プロシーディングス等

An online algorithm optimally self-tuning to congestion for power management problems

Wolfgang BEIN, HATTA Naoki, Nelson HERNANDEZ-CONS, ITO Hiro, KASAHARA Shoji, and KAWAHARA Jun
Proceedings of the 9th Workshop on Approximation and Online Algorithms (WAOA2011), LNCS
7164, 35--48-
2012



82 国際会議プロシーディングス等

Constant-time algorithms for sparsity matroids

ITO Hiro TANIGAWA Shin-ichi, and YOSHIDA Yuichi
Proceedings of The 39th International Colloquium on Automata, Language and Programming (ICALP 2012), LNCS, Springer
7391, 498-509
2012/07



83 国際会議プロシーディングス等

Algorithms and complexity of generalized river crossing problems

ITO Hiro, Stefan LANGERMAN, and YOSHIDA Yuichi
Proceedings of The 6th International Conference on Fun with Algorithms (FUN 2012), LNCS, Springer
7288, 235-244
2012/06



84 国際会議プロシーディングス等

Constant-time approximation algorithms for the knapsack problem

ITO Hiro, KIYOSHIMA Susumu, and YOSHIDA Yuichi
Proceedings of The 9th Annual Conference on Theory and Applications of Models of Computation (TAMC2012), LNCS, Springer
7287, 131-142
2012/05



85 国際会議プロシーディングス等

Complexity of the stamp folding problem

UMESATO Takuya, SAITOH Toshiki, UEHARA Ryuhei, and ITO Hiro
Proceedings of The 5th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2011), LNCS
6831, 311--321-
2011



86 国際会議プロシーディングス等

Making polygons by simple folds and one straight cut

Erik D. DEMAINE, Martin L. DEMAINE, Andrea HAWKSLEY, ITO Hiro, Po-Ru LOH, Shelly MANBER and Omari STEPHENS
Proceedings of the China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010), LNCS
7033, 27--43-
2011



87 国際会議プロシーディングス等

Helly numbers of polyominoes

Jean CARDINAL, ITO Hiro, Matias KORMAN, Stefan LANGERMAN
The 23rd Canadian Conference on Computational Geometry (CCCG'11)
443--448-
2011/08



88 国際会議プロシーディングス等

PSPACE-completeness of the weighted poset game

ITO Hiro and TAKATA Satoshi
Proceedings of the 10th International Symposium on Operations Research and Its Applications (ISORA 2011), Lecture Notes in Operations Research
14, 89--93-
2011/08



89 国際会議プロシーディングス等

Cannibal animal games: a new variant of tic-tac-toe

Jean CARDINAL, Sebastien COLETTE, ITO Hiro, Matias KORMAN, Stefan LANGERMAN, SAKIDANI Hikaru, Perouz TASLAKIAN
The 27th European Workshop on Computational Geometry (EuroCG 2011)
131--134-
2011/03



90 国際会議プロシーディングス等

Testing outerplanarity of bounded degree graphs

YOSHIDA Yuichi and ITO Hiro
Proceedings of the 14th Intl. Workshop on Randomization and Computation (RANDOM 2010), LNCS
6302, 642--655-
2010/09



91 国際会議プロシーディングス等

Tractability and intractability of problems on unit disk graphs parameterized by domain area

ITO Hiro and KADOSHITA Masakazu
Proceedings of the 9th International Symposium on Operations Research and Its Applications (ISORA 2010), Lecture Notes in Operations Research
12, 120--127-
2010/08



92 国際会議プロシーディングス等

An improved constant-time approximation algorithm for maximum matchings

YOSHIDA Yuichi, YAMAMOTO Masaki, and ITO Hiro
Proceedings of the 41st ACM Symposium on Theory of Computing (STOC 2009)
225--234-
2009/05



93 国際会議プロシーディングス等

Transforming graphs with the same degree sequences

Sergey BEREG and ITO Hiro
Proceedings of Kyoto International Conference on Computational Geometry and Graph Theory --- in honor of Jin Akiyama and Vasek Chvatal on their 60th birthdays, LNCS
4535, 25--32-
2008



94 国際会議プロシーディングス等

Property testing on k-vertex connectivity of graphs

YOSHIDA Yuichi and ITO Hiro
Proceedings of the 35th International Colloquium on Automata, Language and Programming (ICALP 2008), LNCS
5125, 539--550-
2008/07



95 国際会議プロシーディングス等

Multi-commodity source location problems and price of greed

ITO Hiro, Mike PATERSON, and SUGIHARA Kenya
Proceedings of the Second Workshop on Algorithms and Computation (WALCOM 2008), LNCS
4921, 169--179-
2008/02



96 国際会議プロシーディングス等

Infinite series of generalized Gospher space filling curves

AKIYAMA Jin, FUKUDA Hiroshi, ITO Hiro, and NAKAMURA Gisaku
Proceedings of the China-Japan Joint Conference on Discrete Geometry and Graph Theory (CJCDGCGT2005), LNCS
4381, 1--9-
2007



97 国際会議プロシーディングス等

Impossibility of transformation of vertex labeled simple graphs preserving the cut-size order

ITO Hiro
Proceedings of the China-Japan Joint Conference on Discrete Geometry and Graph Theory (CJCDGCGT2005), LNCS
4381, 59--69-
2007



98 国際会議プロシーディングス等

Snaky is a winner with one handicap

ITO Hiro and MIYAGAWA Hiromitsu
8th Hellenic European Conference on Computer Mathematics and its Applications (HERCMA 2007)
25--26-
2007/09



99 国際会議プロシーディングス等

Maximum-cover source-location problem with object edge-connectivity three

SUGIHARA Kenya and ITO Hiro
Proceedings of CTW2006 Workshop on Graphs and Combinatorial Optimization, Electronic Notes in Discrete Mathematics, Elsevier
25, 165--171-
2006



100 国際会議プロシーディングス等

Three equivalent partial orders on graphs with real edge-weights drawn on a convex polygon

ITO Hiro
Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG2004), LNCS
3742, 123--130-
2005



101 国際会議プロシーディングス等

Linear-time enumeration of isolated cliques

ITO Hiro, IWAMA Kazuo, and OSUMI Tsuyoshi
Proceedings of 13th Annual European Symposium on Algorithms (ESA2005), LNCS
3669, 119--130-
2005/09



102 国際会議プロシーディングス等

Imperfectness of data for STS-based physical mapping

ITO Hiro, IWAMA Kazuo, and TAMURA Takeyuki
J.- J. Levy, E. W. Mayr, and J. C. Mitchell (Eds.), Exploring New Frontiers of Theoretical Informatics (Proceedings of TCS2004), KLUWER
279--292-
2004



103 国際会議プロシーディングス等

Subdivision of the hierarchy of H-colorable graph classes by circulant graphs

UEJIMA Akihiro and ITO Hiro
Proceedings of CTW2004 Workshop on Graphs and Combinatorial Optimization
232--236-
2004/05



104 国際会議プロシーディングス等

Can a hypergraph cover every convex polygon?

ITO Hiro, NAGAMOCHI Hiroshi
Proceedings of the 3rd Hungarian-Japanese Symposium 2003
293--302-
2003



105 国際会議プロシーディングス等

Polynomial time computable backup tables for shortest path routing

ITO Hiro, IWAMA Kazuo, OKABE Yasuo, and YOSHIHIRO Takuya
Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), Proceedings in Informatics, Carleton Scientific
17, 163--177-
2003



106 国際会議プロシーディングス等

Comparing hypergraphs by areas of hyperedges drawn on a convex polygon

ITO Hiro, NAGAMOCHI Hiroshi
Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG2002), LNCS
2866, 176--181-
2003



107 国際会議プロシーディングス等

Avoiding routing loops on the Internet

ITO Hiro, IWAMA Kazuo, OKABE Yasuo, and YOSHIHIRO Takuya
Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2002), Proceedings in Informatics, Carleton Scientific
13, 197--210-
2002



108 国際会議プロシーディングス等

File transfer tree problems

ITO Hiro, NAGAMOCHI Hiroshi, SUGIYAMA Yosuke, and FUJITA Masato
Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC2002), LNCS
2518, 441--452-
2002



109 国際会議プロシーディングス等

Sum of edge lengths of a graph drawn on a convex polygon

ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo
Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG2000), LNCS
2098, 160--166-
2001



110 国際会議プロシーディングス等

Source location problem with edge-connectivity requirements in digraphs

ITO Hiro, MAKINO Kazuhisa, ARATA Kouji, ITATSU Yuichiro, FUJISHIGE Satoru
Proceedings of the 2nd Japanese-Hungarian Symposium on Discrete Mathematics and Its Application
92--97-
2001/04



111 国際会議プロシーディングス等

Coloring problem with restrictions of adjacent colors expressed by cycles and bipartite graphs

UEJIMA Akihiro, ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo
Proceedings of the 2nd Japanese-Hungarian Symposium on Discrete Mathematics and Its Application
227--236-
2001/04



112 国際会議プロシーディングス等

2-dimension ham sandwich theorem for partitioning into three convex pieces

ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo
Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG'98), LNCS
1763, 129--157-
2000



113 国際会議プロシーディングス等

NP-completeness of Stage Illumination Problems

ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo
Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG'98), LNCS
1763, 158--165-
2000



114 国際会議プロシーディングス等

Slot assignment scheme for integrated voice and data traffic in reservation-type packet radio networks

UEHARA Hideyuki, YOKOYAMA Mitsuo, and ITO Hiro
Proceedings of the 11th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC2000)
222--226-
2000



115 国際会議プロシーディングス等

Location problems based on node-connectivity and edge-connectivity between nodes and node-subsets

ITO Hiro, ITO Motoyasu, ITATSU Yuichiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo
Proceedings of the 11th Annual International Symposium on Algorithms and Computation (ISAAC'00), LNCS
1969, 338--349-
2000



116 国際会議プロシーディングス等

The sum of chord lengths for convex polygons is a concave and increasing function

ITO Hiro, UEHARA Hideyuki, and YOKOYAMA Mitsuo
Proceedings of the Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
79--81-
1999/03



117 国際会議プロシーディングス等

Repairing flaws in a picture based on a geometric representation of a digital image

ASANO Tetsuo, ITO Hiro, KIMURA Souichi, and SHIMAZU Shigeaki
Proceedings of the 9th Annual International Symposium on Algorithms and Computation (ISAAC'98), LNCS
1533, 149--158-
1998



118 国際会議プロシーディングス等

Access control schemes for slotted ALOHA system with an adaptive array

UEHARA Hideyuki, YOKOYAMA Mitsuo, and ITO Hiro
Proceedings of the 1998 International Symposium on Information Theory and Its Application (ISITA'98)
142--145-
1998/10



119 国際会議プロシーディングス等

Hybrid control strategies for advanced network control and their intelligent decision support system

INOUE Akiya, ITO Hiro, and YAMAMOTO Hisao
Proceedings of the Fifth International Network Planning Symposium (NETWORKS'92)
37--42-
1992/05