論文

• Kumiko Nomura, Satoshi Tayu, Shuichi Ueno. On the Orthogonal Drawing of Outerplanar Graphs, IEICE Trans. Fundamentals, Vol. E88-A, No. 6, pp. 1583-1588, 2005.
• Koji Goda, Toshinori Yamada, Shuichi UENO. A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems, IEICE Trans. Fundamentals, Vol. E88-A, No. 4, pp. 1090-1092, 2005.
• Toshinori Yamada, Takashi Ohtsuka, Akitsugu Watanabe, Shuichi Ueno. On sequential diagnosis of multiprocessor systems, Discrete Applied Mathematics, Vol. 146, pp. 311-342, 2005.
• Satoshi Tayu, Toshihiko Takahashi, Eita Kobayashi, Shuichi UENO. On the Three-Dimensional Channel Routing, IEICE Trans. Fundamentals, Vol. E99-A, No. 10, pp. 1813-1821, Oct. 2016.
• Irina Mustaţă, Kousuke Nishikawa, Asahi Takaoka, Satoshi Tayu, Shuichi UENO. On Orthogonal Ray Trees, Discrete Applied Mathematics, Elsevier, Vol. 201, pp. 201-212, Mar. 2016.
• Asahi Takaoka, Shingo Okuma, Satoshi Tayu, Shuichi UENO. A Note on Harmonious Coloring of Caterpillars, IEICE Trans. Information and Systems, Vol. E98-D, No. 12, pp. 824-834, Dec. 2015.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. Dominating Sets in Two-Directional Orthogonal Ray Graphs, IEICE Transactions on Information and Systems, The Institute of Electronics, Information and Communication Engineers, Vol. E98-D, No. 8, pp. 1592-1595, Aug. 2015.
• Asahi Takaoka, Shuichi UENO. A Note on Irreversible 2-Conversion Sets in Subcubic Graphs, IEICE Transactions on Information and Systems, The Institute of Electronics, Information and Communication Engineers, Vol. E98-D, No. 8, pp. 1589-1591, Aug. 2015.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. OBDD Representation of Intersection Graphs, IEICE Trans. Information and Systems, Vol. E98-D, No. 4, pp. 824-834, Apr. 2015.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. Dominating Sets and Induced Matchings in Orthogonal Ray Graphs, IEICE Trans. Information and Systems, Vol. E97-D, No. 12, pp. 3101-3109, Dec. 2014.
• 上野修一. 直交半直線交差グラフとナノ回路, IEICE Fundamentals Review, Vol. 8, No. 1, pp. 30-36, July 2014.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs, IEICE Trans. Information and Systems, Vol. E96-D, No. 11, pp. 2327-2332, Nov. 2013.
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. Bandwidth of Convex Bipartite Graphs and Related Graphs, Information Processing Letters, ScienceDirect, Vol. 112, No. 11, pp. 411-417, Mar. 2012.
• ANISH MAN SINGH SHRESTHA, Asahi Takaoka, Satoshi Tayu, Shuichi UENO. On Two Problems of Nano-PLA Design, IEICE Trans. Information and Systems, Vol. E94-D, No. 1, pp. 35-41, Jan. 2011.
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. On Orthogonal Ray Graphs, Discrete Applied Mathematics, Elsevier, Vol. 158, No. 15, pp. 1650-1659, Aug. 2010.
• Satoshi Tayu, Kumiko Nomura, Shuichi UENO. On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs, Discrete Applied Mathematics, Elsevier, Vol. 157, No. 8, pp. 1885-1895, Apr. 2009.
• Satoshi Tayu, Shigeru Ito, Shuichi UENO. On Fault Testing for Reversible Circuits, IEICE Trans. Information and Systems, Vol. E91-D, No. 12, pp. 2770-2775, Dec. 2008.
• Satoshi Tayu, Truki Al-Mutairi, Shuichi UENO. Cost-Constrained Minimum-Delay Multicasting, Journal of Interconnection Networks, Vol. 9, No. 1&2, pp. 141-155, Sept. 2008.
• Kohsuke Ogata, Toshinori Yamada, Shuichi Ueno. A Note on the Implementation of de Bruijn Networks by the Optical Transpose Interconnection System, IEICE Trans. Fundamentals, Vol. E88-A, No. 12, pp. 3661-3662, 2005.
• Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno. On-Line Multicasting in All-Optical Networks, IEICE Trans. Information and Systems, Vol. E86-D, No. 2, pp. 326-329, 2003.
• Suguru Amitani, Toshinori Yamada, Shuichi Ueno. Optimal Layouts of Virtual Paths in Complete Binary Tree Networks, IEICE Trans. Fundamentals, Vol. E85-A, No. 4, pp. 914-917, 2002.
• Toshinori Yamada, Shuichi Ueno. A Note on the Circuit-switched Fixed Routing in Networks, Trans. of IPSJ, Vol. 40, No. 5, pp. 2305-2307, 1999.
• Akira Matsubayashi, Shuichi Ueno. Small Congestion Embedding of Graphs into Hypercubes, Networks, Vol. 33, pp. 71-77, 1999.
• Akira Matsubayashi, Shuichi Ueno. A Linear Time Algorithm for Constructing Proper-path-Decomposition of Width Two, IEICE TRANS. Fundamentals, Vol. E81-A, No. 5, pp. 729-737, 1998.
• Toshinori Yamada, Shuichi Ueno. Fault-Tolerant Hypercubes with Small Degree, IEICE TRANS. Fundamentals, Vol. E81-A, No. 5, pp. 807-813, 1998.
• Toshinori Yamada, Shuichi Ueno. Fault-Tolerant Graphs for Tori, Networks, Vol. 32, pp. 181-188, 1998.
• Magnus M. Halldorsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani. Approximating Steiner Trees in Graphs with Restricted Weights, Networks, Vol. 31, pp. 283-292, 1998.
• 田湯　智, 上野　修一. ２分木のハイパーキューブへの埋込みについて, 電子情報通信学会論文誌, Vol. J81-A, No. 4, pp. 682-695, 1998.
• Toshinori Yamada, Shuichi Ueno. Fault-Tolerant Meshes with Efficient Layouts, IEICE Trans. Information and Systems, Vol. E81-D, No. 1, pp. 56-65, 1998.
• Satoshi Tayu, Shuichi Ueno. Efficient Embeddings of Binary Trees with Bounded Proper Pathwidth into Paths and Grids, IEICE TRANS. Fundamentals, Vol. E80-A, No. 1, pp. 183-192, 1997.
• Toshinori Yamada, Tomohiro Nishimura, Shuichi Ueno. On Dynamic Fault Tolerance for WSI Networks, IEICE TRANS. Fundamentals, Vol. E80-A, No. 8, pp. 1529-1530, 1997.
• T. Yamada, K. Yamamoto, S. Ueno. Fault-Tolerant Graphs for Hypercubes and Tori, IEICE Trans. Information and Systems, Vol. E79-D, pp. 1147-1152, 1996.
• A. Matsubayashi, S. Ueno. On the Complexity of Embedding of Graphs into Grids with Minimum Congestion, IEICE Trans. Fundamentals, Vol. E79-A, pp. 469-476, 1996.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. Minimal Forbidden Minors for the Family of Graphs with Proper-Path-Width at Most Two, IEICE Trans. Fundamentals, Vol. E78-A, No. 12, pp. 1828-1839, Dec. 1995.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. Universal Graphs for Graphs with Bounded Path-Width, IEICE Trans. Fundamentals, Vol. E78-A, No. 4, pp. 458-462, Apr. 1995.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. On the Proper-Path-Decomposition of Trees, IEICE Trans. Fundamentals, Vol. E78-A, No. 1, pp. 131-136, Jan. 1995.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. Mixed-Searching and Proper-Path-Width, Theoretical Computer Science, Vol. 137, No. 2, pp. 253-268, 1995.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. Minimal Acyclic Forbidden Minors for the Family of Graphs with Bounded Path-Width, Discrete Mathematics, Vol. 127, pp. 293-304, 1994.
• S. Ueno, A. Bagchi, S. L. Hakimi, E. Schmeichel. On Minimum Fault-Tolerant Networks, SIAM J. on Discrete Mathematics, Vol. 6, pp. 565-574, 1993.
• T. Arai, S. Ueno, Y. Kajitani. Generalization of a Theorem on the Parametric Maximum Flow Problem, Discrete Applied Mathematics, Vol. 41, pp. 69-74, 1993.
• S. Ueno, K. Tsuji, Y. Kajitani. A Note on the Graph Augmentation Problem, IEICE Trans. Fundamentals, Vol. E74, pp. 679-680, 1991.
• S. Ueno, K. Tsuji, Y. Kajitani. A Note on Dual Trail Partition of a Plane Graph, IEICE Trans. Fundamentals, Vol. E74, pp. 1915-1917, 1991.
• 宮野浩, 福原近, 上野修一, 梶谷洋司. 凸ｎ角形のアスペクトグラフの特徴付けと数え上げ, 電子情報通信学会論文誌, Vol. J74-A, No. 4, pp. 692-700, 1991.
• 鈴木均, 高橋奈穂美, 西関隆夫, 宮野浩, 上野修一. ３－連結グラフ３分割アルゴリズム, 情報処理, Vol. 31, No. 5, pp. 584-592, 1990.
• Y. Kajitani, S. Ueno, H. Miyano. Ordering of the Elements of a Matroid such that Its Consecutive w Elements are Independent, Discrete Mathematics, Vol. 72, pp. 187-194, 1988.
• S. Ueno, Y. Kajitani, H. Wada. Minimum Augmentation of a Tree to a k-Edge-Connected Graph, Networks, Vol. 18, pp. 19-25, 1988.
• S. Ueno, Y. Kajitani, S. Gotoh. On the Nonseparating Independent Set Problem and Feedback Set Problem for Graphs with no Vertex Degree Exceeding Three, Discrete Mathematics, Vol. 72, pp. 355-369, 1988.
• 梶谷洋司, 上野修一, 宮坂健一. 耐故障ネットワークのコスト最小実現における最小枝数について, 電子情報通信学会論文誌, Vol. J70-A, No. 2, pp. 146-155, 1987.
• Y. Kajitani, A. Ishizuka, S. Ueno. Characterization of Partial 3-Trees in Terms of Three Structures, Graphs and Combinatorics, Vol. 2, pp. 233-246, 1986.
• Y. Kajitani, S. Ueno. The Minimum Augmentation of a Directed Tree to a k-Edge-Connected Directed Graph, Networks, Vol. 16, pp. 181-197, 1986.
• 上野修一, 梶谷洋司. ＲＣＧ回路の一意可解性とその状態変数, 電子通信学会論文誌, Vol. J68-A, No. 9, pp. 859-866, 1985.
• S. Ueno, Y. Kajitani. A Matroid Generalization of Theorems of Lewin and Gallai, Discrete Applied Mathematics, Vol. 9, pp. 213-216, 1984.
• 梶谷洋司, 上野修一. パリティ構造をもつマトロイドの基本分割とその応用, 電子通信学会論文誌, Vol. J66-A, No. 6, pp. 553-560, 1983.
• Y. Kajitani, S. Ueno, W-K. Chen. On the Number of Essential Complementary Partitions, IEEE Trans. on Circuits and Systems, Vol. CAS-29, pp. 572-574, 1982.
• Y. Kajitani, S. Ueno. On the Rank of Certain Classes of Cut-Set and Tie-Set of a Graph, IEEE Trans. on Circuits and Systems, Vol. CAS-26, pp. 666-668, 1979.
• 梶谷洋司, 上野修一. グラフの基本タイ行列の冗長な要素, 電子通信学会論文誌, Vol. 62-A, pp. 1-7, 1979.

著書

• 佐藤泰介, 高橋篤司, 伊東利哉, 上野修一. 情報基礎数学, オーム社, Sept. 2014.
• 佐藤泰介, 高橋篤司, 伊東利哉, 上野修一. 情報基礎数学, 昭晃堂, Oct. 2007.
• 上野修一, 高橋篤司. 情報とアルゴリズム, 森北出版, Apr. 2005.
• 上野修一. 離散構造とアルゴリズムI, 近代科学社(共著), 近代科学社, 1992.

国際会議発表 (査読有り)

• Hiroki Katsumata, Satoshi Tayu, Shuichi UENO. On the Complexity of Finding a Largest Common Subtree of Trees, The 20th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Lecture Notes in Computer Science, pp. 125-126, Aug. 2017.
• Satoshi Tayu, Shuichi UENO. Stable Matchings in Trees, The 23rd Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science, Springer Verlarg, Vol. 10392, pp. 492-503, Aug. 2017.
• Satoshi Tayu, Shuichi UENO. On Evasion Games on Graphs, Springer Verlarg, Lecture Notes in Computer Science, Vol. 9943, pp. 253-264, Sept. 2016.
• Satoshi Tayu, Shuichi UENO. On Evasion Games on Graphs, The 18th Japan Conference on Discrete and Computational Geometry and Graphs, Proceedings of the 16th Japan Conference on Discrete and Computational Geometry and Graphs, pp. 118-119, Sept. 2015.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. Weighted Dominating Sets and Induced Matchings in Orthogonal Ray Graphs, 2014 International Conference on Control, Decision and Information Technologies, Proc. of 2014 International Conference on Control, Decision and Information Technologies, Nov. 2014.
• Satoshi Tayu, Shuichi UENO. A Note on the Energy-Aware Mapping for NoCs, IEEE Asia Pacific Conference on Circuits and Systems, Proc. of IEEE Asia Pacific Conference on Circuits and Systems, pp. 647-650, Nov. 2014.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. OBDD Representation of Intersection Graphs, The 17th Japan-Korea Joint Workshop on Algorithms and Computation, Proceedings of the 17th Japan-Korea Joint Workshop on Algorithms and Computation, pp. 71-78, July 2014.
• Satoshi Tayu, Shuichi UENO. Stable Matchings in Trees, The 16th Japan Conference on Discrete and Computational Geometry and Graphs, Proceedings of the 16th Japan Conference on Discrete and Computational Geometry and Graphs, pp. 24-25, Sept. 2013.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. On Unit Grid Intersection Graphs, The 16th Japan Conference on Discrete and Computational Geometry and Graphs, Proceedings of the 16th Japan Conference on Discrete and Computational Geometry and Graphs, pp. 120-121, Sept. 2013.
• Asahi Takaoka, Satoshi Tayu, Shuichi Ueno. On Minimum Feedback Vertex Sets in Graphs, the 3rd International Conference on Networking and Computing, Proceedings of the 3rd International Conference on Networking and Computing, pp. 429-434, Dec. 2012.
• Yiqiang Sheng, Atsushi Takahashi, Shuichi Ueno. 2-Stage Simulated Annealing with Crossover Operator for 3D-Packing Volume Minimization, Proc. the 17th Workshop on Synthesis And System Integration of Mixed Information technologies (SASIMI 2012), pp. 227-232, Mar. 2012.  公式リンク  
  
• Yiqiang Sheng, Atsushi Takahashi, Shuichi Ueno. RRA-Based Multi-Objective Optimization to Mitigate the Worst Cases of Placement, Proc. IEEE 9th International Conference on ASIC (ASICON 2011), pp. 357-360, Oct. 2011.
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. Bandwidth of Convex Bipartite Graphs and Related Graphs, International Computing and Combinatorics Conference, Springer Verlarg, Lecture Notes in Computer Science, Vol. 6842, pp. 307-318, Aug. 2011.  公式リンク  
  
• Yiqiang Sheng, Atsushi Takahashi, Shuichi Ueno. Relay-Race Algorithm: A Novel Heuristic Approach to VLSI/PCB Placement, Proc. IEEE Computer Society Annual Symposium on VLSI (ISVLSI 2011), pp. 96-101, July 2011.
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. Bandwidth of Convex Bipartite Graphs and Related Graphs (Extended Abstract), the 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Proceedings of the 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, pp. 381-388, May 2011.
• Satoshi Tayu, Masayoshi Arai, Shuichi UENO. On the Energy-Aware Mapping for NoCs, The 2011 International Conference on Information and Communication Technology for Embedded Systems, Proceedings of the 2011 International Conference on Information and Communication Technology for Embedded Systems, pp. 192-194, Jan. 2011.  公式リンク  
  
• Satoshi Tayu, Shota Fukuyama, Shuichi UENO. Universal Test Sets for Reversible Circuits, International Computing and Combinatorics Conference, Springer Verlarg, Lecture Notes in Computer Science, Vol. 6196, pp. 348-357, July 2010.  公式リンク  
  
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. On Two-Directional Orthogonal Ray Graphs, IEEE International Symposium on Circuits and Systems, Proceedings of 2009 IEEE International Symposium on Circuits and Systems, pp. 1807-1810, May 2010.  公式リンク  
  
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. On Two-Directional Orthogonal Ray Graphs, Japan Conference on Comutational Geometry and Graphs, Proceedings of the 7-th Japan Conference on Comutational Geometry and Graphs, pp. 93-94, Nov. 2009.
• Satoshi Tayu, Takuya Ooshima, Shuichi UENO. On the Three-Dimensional Orthogoanl Drawing of Outerplanar Graphs (Extended Abstract), IEEE International Symposium on Circuits and Systems, Proceedings of 2009 IEEE International Symposium on Circuits and Systems, pp. 836-839, May 2009.  公式リンク  
  
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. Orthogonal Ray Graphs and Nano-PLA Design, IEEE International Symposium on Circuits and Systems, Proceedings of 2009 IEEE International Symposium on Circuits and Systems, pp. 2930-2933, May 2009.  公式リンク  
  
• Satoshi Tayu, Kumiko Nomura, Shuichi UENO. On the Three-Dimensional Orthogoanl Drawing of Seiries-Parallel Graphs, IEEE International Symposium on Circuits and Systems, Proceedings of 2008 IEEE International Symposium on Circuits and Systems, pp. 212--215, May 2008.  公式リンク  
  
• Yohei Kobayashi, ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. On Orthogonal Ray Graphs, The First AAAC(Asian Association for Algorithms and Computation) Annual Meeting, Proceedings of the First AAAC Annual Meeting, p. 57, Apr. 2008.
• Satoshi Tayu, Shigeru Ito, Shuichi UENO. On the Fault Testing for Reversible Circuits, International Computing and Combinatorics Conference, Lecture Notes in Computer Science, Springer Verlarg, Vol. 4835, pp. 812-821, Dec. 2007.
• Satoshi Tayu, Shuichi UENO. On the Complexity of Three-Dimensional Channel Routing, IEEE International Symposium on Circuits and Systems, Proceedings of 2007 IEEE International Symposium on Circuits and Systems, pp. 3399-3402, May 2007.
• Satoshi Tayu, Shuichi UENO. The Complexity of Three-Dimensional Channel Routing, The 5th Hungarian-Japanese Symposium on Discrete Mathematicas and Its Applications, Proceedings of the 5th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applicatons, pp. 279-288, Apr. 2007.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. Universal Graphs for Graphs with Bounded Path-Width, Proc. IEEE Asia-Pacific Conference on Circuits and Systems '92 (APCCAS), pp. 419-423, 1992.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. Path-Width and Proper-Path-Width, Proc. International Workshop on Graph and Graph Transformations: Tree-structured graphs, forbidden configurations and graph algorithms, pp. 13-14, 1991.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. Mixed-Searching and Proper-Path-Width, Proc. Second Annual International Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 557, pp. 61-71, 1991.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. A Characterization of the Cycle-Free k-Path in Terms of Forbidden Minors, Proc. the Second Japan Conference on Graph Theory and Combinatorics, p. 42, Aug. 1990.

国内会議発表 (査読有り)

• Satoshi Tayu, ANISH MAN SINGH SHRESTHA, Shuichi UENO. On the Complexity of Energy-Aware Mapping for NoCs, 2012IEICE General Conference, Proceedings of the 2012 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-34, Mar. 2012.
• Yiqiang Sheng, Atsushi Takahashi, Shuichi Ueno. A Stochastic Optimization Method to Solve General Placement Problem Effectively, Proc. DA Symposium 2011, IPSJ Symposium Series, Vol. 2011, No. 5, pp. 27-32, Aug. 2011.
• Tomoki Yamada, Satoshi Tayu, Shuichi UENO. On Efficient Universal Quantum Circuits, 2011 IEICE General Conference, Proceedings of the 2011 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-25, Mar. 2011.
• Takuma Fukushima, Satoshi Tayu, Shuichi UENO. On the Three-Dimensional Orthogonal Face Routing, 2010 IEICE General Conference, Proceedings of the 2010 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-31, Mar. 2010.
• Yoshiyuki ITO, Shuichi UENO. A Note on Universally Ideal Secret-Sharing Schemes, IEICE General Conference, Proceedings of the 2010 IEICE General Conference, IEICE, A-7-1, Mar. 2010.
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. A Necessary Condition for Orthogonal Ray Graphs, 2010 IEICE General Conference, Proceedings of the 2010 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-29, Mar. 2010.
• Jun Tomiyama, Satoshi Tayu, Shuichi UENO. On the Three-Dimensional Single-Active-Layer Routing with Dual Channels, 2010 IEICE General Conference, Proceedings of the 2010 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-30, Mar. 2010.
• Satoshi Tayu, Shuichi UENO. A Note on Fault Testing for Reversible Circuits, 2010 IEICE General Conference, Proceedings of the 2010 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-32, Mar. 2010.
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. Characterizations of Two-Directional Orthogonal Ray Graphs, 2009 IEICE Society Conference, Proceedings of the 2006 IEICE Society Conference, No. A-1-8, Sept. 2009.
• Satoshi Tayu, Shuichi UENO. Universal Test Sets for Reversible Circuits, 2009 IEICE Society Conference, Proceedings of the 2009 IEICE Society Conference, No. A-1-7, Sept. 2009.
• Shouta Fukuyama, Satoshi Tayu, Shuichi UENO. Fault Testing for Linear Reversible Circuits, 2009 IEICE General Conference, Proceedings of the 2009 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-14, Mar. 2009.
• SHINGO OGATA, Satoshi Tayu, Shuichi UENO. Universal Reversible Circuits, 2009 IEICE General Conference, Proceedings of the 2009 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-13, Mar. 2009.
• Eita Kobayashi, Satoshi Tayu, Shuichi UENO. Lower Bounds for the Height of Three-Dimensional Channel Routing, 2008 IEICE General Conference, Proceedings of the 2008 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. AS-1-2, Mar. 2008.
• Fuwei Cai, Satoshi Tayu, Shuichi Ueno. On the Quantum Query Complexity of All-Pairs Shortest Paths, Proceedings of the 2007 IEICE General Conference, pp. 20, Mar. 2007.
• Yohei Arai, Satoshi Tayu, Shuichi Ueno. A Note on the Three-Dimensional Single -Active Layer Routing, Proceedings of the 2007 IEICE General Conference, pp. 21, Mar. 2007.
• Shigeru Ito, Satoshi Tayu, Shuichi UENO. The Complexity of Fault Testing for Reversible Circuits, 2006 IEICE Society Conference, Proceedings of the 2006 IEICE Society Conference, No. AS-1-1, pp. S-1 - S-2, Sept. 2006.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. Universal Graphs for Graphs with Bounded Path-Width, Proc. 5th Karuizawa Workshop on Circuits and Systems, pp. 179-184, Apr. 1992.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. Mixed-Searching and Proper-Path-Width, Proc. 4th Karuizawa Workshop on Circuits and Systems, pp. 215-220, Apr. 1991.

国際会議発表 (査読なし・不明)

• Toshinori Yamada, Hiroyuki Kawakita, Tadashi Nishiyama, Shuichi Ueno. On VLSI Decompositions for d-ary de Bruijn Graphs (Extended Abstract), Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 1358-1361, 2005.
• Satoshi Tayu, Patrik Hurtig, Yoshiyasu Horikawa, Shuichi Ueno. On the Three-Dimensional Channel Routing, Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 180-183, 2005.
• Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno. Cost-Constrained Minimum-Delay Multicasting, Lecture Notes in Computer Science, Vol. 3381, pp. 330-339, 2005.
• Shuichi UENO. Orthogonal Ray Graphs, The 3rd International Conference on Discrete Mathematics, Proc. of the 3rd International Conference on Discrete Mathematics, p. 50, June 2013.
• Satoshi Tayu, Kumiko Nomura, Shuichi Ueno. On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs, Proceedings of 2006 IEEE International Symposium on Circuits and Systems, pp. 1796-1799, 2006.
• Kumiko Nomura, Satoshi Tayu, Shuichi Ueno. On the Orthogonal Drawing of Outerplannar Graphs, Lecture Notes in Computer Science, Vol. LNCS3106, pp. 300-308, 2004.
• Toshinori Yamada, Shuichi Ueno. Optimal Fault-Tolerant Linear Arrays, Proc. of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 60-64, 2003.
• Toshinori Yamada, Kumiko Nomura, Shuichi Ueno. Optimal Adaptive Parallel Diagnosis for Arrays, Proc. of the 2003 IEEE International Symposium on Circuits and Systems, pp. III-854--857, 2003.
• Toshinori Yamada, Shuichi Ueno. On Three-Dimensional Layout of de Bruijn Networks, Proc. 2002 IEEE International Symposium on Circuits and Systems, pp. III-779 -- III-782, 2002.
• Toshinori Yamada, Nobuaki Fujii, Shuichi Ueno. On Three-Dimensional Layout of Pyramid Networks, Proc. IEEE Asia-Pacific Conference on Circuits and Systems, pp. 1-4, 2002.
• Kumiko Nomura, Toshinori Yamada, Shuichi Ueno. On Adaptive Fault Diagnosis for Multiprocessor Systems, Proc. of ISAAC 2001, Vol. LNCS2223, pp. 86-98, 2001.
• Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno. On-Line Multicasting in All-Optical Networks, Proc. of ISAAC 2001, Vol. LNCS2223, 2001.
• Kumiko Nomura, Toshinori Yamada, Shuichi Ueno. Sparse Networks Tolerating Random Faults for Tree-Like and Butterfly-Like Networks, Proc. of IEEE Asia Pacific Conference on Circuits and Systems 2000, pp. 799-802, 2000.
• Toshinori Yamada, Takashi Mori, Shin-ichiro Tago, Shuichi Ueno. Optimal Implementation of CCC's by Three-Dimensional Space-Invariant Optical Interconnections, Proc. of IEEE Asia Pacific Conference on Circuits and Systems 2000, pp. 879-882, 2000.
• Toshinori Yamada, Satoshi Imai, Shuichi Ueno. On VLSI Decompositions for Debruijin Graphs, Proc. 1999 International Symposium on Circuits and Systems, pp. VI165-VI169, 1999.
• Toshinori Yamada, Shuichi Ueno. Sparse Networks Tolerating Random Faults, Proc. I-SPAN'99, pp. 114-118, 1999.
• Takashi Ohtsuka, Shuichi Ueno. Upper Bounds for the Degree of Sequential Diagnosability, Proc. of 1998 IEEE Asia-Pacific Conference on Circuits and Systems, pp. 711-714, 1998.
• Toshinori Yamada, Shuichi Ueno. Fault-Tolerant Meshes with Efficient Layouts, Proceedings of the 1997 International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 1623-1631, 1997.
• Shin'ichiroTago, Shuichi Ueno. Optimal Realization of Hypercubes by Three-Dimensional Space-Invariant Optical Interconnections, Proc. of Third International Symposium on Parallel Architectures, Algorithms, and Networks, pp. 44-48, 1997.
• Toshinori Yamada, Shuichi Ueno. Fault-Tolerant Hypercubes with Small Degree, Proc. of Third International Symposium on Parallel Architectures, Algorithms, and Networks, pp. 179-185, 1997.
• S. Ueno, M. Yamazaki, Y. Kajitani. Graph Spanners and Connectivity, Lecture Notes in Computer Science, Vol. 650, pp. 126-134, 1992.

国内会議発表 (査読なし・不明)

• Satoshi Tayu, Kumiko Nomura, Shuichi Ueno. On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs, Technical Report of IEICE, Vol. 105, No. 387, pp. 51-56, 2005.
• Satoshi Tayu, Yoshiyasu Horikawa, Shuichi Ueno. On the Three-Dimensional Layout of Butterfly Networks, Proceedings of the 2005 IEICE Society Conference, Vol. A-1-27, pp. 27, 2005.
• Shigeru Ito, Yusuke Ito, Satoshi Tayu, Shuichi Ueno. On the Complexity of Fault Testing for Reversible Circuits, Technical Report of IEICE, Vol. 105, No. 387, pp. 13-16, 2005.
• Shigeru Ito, Yusuke Ito, Satoshi Tayu, Shuichi Ueno. On the Complexity of Fault Testing for Reversible Circuits, Proceedings of the 2005 IEICE Society Conference, Vol. A-1-26, pp. 26, 2005.
• Keisuke Inoue, Kumiko Nomura, Satoshi Tayu, Shuichi Ueno. A Note on Sparse Networks Tolerating Random Faults for Cycles, Proceedings of the 2005 IEICE General Conference, pp. 31, 2005.
• Satoshi Tayu, Shuichi Ueno. A Note on the Three-Dimensional Channel Routing, Proceedings of the 2005 IEICE General Conference, pp. 30, 2005.
• Hiroki Katsumata, Satoshi Tayu, Shuichi Ueno. On the Orthogonal Ray Cacti, 2018 IEICE Society Conference, Proceedings of the 2018 IEICE Society Conference, No. A-1-3, Sept. 2018.
• Tsukasa Kobayashi, Satoshi Tayu, Shuichi Ueno. A Note on the Parallel Complexity of Doubly Lexical Orderings, 2018 IEICE General Conference, Proceedings of the 2018 IEICE General Conference, No. A-1-20, Mar. 2018.
• Satoshi Tayu, Shuichi UENO. On the Recognition of Unit Grid Intersection Graphs, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 117日7, No. 300, pp. 15-20, Nov. 2017.
• Koutarou Mure, Satoshi Tayu, Shuichi UENO. A Note on the Subgraph Isomorphism Problem, Proceedings of the 2016 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-7, Mar. 2017.
• Hiroki Katsumata, Satoshi Tayu, Shuichi UENO. A Note on the Largest Common Subgraph Problem, Proceedings of the 2016 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-6, Mar. 2017.
• Satoshi Tayu, Kenji Ichikawa, Shuichi UENO. A Note on the Spanning Subgraph Isomorphism Problem, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 116, No. 315, pp. 83-88, Nov. 2016.
• Hiroki Katsumata, Satoshi Tayu, Shuichi UENO. On the Complexity of Finding a Largest Common Subtree of Trees, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 116, No. 315, pp. 89-92, Nov. 2016.
• Yuuta Inaba, Satoshi Tayu, Shuichi UENO. A 3/2-Approximation Algorithm for the Bipartite Dense Subgraph Problem on Bipartite Permutation Graphs, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 116, No. 315, pp. 93-96, Nov. 2016.
• Ryu Sugimoto, Satoshi Tayu, Shuichi Ueno. A Parallel Matching Algorithm for Chain Graphs, 2016 IEICE Society Conference, Proceedings of the 2016 IEICE Society Conference, No. A-1-11, Sept. 2016.
• Yuuta Inaba, Satoshi Tayu, Shuichi UENO. A 3/2-Approximation Algorithm for the Bipartite Dense Subgraph Problem on Bipartite Permutation Graphs, Proceedings of the 2016 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-3, Mar. 2016.
• Kenji Ichikawa, Satoshi Tayu, Shuichi UENO. A Note on the Spanning Subgraph Isomorphism Problem, Proceedings of the 2016 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-5, Mar. 2016.
• Hiroyuki Gunji, Satoshi Tayu, Shuichi UENO. On the Three-Dimensional Routing, Proceedings of the 2016 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-4, Mar. 2016.
• Satoshi Tayu, Shuichi UENO. On Evasion Games on Graphs, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 115, No. 315, pp. 59-64, Nov. 2015.
• Satoshi Tayu, Shuichi Ueno. A Note on the Evasion Games on Graphs, 2015 IEICE Society Conference, Proceedings of the 2015 IEICE Society Conference, No. A-1-12, Sept. 2015.
• Yuuta Inaba, Satoshi Tayu, Shuichi Ueno. A Note on the Bipartite Dense Subgraph Problem, 2015 IEICE Society Conference, Proceedings of the 2015 IEICE Society Conference, No. A-1-11, Sept. 2015.
• Satoshi Tayu, Shuni Go, Shuichi UENO. On the Complexity of Mining Maximal Frequent Subgraphs, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 115, No. 87, pp. 37-42, June 2015.
• Asahi Takaoka, Shuichi UENO. A Note on Irreversible 2-Conversion Sets in Subcubic Graphs, IEICE Technical Committee on Theoretical Foundations of Computing, IEICE Technical Report, Institute of Electronics, Information and Communication Engineers, Vol. 114, No. 509, pp. 9-11, Mar. 2015.
• Asahi Takaoka, Shuichi UENO. A Note on Irreversible 2-Conversion Sets in Subcubic Graphs, 2015 IEICE General Conference, Proceedings of the 2015 IEICE General Conference, The Institute of Electronics, Information and Communication Engineers, No. A-1-10, Mar. 2015.
• Shuni Go, Satoshi Tayu, Shuichi UENO. A Note on the Complexity of Mining Maximal Frequent Subgraphs, Proceedings of the 2015 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-9, Mar. 2015.
• Haruki Itou, Satoshi Tayu, Shuichi UENO. On Evasion Games on Graphs, Proceedings of the 2015 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-11, Mar. 2015.
• Asahi Takaoka, Shingo Okuma, Satoshi Tayu, Shuichi UENO. Harmonious Coloring of Caterpillars, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 114, No. 312, pp. 57-62, Nov. 2014.
• Satoshi Tayu, Asahi Takaoka, Shuichi UENO. On the Bipartite Dense Subgraph Problem, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 114, No. 312, pp. 64-68, Nov. 2014.
• Satoshi Tayu, Dai Itoh, Shuichi Ueno. On the Bipartite Dense Subgraph Problem, 2014 IEICE Society Conference, Proceedings of the 2014 IEICE Society Conference, No. A-1-7, Sept. 2014.
• Asahi Takaoka, Satoshi Tayu, Shingo Okuma, Shuichi Ueno. Harmonious Coloring of Caterpillars, 2014 IEICE Society Conference, Proceedings of the 2014 IEICE Society Conference, No. A-1-6, Sept. 2014.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. Weighted Dominating Sets and Induced Matchings in Orthogonal Ray Graphs, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 114, No. 122, pp. 45-48, July 2014.
• Satoshi Tayu, Toshiyuki Hongo, Shuichi UENO. A Note on the 3-D IC TSV Assignment Problem, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 114, No. 122, pp. 49-54, July 2014.
• Guochen Zhao, ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. On the OBDD Representation of de Bruijn Graphs, Proceedings of the 2014 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-18, Mar. 2014.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. Weighted Dominating Set Problem for Two-Directional Orthogonal Ray Graphs, Proceedings of the 2014 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-19, Mar. 2014.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. A Note on Two-Directional Orthogonal Ray Graphs and Related Graphs, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 113, No. 278, pp. 99-104, Nov. 2013.
• Shuichi UENO. Orthogonal Ray Graphs with Applications to Nanocircuit Design, IEICE Technical Report, Vol. 113, No. 278, p. 71, Nov. 2013.
• Satoshi Tayu, Shuichi Ueno. Stable Matchings in Trees, IPSJ SIGAL, IPSJ SIG Technical Report, Vol. 2012-AL-145, No. 10, pp. 1-6, Nov. 2013.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. On Unit Grid Intersection Graphs, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 113, No. 118, pp. 171-175, July 2013.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. A Note on the OBDD Representation of Graphs, 2013IEICE General Conference, Proceedings of the 2013 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, p. A-1-6, Mar. 2013.
• Kousuke Nishikawa, Satoshi Tayu, Shuichi UENO. A Note on the Subtree Isomorphism Problem, 2013IEICE General Conference, Proceedings of the 2013 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, p. A-1-5, Mar. 2013.
• Kousuke Nishikawa, Satoshi Tayu, Shuichi UENO. On Orthogonal Ray Trees, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 112, No. 418, pp. 35-40, Jan. 2013.
• Satoshi Tayu, Shuichi UENO. A Note on the Energy-Aware Mapping for NoCs, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 112, No. 273, pp. 5-10, Nov. 2012.
• Asahi Takaoka, Satoshi Tayu, Shuichi Ueno. Representation of Bipartite Graphs by OBDDs, IPSJ SIGAL, IPSJ SIG Technical Report, Vol. 2012-AL-141, No. 4, pp. 1-6, Oct. 2012.
• Dai Itoh, Satoshi Tayu, Shuichi Ueno. The Complexity of the Densest k-Subgraph Problem for Chordal Bipartite Graphs, 2012 IEICE Society Conference, Proceedings of the 2012 IEICE Society Conference, No. A-1-9, Sept. 2012.
• Asahi Takaoka, Satoshi Tayu, Shuichi Ueno. A Note on Two-Directional Orthogonal Ray Graphs, 2012 IEICE Society Conference, Proceedings of the 2012 IEICE Society Conference, No. A-1-8, Sept. 2012.
• Kousuke Nishikawa, Satoshi Tayu, Shuichi Ueno. Characterizations of Orthogonal Ray Trees, 2012 IEICE Society Conference, Proceedings of the 2012 IEICE Society Conference, No. A-1-10, Sept. 2012.
• Satoshi Tayu, Shuichi Ueno. A Note on the Energy-Aware Mapping for NoCs, 2012 IEICE Society Conference, Proceedings of the 2012 IEICE Society Conference, No. A-1-6, Sept. 2012.
• Kazunari Ishii, Satoshi Tayu, Shuichi Ueno. A Note on the Cutwidth of Trees, 2012 IEICE Society Conference, Proceedings of the 2012 IEICE Society Conference, No. A-1-7, Sept. 2012.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. On Minimum Feedback Vertex Sets in Graphs, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 112, No. 113, pp. 87-92, July 2012.
• Satoshi Tayu, ANISH MAN SINGH SHRESTHA, Shuichi UENO. On the Complexity of Energy-Aware Mapping for NoCs, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 111, No. 465, pp. 219-224, Mar. 2012.
• Asahi Takaoka, Satoshi Tayu, Shuichi UENO. Minimum Feedback Vertex Sets in Permutation Bigraphs, 2012IEICE General Conference, Proceedings of the 2012 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-35, Mar. 2012.
• Yiqiang Sheng, Atsushi Takahashi, Shuichi Ueno. An Improved Simulated Annealing for 3D Packing with Sequence Triple and Quintuple Representations, Technical Committee on VLSI Design Technologies, IEICE Technical Report (VLD2011-88), Vol. 111, No. 324, pp. 209-214, Nov. 2011.  公式リンク  
  
• Satoshi Tayu, Tomoki Yamada, Shuichi UENO. On Efficient Universal Quantum Circuits, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 111, No. 293, pp. 1-6, Nov. 2011.
• Kousuke Nishikawa, Satoshi Tayu, Shuichi UENO. A Note on the Maximum Balanced Biclique Problem, 2011 IEICE Society Conference, Proceedings of the 2011 IEICE Society Conference, No. A-1-14, Sept. 2011.
• Yiqiang Sheng, Atsushi Takahashi, Shuichi Ueno. MSA: Mixed Stochastic Algorithm for Placement with Larger Solution Space, Technical Committee on VLSI Design Technologies, IEICE Technical Report (VLD2011-42), Vol. 111, No. 216, pp. 11-16, Sept. 2011.
• Satoshi Tayu, Katsuya Imai, Shuichi UENO. A Note on the Subtree Isomorphism Problem, 2011 IEICE Society Conference, Proceedings of the 2011 IEICE Society Conference, No. A-1-13, Sept. 2011.
• Masayoshi Arai, Satoshi Tayu, Shuichi UENO. On the Energy-Aware Mapping for NoCs, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 110, No. 389, pp. 87-92, Jan. 2011.
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. Bandwidth of Convex Bipartite Graphs and Related Graph Classes, IPSJ SIGAL, IPSJ SIG Technical Report, Vol. 2010-AL-132, No. 6, pp. 1-7, Nov. 2010.
• Satoshi Tayu, Shuichi UENO. On the Complexity of Three-Dimensional Orthogonal Face Routing, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 110, No. 283, pp. 19-24, Nov. 2010.
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. Bandwidth of Convex Bipartite Graphs, 2010 IEICE Society Conference, Proceedings of the 2010 IEICE Society Conference, No. A-1-8, Sept. 2010.
• Satoshi Tayu, Shuichi UENO. On the Complexity of Three-Dimensional Orthogonal Face Routing, 2010 IEICE Society Conference, Proceedings of the 2010 IEICE Society Conference, No. A-1-7, Sept. 2010.
• Asahi Takaoka, ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. A Note on a Problem of Nano-PLA Design, 2010 IEICE General Conference, Proceedings of the 2010 IEICE General Conference, Institute of Electronics, Information and Communication Engineers, No. A-1-28, Mar. 2010.
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. On Two-Directional Orthogonal Ray Graphs, IPSJ SIGAL, IPSJ SIG Technical Report, Vol. 2009-AL-127, No. 6, Nov. 2009.
• Satoshi Tayu, Shota Fukuyama, Shuichi UENO. Universal Test Sets for Reversible Circuits, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 109, No. 300, pp. 59-64, Nov. 2009.
• ANISH MAN SINGH SHRESTHA, Tomoki Yamada, Satoshi Tayu, Shuichi UENO. A Note on Two Problems of Nano-PLA Design, Technical Committee on Circuits and Systems, IEICE, Thechnical Reprot of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 108, No. 453, pp. 183-184, Mar. 2009.
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. Orthogonal Ray Graphs and Nano-PLA Design, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 108, No. 227, pp. 5-9, Nov. 2008.
• Satoshi Tayu, Shuichi UENO. On the Three-Dimensional Single-Active-Layer Routing, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 108, No. 227, pp. 1-4, Nov. 2008.
• ANISH MAN SINGH SHRESTHA, Yohei Kobayashi, Satoshi Tayu, Shuichi UENO. On Orthogonal Ray Graphs, 情報処理学会アルゴリズム研究会, Technical Report of the IPSJ, Vol. 2008, No. 84, pp. 9-15, Sept. 2008.
• Satoshi Tayu, Takuya Ooshima, Shuichi UENO. On the Three-Dimensional Orthogonal Drawing of Outerplanar Graphs, 情報処理学会アルゴリズム研究会, Technical Report of the IPSJ, Vol. 2008, No. 84, pp. 1-8, Sept. 2008.
• Yohei Kobayashi, ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. On Orthogonal Ray Graphs with Applications to NanoPLA Design, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 107, No. 527, pp. 97-98, Mar. 2008.
• Yoshinori Kawata, Satoshi Tayu, Shuichi UENO. An Efficient Quantum Addition Circuit, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 107, No. 527, pp. 95-96, Mar. 2008.
• Takuya Ooshima, Satoshi Tayu, Shuichi UENO. On the Three-Dimensional Orthogonal Drawing of Outerplanar Graphs, Technical Report of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 107, No. 527, pp. 93-94, Mar. 2008.
• ANISH MAN SINGH SHRESTHA, Satoshi Tayu, Shuichi UENO. On the Permutation Routing in All-Optical Caterpillar Networks, Technical Committee on Circuits and Systems, IEICE, Thechnical Reprot of the IEICE, Institute of Electronics, Information and Communication Engineers, Vol. 107, No. 361, pp. 23-27, Nov. 2007.
• Satoshi Tayu, Shigeru Ito, Shuichi UENO. On the Fault Testing for Reversible Circuits, 情報処理学会アルゴリズム研究会, Technical Report of the IPSJ, Vol. 2007, No. 66, pp. 25-30, July 2007.
• Satoshi Tayu, Shigeru Ito, Shuichi UENO. On the Complexity of Fault Testing for Reversible Circuits, Technical Report of IPSJ, Information Processing Society of Japan, Vol. 2007, No. 66, pp. 25-30, July 2006.  公式リンク  
  
• Takafumi Yamaguchi, Satoshi Tayu, Shuichi Ueno. On the Complexity of Three-Dimensional Channel Routing, Proceedings of the 68th National Convension of IPSJ, pp. 1-193 - 1-194, 2006.
• Satoshi Tayu, Kumiko Nomura, Shuichi Ueno. On the Three-Dimensional Orthogonal Drawing of Series-Parallel Graphs, IEICE Technical Report, Vol. 105, No. 502, pp. 7-12, 2006.
• Toshihiro Kubo, Satoshi Tayu:, Shuichi Ueno. On the Three-Dimensional Layout of Hypercubes, Proceedings of the 2006 IEICE Society Conference, Vol. AS-1-4, pp. S-7 - S-8, 2006.
• Satoshi Tayu, Shuichi Ueno. Three-Dimensional Channel Routeing is in NP, Proceedings of the 2006 IEICE Society Conference, Vol. AS-1-3, pp. S-5 - S-6, 2006.
• Shigeru Ito, Satoshi Tayu, Shuichi Ueno. The Complexity of Fault Testing for Reversible Circuits, Proceedings of the 2006 IEICE Society Conference, Vol. A-1-1, pp. S-1 - S-2, 2006.
• Satoshi Tayu, Shuichi Ueno. The Complexity of Three-Dimensional Channel Routing, IEICE Technical Report, Vol. 106, No. 366, pp. 37-41, 2006.
• Kumiko Nomura, Satoshi Tayu, Shuichi Ueno. On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs, Proc. of the 2004 IEICE Society Conference, No. AS-1-2, pp. (S-3)-(S-4), 2004.
• Hiroyuki Kawakita, Toshinori Yamada, Shuichi Ueno. Efficient VLSI Decompositions for de Bruijin Graphs, Proc. of the 66th National Convention of IPSJ, Vol. 1, pp. 265-266, 2004.
• Kumiko Nomura, Satoshi Tayu, Shuichi Ueno. On the Orthogonal Drawing of Series-Parallel Graphs, IPSJ SIG Technical Report, Vol. 2004-AL-98, pp. 25-32, 2004.
• Satoshi Tayu, Turki Al-mutairi, Shuichi Ueno. Cost-Constrained Minimum-Delay Multicasting, Technical Report of IEICE, Vol. 104, No. 115, pp. 43-48, 2004.
• Satoshi Tayu, Patrik Hurtig, Yoshiyasu Horikawa, Shuichi Ueno. On the Three-Dimensional Channel Routing, IPSJ SIG Technical Report, Vol. 2004-AL-98, pp. 19-23, 2004.
• Satoshi Tayu, Patrik Hurtig, Yoshiyasu Horikawa, Shuichi Ueno. On the Three-Dimensional Channel Routing, Proc. of the 2004 IEICE Society Conference, No. AS-1-3, pp. S-5, 2004.
• Kohsuke Ogata, Toshinori Yamada, Shuichi Ueno. A Note on the Implementation of de Bruijn Networks by the Optical Transpose Interconnection System, Proc. of the 65th National Convention of IPSJ, Vol. 1, pp. 165-166, 2003.
• Kumiko Nomura, Satoshi Tayu, Shuichi Ueno. On the Orthogonal Drawing of Outerplanar Graphs, Technical Report of IEICE, Vol. 103, No. 403, pp. 7-11, 2003.
• Koji Goda, Toshinori Yamada, Shuichi Ueno. A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems, Proc. of the 65th National Convention of IPSJ, Vol. 1, pp. 179-180, 2003.
• Toshinori Yamada, Shuichi Ueno. Explicit Construction of Optimal Fault-Tolerant Linear Arrays, Proc. of the 65th National Convention of IPSJ, Vol. 1, pp. 177-178, 2003.
• Toshinori Yamada, Shuichi Ueno. Explicit Construction of Optimal Fault-Tolerant Linear Arrays, Technical Report of IEICE, Vol. 102, No. 593, pp. 1-7, 2003.
• Toshinori Yamada, Shuichi Ueno. Optimal Fault-Tolerant Linear Arrays, Technical Report of IEICE, Vol. 102, No. 426, pp. 31-35, 2002.
• Tadashi Nishiyama, Toshinori Yamada, Shuichi Ueno. On VLSI Decompositions for d-ary de Bruijn Graphs, Technical Report of IEICE, Vol. 100, No. 568, pp. 47-54, 2001.
• Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno. On-Line Multicasting in All-Optical Networks, Technical Report of IEICE, Vol. 101, No. 133, pp. 57-63, 2001.
• Kumiko Nomura, Toshinori Yamada, Shuichi Ueno. On Adaptive Fault Diagnosis for Multiprocessor Systems, Technical Report of IEICE, Vol. 101, No. 133, pp. 49-56, 2001.
• Toshinori Yamada, Nobuaki Fujii, Shuichi Ueno. On Three-Dimensional Layout of Pyramid Networks, Technical Report of IEICE, Vol. 101, No. 458, pp. 77-82, 2001.
• Toshinori Yamada, Shuichi Ueno. On Three-Dimensional Layout of de Bruijn Networks, Technical Report of IEICE, Vol. 101, No. 133, pp. 33-40, 2001.
• Toshinori Yamada, Akitsugu Watanabe, Shuichi Ueno. A Note on Sequential Diagnosis of Multiprocessor Systems, Proc. of the 61th National Convention of IPSJ, Vol. 1, pp. 227-228, 2000.
• Kumiko Nomura, Toshinori Yamada, Shuichi Ueno. Sparse Networks Tolerating Random Faults for Tree-Like and Butterfly-Like Networks, Technical Report of IEICE, Vol. 100, No. 415, pp. 59-64, 2000.
• Toshinori Yamada, Akitsugu Watanabe, Shuichi Ueno. On Sequential Diagnosis of Multiprocessor Systems, Technical Report of IEICE, Vol. 100, No. 415, pp. 65-72, 2000.
• Suguru Amitani, Toshinori Yamada, Shuichi Ueno. Optimal Layouts of Virtual Paths in Complete Binary Tree ATM Networks, Technical Report of IEICE, Vol. 100, No. 415, pp. 73-78, 2000.
• Atsushi Yamazaki, Toshinori Yamada, Shuichi Ueno. On Sequential Diagnosis of Multiprocessor Systems under Probabilistic Models, Technical Report of IEICE, Vol. COMP99-70, pp. 9-16, 2000.
• Yoshiyasu Doi, Toshinori Yamada, Shuichi Ueno. Three-Dimensional VLSI Layouts of de Bruijn and Shuffle-Exchange Networks, Technical Report of IEICE, Vol. COMP99-71, pp. 17-24, 2000.
• Suguru Amitani, Toshinori Yamada, Shuichi Ueno. Optimal Layouts of Virtual Paths in Complete Binary Tree ATM Networks, Proc. of the 61th National Convention of IPSJ, Vol. 1, pp. 231-232, 2000.
• Kumiko Nomura, Toshinori Yamada, Shuichi Ueno. Sparse Networks Tolerating Random Faults for Tree-Like and Butterfly-Like Networks, Proc. of the 61th National Convention of IPSJ, Vol. 1, pp. 229-230, 2000.
• Hideki Awata, Toshinori Yamada, Shuichi Ueno. Routing and Wavelength Translation in WDM Networks, Technical Report of IEICE (CPSY98-153), Vol. 98, No. 572, pp. 15-22, 1999.
• Akitsugu Watanabe, Toshinori Yamada, Shuichi Ueno. Bounds for the Degree of Sequential Diagnosability for CCC's, Technical Report of IEICE (CAS99-96, CST99-50), Vol. 99, pp. 45-48, 1999.
• Toshinori Yamada, Shuichi Ueno. Sparse Networks Tolerating Random Faults, Proc. of Joint Symposium on Parallel Processing 1999, pp. 293-297, 1999.
• Toshinori Yamada, Takashi Mori, Shin-ichiro Tago, Shuichi Ueno. Optimal Implementation of CCC's by Three-Dimensional Space-Invariant Optical Interconnections, Technical Report of IEICE (CAS99-97, CST99-51), Vol. 99, pp. 49-54, 1999.
• Shin'ichiro Tago, Shuichi Ueno. A Note on the Three-Dimensional Optical Implementation of Regular Bipartite Graphs, Proc. of The 1998 Engineering Sciences Society conference of IEICE, pp. 203-204, 1998.
• Toshinori Yamada, Shuichi Ueno. Sparse Networks Tolerating Random Faults, IPSJ SIG Notes(98-AL-65), pp. 41-45, 1998.
• Yoshiyasu Doi, Toshinori Yamada, Shuichi Ueno. A Note on Efficient Layouts for de Bruijn Networks, Proc. of The 57th National Convention of IPSJ, Vol. 1, pp. 137-138, 1998.
• Toshinori Yamada, Shuichi Ueno. A Note on the Circuit-Switched Fixed Routing in Networks, Proc. of The 57th National Convention of IPSJ, Vol. 1, pp. 131-132, 1998.
• Toshinori Yamada, Takashi Tono-oka, Shuihi Ueno. Tight Bounds for Circuit-Switched Fixed Routing in Networks, Technical Report of the IEICE, Vol. CPSY97-111, No. 524, pp. 75-82, 1998.
• Toshinori Yamada, Shuichi Ueno. Fault-Tolerant Meshes with Efficient Layouts, JSPP'97, pp. 85-92, 1997.
• Takashi Ohtsuka, Shuichi Ueno. Upper Bounds for the Degree of Sequential Diagnosability, IPSJ SIG Notes, Vol. 97, No. 42, pp. 25-32, 1997.
• Toshinori Yamada, Shuichi Ueno. Fault-Tolerant Meshes with Efficient Layouts, Technical Report of IEICE, Vol. CPSY96-104, No. 503, pp. 41-47, 1997.
• Satoshi Imai, Toshinori Yamada, Shuichi Ueno. On VLSI Decompositions for deBruijn Graphs, Technical Report of IEICE, Vol. CPSY97-68, No. 347, pp. 1-6, 1997.
• 高橋篤司, 上野修一, 梶谷洋司. 真のパス幅が高々２のグラフの族に対する極小禁止マイナー, 回路とシステム研究会, 電子情報通信学会技術研究報告 (CAS92-51), Vol. 92, No. 236, pp. 69-76, Sept. 1992.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. Universal Graphs for Graphs with Bounded Path-Width, Algorithms,, IPSJ SIG Technical Reports (91-AL-24-3), Vol. 91, No. 102, Nov. 1991.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. On the Proper-Path-Decomposition of Trees, Technical Committee on Circuits and Systems, IEICE Technical Report (CAS91-74), Vol. 91, No. 255, pp. 23-26, Sept. 1991.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. Mixed-Searching and Proper-Path-Width, Algorithms, IPSJ SIG Technical Reports (91-AL-22-7), Vol. 91, No. 69, July 1991.
• Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani. Minimal Acyclic Forbidden Minors for the Family of Graphs with Bounded Path-Width, Algorithms, IPSJ SIG Technical Reports (91-AL-19-3), Vol. 91, No. 11, Jan. 1991.

学位論文

• パリティ構造をもつマトロイドとその応用に関する研究,  本文,  Doctor of Engineering,  東京工業大学,  1982/--/--, 

[ BibTeX 形式で保存 ]    [ 論文・著書をCSV形式で保存 ]    [ 特許をCSV形式で保存 ]