Takao Asano - RankMe

54 papers A* 5B 9Misc 1Journal 34Unranked 5

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