Traveling Salesman Cycles are not Always Subgraphs of Voronoi Duals. - Vitit Kantabutra (Inf. Process. Lett., 1983)

New Algorithms for Multilink Robot Arms. - Vitit Kantabutra; S. Rao Kosaraju (J. Comput. Syst. Sci., 1986)

A lower bound on the path length of binary trees. - Vitit Kantabutra (SIGACT News, 1988)

Designing optimum carry-skip adders. - Vitit Kantabutra (IEEE Symposium on Computer Arithmetic, 1991)

Motions of a Short-Linked Robot Arm in a Square. - Vitit Kantabutra (Discret. Comput. Geom., 1992)

Designing Optimum One-Level Carry-Skip Adders. - Vitit Kantabutra (IEEE Trans. Computers, 1993)

Accelerated Two-Level Carry-Skip Adders-A Type of Very Fast Adders. - Vitit Kantabutra (IEEE Trans. Computers, 1993)

A Recursive Carry-Lookahead/Carry-Select Hybrid Adder. - Vitit Kantabutra (IEEE Trans. Computers, 1993)

A Linear-Time Near-Optimum-Length Triangulation Algorithm for Convex Polygons. - Vitit Kantabutra (J. Comput. Syst. Sci., 1994)

A State Assignment Approach to Asynchronous CMOS Circuit Design. - Vitit Kantabutra; Andreas G. Andreou (IEEE Trans. Computers, 1994)

On Hardware for Computing Exponential and Trigonometric Functions. - Vitit Kantabutra (IEEE Trans. Computers, 1996)

Reaching a Point with an Unanchored Robot Arm in a Square. - Vitit Kantabutra (Int. J. Comput. Geom. Appl., 1997)

High-radix CORDIC for vector rotation with pipelined FPGA implementation. - Vitit Kantabutra (ICECS, 1999)

Area- and Power-Reduced Standard-Cell Spanning Tree Adders. - Pasquale Corsonello; Stefania Perri; Vitit Kantabutra (ESA/VLSI, 2004)

Towards Reliable Convergence in the Training of Neural Networks - The Streamlined Glide Algorithm and the LM Glide Algorithm. - Vitit Kantabutra (MLMTA, 2006)

A New Type of Database Systems: Intentionally-Linked Entities - a Detailed Suggestion for a Direct Way to Implement the Entity-Relationship Data Model. - Vitit Kantabutra (CSREA EEE, 2007)

An Infinite Class of Non-Hamiltonian Voronoi Duals Based on Regular Polygons. - Vitit Kantabutra (FCS, 2009)

On the Benefits of using Linked Data Structures and Dynamically-Allocated Memory for the Modeling and Visualization of Practical Complex Systems. - Vitit Kantabutra; Charles Burns (MSV, 2010)

Modeling Event-Based Historical Narratives: A Conversation Between Digital Humanists, Information Scientists and Computer Scientists. - Elijah Meeks; Ruth Mostern; Karl E. Grossner; Ryan Shaw 001; Ramesh C. Jain; Vitit Kantabutra (DH, 2011)

Better Software Tools for the Humanities and the Social Sciences: A Computer Science Perspective. - Russell Stephenson; Vitit Kantabutra (DH, 2011)

A Clear Temporal GIS Viewer and Software for Discovering Irregularities in Historical GIS. - Vitit Kantabutra; J. B. Owens (DH, 2013)

Comparative Analysis of Various Design Implementations of CLA Carry Chains. - Naga Spandana Muppaneni; Steve C. Chiu; Vitit Kantabutra; Farshad Dailami (EIT, 2018)

Implementing Hypergraph Databases with Fast Relationship Linking and Traversal Using ILE. - Vitit Kantabutra (CSCI, 2022)