The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Naoki Katoh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Toshihide Ibaraki, Naoki Katoh
    On-Line Computation of Transitive Closures of Graphs. [Citation Graph (5, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:95-97 [Journal]
  2. Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama
    Polynomial-Time Solutions to Image Segmentation. [Citation Graph (3, 0)][DBLP]
    SODA, 1996, pp:104-113 [Conf]
  3. Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
    Cautious Transaction Schedulers with Admission Control. [Citation Graph (3, 12)][DBLP]
    ACM Trans. Database Syst., 1985, v:10, n:2, pp:205-229 [Journal]
  4. Naoki Katoh, Tiko Kameda, Toshihide Ibaraki
    A Cautious Scheduler for Multistep Transactions. [Citation Graph (2, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:1-26 [Journal]
  5. Toshihide Ibaraki, Tiko Kameda, Naoki Katoh
    Cautious Transaction Schedulers for Database Concurrency Control. [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Software Eng., 1988, v:14, n:7, pp:997-1009 [Journal]
  6. Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
    An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:231-242 [Conf]
  7. Shin-ichi Tanigawa, Naoki Katoh
    Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:161-172 [Conf]
  8. Katsutoshi Yada, Yukinobu Hamuro, Naoki Katoh, Takashi Washio, Issey Fusamoto, Daisuke Fujishima, Takaya Ikeda
    Data Mining Oriented CRM Systems Based on MUSASHI: C-MUSASHI. [Citation Graph (0, 0)][DBLP]
    Active Mining, 2003, pp:152-173 [Conf]
  9. Shin-ichi Tanigawa, Naoki Katoh
    Finding a triangular mesh with a constant number of different edge lengths. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:274-277 [Conf]
  10. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    The Structure and Number of Global Roundings of a Graph. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:130-138 [Conf]
  11. Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu
    Approximating Uniform Triangular Meshes in Polygons. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:23-33 [Conf]
  12. David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
    Enumerating Non-crossing Minimally Rigid Frameworks. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:205-215 [Conf]
  13. Danny Z. Chen, Jinhee Chun, Naoki Katoh, Takeshi Tokuyama
    Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:238-248 [Conf]
  14. Yang Dai, Naoki Katoh
    On Computing New Classes of Optimal Trangulations with Angular Constraints. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:15-24 [Conf]
  15. Yin-Feng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki
    Triangulating a Convex Polygon with Small Number of Non-standard Bars. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:481-489 [Conf]
  16. Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
    Fining k Points with Minimum Spanning Trees and Related Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:283-291 [Conf]
  17. Mary Inaba, Hiroshi Imai, Naoki Katoh
    Experimental Results of Randomized Clustering Algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-1 [Conf]
  18. Mary Inaba, Naoki Katoh, Hiroshi Imai
    Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:332-339 [Conf]
  19. Naoki Katoh, Kazuo Iwano
    Finding k Farthest Pairs and k Closest/Farthest Bichromatic Pairs for Points in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:320-329 [Conf]
  20. Naoki Katoh, Takeshi Tokuyama
    Notes on computing peaks in k-levels and parametric spanning trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:241-248 [Conf]
  21. Katsuki Fujisawa, Yukinobu Hamuro, Naoki Katoh, Takeshi Tokuyama, Katsutoshi Yada
    Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1999, pp:148-159 [Conf]
  22. Yukinobu Hamuro, Naoki Katoh, Katsutoshi Yada
    Discovering Interpretable Rules that Explain Customers' Brand Choice Behavior. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2000, pp:263-267 [Conf]
  23. Yukinobu Hamuro, Naoki Katoh, Katsutoshi Yada
    Data Mining Oriented System for Business Applications. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1998, pp:441-442 [Conf]
  24. Naoki Katoh, Katsutoshi Yada, Yukinobu Hamuro
    Business Application for Sales Transaction Data by Using Genome Analysis Technology. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2003, pp:208-219 [Conf]
  25. Yukinobu Hamuro, Hideki Kawata, Naoki Katoh, Katsutoshi Yada
    A Machine Learning Algorithm for Analyzing String Patterns Helps to Discover Simple and Interpretable Business Rules from Purchase History. [Citation Graph (0, 0)][DBLP]
    Progress in Discovery Science, 2002, pp:565-575 [Conf]
  26. Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh
    The Supported Solutions Used as a Genetic Information in a Population Heuristics. [Citation Graph (0, 0)][DBLP]
    EMO, 2001, pp:429-442 [Conf]
  27. Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh
    Use of a Genetic Heritage for Solving the Assignment Problem with Two Objectives. [Citation Graph (0, 0)][DBLP]
    EMO, 2003, pp:43-57 [Conf]
  28. Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama
    A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:215-226 [Conf]
  29. Naoki Katoh, Takeshi Tokuyama
    Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:389-398 [Conf]
  30. Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano
    On Minimum and Maximum Spanning Trees of Linearly Moving Points [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:396-405 [Conf]
  31. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
    Polyline Fitting of Planar Points Under Min-sum Criteria. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:77-88 [Conf]
  32. Tetsuo Asano, Naoki Katoh
    Number Theory Helps Line Detection in Digital Images. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:313-322 [Conf]
  33. Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima
    A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:317-326 [Conf]
  34. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    Convertibility among Grid Filling Curves. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:307-316 [Conf]
  35. Siu-Wing Cheng, Naoki Katoh, Manabu Sugai
    A Study of the LMT-Skeleton. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:256-265 [Conf]
  36. Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh
    How to Treat Delete Requests in Semi-Online Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:48-57 [Conf]
  37. Shin-ya Hamaguchi, Naoki Katoh
    A Capacitated Vehicle Routing Problem on a Tree. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:397-406 [Conf]
  38. Naoki Katoh, Hiromichi Kojima, Ryo Taniguchi
    Approximating Uniform Triangular Meshes for Spheres. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:192-204 [Conf]
  39. Katsutoshi Yada, Yukinobu Hamuro, Naoki Katoh, Kazuhiro Kishiya
    The Future Direction of New Computing Environment for Exabyte Data in the Business World. [Citation Graph (0, 0)][DBLP]
    SAINT Workshops, 2005, pp:316-319 [Conf]
  40. Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
    Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:896-904 [Conf]
  41. Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu
    Optimizing the sum of linear fractional functions and applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:707-716 [Conf]
  42. Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
    Finding Subsets Maximizing Minimum Structures. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:150-159 [Conf]
  43. Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    Parametric Polymatroid Optimization and Its Geometric Applications. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:517-526 [Conf]
  44. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:275-283 [Conf]
  45. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    On Geometric Structure of Global Roundings for Graphs and Range Spaces. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:455-467 [Conf]
  46. Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
    Combinatorial and Geometric Problems Related to Digital Halftoning. [Citation Graph (0, 0)][DBLP]
    Theoretical Foundations of Computer Vision, 2002, pp:58-71 [Conf]
  47. Naoki Katoh, Kazuo Iwano
    Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:80-91 [Conf]
  48. Naoki Katoh
    Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:2, pp:101-101 [Journal]
  49. Toshihide Ibaraki, Naoki Katoh
    Searching Minimax Game Trees under Memory Space Constraint. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:- [Journal]
  50. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff
    Optimal spanners for axis-aligned rectangles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:1, pp:59-77 [Journal]
  51. Tetsuo Asano, Naoki Katoh
    Variants for the Hough Transform for Line Detection. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:231-252 [Journal]
  52. Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama
    A unified scheme for detecting fundamental curves in binary edge images. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:18, n:2, pp:73-93 [Journal]
  53. Yang Dai, Naoki Katoh, Siu-Wing Cheng
    LMT-skeleton heuristics for several new classes of optimal triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:17, n:1-2, pp:51-68 [Journal]
  54. Naoki Katoh, Takeshi Tokuyama
    Notes on computing peaks in k-levels and parametric spanning trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  55. Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh, Keiji Ohtsuka, Nobuhiko Yoshimura
    A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:167-190 [Journal]
  56. Naoki Katoh, Toshihide Ibaraki, Tiko Kameda
    A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:4, pp:379-395 [Journal]
  57. Naoki Katoh, Taihei Yano
    An approximation algorithm for the pickup and delivery vehicle routing problem on trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2335-2349 [Journal]
  58. Naoki Katoh, Hiro Ito
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:16, pp:2239-2240 [Journal]
  59. Yukinobu Hamuro, Naoki Katoh, Yasuyuki Matsuda, Katsutoshi Yada
    Mining Pharmacy Data Helps to Make Profits. [Citation Graph (0, 0)][DBLP]
    Data Min. Knowl. Discov., 1998, v:2, n:4, pp:391-398 [Journal]
  60. Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu
    Triangulations Intersect Nicely. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:16, n:4, pp:339-359 [Journal]
  61. Naoki Katoh, Takeshi Tokuyama
    K-Levels of Concave Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:27, n:4, pp:567-584 [Journal]
  62. Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano
    On Minimum and Maximum Spanning Trees of Linearly Moving Points. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:161-176 [Journal]
  63. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
    Polyline Fitting of Planar Points under Min-sum Criteria. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:2-3, pp:97-116 [Journal]
  64. Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama
    Efficient Algorithms for Optimization-Based Image Segmentation. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:2, pp:145-166 [Journal]
  65. Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    Parametric Polymatroid Optimization and Its Geometric Applications. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:5, pp:429-0 [Journal]
  66. Naoki Katoh, Kazuo Iwano
    Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:37-51 [Journal]
  67. Yang Dai, Kazuo Iwano, Naoki Katoh
    A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:5, pp:255-261 [Journal]
  68. Kazuo Iwano, Naoki Katoh
    Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:5, pp:211-213 [Journal]
  69. Naoki Katoh, Toshihide Ibaraki, H. Mine
    An Algorithm for the K Best Solutions of the Resource Allocation Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:752-764 [Journal]
  70. Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
    Finding k Points with Minimum Diameter and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:1, pp:38-56 [Journal]
  71. Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima
    A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:2, pp:213-231 [Journal]
  72. Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu
    Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:1, pp:69-90 [Journal]
  73. Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama
    Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1423-1435 [Journal]
  74. Naoki Katoh, Toshihide Ibaraki, H. Mine
    An Algorithm for Finding K Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:247-255 [Journal]
  75. Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
    Finding Subsets Maximizing Minimum Structures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:342-359 [Journal]
  76. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    The structure and number of global roundings of a graph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:325, n:3, pp:425-437 [Journal]
  77. Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yin-Feng Xu
    Approximating uniform triangular meshes in polygons. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:879-895 [Journal]
  78. Toshihide Ibaraki, Tiko Kameda, Naoki Katoh
    Multiversion Cautious Schedulers for Database Concurrency Control. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1990, v:16, n:3, pp:302-315 [Journal]
  79. Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa
    An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:178-190 [Conf]
  80. Naoki Katoh, Shin-ichi Tanigawa
    Enumerating Constrained Non-crossing Geometric Spanning Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:243-253 [Conf]
  81. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
    Voronoi Diagram with Respect to Criteria on Vision Information. [Citation Graph (0, 0)][DBLP]
    ISVD, 2007, pp:25-32 [Conf]
  82. Katsutoshi Yada, Edward Ip, Naoki Katoh
    Is this brand ephemeral? A multivariate tree-based decision analysis of new product sustainability. [Citation Graph (0, 0)][DBLP]
    Decision Support Systems, 2007, v:44, n:1, pp:223-234 [Journal]

  83. Geometric Spanner of Objects under L1 Distance. [Citation Graph (, )][DBLP]


  84. Covering Directed Graphs by In-Trees. [Citation Graph (, )][DBLP]


  85. Fast enumeration algorithms for non-crossing geometric graphs. [Citation Graph (, )][DBLP]


  86. A proof of the molecular conjecture. [Citation Graph (, )][DBLP]


  87. Geometric Spanner of Segments. [Citation Graph (, )][DBLP]


  88. A Proof of the Molecular Conjecture. [Citation Graph (, )][DBLP]


  89. A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths. [Citation Graph (, )][DBLP]


  90. On the Infinitesimal Rigidity of Bar-and-Slider Frameworks. [Citation Graph (, )][DBLP]


  91. Applying graph mining to discover substructures of room layouts which affect the rent of apartments. [Citation Graph (, )][DBLP]


  92. Arc-disjoint in-trees in directed graphs. [Citation Graph (, )][DBLP]


  93. A Rooted-Forest Partition with Uniform Vertex Demand. [Citation Graph (, )][DBLP]


  94. Angular Voronoi Diagram with Applications. [Citation Graph (, )][DBLP]


  95. The Minimum Weight In-Tree Cover Problem. [Citation Graph (, )][DBLP]


  96. Arc-disjoint in-trees in directed graphs. [Citation Graph (, )][DBLP]


  97. Covering Directed Graphs by In-trees [Citation Graph (, )][DBLP]


  98. Optimal strategies for some team games. [Citation Graph (, )][DBLP]


  99. A fully polynomial time approximation scheme for minimum cost-reliability ratio problems. [Citation Graph (, )][DBLP]


  100. An e-approximation scheme for combinatorial optimization problems with minimum variance criterion. [Citation Graph (, )][DBLP]


  101. An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. [Citation Graph (, )][DBLP]


  102. Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees. [Citation Graph (, )][DBLP]


  103. Enumerating Constrained Non-crossing Minimally Rigid Frameworks. [Citation Graph (, )][DBLP]


  104. Fast Enumeration Algorithms for Non-crossing Geometric Graphs. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.014secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002