Joseph Naor - RankMe

242 papers A* 81A 9B 22Journal 114Unranked 14

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes. CoRR Niv Buchbinder, Joseph Naor, David Wajc
2025	J	`jnl`	Dimension-Free Correlated Sampling for the Hypersimplex. CoRR Joseph Naor, Nitya Raju, Abhishek Shetty, Aravind Srinivasan, Renata Valieva, David Wajc
2024	B	`conf`	Approximations and Hardness of Covering and Packing Partially Ordered Items. WG Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2024	J	`jnl`	Approximations and Hardness of Packing Partially Ordered Items. CoRR Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2024	J	`jnl`	Non-Linear Paging. CoRR Ilan Doron-Arad, Joseph Naor
2023	J	`jnl`	Online Dependent Rounding Schemes. CoRR Joseph Naor, Aravind Srinivasan, David Wajc
2023	J	`jnl`	Online k-taxi via Double Coverage and time-reverse primal-dual. Math. Program. Niv Buchbinder, Christian Coester, Joseph Naor
2022	J	`jnl`	Competitive Algorithms for Block-Aware Caching. CoRR Christian Coester, Roie Levin, Joseph Naor, Ohad Talmon
2021	J	`jnl`	A Randomness Threshold for Online Bipartite Matching, via Lossless Online Rounding. CoRR Niv Buchbinder, Joseph Naor, David Wajc
2021	A*	`conf`	Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N: M Transposable Masks. NeurIPS Itay Hubara, Brian Chmiel, Moshe Island, Ron Banner, Joseph Naor, Daniel Soudry
2021	J	`jnl`	General Knapsack Problems in a Dynamic Setting. CoRR Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz
2020	J	`jnl`	A (1-e CoRR Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai
2020	B	`conf`	NFV Placement in Resource-Scarce Edge Nodes. CCGRID Yaron Fairstein, Dor Harris, Joseph Naor, Danny Raz
2020	J	`jnl`	Online Virtual Machine Allocation with Predictions. CoRR Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph Naor
2020	J	`jnl`	Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. CoRR Niv Buchbinder, Christian Coester, Joseph Naor
2019	J	`jnl`	Tight Bounds for Online Weighted Tree Augmentation. CoRR Joseph Naor, Seeun William Umboh, David P. Williamson
2018	B	`conf`	Latency Aware Placement in Multi-access Edge Computing. NetSoft Dor Harris, Joseph Naor, Danny Raz
2018	J	`jnl`	k-Servers with a Smile: Online Algorithms via Projections. CoRR Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor
2017	J	`jnl`	O(depth)-Competitive Algorithm for Online Multi-level Aggregation. CoRR Niv Buchbinder, Moran Feldman, Joseph Naor, Ohad Talmon
2017	J	`jnl`	Robust Submodular Maximization: Offline and Online Algorithms. CoRR Nima Anari, Nika Haghtalab, Joseph Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico
2016	J	`jnl`	Equilibria in Online Games. SIAM J. Comput. Roee Engelberg, Joseph Naor
2016	A*	`conf`	Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS 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
2016	J	`jnl`	Timing Matters: Online Dynamics in Broadcast Games. CoRR Shuchi Chawla, Joseph Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh
2016	J	`jnl`	Unified Algorithms for Online Learning and Competitive Analysis. Math. Oper. Res. Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir
2015	J	`jnl`	A Polylogarithmic-Competitive Algorithm for the J. ACM Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor
2015	J	`jnl`	A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
2015	J	`jnl`	Hedonic Clustering Games. ACM Trans. Parallel Comput. Moran Feldman, Liane Lewin-Eytan, Joseph Naor
2015	A*	`conf`	Near optimal placement of virtual network functions. INFOCOM Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz
2015	J	`jnl`	Near-Optimal Scheduling Mechanisms for Deadline-Sensitive Jobs in Large Computing Clusters. ACM Trans. Parallel Comput. Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv
2015	A*	`conf`	Near-Optimum Online Ad Allocation for Targeted Advertising. EC Joseph Naor, David Wajc
2015	A*	`conf`	Truthful Online Scheduling with Commitments. EC Yossi Azar, Inna Kalp-Shaltiel, Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv
2015	J	`jnl`	Truthful Online Scheduling with Commitments. CoRR Yossi Azar, Inna Kalp-Shaltiel, Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv
2014	J	`jnl`	A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. Algorithmica Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor
2014	J	`jnl`	A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. Theory Comput. Syst. Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv
2014	B	`conf`	Brief announcement: deadline-aware scheduling of big-data processing jobs. SPAA Peter Bodík, Ishai Menache, Joseph Naor, Jonathan Yaniv
2014	A	`conf`	Competitive Algorithms for Restricted Caching and Matroid Caching. ESA Niv Buchbinder, Shahar Chen, Joseph Naor
2014	A*	`conf`	Competitive Analysis via Regularization. SODA Niv Buchbinder, Shahar Chen, Joseph Naor
2014	J	`jnl`	Frequency capping in online advertising. J. Sched. Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor
2014	J	`jnl`	Min-Max Graph Partitioning and Small Set Expansion. SIAM J. Comput. Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
2014	J	`jnl`	Near-Optimum Online Ad Allocation for Targeted Advertising. CoRR Joseph Naor, David Wajc
2014	A*	`conf`	Non-Uniform Graph Partitioning. SODA Robert Krauthgamer, Joseph Naor, Roy Schwartz, Kunal Talwar
2014	A*	`conf`	On the effect of forwarding table size on SDN network utilization. INFOCOM Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz
2014	J	`jnl`	Online Packing and Covering Framework with Convex Objectives. CoRR Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor
2014	J	`jnl`	Smart Grid Network Optimization: Data-Quality-Aware Volume Reduction. IEEE Syst. J. Miriam Allalouf, Gidon Gershinsky, Liane Lewin-Eytan, Joseph Naor
2014	A*	`conf`	Submodular Maximization with Cardinality Constraints. SODA Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
2013	A*	`conf`	Almost optimal virtual machine placement for traffic intense data centers. INFOCOM Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz
2013	B	`conf`	Efficient online scheduling for deadline-sensitive jobs: extended abstract. SPAA Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv
2013	J	`jnl`	Fair online load balancing. J. Sched. Niv Buchbinder, Joseph Naor
2013	A*	`conf`	Simplex partitioning via exponential clocks and the multiway cut problem. STOC Niv Buchbinder, Joseph Naor, Roy Schwartz
2012	J	`jnl`	A Primal-Dual Randomized Algorithm for Weighted Paging. J. ACM Nikhil Bansal, Niv Buchbinder, Joseph Naor
2012	A*	`conf`	A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
2012	J	`jnl`	Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints CoRR Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh
2012	—	`conf`	Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. ICALP (1) Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh
2012	J	`jnl`	Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. IEEE/ACM Trans. Netw. Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda
2012	B	`conf`	Hedonic clustering games. SPAA Moran Feldman, Liane Lewin-Eytan, Joseph Naor
2012	B	`conf`	Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters. SPAA Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv
2012	J	`jnl`	Randomized Competitive Algorithms for Generalized Caching. SIAM J. Comput. Nikhil Bansal, Niv Buchbinder, Joseph Naor
2012	J	`jnl`	The load-distance balancing problem. Networks Edward Bortnikov, Samir Khuller, Jian Li, Yishay Mansour, Joseph Naor
2012	—	`conf`	Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks. ICALP (2) Navendu Jain, Ishai Menache, Joseph Naor, F. Bruce Shepherd
2012	A*	`conf`	Unified Algorithms for Online Learning and Competitive Analysis. COLT Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir
2011	J	`jnl`	A Polylogarithmic-Competitive Algorithm for the k-Server Problem CoRR Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor
2011	A*	`conf`	A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor
2011	B	`conf`	A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. SAGT Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv
2011	A*	`conf`	A Unified Continuous Greedy Algorithm for Submodular Maximization. FOCS Moran Feldman, Joseph Naor, Roy Schwartz
2011	—	`conf`	Data-quality-aware volume reduction in smart grid networks. SmartGridComm Miriam Allalouf, Gidon Gershinsky, Liane Lewin-Eytan, Joseph Naor
2011	B	`conf`	Frequency Capping in Online Advertising. WADS Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor
2011	A	`conf`	Improved Approximations for k-Exchange Systems - (Extended Abstract). ESA Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward
2011	—	`conf`	Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). APPROX-RANDOM Moran Feldman, Joseph Naor, Roy Schwartz
2011	J	`jnl`	Min-Max Graph Partitioning and Small Set Expansion CoRR Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
2011	A*	`conf`	Min-max Graph Partitioning and Small Set Expansion. FOCS Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
2011	—	`conf`	Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract). ICALP (1) Moran Feldman, Joseph Naor, Roy Schwartz
2011	A*	`conf`	Online Node-Weighted Steiner Tree and Related Problems. FOCS Joseph Naor, Debmalya Panigrahi, Mohit Singh
2010	—	`conf`	Approximation Algorithms for Diversified Search Ranking. ICALP (2) Nikhil Bansal, Kamal Jain, Anna Kazeykina, Joseph Naor
2010	A*	`conf`	Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. INFOCOM Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda
2010	—	`conf`	Metrical Task Systems and the ICALP (1) Nikhil Bansal, Niv Buchbinder, Joseph Naor
2010	J	`jnl`	Non-Cooperative Cost Sharing Games via Subsidies. Theory Comput. Syst. Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
2010	A*	`conf`	Non-Preemptive Buffer Management for Latency Sensitive Packets. INFOCOM Moran Feldman, Joseph Naor
2010	J	`jnl`	Online time-constrained scheduling in linear and ring networks. J. Discrete Algorithms Joseph Naor, Adi Rosén, Gabriel Scalosub
2010	J	`jnl`	The directed circular arrangement problem. ACM Trans. Algorithms Joseph Naor, Roy Schwartz
2010	A*	`conf`	Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. SODA Nikhil Bansal, Niv Buchbinder, Joseph Naor
2009	—	`ed.`	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 APPROX-RANDOM Irit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim
2009	A*	`conf`	Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. INFOCOM Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda
2009	J	`jnl`	Online Primal-Dual Algorithms for Covering and Packing. Math. Oper. Res. Niv Buchbinder, Joseph Naor
2009	A*	`conf`	Partitioning graphs into balanced components. SODA Robert Krauthgamer, Joseph Naor, Roy Schwartz
2009	J	`jnl`	Survivable Network Design with Degree or Order Constraints. SIAM J. Comput. Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
2009	J	`jnl`	The Design of Competitive Online Algorithms via a Primal-Dual Approach. Found. Trends Theor. Comput. Sci. Niv Buchbinder, Joseph Naor
2009	J	`jnl`	The Online Set Cover Problem. SIAM J. Comput. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
2009	J	`jnl`	Throughput maximization of real-time scheduling with batching. ACM Trans. Algorithms Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2009	A*	`conf`	Toward Optimal Utilization of Shared Random Access Channels. INFOCOM Joseph Naor, Danny Raz, Gabriel Scalosub
2008	—	`conf`	Homogeneous Interference Game in Wireless Networks. WINE Joseph Naor, Danny Raz, Gabriel Scalosub
2008	B	`conf`	Non-cooperative Cost Sharing Games Via Subsidies. SAGT Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
2008	J	`jnl`	On the approximability of some network design problems. ACM Trans. Algorithms Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha
2008	B	`conf`	Online multicast with egalitarian cost sharing. SPAA Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks
2008	A*	`conf`	Randomized competitive algorithms for generalized caching. STOC Nikhil Bansal, Niv Buchbinder, Joseph Naor
2008	A*	`conf`	Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. STOC Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz
2008	J	`jnl`	Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees. Theory Comput. Syst. Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Joseph Naor, Baruch Schieber
2007	A*	`conf`	A Primal-Dual Randomized Algorithm for Weighted Paging. FOCS Nikhil Bansal, Niv Buchbinder, Joseph Naor
2007	A*	`conf`	Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks. INFOCOM David Amzallag, Joseph Naor, Danny Raz
2007	J	`jnl`	Algorithmic aspects of bandwidth trading. ACM Trans. Algorithms Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor
2007	A	`conf`	An ESA Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor
2007	J	`jnl`	Cut problems in graphs with a budget constraint. J. Discrete Algorithms Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor
2007	A*	`conf`	Equilibria in online games. SODA Roee Engelberg, Joseph Naor
2007	B	`conf`	Maximum-lifetime routing: system optimization & game-theoretic perspectives. MobiHoc Liane Lewin-Eytan, Joseph Naor, Ariel Orda
2007	J	`jnl`	Non-Cooperative Multicast and Facility Location Games. IEEE J. Sel. Areas Commun. Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
2007	A	`conf`	Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. ESA Niv Buchbinder, Kamal Jain, Joseph Naor
2007	J	`jnl`	Real-Time Scheduling with a Budget. Algorithmica Joseph Naor, Hadas Shachnai, Tami Tamir
2007	A*	`conf`	Survivable network design with degree or order constraints. STOC Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
2007	J	`jnl`	The Hardness of Metric Labeling. SIAM J. Comput. Julia Chuzhoy, Joseph Naor
2006	J	`jnl`	A general approach to online network optimization problems. ACM Trans. Algorithms Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
2006	B	`conf`	Coping with Interference: From Maximum Coverage to Planning Cellular Networks. WAOA David Amzallag, Joseph Naor, Danny Raz
2006	J	`jnl`	Covering Problems with Hard Capacities. SIAM J. Comput. Julia Chuzhoy, Joseph Naor
2006	B	`conf`	Cut Problems in Graphs with a Budget Constraint. LATIN Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor
2006	J	`jnl`	Efficient algorithms for shared backup allocation in networks with partial information. J. Comb. Optim. Yigal Bejerano, Joseph Naor, Alexander Sprintson
2006	J	`jnl`	Efficient location area planning for personal communication systems. IEEE/ACM Trans. Netw. Yigal Bejerano, Mark A. Smith, Joseph Naor, Nicole Immorlica
2006	B	`conf`	Fair online load balancing. SPAA Niv Buchbinder, Joseph Naor
2006	A*	`conf`	Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. FOCS Niv Buchbinder, Joseph Naor
2006	J	`jnl`	New hardness results for congestion minimization and machine scheduling. J. ACM Julia Chuzhoy, Joseph Naor
2006	A*	`conf`	Non-cooperative multicast and facility location games. EC Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
2006	J	`jnl`	Scheduling Split Intervals. SIAM J. Comput. Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
2006	J	`jnl`	The Steiner SIAM J. Discret. Math. Chandra Chekuri, Sudipto Guha, Joseph Naor
2005	A*	`conf`	Approximating the average response time in broadcast scheduling. SODA Nikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor
2005	J	`jnl`	Asymmetric J. ACM Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor
2005	A*	`conf`	Balanced metric labeling. STOC Joseph Naor, Roy Schwartz
2005	J	`jnl`	Building Edge-Failure Resilient Networks. Algorithmica Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz
2005	A	`conf`	Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information. ESA Yigal Bejerano, Joseph Naor, Alexander Sprintson
2005	A	`conf`	From Balanced Graph Partitioning to Balanced Metric Labeling. ESA Joseph Naor
2005	A*	`conf`	On the approximability of some network design problems. SODA Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha
2005	A	`conf`	Online Primal-Dual Algorithms for Covering and Packing Problems. ESA Niv Buchbinder, Joseph Naor
2005	A*	`conf`	Online time-constrained scheduling in linear networks. INFOCOM Joseph Naor, Adi Rosén, Gabriel Scalosub
2004	J	`jnl`	A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem. SIAM J. Discret. Math. Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin
2004	A*	`conf`	A general approach to online network optimization problems. SODA Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
2004	J	`jnl`	Admission Control in Networks with Advance Reservations. Algorithmica Liane Lewin-Eytan, Joseph Naor, Ariel Orda
2004	J	`jnl`	Approximating the Advertisement Placement Problem. J. Sched. Ari Freund, Joseph Naor
2004	A*	`conf`	Asymmetric k-center is log STOC Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor
2004	A*	`conf`	Machine Minimization for Scheduling Jobs with Interval Constraints. FOCS Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor
2004	A*	`conf`	New hardness results for congestion minimization and machine scheduling. STOC Julia Chuzhoy, Joseph Naor
2004	J	`jnl`	Resource optimization in QoS multicast routing of real-time multimedia. IEEE/ACM Trans. Netw. Moses Charikar, Joseph Naor, Baruch Schieber
2004	A*	`conf`	The Hardness of Metric Labeling. FOCS Julia Chuzhoy, Joseph Naor
2004	A*	`conf`	The directed circular arrangement problem. SODA Joseph Naor, Roy Schwartz
2003	A*	`conf`	Algorithmic Aspects of Bandwidth Trading. ICALP Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor
2003	A*	`conf`	Approximating Steiner k-Cuts. ICALP Chandra Chekuri, Sudipto Guha, Joseph Naor
2003	J	`jnl`	Asymmetric k-center is log Electron. Colloquium Comput. Complex. Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor
2003	J	`jnl`	Competitive On-Line Switching Policies. Algorithmica Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor
2003	A*	`conf`	Efficient location area planning for personal communication systems. MobiCom Yigal Bejerano, Nicole Immorlica, Joseph Naor, Mark A. Smith
2003	J	`jnl`	Pushing Dependent Data in Clients-Providers-Servers Systems. Wirel. Networks Amotz Bar-Noy, Joseph Naor, Baruch Schieber
2003	A*	`conf`	Real-Time Scheduling with a Budget. ICALP Joseph Naor, Hadas Shachnai, Tami Tamir
2003	A*	`conf`	The online set cover problem. STOC Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
2002	B	`conf`	Approximating the Advertisement Placement Problem. IPCO Ari Freund, Joseph Naor
2002	B	`conf`	Building Edge-Failure Resilient Networks. IPCO Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz
2002	A*	`conf`	Competitive on-line switching policies. SODA Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor
2002	A*	`conf`	Control Message Aggregation in Group Communication Protocols. ICALP Sanjeev Khanna, Joseph Naor, Danny Raz
2002	A*	`conf`	Covering Problems with Hard Capacities. FOCS Julia Chuzhoy, Joseph Naor
2002	J	`jnl`	Efficient handoff rerouting algorithms: a competitive on-line algorithmic approach. IEEE/ACM Trans. Netw. Yigal Bejerano, Israel Cidon, Joseph Naor
2002	J	`jnl`	Minimizing Service and Operation Costs of Periodic Scheduling. Math. Oper. Res. Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber
2002	A*	`conf`	On-line Admission Control and Packet Scheduling with Interleaving. INFOCOM Juan A. Garay, Joseph Naor, Bülent Yener, Peng Zhao
2002	—	`conf`	Routing and Admission Control in Networks with Advance Reservations. APPROX Liane Lewin-Eytan, Joseph Naor, Ariel Orda
2002	A*	`conf`	Scheduling split intervals. SODA Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
2002	A*	`conf`	Throughput maximization of real-time scheduling with batching. SODA Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai
2001	J	`jnl`	A 2-Approximation Algorithm for the Directed Multiway Cut Problem. SIAM J. Comput. Joseph Naor, Leonid Zosin
2001	A*	`conf`	A deterministic algorithm for the cost-distance problem. SODA Chandra Chekuri, Sanjeev Khanna, Joseph Naor
2001	J	`jnl`	A unified approach to approximating resource allocation and scheduling. J. ACM Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
2001	J	`jnl`	Approximating the Throughput of Multiple Machines in Real-Time Scheduling. SIAM J. Comput. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
2001	A*	`conf`	Approximation algorithms for the metric labeling problem via a new linear programming formulation. SODA Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin
2001	J	`jnl`	Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems. J. Graph Algorithms Appl. Reuven Bar-Yehuda, Guy Even, Jon Feldman, Joseph Naor
2001	J	`jnl`	On-Line Load Balancing in a Hierarchical Server Topology. SIAM J. Comput. Amotz Bar-Noy, Ari Freund, Joseph Naor
2001	A*	`conf`	Tree packing and approximating k-cuts. SODA Joseph Naor, Yuval Rabani
2000	A*	`conf`	A unified approach to approximating resource allocation and scheduling. STOC Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber
2000	J	`jnl`	An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. SIAM J. Comput. Guy Even, Joseph Naor, Leonid Zosin
2000	J	`jnl`	Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. SIAM J. Discret. Math. Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin
2000	A*	`conf`	Directed network design with orientation constraints. SODA Sanjeev Khanna, Joseph Naor, F. Bruce Shepherd
2000	J	`jnl`	Divide-and-conquer approximation algorithms via spreading metrics. J. ACM Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
2000	—	`conf`	Dynamic session management for static and mobile users: a competitive on-line algorithmic approach. DIAL-M Yigal Bejerano, Israel Cidon, Joseph Naor
2000	J	`jnl`	Dynamic storage allocation with known durations. Discret. Appl. Math. Joseph Naor, Ariel Orda, Yael Petruschka
2000	A*	`conf`	Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach. INFOCOM Yigal Bejerano, Israel Cidon, Joseph Naor
2000	J	`jnl`	Message Multicasting in Heterogeneous Networks. SIAM J. Comput. Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
2000	A*	`conf`	Pushing dependent data in clients-providers-servers systems. MobiCom Amotz Bar-Noy, Joseph Naor, Baruch Schieber
2000	A*	`conf`	Resource Optimization in QoS Multicast Routing of Real-Time Multimedia. INFOCOM Moses Charikar, Joseph Naor, Baruch Schieber
2000	J	`jnl`	The Loading Time Scheduling Problem. J. Algorithms Randeep Bhatia, Samir Khuller, Joseph Naor
1999	A*	`conf`	Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. STOC Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
1999	A*	`conf`	Efficient Recovery from Power Outage (Extended Abstract). STOC Sudipto Guha, Anna Moss, Joseph Naor, Baruch Schieber
1999	J	`jnl`	Fast Approximate Graph Partitioning Algorithms. SIAM J. Comput. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
1999	A	`conf`	On-Line Load Banancing in a Hierarchical Server Topology. ESA Amotz Bar-Noy, Ari Freund, Joseph Naor
1999	J	`jnl`	The Budgeted Maximum Coverage Problem. Inf. Process. Lett. Samir Khuller, Anna Moss, Joseph Naor
1998	J	`jnl`	Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. Algorithmica Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan
1998	J	`jnl`	Approximating Probability Distributions Using Small Sample Spaces. Comb. Yossi Azar, Rajeev Motwani, Joseph Naor
1998	J	`jnl`	Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. SIAM J. Comput. Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth
1998	A*	`conf`	Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). SODA Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber
1998	A*	`conf`	Multicasting in Heterogeneous Networks. STOC Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber
1998	J	`jnl`	Scheduled Hot-Potato Routing. J. Graph Algorithms Appl. Joseph Naor, Ariel Orda, Raphael Rom
1997	A*	`conf`	A 2-Approximation Algorithm for the Directed Multiway Cut Problem. FOCS Joseph Naor, Leonid Zosin
1997	A	`conf`	Dynamic Storage Allocation with Known Durations. ESA Joseph Naor, Ariel Orda, Yael Petruschka
1997	A*	`conf`	Fast Approximate Graph Partitioning Algorithms. SODA Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
1997	A*	`conf`	Improved Approximations for Shallow-Light Spanning Trees. FOCS Joseph Naor, Baruch Schieber
1997	—	`conf`	Spreading Metric Based Graph Partitioning Algorithms. PP Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
1996	A*	`conf`	An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. FOCS Guy Even, Joseph Naor, Leonid Zosin
1996	—	`conf`	Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. ISTCS Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin
1996	J	`jnl`	Approximation Algorithms for Network Design Problems on Bounded Subsets. J. Algorithms Dorit S. Hochbaum, Joseph Naor
1996	J	`jnl`	Routing Strategies for Fast Networks. IEEE Trans. Computers Yossi Azar, Joseph Naor, Raphael Rom
1996	J	`jnl`	Tight Bounds for Dynamic Storage Allocation. SIAM J. Discret. Math. Michael Luby, Joseph Naor, Ariel Orda
1995	B	`conf`	Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. IPCO Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan
1995	J	`jnl`	Constructions of Permutation Arrays for Certain Scheduling Cost Measures. Random Struct. Algorithms Joseph Naor, Ron M. Roth
1995	A*	`conf`	Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). FOCS Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
1995	J	`jnl`	Flow in Planar Graphs with Multiple Sources and Sinks. SIAM J. Comput. Gary L. Miller, Joseph Naor
1995	A*	`conf`	Scheduled Hot-Potato Routing. INFOCOM Joseph Naor, Ariel Orda, Raphael Rom
1995	J	`jnl`	The Competitiveness of On-Line Assignments. J. Algorithms Yossi Azar, Joseph Naor, Raphael Rom
1995	A*	`conf`	The Loading Time Scheduling Problem (Extended Abstract). FOCS Randeep Bhatia, Samir Khuller, Joseph Naor
1994	A*	`conf`	Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. SODA Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth
1994	J	`jnl`	Flow in Planar Graphs with Vertex Capacities. Algorithmica Samir Khuller, Joseph Naor
1994	J	`jnl`	Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality. SIAM J. Comput. Dorit S. Hochbaum, Joseph Naor
1994	J	`jnl`	The Probabilistic Method Yields Deterministic Parallel Algorithms. J. Comput. Syst. Sci. Rajeev Motwani, Joseph Naor, Moni Naor
1994	A*	`conf`	Tight Bounds for Dynamic Storage Allocation. SODA Michael Luby, Joseph Naor, Ariel Orda
1993	J	`jnl`	Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM J. Comput. Joseph Naor, Moni Naor
1993	J	`jnl`	The Lattice Structure of Flow in Planar Graphs. SIAM J. Discret. Math. Samir Khuller, Joseph Naor, Philip N. Klein
1993	J	`jnl`	Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Program. Dorit S. Hochbaum, Nimrod Megiddo, Joseph Naor, Arie Tamir
1992	J	`jnl`	A Linear Time Approach to the Set Maxima Problem. SIAM J. Discret. Math. Amotz Bar-Noy, Rajeev Motwani, Joseph Naor
1992	J	`jnl`	Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Inf. Theory Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth
1992	A*	`conf`	Routing Strategies for Fast Networks. INFOCOM Yossi Azar, Joseph Naor, Raphael Rom
1992	B	`conf`	Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality. IPCO Dorit S. Hochbaum, Joseph Naor
1992	A*	`conf`	The Competitiveness of On-Line Assignments. SODA Yossi Azar, Joseph Naor, Raphael Rom
1992	J	`jnl`	The Greedy Algorithm is Optimal for On-Line Edge Coloring. Inf. Process. Lett. Amotz Bar-Noy, Rajeev Motwani, Joseph Naor
1991	J	`jnl`	An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph. Algorithmica Marek Chrobak, Joseph Naor
1991	—	`conf`	Flow in Planar Graphs: A Survey of Results. Planar Graphs Samir Khuller, Joseph Naor
1990	J	`jnl`	An Efficient Reconstruction of a Graph from its Line Graph in Parallel. J. Algorithms Joseph Naor, Mark B. Novick
1990	B	`conf`	Flow in Planar Graphs with Vertex Capacities. IPCO Samir Khuller, Joseph Naor
1990	J	`jnl`	One-Bit Algorithms. Distributed Comput. Amotz Bar-Noy, Joseph Naor, Moni Naor
1990	A*	`conf`	Small-bias Probability Spaces: Efficient Constructions and Applications STOC Joseph Naor, Moni Naor
1990	J	`jnl`	Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments. SIAM J. Discret. Math. Amotz Bar-Noy, Joseph Naor
1989	B	`conf`	An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph. SPAA Marek Chrobak, Joseph Naor
1989	J	`jnl`	Fast Parallel Algorithms for Chordal Graphs. SIAM J. Comput. Joseph Naor, Moni Naor, Alejandro A. Schäffer
1989	A*	`conf`	Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract) FOCS Gary L. Miller, Joseph Naor
1989	J	`jnl`	On Separating the Erew and Crew Pram Models. Theor. Comput. Sci. Eli Gafni, Joseph Naor, Prabhakar Ragde
1989	A*	`conf`	The Probabilistic Method Yields Deterministic Parallel Algorithms FOCS Rajeev Motwani, Joseph Naor, Moni Naor
1989	B	`conf`	Using Bounded Degree Spanning Trees in the Design of Efficient Algorithms on Claw-Free Graphs. WADS Marek Chrobak, Joseph Naor, Mark B. Novick
1988	J	`jnl`	A Fast Parallel Algorithm to Color a Graph with Delta Colors. J. Algorithms Mauricio Karchmer, Joseph Naor
1988	—	`conf`	Computing a Perfect Matching in a Line Graph. AWOC Joseph Naor
1988	A*	`conf`	One Bit Algorithms. PODC Amotz Bar-Noy, Joseph Naor, Moni Naor
1987	J	`jnl`	A Fast Parallel Coloring of Planar Graphs with Five Colors. Inf. Process. Lett. Joseph Naor
1987	A*	`conf`	Fast Parallel Algorithms for Chordal Graphs (Extended Abstract) STOC Joseph Naor, Moni Naor, Alejandro A. Schäffer
1987	—	`—`	אלגוריתמים במערכות מקביליות ומבוזרות (Algorithms in distributed and parallel systems.). Joseph Naor
1984	J	`jnl`	Multiple Resolution Texture Analysis and Classification. IEEE Trans. Pattern Anal. Mach. Intell. Shmuel Peleg, Joseph Naor, Ralph Hartley, David Avnir
1983	J	`jnl`	Hierarchical image representation for compression, filtering and normalization. Pattern Recognit. Lett. Joseph Naor, Shmuel Peleg
1983	A*	`conf`	Image Compression and Filtering Using Pyramid Data Structures. IJCAI Joseph Naor, Shmuel Peleg