Takao Asano - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 51 from 51

2021

Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of CutsTakao Asano. isaac 2021: [doi]

Optimal investment under ambiguous technology shocksTakao Asano, Yusuke Osaki. eor, 293(1):304-311, 2021. [doi]

2020

Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of CutsTakao Asano, Hiroyuki Umeda. isaac 2020: [doi]

Portfolio allocation problems between risky and ambiguous assetsTakao Asano, Yusuke Osaki. anor, 284(1):63-79, 2020. [doi]

2018

Nash Equilibria in Combinatorial Auctions with Item Bidding and Subadditive Symmetric ValuationsHiroyuki Umeda, Takao Asano. ieicet, 101-A(9):1324-1333, 2018. [doi]

2017

Nash Equilibria in Combinatorial Auctions with Item Bidding by Two BiddersHiroyuki Umeda, Takao Asano. jip, 25:745-754, 2017. [doi]

2014

Modularity and monotonicity of gamesTakao Asano, Hiroyuki Kojima. mmor, 80(1):29-46, 2014. [doi]

2013

Guest Editorial: Selected Papers from ISAAC 2011Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto. algorithmica, 67(1):1-2, 2013. [doi]

Guest Editors' ForewordTakao Asano, Shin-Ichi Nakano, Yoshio Okamoto. ijcga, 23(2):73-74, 2013. [doi]

2006

An improved analysis of Goemans and Williamson s LP-relaxation for MAX SATTakao Asano. TCS, 354(3):339-353, 2006. [doi]

Portfolio inertia under ambiguityTakao Asano. mss, 52(3):223-232, 2006. [doi]

2003

An Improved Analysis of Goemans and Williamson s LP-Relaxation for MAX SATTakao Asano. fct 2003: 2-14 [doi]

2002

Improved Approximation Algorithms for MAX SATTakao Asano, David P. Williamson. jal, 42(1):173-202, 2002. [doi]

An Improved Algorithm for the Minimum Manhattan Network ProblemRyo Kato, Keiko Imai, Takao Asano. isaac 2002: 344-356 [doi]

2000

Improved approximation algorithms for MAX SATTakao Asano, David P. Williamson. soda 2000: 96-105 [doi]

Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial CircuitsTakao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda. isaac 2000: 204-215 [doi]

1997

Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-WilliamsonTakao Asano. istcs 1997: 24-37 [doi]

Constructing a bipartite graph of maximum connectivity with prescribed degreesTakao Asano. networks, 29(4):245-263, 1997. [doi]

A Theoretical Framework of Hybrid Approaches to MAX SATTakao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata. isaac 1997: 153-162

1996

Approximation Algorithms for the Maximum Satisfiability ProblemTakao Asano, Takao Ono, Tomio Hirata. swat 1996: 100-111

Approximation Algorithms for the Maximum Satisfiability ProblemTakao Asano, Takao Ono, Tomio Hirata. njc, 3(4):388-404, 1996.

1995

An O(n log log n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed DegreesTakao Asano. jcss, 51(3):503-510, 1995.

An Approximation Algorithm for MAX 3-SATTakao Ono, Tomio Hirata, Takao Asano. isaac 1995: 163-170

1993

Graphical Degree Sequence Problems with Connectivity RequirementsTakao Asano. isaac 1993: 38-47

1991

Dynamic Programming on IntervalsTakao Asano. sersc-isa 1991: 199-207

1989

A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical EfficiencyMasato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano. algorithmica, 4(1):61-76, 1989.

1988

Generalized Manhattan path algorithm with applicationsTakao Asano. tcad, 7(7):797-804, 1988. [doi]

1987

An Application of Duality to Edge-Deletion ProblemsTakao Asano. SICOMP, 16(2):312-331, 1987.

Shortest Path Between Two Simple PolygonsTakao Asano, Tetsuo Asano, Hiroshi Imai. ipl, 24(5):285-288, 1987.

A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical EfficiencyMasato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano. compgeom 1987: 258-267 [doi]

Dynamic Orthogonal Segment Intersection SearchHiroshi Imai, Takao Asano. jal, 8(1):1-18, 1987.

1986

Polygon Triangulation: Efficiency and MinimalityTakao Asano, Tetsuo Asano, Ron Y. Pinter. jal, 7(2):221-231, 1986.

Partitioning a polygonal region into trapezoidsTakao Asano, Tetsuo Asano, Hiroshi Imai. JACM, 33(2):290-312, 1986. [doi]

Visibility of Disjoint PolygonsTakao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai. algorithmica, 1(1):49-63, 1986.

Efficient Algorithms for Geometric Graph Search ProblemsHiroshi Imai, Takao Asano. SICOMP, 15(2):478-494, 1986.

1985

An Approach to the Subgraph Homeomorphism ProblemTakao Asano. TCS, 38:249-267, 1985.

Visibility-Polygon Search and Euclidean Shortest PathsTakao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai. focs 1985: 155-164

1984

1983

1982

Edge-Deletion and Edge-Contraction ProblemsTakao Asano, Tomio Hirata. stoc 1982: 245-254

The smallest 2-connected cubic bipartite planar nonhamiltonian graphTakao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary. DM, 38(1):1-6, 1982. [doi]

1980

An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graphTakao Asano, S. Kikuchi, Nobuji Saito. gta 1981: 182-195

An upper bound on the length of a Hamiltonian walk of a maximal planar graphTakao Asano, Takao Nishizeki, Takahiro Watanabe. jgt, 4(3):315-336, 1980. [doi]

Sign in or sign up to see more results.

runs on WebDSL