|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 7 occurrences of 6 keywords
|
|
|
|
|
Results
Found 42 publication records. Showing 42 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Masao Kumamoto, Eiji Miyano |
Optimal distortion embedding of complete binary trees into lines.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano |
NP-hardness of the sorting buffer problem on the uniform metric. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono |
Graph Orientation to Maximize the Minimum Weighted Outdegree. |
Int. J. Found. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eiji Miyano |
Foreword. |
IEICE Transactions |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono |
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Kenta Kanmera, Eiji Miyano |
(1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta |
Weighted nearest neighbor algorithms for the graph exploration problem on cycles. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo |
Approximating Maximum Diameter-Bounded Subgraphs. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Masao Kumamoto, Eiji Miyano |
Optimal Distortion Embedding of Complete Binary Trees into Lines. |
FCS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Naoyuki Kamiyama, Yuuki Kiyonari, Eiji Miyano, Shuichi Miyazaki, Katsuhisa Yamanaka |
Computational Complexities of University Interview Timetabling. |
IEICE Transactions |
2009 |
DBLP BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano, Hirotaka Ono |
Drawing Borders Efficiently. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Algorithm, Approximation algorithm, Combinatorial optimization, NP-hardness, Spreadsheet |
| 1 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono |
Graph orientation to maximize the minimum weighted outdegree. |
IPDPS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa |
Grasp and Delivery for Moving Objects on Broken Lines. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Grasp and delivery, MAXSNP-hardness, Approximation algorithm, Moving objects |
| 1 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono |
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. |
CATS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano |
NP-Hardness of the Sorting Buffer Problem on the Uniform Metric. |
FCS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
Graph Orientation Algorithms to minimize the Maximum Outdegree. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. |
AAIM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono |
On Approximation of Bookmark Assignments. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano, Hirotaka Ono |
Drawing Borders Efficiently. |
FUN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta |
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. |
SOFSEM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Takahiro Yukizane, Shin-ya Ohi, Eiji Miyano, Hideo Hirose |
The Bump Hunting Method Using the Genetic Algorithm with the Extreme-Value Statistics. |
IEICE Transactions |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
Graph Orientation Algorithms to Minimize the Maximum Outdegree. |
CATS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano |
How to Pack Directed Acyclic Graphs into Small Blocks. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa |
Pickup and Delivery for Moving Objects on Broken Lines. |
ICTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki |
Efficient randomized routing algorithms on the two-dimensional mesh of buses. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano |
An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano |
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano |
New Bounds for Oblivious Mesh Routing. |
J. Graph Algorithms Appl. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano |
Oblivious Routing Algorithms on the Mesh of Buses. |
J. Parallel Distrib. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano |
A (2.954 epsilon)n oblivious routing algorithm on 2D meshes. |
SPAA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano |
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing. |
ESA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano |
An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. |
SODA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano |
Better Approximations of Non-Hamiltonian Graphs. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano |
New Bounds for Oblivious Mesh Routing. |
ESA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki |
Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano |
Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing. |
ESA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano |
Oblivious Routing Algorithms on the Mesh of Buses. (PDF / PS) |
IPPS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano, Yahiko Kambayashi |
Routing Problems on the Mesh of Buses. |
J. Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano |
Intractability of Read-Once Resolution. |
Structure in Complexity Theory Conference |
1995 |
DBLP BibTeX RDF |
|
| 1 | Kazuo Iwama, Hidetoshi Abeta, Eiji Miyano |
Random Generation of Satisfiable and Unsatisfiable CNF Predicates. |
IFIP Congress |
1992 |
DBLP BibTeX RDF |
|
| 1 | Kazuo Iwama, Eiji Miyano |
Routing Problems on the Mesh of Buses. |
ISAAC |
1992 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #42 of 42 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")