|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 47 publication records. Showing 47 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Yuichi Yoshida, Hiro Ito |
Property Testing on k-Vertex-Connectivity of Graphs.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida |
Constant-Time Approximation Algorithms for the Knapsack Problem. |
TAMC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin Akiyama, Hiro Ito, Midori Kobayashi, Gisaku Nakamura |
Arrangements of n Points whose Incident-Line-Numbers are at most n/2. |
Graphs and Combinatorics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito |
Preface. |
Graphs and Combinatorics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida |
Constant-Time Algorithms for Sparsity Matroids |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman |
Helly Numbers of Polyominoes. |
CCCG |
2011 |
DBLP BibTeX RDF |
|
| 1 | Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito |
Complexity of the Stamp Folding Problem. |
COCOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang W. Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara |
An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems. |
WAOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Yoshida, Hiro Ito |
Query-Number Preserving Reductions and Linear Lower Bounds for Testing. |
IEICE Transactions |
2010 |
DBLP BibTeX RDF |
|
| 1 | Erik D. Demaine, Martin L. Demaine, Andrea Hawksley, Hiro Ito, Po-Ru Loh, Shelly Manber, Omari Stephens |
Making Polygons by Simple Folds and One Straight Cut. |
CGGA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Yoshida, Hiro Ito |
Testing Outerplanarity of Bounded Degree Graphs. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Kazuo Iwama |
Enumeration of isolated cliques and pseudo-cliques. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Mike Paterson, Kenya Sugihara |
The Multi-Commodity Source Location Problems and the Price of Greed. |
J. Graph Algorithms Appl. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yuichi Yoshida, Masaki Yamamoto, Hiro Ito |
An improved constant-time approximation algorithm for maximum~matchings. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover |
| 1 | Takeyuki Tamura, Hiro Ito |
Inferring Pedigree Graphs from Genetic Distances. |
IEICE Transactions |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Yoshida, Hiro Ito |
Property Testing on k-Vertex-Connectivity of Graphs. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Mike Paterson, Kenya Sugihara |
Multi-commodity Source Location Problems and Price of Greed. |
WALCOM |
2008 |
DBLP DOI BibTeX RDF |
Source location problem, price of greed |
| 1 | Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno (eds.) |
Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers |
KyotoCGGT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergey Bereg, Hiro Ito |
Transforming Graphs with the Same Degree Sequence. |
KyotoCGGT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenya Sugihara, Hiro Ito |
Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenya Sugihara, Hiro Ito |
Maximum-Cover Source-Location Problems. |
IEICE Transactions |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Kazuo Iwama, Takeyuki Tamura |
Efficient Methods for Determining DNA Probe Orders. |
IEICE Transactions |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoki Katoh, Hiro Ito |
Preface. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Hiroshi Nagamochi |
Two equivalent measures on weighted hypergraphs. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro |
Single backup table schemes for shortest-path routing. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi |
Linear-Time Enumeration of Isolated Cliques. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura |
Infinite Series of Generalized Gosper Space Filling Curves. |
CJCDGCGT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito |
Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order. |
CJCDGCGT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Akihiro Uejima, Hiro Ito |
Subdivision of the hierarchy of H-colorable graph classes by circulant graphs. |
Electronic Notes in Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Kazuo Iwama, Takeyuki Tamura |
Imperfectness of Data for STS-Based Physical Mapping. |
IFIP TCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Akihiro Uejima, Hiro Ito |
Subdivision of the Hierarchy of H-colorable Graph Classes by Circulant Graphs. |
CTW |
2004 |
DBLP BibTeX RDF |
|
| 1 | Hiro Ito |
Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon. |
JCDCG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro |
Avoiding Routing Loops on the Internet. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito |
Sum of edge lengths of a multigraph drawn on a convex polygon. |
Comput. Geom. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro |
Polynomial-Time Computable Backup Tables for Shortest-Path Routing. |
SIROCCO |
2003 |
DBLP BibTeX RDF |
|
| 1 | Hiro Ito, Motoyasu Ito, Yuichiro Itatsu, Kazuhiro Nakai, Hideyuki Uehara, Mitsuo Yokoyama |
Source location problems considering vertex-connectivity and edge-connectivity simultaneously. |
Networks |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro |
Avoiding Routing Loops on the Internet. |
SIROCCO |
2002 |
DBLP BibTeX RDF |
|
| 1 | Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita |
File Transfer Tree Problems. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Hiroshi Nagamochi |
Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon. |
JCDCG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama |
Lengths of tours and permutations on a vertex set of a convex polygon. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Yuichiro Itatsu, Hideyuki Uehara, Mitsuo Yokoyama, Motoyasu Ito |
Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama |
Sum of Edge Lengths of a Graph Drawn on a Convex Polygon. |
JCDCG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Mitsuo Yokoyama |
Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Mitsuo Yokoyama |
Edge connectivity between nodes and node-subsets. |
Networks |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu |
Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. |
ISAAC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama |
2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces. |
JCDCG |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama |
NP-Completeness of Stage Illumination Problems. |
JCDCG |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #47 of 47 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")