Baruch Schieber

According to our database1, Baruch Schieber authored at least 125 papers between 1986 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Constrained submodular maximization via greedy local search.
Oper. Res. Lett., 2019

Flexible Resource Allocation to Interval Jobs.
Algorithmica, 2019

Fully Dynamic Maximal Independent Set with Sublinear in n Update Time.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Scalable Fair Clustering.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Complexity and inapproximability results for the Power Edge Set problem.
J. Comb. Optim., 2018

A Theory and Algorithms for Combinatorial Reoptimization.
Algorithmica, 2018

Fully dynamic maximal independent set with sublinear update time.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Fully Dynamic MIS in Uniformly Sparse Graphs.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Generalized Assignment of Time-Sensitive Item Groups.
Proceedings of the Approximation, 2018

2016
Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Subgraph Counting: Color Coding Beyond Trees.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

Real-Time k-bounded Preemptive Scheduling.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015
Real-time scheduling to minimize machine busy times.
J. Scheduling, 2015

The Container Selection Problem.
Proceedings of the Approximation, 2015

2013
The Euclidean k-Supplier Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

The Approximability of the Binary Paintshop Problem.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2011
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy.
Algorithmica, 2011

2010
Minimizing Busy Time in Multiple Machine Real-time Scheduling.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2008
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.
ACM Trans. Algorithms, 2008

2007
Preface.
IBM Journal of Research and Development, 2007

Inventory allocation and transportation scheduling for logistics of network-centric military operations.
IBM Journal of Research and Development, 2007

Dynamic pricing for impatient bidders.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Non-Preemptive Min-Sum Scheduling with Resource Augmentation.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006
Vehicle Routing and Staffing for Sedan Service.
Transportation Science, 2006

A quasi-PTAS for unsplittable flow on line graphs.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Minimizing Setup and Beam-On Times in Radiation Therapy.
Proceedings of the Approximation, 2006

2005
Computing the minimum DNF representation of Boolean functions defined by intervals.
Discrete Applied Mathematics, 2005

Traffic engineering of management flows by link augmentations on confluent trees.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

2004
Minimizing migrations in fair multiprocessor scheduling of persistent tasks.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Further Improvements in Competitive Guarantees for QoS Buffering.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness.
J. Scheduling, 2003

Sparse LCS Common Substring Alignment.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas.
SIAM J. Comput., 2002

Minimizing Service and Operation Costs of Periodic Scheduling.
Math. Oper. Res., 2002

Throughput maximization of real-time scheduling with batching.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Approximating the Throughput of Multiple Machines in Real-Time Scheduling.
SIAM J. Comput., 2001

The edge versus path incidence matrix of series-parallel graphs and greedy packing.
Discrete Applied Mathematics, 2001

Buffer overflow management in QoS switches.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Online server allocation in a server farm via benefit task systems.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000
Message Multicasting in Heterogeneous Networks.
SIAM J. Comput., 2000

Divide-and-conquer approximation algorithms via spreading metrics.
J. ACM, 2000

Improved approximations of crossings in graph drawings.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

A unified approach to approximating resource allocation and scheduling.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Pushing dependent data in clients-providers-servers systems.
Proceedings of the MOBICOM 2000, 2000

Resource Optimization in QoS Multicast Routing of Real-Time Multimedia.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999
Lower Bounds on the Depth of Monotone Arithmetic Computations.
J. Complexity, 1999

Efficient Recovery from Power Outage (Extended Abstract).
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Approximating the Throughput of Multiple Machines Under Real-Time Scheduling.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity.
SIAM J. Comput., 1998

Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property.
J. Algorithms, 1998

Approximating Minimum Feedback Sets and Multicuts in Directed Graphs.
Algorithmica, 1998

Multicasting in Heterogeneous Networks.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Competitive Dynamic Bandwidth Allocation.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997
Deterministic Many-to-Many Hot Potato Routing.
IEEE Trans. Parallel Distrib. Syst., 1997

Navigating in Unfamiliar Geometric Terrain.
SIAM J. Comput., 1997

A Tight Bound for Approximating the Square Root.
Inf. Process. Lett., 1997

A Linear-time Algorithm for Computing the Intersection of All Odd Cycles in a Graph.
Discrete Applied Mathematics, 1997

Fast Approximate Graph Partitioning Algorithms.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

The Angular-Metric Traveling Salesman Problem.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Spreading Metric Based Graph Partitioning Algorithms.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

Improved Approximations for Shallow-Light Spanning Trees.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996
Efficient Routing in Optical Networks.
J. ACM, 1996

A fast parallel algorithm for finding the convex hull of a sorted point set.
Int. J. Comput. Geometry Appl., 1996

Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995
Computing Global Combine Operations in the Multiport Postal Model.
IEEE Trans. Parallel Distrib. Syst., 1995

Competitive Paging with Locality of Reference.
J. Comput. Syst. Sci., 1995

Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality.
J. Algorithms, 1995

optimal Computation of Census Functions in the Postal Model.
Discrete Applied Mathematics, 1995

Bandwidth allocation with preemption.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Guaranteeing Fair Service to Persistent Dependent Tasks.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Calling Names on Nameless Networks
Inf. Comput., August, 1994

Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications.
Discrete & Computational Geometry, 1994

A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle.
Algorithmica, 1994

Optimal multiple message broadcasting in telephone-like communication systems.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Efficient Routing and Scheduling Algorithms for Optical Networks.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
An Optimal Algorithm for computing Census Functions in Message-Passing Systems.
Parallel Processing Letters, 1993

Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values.
J. Algorithms, 1993

Improved selection in totally monotone arrays.
Int. J. Comput. Geometry Appl., 1993

How much can hardware help routing?
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Computing Global Combine Operations in the Multi-Port Postal Model.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

Fast Deflection Routing for Packets and Worms (Extended Summary).
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992
The Intractability of Bounded Protocols for On-Line Sequence Transmission over Non-FIFO Channels.
J. ACM, 1992

On Independent Spanning Trees.
Inf. Process. Lett., 1992

An Efficient Algorithm for the All Pairs Suffix-Prefix Problem.
Inf. Process. Lett., 1992

Fast Exponentiation Using the Truncation Operation.
Computational Complexity, 1992

Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Efficient Minimum Cost Matching Using Quadrangle Inequality
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1991
Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs.
SIAM J. Comput., 1991

A Lower Bound for Integer Greatest Common Divisor Computations.
J. ACM, 1991

Computing external farthest neighbors for a simple polygon.
Discrete Applied Mathematics, 1991

Competitive Paging with Locality of Reference (Preliminary Version)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Navigating in Unfamiliar Geometric Terrain (Preliminary Version)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

The Canadian Traveller Problem.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Improved Selection on Totally Monotone Arrays.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

Competitive Paging with Locality of Reference (Brief Summary).
Proceedings of the On-Line Algorithms, 1991

Navigating in Unfamiliar Geometric Terrain (Extended Summary).
Proceedings of the On-Line Algorithms, 1991

1990
The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks
Inf. Comput., January, 1990

Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm.
Discrete Applied Mathematics, 1990

On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989
Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1 Flows.
J. Parallel Distrib. Comput., 1989

Finding the Edge Connectivity of Directed Graphs.
J. Algorithms, 1989

Highly Parallelizable Problems (Extended Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Calling Names in Nameless Networks.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

The Intractability of Bounded Protocols for Non-FIFO Channels.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

Lower Bounds for Computations with the Floor Operation.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

The Complexity of Approximating the Square Root (Extended Summary)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Fast Geometric Approximation Techniques and Geometric Embedding Problems.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
On finding most uniform spanning trees.
Discrete Applied Mathematics, 1988

Parallel Construction of a Suffix Tree with Applications.
Algorithmica, 1988

The Power of Multimedia: Combining Point-to Point and Multi-Access Networks.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

On Finding Lowest Common Ancestors: Simplification and Parallelization.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
Parallel Construction of a Suffix Tree (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs.
Theor. Comput. Sci., 1986

Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings.
Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986

Parallel Ear Decomposition Search (EDS) and St-Numbering in Graphs (Extended Abstract).
Proceedings of the VLSI Algorithms and Architectures, 1986


  Loading...