The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joseph Naor: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yossi Azar, Joseph Naor, Raphael Rom
    The Competitiveness of On-Line Assignments. [Citation Graph (2, 0)][DBLP]
    SODA, 1992, pp:203-210 [Conf]
  2. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Fast Approximate Graph Partitioning Algorithms. [Citation Graph (1, 0)][DBLP]
    SODA, 1997, pp:639-648 [Conf]
  3. Liane Lewin-Eytan, Joseph Naor, Ariel Orda
    Routing and Admission Control in Networks with Advance Reservations. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:215-228 [Conf]
  4. Joseph Naor
    Computing a Perfect Matching in a Line Graph. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:139-148 [Conf]
  5. Yigal Bejerano, Israel Cidon, Joseph Naor
    Dynamic session management for static and mobile users: a competitive on-line algorithmic approach. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2000, pp:65-74 [Conf]
  6. Amotz Bar-Noy, Ari Freund, Joseph Naor
    On-Line Load Banancing in a Hierarchical Server Topology. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:77-88 [Conf]
  7. Yigal Bejerano, Joseph Naor, Alexander Sprintson
    Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:702-713 [Conf]
  8. Niv Buchbinder, Joseph Naor
    Online Primal-Dual Algorithms for Covering and Packing Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:689-701 [Conf]
  9. Joseph Naor
    From Balanced Graph Partitioning to Balanced Metric Labeling. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:9- [Conf]
  10. Joseph Naor, Ariel Orda, Yael Petruschka
    Dynamic Storage Allocation with Known Durations. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:378-387 [Conf]
  11. Randeep Bhatia, Samir Khuller, Joseph Naor
    The Loading Time Scheduling Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:72-81 [Conf]
  12. Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor
    Machine Minimization for Scheduling Jobs with Interval Constraints. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:81-90 [Conf]
  13. Julia Chuzhoy, Joseph Naor
    Covering Problems with Hard Capacities. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:481-489 [Conf]
  14. Julia Chuzhoy, Joseph Naor
    The Hardness of Metric Labeling. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:108-114 [Conf]
  15. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:62-71 [Conf]
  16. Guy Even, Joseph Naor, Leonid Zosin
    An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:310-319 [Conf]
  17. Gary L. Miller, Joseph Naor
    Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:112-117 [Conf]
  18. Rajeev Motwani, Joseph Naor, Moni Naor
    The Probabilistic Method Yields Deterministic Parallel Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:8-13 [Conf]
  19. Joseph Naor, Baruch Schieber
    Improved Approximations for Shallow-Light Spanning Trees. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:536-541 [Conf]
  20. Joseph Naor, Leonid Zosin
    A 2-Approximation Algorithm for the Directed Multiway Cut Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:548-553 [Conf]
  21. Niv Buchbinder, Joseph Naor
    Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:293-304 [Conf]
  22. Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor
    Algorithmic Aspects of Bandwidth Trading. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:751-766 [Conf]
  23. Chandra Chekuri, Sudipto Guha, Joseph Naor
    Approximating Steiner k-Cuts. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:189-199 [Conf]
  24. Sanjeev Khanna, Joseph Naor, Danny Raz
    Control Message Aggregation in Group Communication Protocols. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:135-146 [Conf]
  25. Joseph Naor, Hadas Shachnai, Tami Tamir
    Real-Time Scheduling with a Budget. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:1123-1137 [Conf]
  26. Joseph Naor, Shmuel Peleg
    Image Compression and Filtering Using Pyramid Data Structures. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1983, pp:1086-1088 [Conf]
  27. Yossi Azar, Joseph Naor, Raphael Rom
    Routing Strategies for Fast Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1992, pp:170-179 [Conf]
  28. Yigal Bejerano, Israel Cidon, Joseph Naor
    Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:198-207 [Conf]
  29. Moses Charikar, Joseph Naor, Baruch Schieber
    Resource Optimization in QoS Multicast Routing of Real-Time Multimedia. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:1518-1527 [Conf]
  30. Juan A. Garay, Joseph Naor, Bülent Yener, Peng Zhao
    On-line Admission Control and Packet Scheduling with Interleaving. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  31. Joseph Naor, Ariel Orda, Raphael Rom
    Scheduled Hot-Potato Routing. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1995, pp:579-586 [Conf]
  32. Joseph Naor, Adi Rosén, Gabriel Scalosub
    Online time-constrained scheduling in linear networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:855-865 [Conf]
  33. Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan
    Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:14-28 [Conf]
  34. Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz
    Building Edge-Failure Resilient Networks. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:439-456 [Conf]
  35. Ari Freund, Joseph Naor
    Approximating the Advertisement Placement Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:415-424 [Conf]
  36. Dorit S. Hochbaum, Joseph Naor
    Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:44-59 [Conf]
  37. Samir Khuller, Joseph Naor
    Flow in Planar Graphs with Vertex Capacities. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:367-384 [Conf]
  38. Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin
    Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:78-88 [Conf]
  39. Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor
    Cut Problems in Graphs with a Budget Constraint. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:435-446 [Conf]
  40. Amotz Bar-Noy, Joseph Naor, Baruch Schieber
    Pushing dependent data in clients-providers-servers systems. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2000, pp:222-230 [Conf]
  41. Yigal Bejerano, Nicole Immorlica, Joseph Naor, Mark Smith
    Efficient location area planning for personal communication systems. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2003, pp:109-121 [Conf]
  42. Amotz Bar-Noy, Joseph Naor, Moni Naor
    One Bit Algorithms. [Citation Graph (0, 0)][DBLP]
    PODC, 1988, pp:66-76 [Conf]
  43. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Spreading Metric Based Graph Partitioning Algorithms. [Citation Graph (0, 0)][DBLP]
    PPSC, 1997, pp:- [Conf]
  44. Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
    Non-cooperative multicast and facility location games. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2006, pp:72-81 [Conf]
  45. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
    A general approach to online network optimization problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:577-586 [Conf]
  46. Nikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor
    Approximating the average response time in broadcast scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:215-221 [Conf]
  47. Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber
    Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:11-20 [Conf]
  48. Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor
    Competitive on-line switching policies. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:525-534 [Conf]
  49. Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai
    Throughput maximization of real-time scheduling with batching. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:742-751 [Conf]
  50. Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth
    Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:344-354 [Conf]
  51. Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
    Scheduling split intervals. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:732-741 [Conf]
  52. Chandra Chekuri, Sanjeev Khanna, Joseph Naor
    A deterministic algorithm for the cost-distance problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:232-233 [Conf]
  53. Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin
    Approximation algorithms for the metric labeling problem via a new linear programming formulation. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:109-118 [Conf]
  54. Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha
    On the approximability of some network design problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:943-951 [Conf]
  55. Sanjeev Khanna, Joseph Naor, F. Bruce Shepherd
    Directed network design with orientation constraints. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:663-671 [Conf]
  56. Michael Luby, Joseph Naor, Ariel Orda
    Tight Bounds for Dynamic Storage Allocation. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:724-732 [Conf]
  57. Joseph Naor, Yuval Rabani
    Tree packing and approximating k-cuts. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:26-27 [Conf]
  58. Joseph Naor, Roy Schwartz
    The directed circular arrangement problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:86-95 [Conf]
  59. Niv Buchbinder, Joseph Naor
    Fair online load balancing. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:291-298 [Conf]
  60. Marek Chrobak, Joseph Naor
    An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:379-387 [Conf]
  61. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
    The online set cover problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:100-105 [Conf]
  62. Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
    A unified approach to approximating resource allocation and scheduling. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:735-744 [Conf]
  63. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
    Multicasting in Heterogeneous Networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:448-453 [Conf]
  64. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
    Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:622-631 [Conf]
  65. Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor
    Asymmetric k-center is log* n-hard to approximate. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:21-27 [Conf]
  66. Julia Chuzhoy, Joseph Naor
    New hardness results for congestion minimization and machine scheduling. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:28-34 [Conf]
  67. Sudipto Guha, Anna Moss, Joseph Naor, Baruch Schieber
    Efficient Recovery from Power Outage (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:574-582 [Conf]
  68. Joseph Naor, Moni Naor
    Small-bias Probability Spaces: Efficient Constructions and Applications [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:213-223 [Conf]
  69. Joseph Naor, Moni Naor, Alejandro A. Schäffer
    Fast Parallel Algorithms for Chordal Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:355-364 [Conf]
  70. Joseph Naor, Roy Schwartz
    Balanced metric labeling. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:582-591 [Conf]
  71. Marek Chrobak, Joseph Naor, Mark B. Novick
    Using Bounded Degree Spanning Trees in the Design of Efficient Algorihtms on Claw-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:147-162 [Conf]
  72. David Amzallag, Joseph Naor, Danny Raz
    Coping with Interference: From Maximum Coverage to Planning Cellular Networks. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:29-42 [Conf]
  73. Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor
    Competitive On-Line Switching Policies. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:3, pp:225-247 [Journal]
  74. Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz
    Building Edge-Failure Resilient Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:1-2, pp:17-41 [Journal]
  75. Marek Chrobak, Joseph Naor
    An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:6, pp:801-815 [Journal]
  76. Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan
    Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:2, pp:151-174 [Journal]
  77. Samir Khuller, Joseph Naor
    Flow in Planar Graphs with Vertex Capacities. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:3, pp:200-225 [Journal]
  78. Liane Lewin-Eytan, Joseph Naor, Ariel Orda
    Admission Control in Networks with Advance Reservations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:4, pp:293-304 [Journal]
  79. Yossi Azar, Rajeev Motwani, Joseph Naor
    Approximating Probability Distributions Using Small Sample Spaces. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:2, pp:151-171 [Journal]
  80. Joseph Naor, Ariel Orda, Yael Petruschka
    Dynamic storage allocation with known durations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:3, pp:203-213 [Journal]
  81. Amotz Bar-Noy, Joseph Naor, Moni Naor
    One-Bit Algorithms. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1990, v:4, n:, pp:3-8 [Journal]
  82. Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor
    Asymmetric k-center is log*n-hard to Approximate [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:038, pp:- [Journal]
  83. Amotz Bar-Noy, Rajeev Motwani, Joseph Naor
    The Greedy Algorithm is Optimal for On-Line Edge Coloring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:5, pp:251-253 [Journal]
  84. Samir Khuller, Anna Moss, Joseph Naor
    The Budgeted Maximum Coverage Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:1, pp:39-45 [Journal]
  85. Joseph Naor
    A Fast Parallel Coloring of Planar Graphs with Five Colors. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:1, pp:51-53 [Journal]
  86. Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
    A unified approach to approximating resource allocation and scheduling. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:5, pp:1069-1090 [Journal]
  87. Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor
    Asymmetric k-center is log* n-hard to approximate. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:4, pp:538-551 [Journal]
  88. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Divide-and-conquer approximation algorithms via spreading metrics. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:4, pp:585-616 [Journal]
  89. Julia Chuzhoy, Joseph Naor
    New hardness results for congestion minimization and machine scheduling. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:5, pp:707-721 [Journal]
  90. Yossi Azar, Joseph Naor, Raphael Rom
    The Competitiveness of On-Line Assignments. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:2, pp:221-237 [Journal]
  91. Randeep Bhatia, Samir Khuller, Joseph Naor
    The Loading Time Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:36, n:1, pp:1-33 [Journal]
  92. Dorit S. Hochbaum, Joseph Naor
    Approximation Algorithms for Network Design Problems on Bounded Subsets. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:2, pp:403-414 [Journal]
  93. Mauricio Karchmer, Joseph Naor
    A Fast Parallel Algorithm to Color a Graph with Delta Colors. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:1, pp:83-91 [Journal]
  94. Joseph Naor, Mark B. Novick
    An Efficient Reconstruction of a Graph from its Line Graph in Parallel. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:1, pp:132-143 [Journal]
  95. Yigal Bejerano, Joseph Naor, Alexander Sprintson
    Efficient algorithms for shared backup allocation in networks with partial information. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:12, n:1-2, pp:17-34 [Journal]
  96. Rajeev Motwani, Joseph Naor, Moni Naor
    The Probabilistic Method Yields Deterministic Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:3, pp:478-516 [Journal]
  97. Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor
    Cut problems in graphs with a budget constraint. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:262-279 [Journal]
  98. Reuven Bar-Yehuda, Guy Even, Jon Feldman, Joseph Naor
    Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2001, v:5, n:4, pp:- [Journal]
  99. Joseph Naor, Ariel Orda, Raphael Rom
    Scheduled Hot-Potato Routing. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal]
  100. Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber
    Minimizing Service and Operation Costs of Periodic Scheduling. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2002, v:27, n:3, pp:518-544 [Journal]
  101. Dorit S. Hochbaum, Nimrod Megiddo, Joseph Naor, Arie Tamir
    Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:69-83 [Journal]
  102. Joseph Naor, Ron M. Roth
    Constructions of Permutation Arrays for Certain Scheduling Cost Measures. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:1, pp:39-50 [Journal]
  103. Ari Freund, Joseph Naor
    Approximating the Advertisement Placement Problem. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:5, pp:365-374 [Journal]
  104. Amotz Bar-Noy, Ari Freund, Joseph Naor
    On-Line Load Balancing in a Hierarchical Server Topology. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:527-549 [Journal]
  105. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
    Message Multicasting in Heterogeneous Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:2, pp:347-358 [Journal]
  106. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
    Approximating the Throughput of Multiple Machines in Real-Time Scheduling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:331-352 [Journal]
  107. Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth
    Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:942-959 [Journal]
  108. Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
    Scheduling Split Intervals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:1-15 [Journal]
  109. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Fast Approximate Graph Partitioning Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2187-2214 [Journal]
  110. Guy Even, Joseph Naor, Leonid Zosin
    An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1231-1252 [Journal]
  111. Dorit S. Hochbaum, Joseph Naor
    Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:6, pp:1179-1192 [Journal]
  112. Gary L. Miller, Joseph Naor
    Flow in Planar Graphs with Multiple Sources and Sinks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:5, pp:1002-1017 [Journal]
  113. Joseph Naor, Moni Naor
    Small-Bias Probability Spaces: Efficient Constructions and Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:4, pp:838-856 [Journal]
  114. Joseph Naor, Moni Naor, Alejandro A. Schäffer
    Fast Parallel Algorithms for Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:327-349 [Journal]
  115. Joseph Naor, Leonid Zosin
    A 2-Approximation Algorithm for the Directed Multiway Cut Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:477-482 [Journal]
  116. Julia Chuzhoy, Joseph Naor
    Covering Problems with Hard Capacities. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:498-515 [Journal]
  117. Julia Chuzhoy, Joseph Naor
    The Hardness of Metric Labeling. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1376-1386 [Journal]
  118. Amotz Bar-Noy, Joseph Naor
    Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:1, pp:7-20 [Journal]
  119. Amotz Bar-Noy, Rajeev Motwani, Joseph Naor
    A Linear Time Approach to the Set Maxima Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:1, pp:1-9 [Journal]
  120. Chandra Chekuri, Sudipto Guha, Joseph Naor
    The Steiner k-Cut Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2006, v:20, n:1, pp:261-271 [Journal]
  121. Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin
    A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:3, pp:608-625 [Journal]
  122. Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin
    Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:2, pp:255-267 [Journal]
  123. Samir Khuller, Joseph Naor, Philip N. Klein
    The Lattice Structure of Flow in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:3, pp:477-490 [Journal]
  124. Michael Luby, Joseph Naor, Ariel Orda
    Tight Bounds for Dynamic Storage Allocation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:1, pp:155-166 [Journal]
  125. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
    A general approach to online network optimization problems. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:640-660 [Journal]
  126. Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor
    Algorithmic aspects of bandwidth trading. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  127. Yossi Azar, Joseph Naor, Raphael Rom
    Routing Strategies for Fast Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:2, pp:165-173 [Journal]
  128. Eli Gafni, Joseph Naor, Prabhakar Ragde
    On Separating the Erew and Crew Pram Models. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:68, n:3, pp:343-346 [Journal]
  129. Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth
    Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:2, pp:509-0 [Journal]
  130. Yigal Bejerano, Israel Cidon, Joseph Naor
    Efficient handoff rerouting algorithms: a competitive on-line algorithmic approach. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2002, v:10, n:6, pp:749-760 [Journal]
  131. Moses Charikar, Joseph Naor, Baruch Schieber
    Resource optimization in QoS multicast routing of real-time multimedia. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2004, v:12, n:2, pp:340-348 [Journal]
  132. Amotz Bar-Noy, Joseph Naor, Baruch Schieber
    Pushing Dependent Data in Clients-Providers-Servers Systems. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2003, v:9, n:5, pp:421-430 [Journal]
  133. Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor
    An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:522-533 [Conf]
  134. Niv Buchbinder, Kamal Jain, Joseph Naor
    Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:253-264 [Conf]
  135. David Amzallag, Joseph Naor, Danny Raz
    Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:991-999 [Conf]
  136. Roee Engelberg, Joseph Naor
    Equilibria in online games. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:149-158 [Conf]
  137. Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
    Survivable network design with degree or order constraints. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:651-660 [Conf]
  138. Joseph Naor, Hadas Shachnai, Tami Tamir
    Real-Time Scheduling with a Budget. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:3, pp:343-364 [Journal]

  139. A Primal-Dual Randomized Algorithm for Weighted Paging. [Citation Graph (, )][DBLP]


  140. Metrical Task Systems and the k-Server Problem on HSTs. [Citation Graph (, )][DBLP]


  141. Approximation Algorithms for Diversified Search Ranking. [Citation Graph (, )][DBLP]


  142. Toward Optimal Utilization of Shared Random Access Channels. [Citation Graph (, )][DBLP]


  143. Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. [Citation Graph (, )][DBLP]


  144. Non-Preemptive Buffer Management for Latency Sensitive Packets. [Citation Graph (, )][DBLP]


  145. Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. [Citation Graph (, )][DBLP]


  146. Maximum-lifetime routing: system optimization & game-theoretic perspectives. [Citation Graph (, )][DBLP]


  147. Partitioning graphs into balanced components. [Citation Graph (, )][DBLP]


  148. Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. [Citation Graph (, )][DBLP]


  149. Online multicast with egalitarian cost sharing. [Citation Graph (, )][DBLP]


  150. Randomized competitive algorithms for generalized caching. [Citation Graph (, )][DBLP]


  151. Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. [Citation Graph (, )][DBLP]


  152. Homogeneous Interference Game in Wireless Networks. [Citation Graph (, )][DBLP]


  153. Non-cooperative Cost Sharing Games Via Subsidies. [Citation Graph (, )][DBLP]


Search in 0.043secs, Finished in 0.051secs
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