The SCEAS System
| |||||||

## Search the dblp DataBase
Eiji Miyano:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano
**How to Pack Directed Acyclic Graphs into Small Blocks.**[Citation Graph (0, 0)][DBLP] CIAC, 2006, pp:272-283 [Conf] - Kazuo Iwama, Eiji Miyano
**Intractability of Read-Once Resolution.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:29-36 [Conf] - Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki
**Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses.**[Citation Graph (0, 0)][DBLP] COCOON, 1998, pp:229-240 [Conf] - Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
**New Bounds for Oblivious Mesh Routing.**[Citation Graph (0, 0)][DBLP] ESA, 1998, pp:295-306 [Conf] - Kazuo Iwama, Eiji Miyano
**Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing.**[Citation Graph (0, 0)][DBLP] ESA, 1997, pp:284-295 [Conf] - Kazuo Iwama, Eiji Miyano
**Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing.**[Citation Graph (0, 0)][DBLP] ESA, 1999, pp:53-64 [Conf] - Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa
**Pickup and Delivery for Moving Objects on Broken Lines.**[Citation Graph (0, 0)][DBLP] ICTCS, 2005, pp:36-50 [Conf] - Kazuo Iwama, Hidetoshi Abeta, Eiji Miyano
**Random Generation of Satisfiable and Unsatisfiable CNF Predicates.**[Citation Graph (0, 0)][DBLP] IFIP Congress (1), 1992, pp:322-328 [Conf] - Kazuo Iwama, Eiji Miyano
**Oblivious Routing Algorithms on the Mesh of Buses.**[Citation Graph (0, 0)][DBLP] IPPS, 1997, pp:721-727 [Conf] - Kazuo Iwama, Eiji Miyano
**Routing Problems on the Mesh of Buses.**[Citation Graph (0, 0)][DBLP] ISAAC, 1992, pp:155-164 [Conf] - Kazuo Iwama, Eiji Miyano
**An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:466-475 [Conf] - Kazuo Iwama, Eiji Miyano
**A (2.954 epsilon)n oblivious routing algorithm on 2D meshes.**[Citation Graph (0, 0)][DBLP] SPAA, 2000, pp:186-195 [Conf] - Kazuo Iwama, Eiji Miyano
**Better Approximations of Non-Hamiltonian Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:239-261 [Journal] - Kazuo Iwama, Eiji Miyano
**A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:39, n:2, pp:145-161 [Journal] - Kazuo Iwama, Eiji Miyano
**An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:262-279 [Journal] - Kazuo Iwama, Eiji Miyano, Yahiko Kambayashi
**Routing Problems on the Mesh of Buses.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:20, n:3, pp:613-631 [Journal] - Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
**New Bounds for Oblivious Mesh Routing.**[Citation Graph (0, 0)][DBLP] J. Graph Algorithms Appl., 2001, v:5, n:5, pp:17-38 [Journal] - Kazuo Iwama, Eiji Miyano
**Oblivious Routing Algorithms on the Mesh of Buses.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2000, v:60, n:2, pp:137-149 [Journal] - Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki
**Efficient randomized routing algorithms on the two-dimensional mesh of buses.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:261, n:2, pp:227-239 [Journal] - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
**Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree.**[Citation Graph (0, 0)][DBLP] AAIM, 2007, pp:167-177 [Conf] - Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono
**On Approximation of Bookmark Assignments.**[Citation Graph (0, 0)][DBLP] MFCS, 2007, pp:115-124 [Conf] - Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta
**Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles.**[Citation Graph (0, 0)][DBLP] SOFSEM (1), 2007, pp:164-175 [Conf] - Kazuo Iwama, Eiji Miyano, Hirotaka Ono
**Drawing Borders Efficiently.**[Citation Graph (0, 0)][DBLP] FUN, 2007, pp:213-226 [Conf] **Graph Orientation Algorithms to Minimize the Maximum Outdegree.**[Citation Graph (, )][DBLP]**Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree.**[Citation Graph (, )][DBLP]**NP-Hardness of the Sorting Buffer Problem on the Uniform Metric.**[Citation Graph (, )][DBLP]**Graph orientation to maximize the minimum weighted outdegree.**[Citation Graph (, )][DBLP]**Approximating Maximum Diameter-Bounded Subgraphs.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |