Takao Asano

According to our database, Takao Asano authored at least 48 papers between 1976 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2021

Optimal investment under ambiguous technology shocks.

Takao Asano, Yusuke Osaki

Eur. J. Oper. Res., 2021

Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts.

Takao Asano

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Portfolio allocation problems between risky and ambiguous assets.

Takao Asano, Yusuke Osaki

Ann. Oper. Res., 2020

Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts.

Takao Asano, Hiroyuki Umeda

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2018

Nash Equilibria in Combinatorial Auctions with Item Bidding and Subadditive Symmetric Valuations.

Hiroyuki Umeda, Takao Asano

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

2017

Nash Equilibria in Combinatorial Auctions with Item Bidding by Two Bidders.

Hiroyuki Umeda, Takao Asano

J. Inf. Process., 2017

2014

Modularity and monotonicity of games.

Takao Asano, Hiroyuki Kojima

Math. Methods Oper. Res., 2014

2013

Guest Editors' Foreword.

Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto

Int. J. Comput. Geom. Appl., 2013

Guest Editorial: Selected Papers from ISAAC 2011.

Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto

Algorithmica, 2013

2006

An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT.

Takao Asano

Theor. Comput. Sci., 2006

Portfolio inertia under ambiguity.

Takao Asano

Math. Soc. Sci., 2006

2002

Improved Approximation Algorithms for MAX SAT.

Takao Asano, David P. Williamson

J. Algorithms, 2002

An Improved Algorithm for the Minimum Manhattan Network Problem.

Ryo Kato, Keiko Imai, Takao Asano

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2000

Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits.

Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1997

Constructing a bipartite graph of maximum connectivity with prescribed degrees.

Takao Asano

Networks, 1997

Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson.

Takao Asano

Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

A Theoretical Framework of Hybrid Approaches to MAX SAT.

Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996

Approximation Algorithms for the Maximum Satisfiability Problem.

Takao Asano, Takao Ono, Tomio Hirata

Nord. J. Comput., 1996

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

An Approximation Algorithm for MAX 3-SAT.

Takao Ono, Tomio Hirata, Takao Asano

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1993

Graphical Degree Sequence Problems with Connectivity Requirements.

Takao Asano

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1991

Dynamic Programming on Intervals.

Takao Asano

Proceedings of the ISA '91 Algorithms, 1991

1989

A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency.

Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano

Algorithmica, 1989

1988

Generalized Manhattan path algorithm with applications.

Takao Asano

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1988

1987

An Application of Duality to Edge-Deletion Problems.

Takao Asano

SIAM J. Comput., 1987

Dynamic Orthogonal Segment Intersection Search.

Hiroshi Imai, Takao Asano

J. Algorithms, 1987

Shortest Path Between Two Simple Polygons.

Takao Asano, Tetsuo Asano, Hiroshi Imai

Inf. Process. Lett., 1987

1986

Efficient Algorithms for Geometric Graph Search Problems.

Hiroshi Imai, Takao Asano

SIAM J. Comput., 1986

Polygon Triangulation: Efficiency and Minimality.

Takao Asano, Tetsuo Asano, Ron Y. Pinter

J. Algorithms, 1986

Partitioning a polygonal region into trapezoids.

Takao Asano, Tetsuo Asano, Hiroshi Imai

J. ACM, 1986

Visibility of Disjoint Polygons.

Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai

Algorithmica, 1986

1985

An Approach to the Subgraph Homeomorphism Problem.

Takao Asano

Theor. Comput. Sci., 1985

Visibility-Polygon Search and Euclidean Shortest Paths

Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

A New Point-Location Algorithm and Its Practical Efficiency: Comparison with Existing Algorithms.

Masato Edahiro, I. Kokubo, Takao Asano

ACM Trans. Graph., 1984

A note on nongraphic matroids.

Takao Asano, Takao Nishizeki, Paul D. Seymour

J. Comb. Theory B, 1984

A Note on the Critical Problem for Matroids.

Takao Asano, Takao Nishizeki, Nobuji Saito, James G. Oxley

Eur. J. Comb., 1984

A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs.

Takao Asano, Shunji Kikuchi, Nobuji Saito

Discret. Appl. Math., 1984

Dynamic Segment Intersection Search with Applications

Hiroshi Imai, Takao Asano

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

Properties of matroids characterizable in terms of excluded matroids.

Takao Asano

J. Comb. Theory B, 1983

Edge-Contraction Problems.

Takao Asano, Tomio Hirata

J. Comput. Syst. Sci., 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

An approximation algorithm for the hamiltonian walk problem on maximal planar graphs.

Takao Nishizeki, Takao Asano, Takahiro Watanabe

Discret. Appl. Math., 1983

Minimum Partition of Polygonal Regions into Trapezoids

Tetsuo Asano, Takao Asano

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

The smallest 2-connected cubic bipartite planar nonhamiltonian graph.

Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary

Discret. Math., 1982

Edge-Deletion and Edge-Contraction Problems

Takao Asano, Tomio Hirata

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

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

An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.

Takao Asano, Shunji Kikuchi, Nobuji Saito

Proceedings of the Graph Theory and Algorithms, 1980

1976

General Results on Tour Lengths in Machines and Digraphs.

Takao Asano, Michiro Shibui, Itsuo Takanami

SIAM J. Comput., 1976