| 2015 | WALCOM | Edge-Colorings of Weighted Graphs - (Extended Abstract). | Yuji Obata, Takao Nishizeki |
| 2014 | FAW | Spanning Distribution Forests of Graphs - (Extended Abstract). | Keisuke Inoue, Takao Nishizeki |
| 2014 | FAW | Approximation Algorithms for Bandwidth Consecutive Multicolorings - (Extended Abstract). | Yuji Obata, Takao Nishizeki |
| 2013 | AAIM | Spanning Distribution Trees of Graphs. | Masaki Kawabata, Takao Nishizeki |
| 2013 | COCOON | Parametric Power Supply Networks. | Shiho Morishita, Takao Nishizeki |
| 2012 | AAIM | Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract). | Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou |
| 2010 | FAW | Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. | Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki |
| 2010 | ISAAC | Minimum Cost Partitions of Trees with Supply and Demand. | Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki |
| 2010 | WALCOM | Small Grid Drawings of Planar Graphs with Balanced Bipartition. | Xiao Zhou, Takashi Hikino, Takao Nishizeki |
| 2009 | FCT | Energy Complexity and Depth of Threshold Circuits. | Kei Uchizawa, Takao Nishizeki, Eiji Takimoto |
| 2009 | ISAAC | Convex Drawings of Internally Triconnected Plane Graphs on | Xiao Zhou, Takao Nishizeki |
| 2009 | MFCS | Size and Energy of Threshold Circuits Computing Mod Functions. | Kei Uchizawa, Takao Nishizeki, Eiji Takimoto |
| 2009 | TAMC | Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions. | Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki |
| 2008 | COCOON | Efficient Compression of Web Graphs. | Yasuhito Asano, Yuya Miyawaki, Takao Nishizeki |
| 2008 | ISAAC | Partitioning a Weighted Tree to Subtrees of Almost Uniform Size. | Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki |
| 2007 | WALCOM | Inner Rectangular Drawings of Plane Graphs: Application of Graph Drawing to VLSI Layouts. | Takao Nishizeki |
| 2007 | WALCOM | Orthogonal drawings of series-parallel graphs with minimum bends. | Xiao Zhou, Takao Nishizeki |
| 2006 | COCOON | Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size. | Takehiro Ito, Kazuya Goto, Xiao Zhou, Takao Nishizeki |
| 2006 | GD | Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs. | Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki |
| 2006 | ISAAC | Approximability of Partitioning Graphs with Supply and Demand. | Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki |
| 2006 | ISAAC | Convex Grid Drawings of Plane Graphs with Rectangular Contours. | Akira Kamada, Kazuyuki Miura, Takao Nishizeki |
| 2005 | COCOON | Algorithms for Finding Distance-Edge-Colorings of Graphs. | Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki |
| 2005 | GD | Convex Drawings of Plane Graphs of Minimum Outer Apices. | Kazuyuki Miura, Machiko Azuma, Takao Nishizeki |
| 2005 | GD | No-bend Orthogonal Drawings of Series-Parallel Graphs. | Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki |
| 2005 | ISAAC | Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. | Xiao Zhou, Takao Nishizeki |
| 2005 | ISCAS | Partitioning graphs of supply and demand. | Takehiro Ito, Xiao Zhou, Takao Nishizeki |
| 2005 | WISE | Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework. | Yasuhito Asano, Takao Nishizeki, Masashi Toyoda |
| 2004 | COCOON | Necessary and Sufficient Numbers of Cards for the Transformation Protocol. | Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki |
| 2004 | COCOON | Canonical Decomposition, Realizer, Schnyder Labeling and Orderly Spanning Trees of Plane Graphs. | Kazuyuki Miura, Machiko Azuma, Takao Nishizeki |
| 2004 | ISAAC | Inner Rectangular Drawings of Plane Graphs. | Kazuyuki Miura, Hiroki Haga, Takao Nishizeki |
| 2004 | WG | Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. | Takehiro Ito, Xiao Zhou, Takao Nishizeki |
| 2004 | WG | Octagonal Drawings of Plane Graphs with Prescribed Face Areas. | Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki |
| 2003 | COCOON | List Total Colorings of Series-Parallel Graphs. | Xiao Zhou, Yuki Matsuo, Takao Nishizeki |
| 2003 | GD | Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework. | Yasuhito Asano, Takao Nishizeki |
| 2003 | GD | No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. | Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki |
| 2003 | ISAAC | Drawing Plane Graphs. | Takao Nishizeki |
| 2002 | COCOON | Algorithms for the Multicolorings of Partial k-Trees. | Takehiro Ito, Takao Nishizeki, Xiao Zhou |
| 2002 | GD | Extended Rectangular Drawings of Plane Graphs with Designated Corners. | Kazuyuki Miura, Ayako Miyazawa, Takao Nishizeki |
| 2002 | GD | Rectangular Drawings of Planar Graphs. | Md. Saidur Rahman, Takao Nishizeki, Shubhashis Ghosh |
| 2002 | ISAAC | Partitioning Trees of Supply and Demand. | Takehiro Ito, Xiao Zhou, Takao Nishizeki |
| 2002 | WG | Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. | Md. Saidur Rahman, Takao Nishizeki |
| 2001 | COCOON | Algorithm for the Cost Edge-Coloring of Trees. | Xiao Zhou, Takao Nishizeki |
| 2001 | GD | Orthogonal Drawings of Plane Graphs without Bends. | Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki |
| 2001 | ICALP | Total Colorings of Degenerated Graphs. | Shuji Isobe, Xiao Zhou, Takao Nishizeki |
| 2001 | ISAAC | Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups. | Takaaki Mizuki, Takao Nishizeki |
| 2001 | ISAAC | Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. | Xiao Zhou, Takao Nishizeki |
| 2000 | COCOON | Rectangular Drawings of Plane Graphs Without Designated Corners. | Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki |
| 2000 | GD | Labeling Points with Rectangles of Various Shapes. | Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe |
| 2000 | ISAAC | Convex Grid Drwaings of Four-Connected Plane Graphs. | Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano |
| 2000 | ISAAC | Finding Independent Spanning Trees in Partial k-Trees. | Xiao Zhou, Takao Nishizeki |
| 1999 | EuroCrypt | Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key. | Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki |
| 1999 | GD | Grid Drawings of Four-Connected Plane Graphs. | Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki |
| 1999 | ISAAC | A Linear Algorithm for Finding Total Colorings of Partial k-Trees. | Shuji Isobe, Xiao Zhou, Takao Nishizeki |
| 1999 | ISAAC | Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs. | Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki |
| 1999 | WG | Box-Rectangular Drawings of Plane Graphs. | Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki |
| 1998 | COCOON | Eulerian Secret Key Exchange. | Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki |
| 1998 | ISAAC | The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. | Xiao Zhou, Takao Nishizeki |
| 1998 | WG | A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees. | Shuji Isobe, Xiao Zhou, Takao Nishizeki |
| 1998 | WG | A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. | Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki |
| 1997 | COCOON | Generalized Vertex-Rankings of Partial k-trees. | Mohammod Abul Kashem, Xiao Zhou, Takao Nishizeki |
| 1997 | GD | A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. | Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki |
| 1997 | ISAAC | An Algorithm for Finding a Region with the Minimum Lotal L | Yoshiyuki Kusakari, Takao Nishizeki |
| 1996 | COCOON | Rectangular Grid Drawings of Plane Graphs. | Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki |
| 1996 | GD | A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. | Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki |
| 1996 | ISAAC | Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). | Xiao Zhou, Syurei Tamura, Takao Nishizeki |
| 1996 | WG | Generalized Edge-Ranking of Trees (Extended Abstract). | Xiao Zhou, Mohammod Abul Kashem, Takao Nishizeki |
| 1995 | COCOON | Simple Reduction of f-Colorings to Edge-Colorings. | Xiao Zhou, Takao Nishizeki |
| 1995 | ISAAC | Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. | Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki |
| 1995 | ISAAC | Algorithms for Finding f-Colorings of Partial k-Trees. | Xiao Zhou, Takao Nishizeki |
| 1995 | SODA | Finding Optimal Edge-Rankings of Trees. | Xiao Zhou, Takao Nishizeki |
| 1994 | ESA | An Efficient Algorithm for Edge-Ranking Trees. | Xiao Zhou, Takao Nishizeki |
| 1994 | ISAAC | Edge-Coloring and f-Coloring for Various Classes of Graphs. | Xiao Zhou, Takao Nishizeki |
| 1993 | ESA | A Linear Algorithm for Edge-Coloring Partial k-Trees. | Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki |
| 1993 | IPCO | Nearly uniform scheduling of file transfers. | Shin-Ichi Nakano, Takao Nishizeki |
| 1993 | IPCO | Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. | Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki |
| 1993 | ISAAC | Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions. | Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki |
| 1992 | IPCO | Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. | Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano |
| 1992 | ISAAC | Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. | Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki |
| 1992 | LATIN | An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. | Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki |
| 1990 | SODA | Finding Steiner Forests in Planar Graphs. | Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki |
| 1985 | STOC | Multicommodity Flows in Planar Undirected Graphs and Shortest Paths | Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito |