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

Search the dblp DataBase

Title:
Author:
David S. Johnson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David S. Johnson, Anthony C. Klug
    Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies. [Citation Graph (19, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:1, pp:167-189 [Journal]
  2. David S. Johnson, Anthony C. Klug
    Optimizing Conjunctive Queries that Contain Untyped Variables. [Citation Graph (11, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:4, pp:616-640 [Journal]
  3. David S. Johnson, Anthony C. Klug
    Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies. [Citation Graph (9, 13)][DBLP]
    PODS, 1982, pp:164-169 [Conf]
  4. M. R. Garey, David S. Johnson, Larry J. Stockmeyer
    Some Simplified NP-Complete Graph Problems. [Citation Graph (8, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:1, n:3, pp:237-267 [Journal]
  5. David S. Johnson
    Approximation Algorithms for Combinatorial Problems. [Citation Graph (4, 0)][DBLP]
    J. Comput. Syst. Sci., 1974, v:9, n:3, pp:256-278 [Journal]
  6. David S. Johnson, Alan J. Demers, Jeffrey D. Ullman, M. R. Garey, Ronald L. Graham
    Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. [Citation Graph (4, 0)][DBLP]
    SIAM J. Comput., 1974, v:3, n:4, pp:299-325 [Journal]
  7. Edward G. Coffman Jr., M. R. Garey, David S. Johnson
    An Application of Bin-Packing to Multiprocessor Scheduling. [Citation Graph (3, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:1, pp:1-17 [Journal]
  8. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
    The Complexity of Multiway Cuts (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    STOC, 1992, pp:241-251 [Conf]
  9. M. R. Garey, David S. Johnson
    ``Strong'' NP-Completeness Results: Motivation, Examples, and Implications. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:499-508 [Journal]
  10. Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Robert Endre Tarjan
    Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:4, pp:808-826 [Journal]
  11. David S. Johnson, Anthony C. Klug
    Optimizing Conjunctive Queries When Attribute Domains Are not Disjoint (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1981, pp:203-211 [Conf]
  12. M. R. Garey, Ronald L. Graham, David S. Johnson
    Some NP-Complete Geometric Problems [Citation Graph (1, 0)][DBLP]
    STOC, 1976, pp:10-22 [Conf]
  13. M. R. Garey, David S. Johnson, Franco P. Preparata, Robert Endre Tarjan
    Triangulating a Simple Polygon. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:4, pp:175-179 [Journal]
  14. David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
    On Generating All Maximal Independent Sets. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:3, pp:119-123 [Journal]
  15. M. R. Garey, David S. Johnson
    The Rectilinear Steiner Tree Problem in NP Complete. [Citation Graph (1, 0)][DBLP]
    SIAM Journal of Applied Mathematics, 1977, v:32, n:, pp:826-834 [Journal]
  16. Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh
    Scheduling File Transfers. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:743-780 [Journal]
  17. M. R. Garey, David S. Johnson
    Complexity Results for Multiprocessor Scheduling under Resource Constraints. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1975, v:4, n:4, pp:397-411 [Journal]
  18. M. R. Garey, David S. Johnson, Robert Endre Tarjan
    The Planar Hamiltonian Circuit Problem is NP-Complete. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:4, pp:704-714 [Journal]
  19. David Applegate, Luciana S. Buriol, Bernard L. Dillard, David S. Johnson, Peter W. Shor
    The Cutting-Stock Approach to Bin Packing: Theory and Experiments. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:1-15 [Conf]
  20. Jill Cirasella, David S. Johnson, Lyle A. McGeoch, Weixiong Zhang
    The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:32-59 [Conf]
  21. János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
    A Self Organizing Bin Packing Heuristic. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:246-265 [Conf]
  22. Aviezri S. Fraenkel, M. R. Garey, David S. Johnson, T. Schaefer, Yaacov Yesha
    The Complexity of Checkers on an N * N Board - Preliminary Report [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:55-64 [Conf]
  23. M. R. Garey, David S. Johnson, H. C. So
    An Application of Graph Coloring to Printed Circuit Testing (Working Paper) [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:178-183 [Conf]
  24. David S. Johnson
    Fast Allocation Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:144-154 [Conf]
  25. David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
    How Easy Is Local Search? (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:39-42 [Conf]
  26. Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
    The Complexity of Searching a Graph (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:376-385 [Conf]
  27. David S. Johnson
    Local Optimization and the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:446-461 [Conf]
  28. David S. Johnson
    The Traveling Salesman Problem: A report on the State of the Art. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:221-222 [Conf]
  29. Alexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe
    The Maximum Traveling Salesman Problem Under Polyhedral Norms. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:195-201 [Conf]
  30. Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith
    Near-optimal Intraprocedural Branch Alignment. [Citation Graph (0, 0)][DBLP]
    PLDI, 1997, pp:183-193 [Conf]
  31. Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh
    Scheduling File Transfers in a Distributed Network. [Citation Graph (0, 0)][DBLP]
    PODC, 1983, pp:254-266 [Conf]
  32. János Csirik, David S. Johnson
    Bounded Space On-Line Bin Packing: Best is Better than First. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:309-319 [Conf]
  33. János Csirik, David S. Johnson, Claire Kenyon
    Better approximation algorithms for bin covering. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:557-566 [Conf]
  34. Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer
    Data Structures for Traveling Salesmen. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:145-154 [Conf]
  35. David S. Johnson, Andrea S. LaPaugh, Ron Y. Pinter
    Minimizing Channel Density by Lateral Shifting of Components. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:122-131 [Conf]
  36. David S. Johnson, Maria Minkoff, Steven Phillips
    The prize collecting Steiner tree problem: theory and practice. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:760-769 [Conf]
  37. David S. Johnson, Lyle A. McGeoch, Edward E. Rothberg
    Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:341-350 [Conf]
  38. David S. Johnson, Mario Szegedy
    What are the Least Tractable Instances of max Tndependent Set? [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:927-928 [Conf]
  39. Jon Louis Bentley, David S. Johnson, Frank Thomson Leighton, Catherine C. McGeoch, Lyle A. McGeoch
    Some Unexpected Expected Behavior Results for Bin Packing [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:279-288 [Conf]
  40. Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
    Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:230-240 [Conf]
  41. Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber
    Markov chains, computer proofs, and average-case analysis of best fit bin packing. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:412-421 [Conf]
  42. János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
    On the sum-of-squares algorithm for bin packing. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:208-217 [Conf]
  43. M. R. Garey, David S. Johnson, Larry J. Stockmeyer
    Some Simplified NP-Complete Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:47-63 [Conf]
  44. David S. Johnson
    Approximation Algorithms for Combinatorial Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:38-49 [Conf]
  45. David S. Johnson
    Data Structures for Traveling Salesmen (Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:287- [Conf]
  46. David S. Johnson, Shankar Krishnan, Jatin Chhugani, Subodh Kumar, Suresh Venkatasubramanian
    Compressing Large Boolean Matrices using Reordering Techniques. [Citation Graph (0, 0)][DBLP]
    VLDB, 2004, pp:13-23 [Conf]
  47. János Csirik, David S. Johnson
    Bounded Space On-Line Bin Packing: Best Is Better than First. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:2, pp:115-138 [Journal]
  48. Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
    The Geometric Maximum Traveling Salesman Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  49. János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
    On the Sum-of-Squares Algorithm for Bin Packing [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  50. Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
    The geometric maximum traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:5, pp:641-664 [Journal]
  51. János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
    On the Sum-of-Squares algorithm for bin packing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:1, pp:1-65 [Journal]
  52. M. R. Garey, David S. Johnson
    The Complexity of Near-Optimal Graph Coloring. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:43-49 [Journal]
  53. M. R. Garey, David S. Johnson
    Scheduling Tasks with Nonuniform Deadlines on Two Processors. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:3, pp:461-467 [Journal]
  54. Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
    The complexity of searching a graph. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:1, pp:18-44 [Journal]
  55. S. F. Assmann, David S. Johnson, Daniel J. Kleitman, Joseph Y.-T. Leung
    On a Dual Version of the One-Dimensional Bin Packing Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:4, pp:502-525 [Journal]
  56. Francine Berman, David S. Johnson, Frank Thomson Leighton, Peter W. Shor, Larry Snyder
    Generalized Planar Matching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:2, pp:153-184 [Journal]
  57. Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer
    Data Structures for Traveling Salesmen. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:3, pp:432-479 [Journal]
  58. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:4, pp:393-405 [Journal]
  59. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:2, pp:182-195 [Journal]
  60. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:3, pp:288-300 [Journal]
  61. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:4, pp:381-395 [Journal]
  62. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:1, pp:89-99 [Journal]
  63. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:1, pp:87-100 [Journal]
  64. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:2, pp:189-203 [Journal]
  65. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:3, pp:286-300 [Journal]
  66. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:4, pp:397-411 [Journal]
  67. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:1, pp:147-160 [Journal]
  68. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:2, pp:284-299 [Journal]
  69. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:3, pp:433-447 [Journal]
  70. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:4, pp:595-609 [Journal]
  71. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:1, pp:145-159 [Journal]
  72. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:2, pp:291-305 [Journal]
  73. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:3, pp:434-451 [Journal]
  74. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:2, pp:289-305 [Journal]
  75. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:4, pp:584-601 [Journal]
  76. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:2, pp:285-303 [Journal]
  77. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:3, pp:438-448 [Journal]
  78. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:3, pp:426-444 [Journal]
  79. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:1, pp:144-151 [Journal]
  80. David S. Johnson
    The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:3, pp:502-524 [Journal]
  81. Edward G. Coffman Jr., M. R. Garey, David S. Johnson
    Bin packing with divisible item sizes. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1987, v:3, n:4, pp:406-428 [Journal]
  82. David S. Johnson, M. R. Garey
    A 71/60 theorem for bin packing. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1985, v:1, n:1, pp:65-106 [Journal]
  83. David S. Johnson
    Fast Algorithms for Bin Packing. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1974, v:8, n:3, pp:272-314 [Journal]
  84. David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
    How Easy is Local Search? [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:37, n:1, pp:79-100 [Journal]
  85. M. R. Garey, Ronald L. Graham, David S. Johnson
    Resource Constrained Scheduling as Generalized Bin Packing. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:21, n:3, pp:257-298 [Journal]
  86. David S. Johnson, Francine Berman
    Performance of the Efficient Data-Driven Evaluation Scheme. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1993, v:18, n:3, pp:340-346 [Journal]
  87. Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber
    Bin packing with discrete item sizes, part II: Tight bounds on First Fit. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:1-2, pp:69-101 [Journal]
  88. Edward G. Coffman Jr., M. R. Garey, David S. Johnson
    Dynamic Bin Packing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:227-258 [Journal]
  89. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
    The Complexity of Multiterminal Cuts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:864-894 [Journal]
  90. M. R. Garey, David S. Johnson
    Two-Processor Scheduling with Start-Times and Deadlines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:3, pp:416-426 [Journal]
  91. M. R. Garey, David S. Johnson
    Composing Functions to Minimize Image Size. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:2, pp:500-503 [Journal]
  92. M. R. Garey, David S. Johnson, Barbara B. Simons, Robert Endre Tarjan
    Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:256-269 [Journal]
  93. Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
    Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:384-402 [Journal]
  94. David S. Johnson
    The NP-completeness column. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:160-176 [Journal]
  95. David S. Johnson
    The NP-completeness column: The many limits on approximation. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:3, pp:473-489 [Journal]
  96. M. R. Garey, Frank K. Hwang, David S. Johnson
    Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1977, v:26, n:4, pp:321-328 [Journal]
  97. David S. Johnson, Franco P. Preparata
    The Densest Hemisphere Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1978, v:6, n:, pp:93-107 [Journal]
  98. M. R. Garey, David S. Johnson, Hans S. Witsenhausen
    The complexity of the generalized Lloyd - Max problem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1982, v:28, n:2, pp:255-0 [Journal]
  99. Jatin Chhugani, Budirijanto Purnomo, Shankar Krishnan, Jonathan D. Cohen, Suresh Venkatasubramanian, David S. Johnson, Subodh Kumar
    vLOD: High-Fidelity Walkthrough of Large Virtual Environments. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 2005, v:11, n:1, pp:35-47 [Journal]
  100. David Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang
    Compressing rectilinear pictures and minimizing access control lists. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1066-1075 [Conf]
  101. Brent N. Clark, Charles J. Colbourn, David S. Johnson
    Unit disk graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:86, n:1-3, pp:165-177 [Journal]
  102. David S. Johnson
    The NP-completeness column: Finding needles in haystacks. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

  103. What is the science in experimental computer science? [Citation Graph (, )][DBLP]


  104. On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing [Citation Graph (, )][DBLP]


  105. Special issue on computational methods for graph coloring and its generalizations. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.759secs
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