default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakao Asano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j34]Takao Asano, Yusuke Osaki:
Optimal investment under ambiguous technology shocks. Eur. J. Oper. Res. 293(1): 304-311 (2021)- [c18]Takao Asano:
Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts. ISAAC 2021: 68:1-68:17 - 2020
- [j33]Takao Asano, Yusuke Osaki:
Portfolio allocation problems between risky and ambiguous assets. Ann. Oper. Res. 284(1): 63-79 (2020) - [c17]Takao Asano, Hiroyuki Umeda:
Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts. ISAAC 2020: 15:1-15:16
2010 – 2019
- 2018
- [j32]Hiroyuki Umeda, Takao Asano:
Nash Equilibria in Combinatorial Auctions with Item Bidding and Subadditive Symmetric Valuations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1324-1333 (2018) - 2017
- [j31]Hiroyuki Umeda, Takao Asano:
Nash Equilibria in Combinatorial Auctions with Item Bidding by Two Bidders. J. Inf. Process. 25: 745-754 (2017) - 2014
- [j30]Takao Asano, Hiroyuki Kojima:
Modularity and monotonicity of games. Math. Methods Oper. Res. 80(1): 29-46 (2014) - 2013
- [j29]Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto
:
Guest Editorial: Selected Papers from ISAAC 2011. Algorithmica 67(1): 1-2 (2013) - [j28]Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto:
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 23(2): 73-74 (2013) - 2011
- [e2]Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, Osamu Watanabe:
Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings. Lecture Notes in Computer Science 7074, Springer 2011, ISBN 978-3-642-25590-8 [contents]
2000 – 2009
- 2006
- [j27]Takao Asano:
Portfolio inertia under ambiguity. Math. Soc. Sci. 52(3): 223-232 (2006) - [j26]Takao Asano:
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT. Theor. Comput. Sci. 354(3): 339-353 (2006) - 2003
- [c16]Takao Asano:
An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT. FCT 2003: 2-14 - 2002
- [j25]Takao Asano, David P. Williamson:
Improved Approximation Algorithms for MAX SAT. J. Algorithms 42(1): 173-202 (2002) - [c15]Ryo Kato, Keiko Imai, Takao Asano:
An Improved Algorithm for the Minimum Manhattan Network Problem. ISAAC 2002: 344-356 - 2000
- [c14]Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda:
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. ISAAC 2000: 204-215 - [c13]Takao Asano, David P. Williamson:
Improved approximation algorithms for MAX SAT. SODA 2000: 96-105
1990 – 1999
- 1999
- [e1]Takao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, Takeshi Tokuyama:
Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings. Lecture Notes in Computer Science 1627, Springer 1999, ISBN 3-540-66200-6 [contents] - 1997
- [j24]Takao Asano:
Constructing a bipartite graph of maximum connectivity with prescribed degrees. Networks 29(4): 245-263 (1997) - [c12]Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata:
A Theoretical Framework of Hybrid Approaches to MAX SAT. ISAAC 1997: 153-162 - [c11]Takao Asano:
Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. ISTCS 1997: 24-37 - 1996
- [j23]Takao Asano, Takao Ono, Tomio Hirata:
Approximation Algorithms for the Maximum Satisfiability Problem. Nord. J. Comput. 3(4): 388-404 (1996) - [c10]Takao Asano, Takao Ono, Tomio Hirata:
Approximation Algorithms for the Maximum Satisfiability Problem. SWAT 1996: 100-111 - 1995
- [j22]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): 503-510 (1995) - [c9]Takao Ono, Tomio Hirata, Takao Asano:
An Approximation Algorithm for MAX 3-SAT. ISAAC 1995: 163-170 - 1993
- [c8]Takao Asano:
Graphical Degree Sequence Problems with Connectivity Requirements. ISAAC 1993: 38-47 - 1991
- [c7]Takao Asano:
Dynamic Programming on Intervals. ISA 1991: 199-207
1980 – 1989
- 1989
- [j21]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): 61-76 (1989) - 1988
- [j20]Takao Asano:
Generalized Manhattan path algorithm with applications. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 7(7): 797-804 (1988) - 1987
- [j19]Takao Asano, Tetsuo Asano, Hiroshi Imai:
Shortest Path Between Two Simple Polygons. Inf. Process. Lett. 24(5): 285-288 (1987) - [j18]Hiroshi Imai, Takao Asano:
Dynamic Orthogonal Segment Intersection Search. J. Algorithms 8(1): 1-18 (1987) - [j17]Takao Asano:
An Application of Duality to Edge-Deletion Problems. SIAM J. Comput. 16(2): 312-331 (1987) - [c6]Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano:
A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency. SCG 1987: 258-267 - 1986
- [j16]Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai:
Visibility of Disjoint Polygons. Algorithmica 1(1): 49-63 (1986) - [j15]Takao Asano, Tetsuo Asano, Hiroshi Imai:
Partitioning a polygonal region into trapezoids. J. ACM 33(2): 290-312 (1986) - [j14]Takao Asano, Tetsuo Asano, Ron Y. Pinter:
Polygon Triangulation: Efficiency and Minimality. J. Algorithms 7(2): 221-231 (1986) - [j13]Hiroshi Imai, Takao Asano:
Efficient Algorithms for Geometric Graph Search Problems. SIAM J. Comput. 15(2): 478-494 (1986) - 1985
- [j12]Takao Asano:
An Approach to the Subgraph Homeomorphism Problem. Theor. Comput. Sci. 38: 249-267 (1985) - [c5]Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai:
Visibility-Polygon Search and Euclidean Shortest Paths. FOCS 1985: 155-164 - 1984
- [j11]Takao Asano, Shunji Kikuchi, Nobuji Saito:
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs. Discret. Appl. Math. 7(1): 1-15 (1984) - [j10]Takao Asano, Takao Nishizeki, Nobuji Saito, James G. Oxley:
A Note on the Critical Problem for Matroids. Eur. J. Comb. 5(2): 93-97 (1984) - [j9]Takao Asano, Takao Nishizeki, Paul D. Seymour:
A note on nongraphic matroids. J. Comb. Theory B 37(3): 290-293 (1984) - [j8]Masato Edahiro, I. Kokubo, Takao Asano:
A New Point-Location Algorithm and Its Practical Efficiency: Comparison with Existing Algorithms. ACM Trans. Graph. 3(2): 86-109 (1984) - [c4]Hiroshi Imai, Takao Asano:
Dynamic Segment Intersection Search with Applications. FOCS 1984: 393-402 - 1983
- [j7]Takao Nishizeki, Takao Asano, Takahiro Watanabe:
An approximation algorithm for the hamiltonian walk problem on maximal planar graphs. Discret. Appl. Math. 5(2): 211-222 (1983) - [j6]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): 310-323 (1983) - [j5]Takao Asano, Tomio Hirata:
Edge-Contraction Problems. J. Comput. Syst. Sci. 26(2): 197-208 (1983) - [j4]Takao Asano:
Properties of matroids characterizable in terms of excluded matroids. J. Comb. Theory B 34(2): 233-236 (1983) - [c3]Tetsuo Asano, Takao Asano:
Minimum Partition of Polygonal Regions into Trapezoids. FOCS 1983: 233-241 - 1982
- [j3]Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary:
The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discret. Math. 38(1): 1-6 (1982) - [c2]Takao Asano, Tomio Hirata:
Edge-Deletion and Edge-Contraction Problems. STOC 1982: 245-254 - 1980
- [j2]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): 315-336 (1980) - [c1]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: 182-195
1970 – 1979
- 1976
- [j1]Takao Asano, Michiro Shibui, Itsuo Takanami:
General Results on Tour Lengths in Machines and Digraphs. SIAM J. Comput. 5(4): 629-645 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
