Takao Asano
According to our database1,
Takao Asano
authored at least 48 papers
between 1976 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2021
Simple Envy-Free and Truthful Mechanisms for Cake Cutting with a Small Number of Cuts.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021
2020
Ann. Oper. Res., 2020
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
2018
Nash Equilibria in Combinatorial Auctions with Item Bidding and Subadditive Symmetric Valuations.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
2017
J. Inf. Process., 2017
2014
2013
2006
Theor. Comput. Sci., 2006
2002
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
2000
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
1997
Networks, 1997
Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997
1996
Approximation Algorithms for the Maximum Satisfiability Problem.
Nord. J. Comput., 1996
1995
An O(n log log n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees.
J. Comput. Syst. Sci., 1995
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995
1993
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
1991
1989
A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency.
Algorithmica, 1989
1988
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1988
1987
1986
1985
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.
ACM Trans. Graph., 1984
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs.
Discret. Appl. Math., 1984
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
1983
J. Comb. Theory B, 1983
Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane.
J. Algorithms, 1983
An approximation algorithm for the hamiltonian walk problem on maximal planar graphs.
Discret. Appl. Math., 1983
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
1982
Discret. Math., 1982
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982
1980
J. Graph Theory, 1980
An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.
Proceedings of the Graph Theory and Algorithms, 1980
1976