Joseph Naor

CoRR, 2024

Approximations and Hardness of Packing Partially Ordered Items.

[BibT_eX]

[DOI]

CoRR, 2024

SSD Wear Leveling with Optimal Guarantees.

[BibT_eX]

[DOI]

Tomer Lange

Gala Yadgar

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023

Online k-taxi via Double Coverage and time-reverse primal-dual.

[BibT_eX]

[DOI]

Christian Coester

Math. Program., February, 2023

Online Dependent Rounding Schemes.

[BibT_eX]

[DOI]

Aravind Srinivasan

CoRR, 2023

Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility).

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

An almost optimal approximation algorithm for monotone submodular multiple knapsack.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Tight Bounds for Online Weighted Tree Augmentation.

[BibT_eX]

[DOI]

Seeun William Umboh

David P. Williamson

Algorithmica, 2022

Competitive Algorithms for Block-Aware Caching.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

2021

Timing Matters: Online Dynamics in Broadcast Games.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2021

Offline and Online Algorithms for SSD Management.

[BibT_eX]

[DOI]

Tomer Lange

Gala Yadgar

Proc. ACM Meas. Anal. Comput. Syst., 2021

Structured Robust Submodular Maximization: Offline and Online Algorithms.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2021

A Randomness Threshold for Online Bipartite Matching, via Lossless Online Rounding.

[BibT_eX]

[DOI]

CoRR, 2021

Efficient Online Weighted Multi-Level Paging.

[BibT_eX]

[DOI]

Ohad Talmon

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Online Virtual Machine Allocation with Lifetime and Load Predictions.

[BibT_eX]

[DOI]

Proceedings of the SIGMETRICS '21: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2021

Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N: M Transposable Masks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Invited Talks.

[BibT_eX]

[DOI]

Henning Fernau

Katharina T. Huber

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

Recent Advances in Competitive Analysis of Online Algorithms.

[BibT_eX]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

General Knapsack Problems in a Dynamic Setting.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2021

2020

Online Virtual Machine Allocation with Predictions.

[BibT_eX]

[DOI]

CoRR, 2020

A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

NFV Placement in Resource-Scarce Edge Nodes.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE/ACM International Symposium on Cluster, 2020

2019

k-Servers with a Smile: Online Algorithms via Projections.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Near-Optimum Online Ad Allocation for Targeted Advertising.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2018

Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Algorithms for Dynamic NFV Workload.

[BibT_eX]

[DOI]

Yaron Fairstein

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Latency Aware Placement in Multi-access Edge Computing.

[BibT_eX]

[DOI]

Dor Harris

Proceedings of the 4th IEEE Conference on Network Softwarization and Workshops, 2018

Netco: Cache and I/O Management for Analytics over Disaggregated Stores.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Cloud Computing, 2018

2017

Non-preemptive buffer management for latency sensitive packets.

[BibT_eX]

[DOI]

J. Sched., 2017

A greedy approximation algorithm for minimum-gap scheduling.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

Uriel Feige

Fei Li

J. Sched., 2017

Robust Submodular Maximization: Offline and Online Algorithms.

[BibT_eX]

[DOI]

CoRR, 2017

O(depth)-Competitive Algorithm for Online Multi-level Aggregation.

[BibT_eX]

[DOI]

CoRR, 2017

O(depth)-Competitive Algorithm for Online Multi-level Aggregation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Equilibria in Online Games.

[BibT_eX]

[DOI]

Roee Engelberg

SIAM J. Comput., 2016

Online Semidefinite Programming.

[BibT_eX]

[DOI]

Noa Elad

Satyen Kale

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Online Algorithms for Covering and Packing Problems with Convex Objectives.

[BibT_eX]

[DOI]

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

Near-Optimal Scheduling Mechanisms for Deadline-Sensitive Jobs in Large Computing Clusters.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2015

Hedonic Clustering Games.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2015

A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

A Polylogarithmic-Competitive Algorithm for the k-Server Problem.

[BibT_eX]

[DOI]

J. ACM, 2015

Truthful Online Scheduling with Commitments.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Near optimal placement of virtual network functions.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

2014

Smart Grid Network Optimization: Data-Quality-Aware Volume Reduction.

[BibT_eX]

[DOI]

IEEE Syst. J., 2014

Min-Max Graph Partitioning and Small Set Expansion.

[BibT_eX]

[DOI]

Uriel Feige

Robert Krauthgamer

Konstantin Makarychev

Viswanath Nagarajan

SIAM J. Comput., 2014

Frequency capping in online advertising.

[BibT_eX]

[DOI]

J. Sched., 2014

A Truthful Mechanism for Value-Based Scheduling in Cloud Computing.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Online Packing and Covering Framework with Convex Objectives.

[BibT_eX]

[DOI]

CoRR, 2014

A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching.

[BibT_eX]

[DOI]

Algorithmica, 2014

Brief announcement: deadline-aware scheduling of big-data processing jobs.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Non-Uniform Graph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Submodular Maximization with Cardinality Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Competitive Analysis via Regularization.

[BibT_eX]

[DOI]

Shahar Chen

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

On the effect of forwarding table size on SDN network utilization.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Competitive Algorithms for Restricted Caching and Matroid Caching.

[BibT_eX]

[DOI]

Shahar Chen

Proceedings of the Algorithms - ESA 2014, 2014

2013

Fair online load balancing.

[BibT_eX]

[DOI]

J. Sched., 2013

Efficient online scheduling for deadline-sensitive jobs: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Almost optimal virtual machine placement for traffic intense data centers.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

2012

Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2012

Randomized Competitive Algorithms for Generalized Caching.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

The load-distance balancing problem.

[BibT_eX]

[DOI]

Networks, 2012

Unified Algorithms for Online Learning and Competitive Analysis.

[BibT_eX]

[DOI]

Proceedings of the COLT 2012, 2012

A Primal-Dual Randomized Algorithm for Weighted Paging.

[BibT_eX]

[DOI]

J. ACM, 2012

Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Data-quality-aware volume reduction in smart grid networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE Second International Conference on Smart Grid Communications, 2011

Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Online Node-Weighted Steiner Tree and Related Problems.

[BibT_eX]

[DOI]

Debmalya Panigrahi

Mohit Singh

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

A Unified Continuous Greedy Algorithm for Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

A Polylogarithmic-Competitive Algorithm for the k-Server Problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Improved Approximations for k-Exchange Systems - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

The directed circular arrangement problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

Non-Cooperative Cost Sharing Games via Subsidies.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Online time-constrained scheduling in linear and ring networks.

[BibT_eX]

[DOI]

Adi Rosén

J. Discrete Algorithms, 2010

Towards the Randomized k-Server Conjecture: A Primal-Dual Approach.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Approximation Algorithms for Diversified Search Ranking.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Metrical Task Systems and the k-Server Problem on HSTs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Throughput maximization of real-time scheduling with batching.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Survivable Network Design with Degree or Order Constraints.

[BibT_eX]

[DOI]

Lap Chi Lau

Mohammad R. Salavatipour

Mohit Singh

SIAM J. Comput., 2009

The Online Set Cover Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Online Primal-Dual Algorithms for Covering and Packing.

[BibT_eX]

[DOI]

Math. Oper. Res., 2009

The Design of Competitive Online Algorithms via a Primal-Dual Approach.

[BibT_eX]

[DOI]

Found. Trends Theor. Comput. Sci., 2009

Partitioning graphs into balanced components.

[BibT_eX]

[DOI]

Robert Krauthgamer

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Toward Optimal Utilization of Shared Random Access Channels.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

On the approximability of some network design problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

Editorial.

[BibT_eX]

[DOI]

Irith Ben-Arroyo Hartman

Michal Penn

Uriel G. Rothblum

Discret. Appl. Math., 2008

The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms.

[BibT_eX]

[DOI]

Irith Ben-Arroyo Hartman

Michal Penn

Uriel G. Rothblum

Discret. Appl. Math., 2008

Homogeneous Interference Game in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Online multicast with egalitarian cost sharing.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

2007

Algorithmic aspects of bandwidth trading.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

The Hardness of Metric Labeling.

[BibT_eX]

[DOI]

Julia Chuzhoy

SIAM J. Comput., 2007

Non-Cooperative Multicast and Facility Location Games.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2007

Cut problems in graphs with a budget constraint.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Real-Time Scheduling with a Budget.

[BibT_eX]

[DOI]

Hadas Shachnai

Tami Tamir

Algorithmica, 2007

Maximum-lifetime routing: system optimization & game-theoretic perspectives.

[BibT_eX]

[DOI]

Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2007

Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks.

[BibT_eX]

[DOI]

David Amzallag

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue.

[BibT_eX]

[DOI]

Kamal Jain

Proceedings of the Algorithms, 2007

An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

2006

Efficient location area planning for personal communication systems.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2006

A general approach to online network optimization problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

The Steiner k-Cut Problem.

[BibT_eX]

[DOI]

Chandra Chekuri

Sudipto Guha

SIAM J. Discret. Math., 2006

Covering Problems with Hard Capacities.

[BibT_eX]

[DOI]

Julia Chuzhoy

SIAM J. Comput., 2006

Scheduling Split Intervals.

[BibT_eX]

[DOI]

Reuven Bar-Yehuda

Magnús M. Halldórsson

Hadas Shachnai

Irina Shapira

SIAM J. Comput., 2006

Efficient algorithms for shared backup allocation in networks with partial information.

[BibT_eX]

[DOI]

Yigal Bejerano

Alexander Sprintson

J. Comb. Optim., 2006

New hardness results for congestion minimization and machine scheduling.

[BibT_eX]

[DOI]

Julia Chuzhoy

J. ACM, 2006

Coping with Interference: From Maximum Coverage to Planning Cellular Networks.

[BibT_eX]

[DOI]

David Amzallag

Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

Asymmetric k-center is log* n-hard to approximate.

[BibT_eX]

[DOI]

J. ACM, 2005

Building Edge-Failure Resilient Networks.

[BibT_eX]

[DOI]

Algorithmica, 2005

Balanced metric labeling.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Approximating the average response time in broadcast scheduling.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Online time-constrained scheduling in linear networks.

[BibT_eX]

[DOI]

Adi Rosén

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

From Balanced Graph Partitioning to Balanced Metric Labeling.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

Online Primal-Dual Algorithms for Covering and Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

2004

Resource optimization in QoS multicast routing of real-time multimedia.

[BibT_eX]

[DOI]

Moses Charikar

Baruch Schieber

IEEE/ACM Trans. Netw., 2004

A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Approximating the Advertisement Placement Problem.

[BibT_eX]

[DOI]

Ari Freund

J. Sched., 2004

Admission Control in Networks with Advance Reservations.

[BibT_eX]

[DOI]

Algorithmica, 2004

Asymmetric k-center is log* n-hard to approximate.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Machine Minimization for Scheduling Jobs with Interval Constraints.

[BibT_eX]

[DOI]

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

Pushing Dependent Data in Clients-Providers-Servers Systems.

[BibT_eX]

[DOI]

Baruch Schieber

Wirel. Networks, 2003

Asymmetric k-center is log*n-hard to Approximate

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

Competitive On-Line Switching Policies.

[BibT_eX]

[DOI]

Algorithmica, 2003

Approximating Steiner k-Cuts.

[BibT_eX]

[DOI]

Chandra Chekuri

Sudipto Guha

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Efficient handoff rerouting algorithms: a competitive on-line algorithmic approach.

[BibT_eX]

[DOI]

Yigal Bejerano

Israel Cidon

IEEE/ACM Trans. Netw., 2002

Minimizing Service and Operation Costs of Periodic Scheduling.

[BibT_eX]

[DOI]

Math. Oper. Res., 2002

On-line Admission Control and Packet Scheduling with Interleaving.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

Control Message Aggregation in Group Communication Protocols.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Routing and Admission Control in Networks with Advance Reservations.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

A 2-Approximation Algorithm for the Directed Multiway Cut Problem.

[BibT_eX]

[DOI]

Leonid Zosin

SIAM J. Comput., 2001

Approximating the Throughput of Multiple Machines in Real-Time Scheduling.

[BibT_eX]

[DOI]

SIAM J. Comput., 2001

On-Line Load Balancing in a Hierarchical Server Topology.

[BibT_eX]

[DOI]

Ari Freund

SIAM J. Comput., 2001

Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2001

A unified approach to approximating resource allocation and scheduling.

[BibT_eX]

[DOI]

J. ACM, 2001

Tree packing and approximating k-cuts.

[BibT_eX]

[DOI]

Yuval Rabani

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximation algorithms for the metric labeling problem via a new linear programming formulation.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

A deterministic algorithm for the cost-distance problem.

[BibT_eX]

[DOI]

Chandra Chekuri

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem.

[BibT_eX]

[DOI]

Guy Even

Leonid Zosin

SIAM J. Comput., 2000

Message Multicasting in Heterogeneous Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

The Loading Time Scheduling Problem.

[BibT_eX]

[DOI]

Randeep Bhatia

J. Algorithms, 2000

Divide-and-conquer approximation algorithms via spreading metrics.

[BibT_eX]

[DOI]

J. ACM, 2000

Dynamic storage allocation with known durations.

[BibT_eX]

[DOI]

Yael Petruschka

Discret. Appl. Math., 2000

Directed network design with orientation constraints.

[BibT_eX]

[DOI]

F. Bruce Shepherd

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Dynamic session management for static and mobile users: a competitive on-line algorithmic approach.

[BibT_eX]

[DOI]

Yigal Bejerano

Israel Cidon

Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2000), 2000

1999

Fast Approximate Graph Partitioning Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

The Budgeted Maximum Coverage Problem.

[BibT_eX]

[DOI]

Anna Moss

Inf. Process. Lett., 1999

Efficient Recovery from Power Outage (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Approximating the Throughput of Multiple Machines Under Real-Time Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

On-Line Load Banancing in a Hierarchical Server Topology.

[BibT_eX]

[DOI]

Ari Freund

Proceedings of the Algorithms, 1999

1998

Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Scheduled Hot-Potato Routing.

[BibT_eX]

[DOI]

Raphael Rom

J. Graph Algorithms Appl., 1998

Approximating Probability Distributions Using Small Sample Spaces.

[BibT_eX]

[DOI]

Yossi Azar

Comb., 1998

Approximating Minimum Feedback Sets and Multicuts in Directed Graphs.

[BibT_eX]

[DOI]

Algorithmica, 1998

Multicasting in Heterogeneous Networks.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Spreading Metric Based Graph Partitioning Algorithms.

[BibT_eX]

Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

Improved Approximations for Shallow-Light Spanning Trees.

[BibT_eX]

[DOI]

Baruch Schieber

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Routing Strategies for Fast Networks.

[BibT_eX]

[DOI]

Yossi Azar

Raphael Rom

IEEE Trans. Computers, 1996

Tight Bounds for Dynamic Storage Allocation.

[BibT_eX]

[DOI]

Michael Luby

SIAM J. Discret. Math., 1996

Approximation Algorithms for Network Design Problems on Bounded Subsets.

[BibT_eX]

[DOI]

Dorit S. Hochbaum

J. Algorithms, 1996

1995

Flow in Planar Graphs with Multiple Sources and Sinks.

[BibT_eX]

[DOI]

Gary L. Miller

SIAM J. Comput., 1995

Constructions of Permutation Arrays for Certain Scheduling Cost Measures.

[BibT_eX]

[DOI]

Ron M. Roth

Random Struct. Algorithms, 1995

The Competitiveness of On-Line Assignments.

[BibT_eX]

[DOI]

Yossi Azar

Raphael Rom

J. Algorithms, 1995

Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

The Loading Time Scheduling Problem (Extended Abstract).

[BibT_eX]

[DOI]

Randeep Bhatia

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality.

[BibT_eX]

[DOI]

Dorit S. Hochbaum

SIAM J. Comput., 1994

The Probabilistic Method Yields Deterministic Parallel Algorithms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

Flow in Planar Graphs with Vertex Capacities.

[BibT_eX]

[DOI]

Algorithmica, 1994

Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

The Lattice Structure of Flow in Planar Graphs.

[BibT_eX]

[DOI]

Philip N. Klein

SIAM J. Discret. Math., 1993

Small-Bias Probability Spaces: Efficient Constructions and Applications.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality.

[BibT_eX]

[DOI]

Math. Program., 1993

1992

Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

A Linear Time Approach to the Set Maxima Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

The Greedy Algorithm is Optimal for On-Line Edge Coloring.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

1991

An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph.

[BibT_eX]

[DOI]

Algorithmica, 1991

Flow in Planar Graphs: A Survey of Results.

[BibT_eX]

[DOI]

Proceedings of the Planar Graphs, 1991

1990

Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

An Efficient Reconstruction of a Graph from its Line Graph in Parallel.

[BibT_eX]

[DOI]

Mark B. Novick

J. Algorithms, 1990

One-Bit Algorithms.

[BibT_eX]

[DOI]

Distributed Comput., 1990

1989

On Separating the Erew and Crew Pram Models.

[BibT_eX]

[DOI]

Eli Gafni

Prabhakar Ragde

Theor. Comput. Sci., 1989

Fast Parallel Algorithms for Chordal Graphs.

[BibT_eX]

[DOI]

Alejandro A. Schäffer

SIAM J. Comput., 1989

Using Bounded Degree Spanning Trees in the Design of Efficient Algorithms on Claw-Free Graphs.

[BibT_eX]

[DOI]

Mark B. Novick

Proceedings of the Algorithms and Data Structures, 1989

An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract)

[BibT_eX]

[DOI]

Gary L. Miller

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

A Fast Parallel Algorithm to Color a Graph with Delta Colors.

[BibT_eX]

[DOI]

Mauricio Karchmer

J. Algorithms, 1988

Computing a Perfect Matching in a Line Graph.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

אלגוריתמים במערכות מקביליות ומבוזרות (Algorithms in distributed and parallel systems.).

[BibT_eX]

[DOI]

PhD thesis, 1987

A Fast Parallel Coloring of Planar Graphs with Five Colors.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

Fast Parallel Algorithms for Chordal Graphs (Extended Abstract)

[BibT_eX]

[DOI]

Alejandro A. Schäffer

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1984

Multiple Resolution Texture Analysis and Classification.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 1984

1983

Hierarchical image representation for compression, filtering and normalization.

[BibT_eX]

[DOI]

Shmuel Peleg

Pattern Recognit. Lett., 1983

Image Compression and Filtering Using Pyramid Data Structures.

[BibT_eX]