The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Takao Asano: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tetsuo Asano, Takao Asano
    Minimum Partition of Polygonal Regions into Trapezoids [Citation Graph (3, 0)][DBLP]
    FOCS, 1983, pp:233-241 [Conf]
  2. Hiroshi Imai, Takao Asano
    Dynamic Orthogonal Segment Intersection Search. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:1, pp:1-18 [Journal]
  3. Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano
    A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:258-267 [Conf]
  4. Takao Asano
    An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:2-14 [Conf]
  5. Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai
    Visibility-Polygon Search and Euclidean Shortest Paths [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:155-164 [Conf]
  6. Hiroshi Imai, Takao Asano
    Dynamic Segment Intersection Search with Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:393-402 [Conf]
  7. Takao Asano, S. Kikuchi, Nobuji Saito
    An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:182-195 [Conf]
  8. Takao Asano
    Dynamic Programming on Intervals. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:199-207 [Conf]
  9. Takao Asano
    Graphical Degree Sequence Problems with Connectivity Requirements. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:38-47 [Conf]
  10. Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda
    Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:204-215 [Conf]
  11. Takao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata
    A Theoretical Framework of Hybrid Approaches to MAX SAT. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:153-162 [Conf]
  12. Ryo Kato, Keiko Imai, Takao Asano
    An Improved Algorithm for the Minimum Manhattan Network Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:344-356 [Conf]
  13. Takao Ono, Tomio Hirata, Takao Asano
    An Approximation Algorithm for MAX 3-SAT. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:163-170 [Conf]
  14. Takao Asano
    Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:24-37 [Conf]
  15. Takao Asano, David P. Williamson
    Improved approximation algorithms for MAX SAT. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:96-105 [Conf]
  16. Takao Asano, Tomio Hirata
    Edge-Deletion and Edge-Contraction Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:245-254 [Conf]
  17. Takao Asano, Takao Ono, Tomio Hirata
    Approximation Algorithms for the Maximum Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:100-111 [Conf]
  18. Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai
    Visibility of Disjoint Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1986, v:1, n:1, pp:49-63 [Journal]
  19. Masato Edahiro, Katsuhiko Tanaka, Takashi Hoshino, Takao Asano
    A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problem and Its Practical Efficiency. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:1, pp:61-76 [Journal]
  20. Takao Asano, Tetsuo Asano, Hiroshi Imai
    Shortest Path Between Two Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:285-288 [Journal]
  21. Takao Asano, Tetsuo Asano, Hiroshi Imai
    Partitioning a polygonal region into trapezoids. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1986, v:33, n:2, pp:290-312 [Journal]
  22. Takao Asano, Tetsuo Asano, Ron Y. Pinter
    Polygon Triangulation: Efficiency and Minimality. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:2, pp:221-231 [Journal]
  23. Takao Asano, David P. Williamson
    Improved Approximation Algorithms for MAX SAT. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:1, pp:173-202 [Journal]
  24. Hiroshi Imai, Takao Asano
    Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:4, pp:310-323 [Journal]
  25. Takao Asano
    An O(n log log n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:503-510 [Journal]
  26. Takao Asano, Tomio Hirata
    Edge-Contraction Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:26, n:2, pp:197-208 [Journal]
  27. Takao Asano
    Properties of matroids characterizable in terms of excluded matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:34, n:2, pp:233-236 [Journal]
  28. Takao Asano, Takao Nishizeki, Paul D. Seymour
    A note on nongraphic matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:290-293 [Journal]
  29. Takao Asano
    Constructing a bipartite graph of maximum connectivity with prescribed degrees. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:4, pp:245-263 [Journal]
  30. Takao Asano, Takao Ono, Tomio Hirata
    Approximation Algorithms for the Maximum Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:4, pp:388-404 [Journal]
  31. Takao Asano
    An Application of Duality to Edge-Deletion Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:2, pp:312-331 [Journal]
  32. Takao Asano, Michiro Shibui, Itsuo Takanami
    General Results on Tour Lengths in Machines and Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:4, pp:629-645 [Journal]
  33. Hiroshi Imai, Takao Asano
    Efficient Algorithms for Geometric Graph Search Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:478-494 [Journal]
  34. Takao Asano
    Generalized Manhattan path algorithm with applications. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1988, v:7, n:7, pp:797-804 [Journal]
  35. Takao Asano
    An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:354, n:3, pp:339-353 [Journal]
  36. Takao Asano
    An Approach to the Subgraph Homeomorphism Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:38, n:, pp:249-267 [Journal]
  37. Masato Edahiro, I. Kokubo, Takao Asano
    A New Point-Location Algorithm and Its Practical Efficiency: Comparison with Existing Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 1984, v:3, n:2, pp:86-109 [Journal]
  38. Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary
    The smallest 2-connected cubic bipartite planar nonhamiltonian graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:1, pp:1-6 [Journal]

Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002