| 2025 | SSS | Brief Announcement: The Steiner Shortest Path Tree Problem. | Omer Asher, Yefim Dinitz, Shlomi Dolev, Li-on Raviv, Baruch Schieber |
| 2024 | KDD | Promoting Fairness and Priority in Selecting | Md Mouinul Islam, Soroush Vahidi, Baruch Schieber, Senjuti Basu Roy |
| 2024 | SSS | Partially Disjoint Shortest Paths and Near-Shortest Paths Trees. | Yefim Dinitz, Shlomi Dolev, Manish Kumar, Baruch Schieber |
| 2024 | SSS | Brief Announcement: Make Master Private-Keys Secure by Keeping It Public. | Shlomi Dolev, Komal Kumari, Sharad Mehrotra, Baruch Schieber, Shantanu Sharma |
| 2024 | SSS | Brief Announcement: Towards Proportionate Fair Assignment. | Baruch Schieber |
| 2024 | WG | Approximations and Hardness of Covering and Packing Partially Ordered Items. | Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai |
| 2023 | ESA | Approximating Connected Maximum Cuts via Local Search. | Baruch Schieber, Soroush Vahidi |
| 2023 | WADS | Quick Minimization of Tardy Processing Time on a Single Machine. | Baruch Schieber, Pranav Sitaraman |
| 2023 | WALCOM | Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. | Baruch Schieber, Bhargav Samineni, Soroush Vahidi |
| 2022 | SIGMOD | Rank Aggregation with Proportionate Fairness. | Dong Wei, Md Mouinul Islam, Baruch Schieber, Senjuti Basu Roy |
| 2019 | ESA | Generalized Assignment via Submodular Optimization with Reserved Capacity. | Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai |
| 2019 | ICML | Scalable Fair Clustering. | Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner |
| 2019 | SODA | Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. | Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon |
| 2018 | ICALP | Fully Dynamic MIS in Uniformly Sparse Graphs. | Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein |
| 2018 | STOC | Fully dynamic maximal independent set with sublinear update time. | Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon |
| 2018 | SPAA | Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. | Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai |
| 2016 | ALENEX | Real-Time k-bounded Preemptive Scheduling. | Sivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir |
| 2016 | SPAA | Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks. | Dmitriy Katz, Baruch Schieber, Hadas Shachnai |
| 2013 | IPCO | All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. | Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir |
| 2013 | IPCO | The Euclidean k-Supplier Problem. | Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai |
| 2007 | FOCS | Non-Preemptive Min-Sum Scheduling with Resource Augmentation. | Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber |
| 2007 | SODA | Dynamic pricing for impatient bidders. | Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko |
| 2006 | STOC | A quasi-PTAS for unsplittable flow on line graphs. | Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Baruch Schieber |
| 2005 | SPAA | Traffic engineering of management flows by link augmentations on confluent trees. | Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber |
| 2004 | ICALP | Further Improvements in Competitive Guarantees for QoS Buffering. | Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko |
| 2004 | SODA | Minimizing migrations in fair multiprocessor scheduling of persistent tasks. | Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko |
| 2003 | CPM | Sparse LCS Common Substring Alignment. | Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson |
| 2002 | SODA | Throughput maximization of real-time scheduling with batching. | Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai |
| 2001 | STOC | Online server allocation in a server farm via benefit task systems. | T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko |
| 2001 | STOC | Buffer overflow management in QoS switches. | Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko |
| 2000 | INFOCOM | Resource Optimization in QoS Multicast Routing of Real-Time Multimedia. | Moses Charikar, Joseph Naor, Baruch Schieber |
| 2000 | MOBICOM | Pushing dependent data in clients-providers-servers systems. | Amotz Bar-Noy, Joseph Naor, Baruch Schieber |
| 2000 | STOC | A unified approach to approximating resource allocation and scheduling. | Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber |
| 2000 | STOC | Improved approximations of crossings in graph drawings. | Guy Even, Sudipto Guha, Baruch Schieber |
| 1999 | STOC | Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. | Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber |
| 1999 | STOC | Efficient Recovery from Power Outage (Extended Abstract). | Sudipto Guha, Anna Moss, Joseph Naor, Baruch Schieber |
| 1998 | PODC | Competitive Dynamic Bandwidth Allocation. | Amotz Bar-Noy, Yishay Mansour, Baruch Schieber |
| 1998 | SODA | Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). | Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber |
| 1998 | STOC | Multicasting in Heterogeneous Networks. | Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber |
| 1997 | FOCS | Improved Approximations for Shallow-Light Spanning Trees. | Joseph Naor, Baruch Schieber |
| 1997 | SODA | The Angular-Metric Traveling Salesman Problem. | Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber |
| 1997 | SODA | Fast Approximate Graph Partitioning Algorithms. | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
| 1995 | FOCS | Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
| 1995 | IPCO | Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. | Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan |
| 1995 | SODA | Guaranteeing Fair Service to Persistent Dependent Tasks. | Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Madhu Sudan |
| 1995 | SODA | Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property. | Baruch Schieber |
| 1995 | STOC | Bandwidth allocation with preemption. | Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber |
| 1994 | SODA | Efficient Routing and Scheduling Algorithms for Optical Networks. | Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan |
| 1993 | PODC | Fast Deflection Routing for Packets and Worms (Extended Summary). | Amotz Bar-Noy, Prabhakar Raghavan, Baruch Schieber, Hisao Tamaki |
| 1993 | STOC | How much can hardware help routing? | Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal |
| 1992 | FOCS | Efficient Minimum Cost Matching Using Quadrangle Inequality | Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber |
| 1992 | FOCS | Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary) | Don Coppersmith, Baruch Schieber |
| 1991 | SODA | The Canadian Traveller Problem. | Amotz Bar-Noy, Baruch Schieber |
| 1991 | STOC | Navigating in Unfamiliar Geometric Terrain (Preliminary Version) | Avrim Blum, Prabhakar Raghavan, Baruch Schieber |
| 1991 | STOC | Competitive Paging with Locality of Reference (Preliminary Version) | Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber |
| 1990 | SODA | On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. | Lawrence L. Larmore, Baruch Schieber |
| 1989 | FOCS | Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) | Samir Khuller, Baruch Schieber |
| 1989 | FOCS | The Complexity of Approximating the Square Root (Extended Summary) | Yishay Mansour, Baruch Schieber, Prasoon Tiwari |
| 1989 | ICALP | Lower Bounds for Computations with the Floor Operation. | Yishay Mansour, Baruch Schieber, Prasoon Tiwari |
| 1989 | PODC | The Intractability of Bounded Protocols for Non-FIFO Channels. | Yishay Mansour, Baruch Schieber |
| 1989 | PODC | Calling Names in Nameless Networks. | Baruch Schieber |
| 1989 | STOC | Highly Parallelizable Problems (Extended Abstract) | Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin |
| 1988 | FOCS | Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary) | Yishay Mansour, Baruch Schieber, Prasoon Tiwari |
| 1988 | PODC | The Power of Multimedia: Combining Point-to Point and Multi-Access Networks. | Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung |
| 1987 | ICALP | Parallel Construction of a Suffix Tree (Extended Abstract). | Gad M. Landau, Baruch Schieber, Uzi Vishkin |
| 1986 | PODC | Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings. | Baruch Schieber, Shlomo Moran |