| 2017 | COCOON | Stable Matchings in Trees. | Satoshi Tayu, Shuichi Ueno |
| 2014 | CoDIT | Weighted dominating sets and induced matchings in orthogonal ray graphs. | Asahi Takaoka, Satoshi Tayu, Shuichi Ueno |
| 2011 | COCOON | Bandwidth of Convex Bipartite Graphs and Related Graphs. | Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno |
| 2010 | COCOON | Universal Test Sets for Reversible Circuits. | Satoshi Tayu, Shota Fukuyama, Shuichi Ueno |
| 2010 | ISCAS | On two-directional orthogonal ray graphs. | Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno |
| 2009 | ISCAS | Orthogonal Ray Graphs and Nano-PLA Design. | Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno |
| 2009 | ISCAS | On the Three-dimensional Orthogonal Drawing of Outerplanar Graphs. | Satoshi Tayu, Takuya Oshima, Shuichi Ueno |
| 2008 | ISCAS | On the three-dimensional orthogonal drawing of series-parallel graphs (extended abstract). | Satoshi Tayu, Kumiko Nomura, Shuichi Ueno |
| 2007 | ISAAC | On the Fault Testing for Reversible Circuits. | Satoshi Tayu, Shigeru Ito, Shuichi Ueno |
| 2007 | ISCAS | On the Complexity of Three-Dimensional Channel Routing (Extended Abstract). | Satoshi Tayu, Shuichi Ueno |
| 2006 | ISCAS | On the two-dimensional orthogonal drawing of series-parallel graphs. | Satoshi Tayu, Kumiko Nomura, Shuichi Ueno |
| 2005 | ISCAS | On the three-dimensional channel routing. | Satoshi Tayu, Patrik Hurtig, Yoshiyasu Horikawa, Shuichi Ueno |
| 2005 | SOFSEM | Cost-Constrained Minimum-Delay Multicasting. | Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno |
| 2004 | COCOON | On the Orthogonal Drawing of Outerplanar Graphs. | Kumiko Nomura, Satoshi Tayu, Shuichi Ueno |
| 2003 | ASPDAC | A simulated annealing approach with sequence-pair encoding using a penalty function for the placement problem with boundary constraints. | Satoshi Tayu |
| 2002 | ISCAS | 3D scheduling based on code space exploration for dynamically reconfigurable systems. | Mineo Kaneko, Jun'ichi Yokoyama, Satoshi Tayu |
| 2000 | ICCD | Assignment-Space Exploration Approach to Concurrent Data-Path/Floorplan Synthesis. | Koji Ohashi, Mineo Kaneko, Satoshi Tayu |
| 2000 | ISCAS | Exact and heuristic methods of assignment driven scheduling for data-path synthesis applications. | Mineo Kaneko, Yoshitaka Nishio, Satoshi Tayu |
| 1999 | COCOON | Scheduling Trees onto Hypercubes and Grids Is NP-complete. | Satoshi Tayu |