General Results on Tour Lengths in Machines and Digraphs. - Takao Asano; Michiro Shibui; Itsuo Takanami (SIAM J. Comput., 1976)

An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph. - Takao Asano; Shunji Kikuchi; Nobuji Saito (Graph Theory and Algorithms, 1980)

An upper bound on the length of a Hamiltonian walk of a maximal planar graph. - Takao Asano; Takao Nishizeki; Takahiro Watanabe (J. Graph Theory, 1980)

Edge-Deletion and Edge-Contraction Problems - Takao Asano; Tomio Hirata (STOC, 1982)

The smallest 2-connected cubic bipartite planar nonhamiltonian graph. - Takao Asano; Nobuji Saito; Geoffrey Exoo; Frank Harary (Discret. Math., 1982)

Minimum Partition of Polygonal Regions into Trapezoids - Tetsuo Asano; Takao Asano (FOCS, 1983)

An approximation algorithm for the hamiltonian walk problem on maximal planar graphs. - Takao Nishizeki; Takao Asano; Takahiro Watanabe (Discret. Appl. Math., 1983)

Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane. - Hiroshi Imai; Takao Asano (J. Algorithms, 1983)

Edge-Contraction Problems. - Takao Asano; Tomio Hirata (J. Comput. Syst. Sci., 1983)

Properties of matroids characterizable in terms of excluded matroids. - Takao Asano (J. Comb. Theory B, 1983)

Dynamic Segment Intersection Search with Applications - Hiroshi Imai; Takao Asano (FOCS, 1984)

A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs. - Takao Asano; Shunji Kikuchi; Nobuji Saito (Discret. Appl. Math., 1984)

A Note on the Critical Problem for Matroids. - Takao Asano; Takao Nishizeki; Nobuji Saito; James G. Oxley (Eur. J. Comb., 1984)

A note on nongraphic matroids. - Takao Asano; Takao Nishizeki; Paul D. Seymour (J. Comb. Theory B, 1984)

A New Point-Location Algorithm and Its Practical Efficiency: Comparison with Existing Algorithms. - Masato Edahiro; I. Kokubo; Takao Asano (ACM Trans. Graph., 1984)

Visibility-Polygon Search and Euclidean Shortest Paths - Takao Asano; Tetsuo Asano; Leonidas J. Guibas; John Hershberger 001; Hiroshi Imai (FOCS, 1985)

An Approach to the Subgraph Homeomorphism Problem. - Takao Asano (Theor. Comput. Sci., 1985)

Visibility of Disjoint Polygons. - Takao Asano; Tetsuo Asano; Leonidas J. Guibas; John Hershberger 001; Hiroshi Imai (Algorithmica, 1986)

Partitioning a polygonal region into trapezoids. - Takao Asano; Tetsuo Asano; Hiroshi Imai (J. ACM, 1986)

Polygon Triangulation: Efficiency and Minimality. - Takao Asano; Tetsuo Asano; Ron Y. Pinter (J. Algorithms, 1986)

Efficient Algorithms for Geometric Graph Search Problems. - Hiroshi Imai; Takao Asano (SIAM J. Comput., 1986)

Shortest Path Between Two Simple Polygons. - Takao Asano; Tetsuo Asano; Hiroshi Imai (Inf. Process. Lett., 1987)

Dynamic Orthogonal Segment Intersection Search. - Hiroshi Imai; Takao Asano (J. Algorithms, 1987)

An Application of Duality to Edge-Deletion Problems. - Takao Asano (SIAM J. Comput., 1987)

Generalized Manhattan path algorithm with applications. - Takao Asano (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1988)

A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency. - Masato Edahiro; Katsuhiko Tanaka; Takashi Hoshino 003; Takao Asano (Algorithmica, 1989)

Dynamic Programming on Intervals. - Takao Asano (ISA, 1991)

Graphical Degree Sequence Problems with Connectivity Requirements. - Takao Asano (ISAAC, 1993)

An Approximation Algorithm for MAX 3-SAT. - Takao Ono; Tomio Hirata; Takao Asano (ISAAC, 1995)

An O(n log log n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees. - Takao Asano (J. Comput. Syst. Sci., 1995)

Approximation Algorithms for the Maximum Satisfiability Problem. - Takao Asano; Takao Ono; Tomio Hirata (Nord. J. Comput., 1996)

A Theoretical Framework of Hybrid Approaches to MAX SAT. - Takao Asano; Kuniaki Hori; Takao Ono; Tomio Hirata (ISAAC, 1997)

Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. - Takao Asano (ISTCS, 1997)

Constructing a bipartite graph of maximum connectivity with prescribed degrees. - Takao Asano (Networks, 1997)

Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. - Takao Asano; Magnús M. Halldórsson; Kazuo Iwama; Takeshi Matsuda (ISAAC, 2000)

An Improved Algorithm for the Minimum Manhattan Network Problem. - Ryo Kato; Keiko Imai; Takao Asano (ISAAC, 2002)

Improved Approximation Algorithms for MAX SAT. - Takao Asano; David P. Williamson (J. Algorithms, 2002)

Portfolio inertia under ambiguity. - Takao Asano (Math. Soc. Sci., 2006)

An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT. - Takao Asano (Theor. Comput. Sci., 2006)

Guest Editorial: Selected Papers from ISAAC 2011. - Takao Asano; Shin-Ichi Nakano; Yoshio Okamoto (Algorithmica, 2013)

Guest Editors' Foreword. - Takao Asano; Shin-Ichi Nakano; Yoshio Okamoto (Int. J. Comput. Geom. Appl., 2013)

Modularity and monotonicity of games. - Takao Asano; Hiroyuki Kojima (Math. Methods Oper. Res., 2014)

Nash Equilibria in Combinatorial Auctions with Item Bidding by Two Bidders. - Hiroyuki Umeda; Takao Asano (J. Inf. Process., 2017)

Nash Equilibria in Combinatorial Auctions with Item Bidding and Subadditive Symmetric Valuations. - Hiroyuki Umeda; Takao Asano (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts. - Takao Asano; Hiroyuki Umeda (ISAAC, 2020)

Portfolio allocation problems between risky and ambiguous assets. - Takao Asano; Yusuke Osaki (Ann. Oper. Res., 2020)

Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts. - Takao Asano (ISAAC, 2021)

Optimal investment under ambiguous technology shocks. - Takao Asano; Yusuke Osaki (Eur. J. Oper. Res., 2021)