Takao Asano

Publication Activity (10 Years)

Years Active: 1976-2021
Publications (10 Years): 6

Top Topics

Additively Separable

Allocation Problems

Top Venues

Ann. Oper. Res.

Int. J. Comput. Geom. Appl.

Math. Methods Oper. Res.

Publications

Takao Asano, Yusuke Osaki
Optimal investment under ambiguous technology shocks. Eur. J. Oper. Res. 293 (1) (2021)
Takao Asano
Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts. ISAAC (2021)
Takao Asano, Yusuke Osaki
Portfolio allocation problems between risky and ambiguous assets. Ann. Oper. Res. 284 (1) (2020)
Takao Asano, Hiroyuki Umeda
Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts. ISAAC (2020)
Hiroyuki Umeda, Takao Asano
Nash Equilibria in Combinatorial Auctions with Item Bidding and Subadditive Symmetric Valuations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2018)
Hiroyuki Umeda, Takao Asano
Nash Equilibria in Combinatorial Auctions with Item Bidding by Two Bidders. J. Inf. Process. 25 (2017)
Takao Asano, Hiroyuki Kojima
Modularity and monotonicity of games. Math. Methods Oper. Res. 80 (1) (2014)
Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 23 (2) (2013)
Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto
Guest Editorial: Selected Papers from ISAAC 2011. Algorithmica 67 (1) (2013)
Takao Asano
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT. Theor. Comput. Sci. 354 (3) (2006)
Takao Asano
Portfolio inertia under ambiguity. Math. Soc. Sci. 52 (3) (2006)
Takao Asano
An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT. FCT (2003)
Takao Asano, David P. Williamson
Improved Approximation Algorithms for MAX SAT. J. Algorithms 42 (1) (2002)
Ryo Kato, Keiko Imai, Takao Asano
An Improved Algorithm for the Minimum Manhattan Network Problem. ISAAC (2002)
Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. ISAAC (2000)
Takao Asano, David P. Williamson
Improved approximation algorithms for MAX SAT. SODA (2000)
Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata
A Theoretical Framework of Hybrid Approaches to MAX SAT. ISAAC (1997)
Takao Asano
Constructing a bipartite graph of maximum connectivity with prescribed degrees. Networks 29 (4) (1997)
Takao Asano
Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. ISTCS (1997)
Takao Asano, Takao Ono, Tomio Hirata
Approximation Algorithms for the Maximum Satisfiability Problem. SWAT (1996)
Takao Asano, Takao Ono, Tomio Hirata
Approximation Algorithms for the Maximum Satisfiability Problem. Nord. J. Comput. 3 (4) (1996)
Takao Ono, Tomio Hirata, Takao Asano
An Approximation Algorithm for MAX 3-SAT. ISAAC (1995)
Takao Asano
An O(n log log n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees. J. Comput. Syst. Sci. 51 (3) (1995)
Takao Asano
Graphical Degree Sequence Problems with Connectivity Requirements. ISAAC (1993)
Takao Asano
Dynamic Programming on Intervals. ISA (1991)
Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano
A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency. Algorithmica 4 (1) (1989)
Takao Asano
Generalized Manhattan path algorithm with applications. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 7 (7) (1988)
Hiroshi Imai, Takao Asano
Dynamic Orthogonal Segment Intersection Search. J. Algorithms 8 (1) (1987)
Takao Asano
An Application of Duality to Edge-Deletion Problems. SIAM J. Comput. 16 (2) (1987)
Takao Asano, Tetsuo Asano, Hiroshi Imai
Shortest Path Between Two Simple Polygons. Inf. Process. Lett. 24 (5) (1987)
Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano
A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency. SCG (1987)
Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai
Visibility of Disjoint Polygons. Algorithmica 1 (1) (1986)
Takao Asano, Tetsuo Asano, Hiroshi Imai
Partitioning a polygonal region into trapezoids. J. ACM 33 (2) (1986)
Hiroshi Imai, Takao Asano
Efficient Algorithms for Geometric Graph Search Problems. SIAM J. Comput. 15 (2) (1986)
Takao Asano, Tetsuo Asano, Ron Y. Pinter
Polygon Triangulation: Efficiency and Minimality. J. Algorithms 7 (2) (1986)
Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai
Visibility-Polygon Search and Euclidean Shortest Paths FOCS (1985)
Takao Asano
An Approach to the Subgraph Homeomorphism Problem. Theor. Comput. Sci. 38 (1985)
Takao Asano, Takao Nishizeki, Paul D. Seymour
A note on nongraphic matroids. J. Comb. Theory, Ser. B 37 (3) (1984)
Takao Asano, Shunji Kikuchi, Nobuji Saito
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs. Discret. Appl. Math. 7 (1) (1984)
Masato Edahiro, I. Kokubo, Takao Asano
A New Point-Location Algorithm and Its Practical Efficiency: Comparison with Existing Algorithms. ACM Trans. Graph. 3 (2) (1984)
Takao Asano, Takao Nishizeki, Nobuji Saito, James G. Oxley
A Note on the Critical Problem for Matroids. Eur. J. Comb. 5 (2) (1984)
Hiroshi Imai, Takao Asano
Dynamic Segment Intersection Search with Applications FOCS (1984)
Tetsuo Asano, Takao Asano
Minimum Partition of Polygonal Regions into Trapezoids FOCS (1983)
Takao Asano, Tomio Hirata
Edge-Contraction Problems. J. Comput. Syst. Sci. 26 (2) (1983)
Takao Asano
Properties of matroids characterizable in terms of excluded matroids. J. Comb. Theory, Ser. B 34 (2) (1983)
Hiroshi Imai, Takao Asano
Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane. J. Algorithms 4 (4) (1983)
Takao Nishizeki, Takao Asano, Takahiro Watanabe
An approximation algorithm for the hamiltonian walk problem on maximal planar graphs. Discret. Appl. Math. 5 (2) (1983)
Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary
The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discret. Math. 38 (1) (1982)
Takao Asano, Tomio Hirata
Edge-Deletion and Edge-Contraction Problems STOC (1982)
Takao Asano, Takao Nishizeki, Takahiro Watanabe
An upper bound on the length of a Hamiltonian walk of a maximal planar graph. J. Graph Theory 4 (3) (1980)
Takao Asano, Shunji Kikuchi, Nobuji Saito
An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph. Graph Theory and Algorithms (1980)
Takao Asano, Michiro Shibui, Itsuo Takanami
General Results on Tour Lengths in Machines and Digraphs. SIAM J. Comput. 5 (4) (1976)