dblp.uni-trier.dewww.uni-trier.de

Takao Asano Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2006
39EETakao Asano: An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT. Theor. Comput. Sci. 354(3): 339-353 (2006)
2003
38EETakao Asano: An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT. FCT 2003: 2-14
2002
37EERyo Kato, Keiko Imai, Takao Asano: An Improved Algorithm for the Minimum Manhattan Network Problem. ISAAC 2002: 344-356
36EETakao Asano, David P. Williamson: Improved Approximation Algorithms for MAX SAT. J. Algorithms 42(1): 173-202 (2002)
2000
35EETakao 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
34EETakao Asano, David P. Williamson: Improved approximation algorithms for MAX SAT. SODA 2000: 96-105
1999
33 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 Springer 1999
1997
32EETakao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata: A Theoretical Framework of Hybrid Approaches to MAX SAT. ISAAC 1997: 153-162
31EETakao Asano: Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. ISTCS 1997: 24-37
30EETakao Asano: Constructing a bipartite graph of maximum connectivity with prescribed degrees. Networks 29(4): 245-263 (1997)
1996
29EETakao Asano, Takao Ono, Tomio Hirata: Approximation Algorithms for the Maximum Satisfiability Problem. SWAT 1996: 100-111
28 Takao Asano, Takao Ono, Tomio Hirata: Approximation Algorithms for the Maximum Satisfiability Problem. Nord. J. Comput. 3(4): 388-404 (1996)
1995
27EETakao Ono, Tomio Hirata, Takao Asano: An Approximation Algorithm for MAX 3-SAT. ISAAC 1995: 163-170
26 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)
1993
25EETakao Asano: Graphical Degree Sequence Problems with Connectivity Requirements. ISAAC 1993: 38-47
1991
24 Takao Asano: Dynamic Programming on Intervals. ISA 1991: 199-207
1989
23 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
22EETakao Asano: Generalized Manhattan path algorithm with applications. IEEE Trans. on CAD of Integrated Circuits and Systems 7(7): 797-804 (1988)
1987
21EEMasato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano: A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency. Symposium on Computational Geometry 1987: 258-267
20 Takao Asano, Tetsuo Asano, Hiroshi Imai: Shortest Path Between Two Simple Polygons. Inf. Process. Lett. 24(5): 285-288 (1987)
19 Hiroshi Imai, Takao Asano: Dynamic Orthogonal Segment Intersection Search. J. Algorithms 8(1): 1-18 (1987)
18 Takao Asano: An Application of Duality to Edge-Deletion Problems. SIAM J. Comput. 16(2): 312-331 (1987)
1986
17 Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai: Visibility of Disjoint Polygons. Algorithmica 1(1): 49-63 (1986)
16EETakao Asano, Tetsuo Asano, Hiroshi Imai: Partitioning a polygonal region into trapezoids. J. ACM 33(2): 290-312 (1986)
15 Takao Asano, Tetsuo Asano, Ron Y. Pinter: Polygon Triangulation: Efficiency and Minimality. J. Algorithms 7(2): 221-231 (1986)
14 Hiroshi Imai, Takao Asano: Efficient Algorithms for Geometric Graph Search Problems. SIAM J. Comput. 15(2): 478-494 (1986)
1985
13 Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai: Visibility-Polygon Search and Euclidean Shortest Paths FOCS 1985: 155-164
12 Takao Asano: An Approach to the Subgraph Homeomorphism Problem. Theor. Comput. Sci. 38: 249-267 (1985)
1984
11 Hiroshi Imai, Takao Asano: Dynamic Segment Intersection Search with Applications FOCS 1984: 393-402
10EEMasato 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)
9EETakao Asano, Takao Nishizeki, Paul D. Seymour: A note on nongraphic matroids. J. Comb. Theory, Ser. B 37(3): 290-293 (1984)
1983
8 Tetsuo Asano, Takao Asano: Minimum Partition of Polygonal Regions into Trapezoids FOCS 1983: 233-241
7 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)
6EETakao Asano: Properties of matroids characterizable in terms of excluded matroids. J. Comb. Theory, Ser. B 34(2): 233-236 (1983)
5 Takao Asano, Tomio Hirata: Edge-Contraction Problems. J. Comput. Syst. Sci. 26(2): 197-208 (1983)
1982
4 Takao Asano, Tomio Hirata: Edge-Deletion and Edge-Contraction Problems STOC 1982: 245-254
3EETakao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary: The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discrete Mathematics 38(1): 1-6 (1982)
1980
2 Takao Asano, S. 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
1976
1 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

1Tetsuo Asano [8] [13] [15] [16] [17] [20]
2Masato Edahiro [10] [21] [23]
3Geoffrey Exoo [3]
4Leonidas J. Guibas [13] [17]
5Magnús M. Halldórsson [35]
6Frank Harary [3]
7John Hershberger [13] [17]
8Tomio Hirata [4] [5] [27] [28] [29] [32]
9Kuniaki Hori [32]
10Takashi Hoshino [21] [23]
11Hiroshi Imai [7] [11] [13] [14] [16] [17] [19] [20] [33]
12Keiko Imai [37]
13Kazuo Iwama [35]
14Ryo Kato [37]
15S. Kikuchi [2]
16I. Kokubo [10]
17D. T. Lee (Der-Tsai Lee) [33]
18Takeshi Matsuda [35]
19Shin-Ichi Nakano [33]
20Takao Nishizeki [9]
21Takao Ono [27] [28] [29] [32]
22Ron Y. Pinter [15]
23Nobuji Saito [2] [3]
24Paul D. Seymour [9]
25Michiro Shibui [1]
26Itsuo Takanami [1]
27Katsuhiko Tanaka [21] [23]
28Takeshi Tokuyama [33]
29David P. Williamson [34] [36]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)