Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDJoseph Naor
Seffi Naor – Joseph (Seffi) Naor
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[c136]Yaron Fairstein, Dor Harris, Joseph Naor, Danny Raz:
NFV Placement in Resource-Scarce Edge Nodes. CCGRID 2020: 51-60- [c135]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai:
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. ESA 2020: 44:1-44:19 - [i15]Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai:
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. CoRR abs/2004.12224 (2020) - [i14]Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph Naor:
Online Virtual Machine Allocation with Predictions. CoRR abs/2011.06250 (2020) - [i13]Niv Buchbinder, Christian Coester, Joseph Naor:
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. CoRR abs/2012.02226 (2020)
2010 – 2019
- 2019
- [c134]Nima Anari, Nika Haghtalab, Seffi Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Structured Robust Submodular Maximization: Offline and Online Algorithms. AISTATS 2019: 3128-3137 - [c133]Joseph (Seffi) Naor, Seeun William Umboh
, David P. Williamson:
Tight Bounds for Online Weighted Tree Augmentation. ICALP 2019: 88:1-88:14 - [c132]Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor:
k-Servers with a Smile: Online Algorithms via Projections. SODA 2019: 98-116 - [i12]Joseph Naor, Seeun William Umboh, David P. Williamson:
Tight Bounds for Online Weighted Tree Augmentation. CoRR abs/1904.11777 (2019) - 2018
- [j96]Niv Buchbinder, Joseph (Seffi) Naor, Roy Schwartz:
Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem. SIAM J. Comput. 47(4): 1463-1482 (2018) - [j95]Joseph (Seffi) Naor, David Wajc:
Near-Optimum Online Ad Allocation for Targeted Advertising. ACM Trans. Economics and Comput. 6(3-4): 16:1-16:20 (2018) - [c131]Virajith Jalaparti, Chris Douglas, Mainak Ghosh, Ashvin Agrawal, Avrilia Floratou, Srikanth Kandula, Ishai Menache, Joseph (Seffi) Naor, Sriram Rao:
Netco: Cache and I/O Management for Analytics over Disaggregated Stores. SoCC 2018: 186-198 - [c130]Dor Harris, Joseph Naor, Danny Raz:
Latency Aware Placement in Multi-access Edge Computing. NetSoft 2018: 132-140 - [c129]Yaron Fairstein, Seffi Naor, Danny Raz:
Algorithms for Dynamic NFV Workload. WAOA 2018: 238-258 - [c128]Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. WINE 2018: 80-95 - [i11]Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor:
k-Servers with a Smile: Online Algorithms via Projections. CoRR abs/1810.07508 (2018) - 2017
- [j94]Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A greedy approximation algorithm for minimum-gap scheduling. J. Sched. 20(3): 279-292 (2017) - [j93]Moran Feldman, Joseph (Seffi) Naor:
Non-preemptive buffer management for latency sensitive packets. J. Sched. 20(4): 337-353 (2017) - [c127]Shahar Chen, Dotan Di Castro, Zohar S. Karnin, Liane Lewin-Eytan, Joseph (Seffi) Naor, Roy Schwartz:
Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification. ICALP 2017: 34:1-34:15 - [c126]Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, Ohad Talmon:
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. SODA 2017: 1235-1244 - [i10]Niv Buchbinder, Moran Feldman, Joseph Naor, Ohad Talmon:
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. CoRR abs/1701.01936 (2017) - [i9]Nima Anari, Nika Haghtalab, Joseph Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Robust Submodular Maximization: Offline and Online Algorithms. CoRR abs/1710.04740 (2017) - 2016
- [j92]Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir:
Unified Algorithms for Online Learning and Competitive Analysis. Math. Oper. Res. 41(2): 612-625 (2016) - [j91]Roee Engelberg, Joseph Naor:
Equilibria in Online Games. SIAM J. Comput. 45(2): 232-267 (2016) - [c125]Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi:
Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS 2016: 148-157 - [c124]Noa Elad, Satyen Kale, Joseph (Seffi) Naor:
Online Semidefinite Programming. ICALP 2016: 40:1-40:13 - [i8]Shuchi Chawla, Joseph Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. CoRR abs/1611.07745 (2016) - 2015
- [j90]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. J. ACM 62(5): 40:1-40:49 (2015) - [j89]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. 44(5): 1384-1402 (2015) - [j88]Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Near-Optimal Scheduling Mechanisms for Deadline-Sensitive Jobs in Large Computing Clusters. ACM Trans. Parallel Comput. 2(1): 3:1-3:29 (2015) - [j87]Moran Feldman, Liane Lewin-Eytan, Joseph Naor:
Hedonic Clustering Games. ACM Trans. Parallel Comput. 2(1): 4:1-4:48 (2015) - [c123]Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz:
Near optimal placement of virtual network functions. INFOCOM 2015: 1346-1354 - [c122]Joseph Naor, David Wajc:
Near-Optimum Online Ad Allocation for Targeted Advertising. EC 2015: 131-148 - [c121]Yossi Azar, Inna Kalp-Shaltiel, Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Truthful Online Scheduling with Commitments. EC 2015: 715-732 - [i7]Yossi Azar, Inna Kalp-Shaltiel, Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Truthful Online Scheduling with Commitments. CoRR abs/1507.00773 (2015) - 2014
- [j86]Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor:
A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. Algorithmica 68(2): 390-403 (2014) - [j85]Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. Theory Comput. Syst. 54(3): 388-406 (2014) - [j84]Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor:
Frequency capping in online advertising. J. Sched. 17(4): 385-398 (2014) - [j83]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-Max Graph Partitioning and Small Set Expansion. SIAM J. Comput. 43(2): 872-904 (2014) - [j82]Miriam Allalouf, Gidon Gershinsky, Liane Lewin-Eytan, Joseph Naor:
Smart Grid Network Optimization: Data-Quality-Aware Volume Reduction. IEEE Syst. J. 8(2): 450-460 (2014) - [c120]Niv Buchbinder, Shahar Chen, Joseph Naor:
Competitive Algorithms for Restricted Caching and Matroid Caching. ESA 2014: 209-221 - [c119]Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz:
On the effect of forwarding table size on SDN network utilization. INFOCOM 2014: 1734-1742 - [c118]Niv Buchbinder, Shahar Chen, Joseph Naor:
Competitive Analysis via Regularization. SODA 2014: 436-444 - [c117]Robert Krauthgamer, Joseph Naor, Roy Schwartz, Kunal Talwar:
Non-Uniform Graph Partitioning. SODA 2014: 1229-1243 - [c116]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
Submodular Maximization with Cardinality Constraints. SODA 2014: 1433-1452 - [c115]Peter Bodík, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Brief announcement: deadline-aware scheduling of big-data processing jobs. SPAA 2014: 211-213 - [i6]Joseph Naor, David Wajc:
Near-Optimum Online Ad Allocation for Targeted Advertising. CoRR abs/1409.8670 (2014) - [i5]Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor:
Online Packing and Covering Framework with Convex Objectives. CoRR abs/1412.8347 (2014) - 2013
- [j81]Niv Buchbinder, Joseph Naor:
Fair online load balancing. J. Sched. 16(1): 117-127 (2013) - [c114]Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A Greedy Approximation Algorithm for Minimum-Gap Scheduling. CIAC 2013: 97-109 - [c113]Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz:
Almost optimal virtual machine placement for traffic intense data centers. INFOCOM 2013: 355-359 - [c112]Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Efficient online scheduling for deadline-sensitive jobs: extended abstract. SPAA 2013: 305-314 - [c111]Niv Buchbinder, Joseph Naor, Roy Schwartz:
Simplex partitioning via exponential clocks and the multiway cut problem. STOC 2013: 535-544 - 2012
- [j80]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
A Primal-Dual Randomized Algorithm for Weighted Paging. J. ACM 59(4): 19:1-19:24 (2012) - [j79]Edward Bortnikov, Samir Khuller, Jian Li, Yishay Mansour, Joseph Naor:
The load-distance balancing problem. Networks 59(1): 22-29 (2012) - [j78]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Randomized Competitive Algorithms for Generalized Caching. SIAM J. Comput. 41(2): 391-414 (2012) - [j77]Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda:
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. IEEE/ACM Trans. Netw. 20(2): 477-487 (2012) - [c110]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS 2012: 649-658 - [c109]Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh:
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. ICALP (1) 2012: 145-156 - [c108]Navendu Jain, Ishai Menache, Joseph Naor, F. Bruce Shepherd:
Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks. ICALP (2) 2012: 586-597 - [c107]Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters. SPAA 2012: 255-266 - [c106]Moran Feldman, Liane Lewin-Eytan, Joseph Naor:
Hedonic clustering games. SPAA 2012: 267-276 - [c105]Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir:
Unified Algorithms for Online Learning and Competitive Analysis. COLT 2012: 5.1-5.18 - [i4]Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh:
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. CoRR abs/1205.1477 (2012) - 2011
- [c104]Moran Feldman, Joseph Naor, Roy Schwartz:
Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). APPROX-RANDOM 2011: 218-229 - [c103]Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward:
Improved Approximations for k-Exchange Systems - (Extended Abstract). ESA 2011: 784-798 - [c102]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26 - [c101]Joseph Naor, Debmalya Panigrahi, Mohit Singh:
Online Node-Weighted Steiner Tree and Related Problems. FOCS 2011: 210-219 - [c100]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS 2011: 267-276 - [c99]Moran Feldman, Joseph Naor, Roy Schwartz:
A Unified Continuous Greedy Algorithm for Submodular Maximization. FOCS 2011: 570-579 - [c98]Moran Feldman, Joseph Naor, Roy Schwartz:
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract). ICALP (1) 2011: 342-353 - [c97]Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. SAGT 2011: 178-189 - [c96]Miriam Allalouf, Gidon Gershinsky, Liane Lewin-Eytan, Joseph Naor:
Data-quality-aware volume reduction in smart grid networks. SmartGridComm 2011: 120-125 - [c95]Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor:
Frequency Capping in Online Advertising. WADS 2011: 147-158 - [i3]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. CoRR abs/1110.1580 (2011) - [i2]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-Max Graph Partitioning and Small Set Expansion. CoRR abs/1110.4319 (2011) - 2010
- [j76]Joseph Naor, Adi Rosén, Gabriel Scalosub:
Online time-constrained scheduling in linear and ring networks. J. Discrete Algorithms 8(4): 346-355 (2010) - [j75]Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-Cooperative Cost Sharing Games via Subsidies. Theory Comput. Syst. 47(1): 15-37 (2010) - [j74]Joseph Naor, Roy Schwartz:
The directed circular arrangement problem. ACM Trans. Algorithms 6(3): 47:1-47:22 (2010) - [c94]Nikhil Bansal, Kamal Jain, Anna Kazeykina, Joseph Naor:
Approximation Algorithms for Diversified Search Ranking. ICALP (2) 2010: 273-284 - [c93]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Metrical Task Systems and the k-Server Problem on HSTs. ICALP (1) 2010: 287-298 - [c92]Moran Feldman, Joseph Naor:
Non-Preemptive Buffer Management for Latency Sensitive Packets. INFOCOM 2010: 186-190 - [c91]Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda:
Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. INFOCOM 2010: 2402-2410 - [c90]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. SODA 2010: 40-55
2000 – 2009
- 2009
- [j73]Niv Buchbinder, Joseph Naor:
The Design of Competitive Online Algorithms via a Primal-Dual Approach. Found. Trends Theor. Comput. Sci. 3(2-3): 93-263 (2009) - [j72]Niv Buchbinder, Joseph Naor:
Online Primal-Dual Algorithms for Covering and Packing. Math. Oper. Res. 34(2): 270-286 (2009) - [j71]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
The Online Set Cover Problem. SIAM J. Comput. 39(2): 361-370 (2009) - [j70]Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh:
Survivable Network Design with Degree or Order Constraints. SIAM J. Comput. 39(3): 1062-1087 (2009) - [j69]Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Throughput maximization of real-time scheduling with batching. ACM Trans. Algorithms 5(2): 18:1-18:17 (2009) - [c89]Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda:
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. INFOCOM 2009: 145-153 - [c88]Joseph Naor, Danny Raz, Gabriel Scalosub:
Toward Optimal Utilization of Shared Random Access Channels. INFOCOM 2009: 2061-2069 - [c87]Robert Krauthgamer, Joseph Naor, Roy Schwartz:
Partitioning graphs into balanced components. SODA 2009: 942-949 - [e1]Irit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings. Lecture Notes in Computer Science 5687, Springer 2009, ISBN 978-3-642-03684-2 [contents] - 2008
- [j68]Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum:
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. Discret. Appl. Math. 156(4): 407-408 (2008) - [j67]Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum:
Editorial. Discret. Appl. Math. 156(4): 410-411 (2008) - [j66]Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Joseph Naor, Baruch Schieber:
Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees. Theory Comput. Syst. 42(1): 2-26 (2008) - [j65]Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha:
On the approximability of some network design problems. ACM Trans. Algorithms 4(2): 23:1-23:17 (2008) - [c86]Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-cooperative Cost Sharing Games Via Subsidies. SAGT 2008: 337-349 - [c85]Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks:
Online multicast with egalitarian cost sharing. SPAA 2008: 70-76 - [c84]Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz:
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. STOC 2008: 11-20 - [c83]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Randomized competitive algorithms for generalized caching. STOC 2008: 235-244 - [c82]Joseph Naor, Danny Raz, Gabriel Scalosub:
Homogeneous Interference Game in Wireless Networks. WINE 2008: 514-521 - 2007
- [j64]Joseph Naor, Hadas Shachnai, Tami Tamir:
Real-Time Scheduling with a Budget. Algorithmica 47(3): 343-364 (2007) - [j63]Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor:
Cut problems in graphs with a budget constraint. J. Discrete Algorithms 5(2): 262-279 (2007) - [j62]Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-Cooperative Multicast and Facility Location Games. IEEE J. Sel. Areas Commun. 25(6): 1193-1206 (2007) - [j61]Julia Chuzhoy, Joseph Naor:
The Hardness of Metric Labeling. SIAM J. Comput. 36(5): 1376-1386 (2007) - [j60]Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor:
Algorithmic aspects of bandwidth trading. ACM Trans. Algorithms 3(1): 10:1-10:19 (2007) - [c81]Niv Buchbinder, Kamal Jain, Joseph Naor:
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. ESA 2007: 253-264 - [c80]Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor:
An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. ESA 2007: 522-533 - [c79]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
A Primal-Dual Randomized Algorithm for Weighted Paging. FOCS 2007: 507-517 - [c78]David Amzallag, Joseph Naor, Danny Raz:
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks. INFOCOM 2007: 991-999 - [c77]Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Maximum-lifetime routing: system optimization & game-theoretic perspectives. MobiHoc 2007: 160-169 - [c76]Roee Engelberg, Joseph Naor:
Equilibria in online games. SODA 2007: 149-158 - [c75]Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh:
Survivable network design with degree or order constraints. STOC 2007: 651-660 - 2006
- [j59]Julia Chuzhoy, Joseph Naor:
New hardness results for congestion minimization and machine scheduling. J. ACM 53(5): 707-721 (2006) - [j58]Yigal Bejerano, Joseph Naor, Alexander Sprintson:
Efficient algorithms for shared backup allocation in networks with partial information. J. Comb. Optim. 12(1-2): 17-34 (2006) - [j57]Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira:
Scheduling Split Intervals. SIAM J. Comput. 36(1): 1-15 (2006) - [j56]Julia Chuzhoy, Joseph Naor:
Covering Problems with Hard Capacities. SIAM J. Comput. 36(2): 498-515 (2006) - [j55]Chandra Chekuri, Sudipto Guha, Joseph Naor:
The Steiner k-Cut Problem. SIAM J. Discret. Math. 20(1): 261-271 (2006) - [j54]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
A general approach to online network optimization problems. ACM Trans. Algorithms 2(4): 640-660 (2006) - [j53]Yigal Bejerano, Mark A. Smith, Joseph Naor, Nicole Immorlica:
Efficient location area planning for personal communication systems. IEEE/ACM Trans. Netw. 14(2): 438-450 (2006) - [c74]Niv Buchbinder, Joseph Naor:
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. FOCS 2006: 293-304 - [c73]Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor:
Cut Problems in Graphs with a Budget Constraint. LATIN 2006: 435-446 - [c72]Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-cooperative multicast and facility location games. EC 2006: 72-81 - [c71]Niv Buchbinder, Joseph Naor:
Fair online load balancing. SPAA 2006: 291-298 - [c70]David Amzallag, Joseph Naor, Danny Raz:
Coping with Interference: From Maximum Coverage to Planning Cellular Networks. WAOA 2006: 29-42 - 2005
- [j52]Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz:
Building Edge-Failure Resilient Networks. Algorithmica 43(1-2): 17-41 (2005) - [j51]Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor:
Asymmetric k-center is log* n-hard to approximate. J. ACM 52(4): 538-551 (2005) - [c69]Joseph Naor:
From Balanced Graph Partitioning to Balanced Metric Labeling. ESA 2005: 9 - [c68]Niv Buchbinder, Joseph Naor:
Online Primal-Dual Algorithms for Covering and Packing Problems. ESA 2005: 689-701 - [c67]Yigal Bejerano, Joseph Naor, Alexander Sprintson:
Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information. ESA 2005: 702-713 - [c66]