Samir Khuller

Manish Purohit

Kanthi K. Sarpatwar

SIAM J. Discret. Math., 2020

On Scheduling Coflows.

[BibT_eX]

[DOI]

Algorithmica, 2020

Multi-transversals for Triangles and the Tuza's Conjecture.

[BibT_eX]

[DOI]

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

An Algorithm for Multi-Attribute Diverse Matching.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

A Pairwise Fair and Community-preserving Approach to k-Center Clustering.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

2019

Select and permute: An improved online framework for scheduling to minimize weighted completion time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Algorithms for Optimal Diverse Matching.

[BibT_eX]

[DOI]

CoRR, 2019

Min-Max Correlation Clustering via MultiCut.

[BibT_eX]

[DOI]

CoRR, 2019

Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm.

[BibT_eX]

[DOI]

Sheng Yang

Algorithmica, 2019

Near Optimal Coflow Scheduling in Networks.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Min-Max Correlation Clustering via MultiCut.

[BibT_eX]

[DOI]

Saba Ahmadi

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

On the Cost of Essentially Fair Clusterings.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2019

2018

Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms.

[BibT_eX]

[DOI]

Riley Murray

Megan Chao

Algorithmica, 2018

Brief Announcement: A Greedy 2 Approximation for the Active Time Problem.

[BibT_eX]

[DOI]

Saurabh Kumar

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Ring graphs in VR: exploring a new and novel method for node placement and link visibility in VR-based graph analysis.

[BibT_eX]

[DOI]

Proceedings of the SIGGRAPH Asia 2018 Posters, Tokyo, Japan, December 04-07, 2018, 2018

Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem.

[BibT_eX]

[DOI]

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Greedy Methods.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

LP rounding and combinatorial algorithms for minimizing active and busy time.

[BibT_eX]

[DOI]

Jessica Chang

Koyel Mukherjee

J. Sched., 2017

Busy Time Scheduling on a Bounded Number of Machines (Extended Abstract).

[BibT_eX]

[DOI]

Frederic Koehler

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

On Scheduling Coflows - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

Graph Connectivity.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Assignment Problem.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms [Full Version].

[BibT_eX]

[DOI]

Riley Murray

Megan Chao

CoRR, 2016

New Approximation Results for Resource Replication Problems.

[BibT_eX]

[DOI]

Kanthi K. Sarpatwar

Algorithmica, 2016

Brief Announcement: Improved Approximation Algorithms for Scheduling Co-Flows.

[BibT_eX]

[DOI]

Manish Purohit

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Minimizing Uncertainty through Sensor Placement with Angle Constraints.

[BibT_eX]

Ioana Oriana Bercea

Volkan Isler

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

Revisiting Connected Dominating Sets: An Optimal Local Algorithm?

[BibT_eX]

[DOI]

Sheng Yang

Proceedings of the Approximation, 2016

2015

On Correcting Inputs: Inverse Optimization for Online Structured Prediction.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

SWORD: workload-aware data placement and replica selection for cloud data management systems.

[BibT_eX]

[DOI]

VLDB J., 2014

Facility location with red-blue demands.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

A Model for Minimizing Active Processor Time.

[BibT_eX]

[DOI]

Jessica Chang

Harold N. Gabow

Algorithmica, 2014

Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems.

[BibT_eX]

[DOI]

Manish Purohit

Kanthi K. Sarpatwar

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

Graph and Network Algorithms.

[BibT_eX]

Proceedings of the Computing Handbook, 2014

2013

Discrete Algorithms Meet Machine Learning (NII Shonan Meeting 2013-6).

[BibT_eX]

[DOI]

Hal Daumé III

Kevin Duh

NII Shonan Meet. Rep., 2013

Data Placement and Replica Selection for Improving Co-location in Distributed Environments

[BibT_eX]

[DOI]

K. Ashwin Kumar

CoRR, 2013

Resolving spatial inconsistencies in chromosome conformation measurements.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2013

Optimal Batch Schedules for Parallel Machines.

[BibT_eX]

[DOI]

Frederic Koehler

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Algorithms for the Thermal Scheduling Problem.

[BibT_eX]

[DOI]

Koyel Mukherjee

Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

To send or not to send: Reducing the cost of data transmission.

[BibT_eX]

[DOI]

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

A Min-Edge Cost Flow Framework for Capacitated Covering Problems.

[BibT_eX]

[DOI]

Jessica Chang

Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013

2012

Special Issue in Honor of Rajeev Motwani (1962-2009): Guest Editors' Foreword.

[BibT_eX]

[DOI]

Theory Comput., 2012

Algorithms column: An overview of the recent progress on matrix multiplication by Virginia Vassilevska Williams.

[BibT_eX]

[DOI]

SIGACT News, 2012

The load-distance balancing problem.

[BibT_eX]

[DOI]

Networks, 2012

Performance tradeoffs in structured peer to peer streaming.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2012

Improved Approximation Algorithms for Data Migration.

[BibT_eX]

[DOI]

Yoo-Ah Kim

Azarakhsh Malekian

Algorithmica, 2012

Resolving Spatial Inconsistencies in Chromosome Conformation Data.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

Saving on cooling: the thermal scheduling problem.

[BibT_eX]

[DOI]

Koyel Mukherjee

Proceedings of the ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, 2012

Set Cover Revisited: Hypergraph Cover with Hard Capacities.

[BibT_eX]

[DOI]

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

LP Rounding for k-Centers with Non-uniform Hard Capacities.

[BibT_eX]

[DOI]

Marek Cygan

MohammadTaghi Hajiaghayi

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

To fill or not to fill: The gas station problem.

[BibT_eX]

[DOI]

Azarakhsh Malekian

Julián Mestre

ACM Trans. Algorithms, 2011

Broadcast scheduling: Algorithms and complexity.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Relay placement for fault tolerance in wireless networks in higher dimensions.

[BibT_eX]

[DOI]

Abhishek Kashyap

Mark A. Shayman

Comput. Geom., 2011

Energy Efficient Monitoring in Sensor Networks.

[BibT_eX]

[DOI]

Algorithmica, 2011

Generalized Machine Activation Problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Link Prediction for Annotation Graphs Using Graph Summarization.

[BibT_eX]

[DOI]

Proceedings of the Semantic Web - ISWC 2011, 2011

2010

Achieving anonymity via clustering.

[BibT_eX]

[DOI]

Krishnaram Kenthapadi

ACM Trans. Algorithms, 2010

SIGACT news algorithms column: computation in large-scale scientific and internet data applications is a focus of MMDS 2010.

[BibT_eX]

[DOI]

Michael W. Mahoney

SIGACT News, 2010

Broadcasting on Networks of Workstations.

[BibT_eX]

[DOI]

Yoo-Ah Kim

Richard Matthew McCutchen

Algorithmica, 2010

New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract).

[BibT_eX]

[DOI]

Benjamin Moseley

Louiqa Raschid

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2010

On Computing Compression Trees for Data Collection in Wireless Sensor Networks.

[BibT_eX]

[DOI]

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

Energy Efficient Scheduling via Partial Shutdown.

[BibT_eX]

[DOI]

Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

2009

Approximation algorithms for data placement on parallel disks.

[BibT_eX]

[DOI]

Sanjeev Khanna

Ramakrishna Thurimella

ACM Trans. Algorithms, 2009

On Computing Compression Trees for Data Collection in Sensor Networks

[BibT_eX]

[DOI]

CoRR, 2009

Online allocation of display advertisements subject to advanced sales contracts.

[BibT_eX]

[DOI]

Proceedings of the 3rd ACM SIGKDD Workshop on Data Mining and Audience Intelligence for Advertising, 2009

On the tradeoff between playback delay and buffer space in streaming.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Minimizing Communication Cost in Distributed Multi-query Processing.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Data Engineering, 2009

On Finding Dense Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Graph Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Assignment Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Efficient and Resilient Backbones for Multihop Wireless Networks.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2008

An Optimal Incremental Algorithm for Minimizing Lateness with Rejection.

[BibT_eX]

[DOI]

Richard Matthew McCutchen

Julián Mestre

Proceedings of the Algorithms, 2008

Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2008

2007

Broadcasting on Networks of Workstations.

[BibT_eX]

[DOI]

Yoo-Ah Kim

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Greedy Methods.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Introduction.

[BibT_eX]

[DOI]

SIGACT News, 2007

Integrated topology control and routing in wireless optical mesh networks.

[BibT_eX]

[DOI]

Comput. Networks, 2007

Computing most probable worlds of action probabilistic logic programs: scalable estimation for 1030, 000 worlds.

[BibT_eX]

[DOI]

Maria Vanina Martinez

Ann. Math. Artif. Intell., 2007

Broadcasting in Heterogeneous Networks.

[BibT_eX]

[DOI]

Algorithmica, 2007

Finding Most Probable Worlds of Probabilistic Logic Programs.

[BibT_eX]

[DOI]

Maria Vanina Martinez

Proceedings of the Scalable Uncertainty Management, First International Conference, 2007

2006

Problems column.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

Approximation algorithms for channel allocation problems in broadcast networks.

[BibT_eX]

[DOI]

Networks, 2006

An improved approximation algorithm for vertex cover with hard capacities.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

On generalized gossiping and broadcasting.

[BibT_eX]

[DOI]

J. Algorithms, 2006

Algorithms for non-uniform size data placement on parallel disks.

[BibT_eX]

[DOI]

Srinivas R. Kashyap

J. Algorithms, 2006

Dependent rounding and its applications to approximation algorithms.

[BibT_eX]

[DOI]

Srinivasan Parthasarathy

Aravind Srinivasan

J. ACM, 2006

Approximating the Minimal Sensor Selection for Supervisory Control.

[BibT_eX]

[DOI]

Kurt Rohloff

Guy Kortsarz

Discret. Event Dyn. Syst., 2006

OMNI: An efficient overlay multicast infrastructure for real-time applications.

[BibT_eX]

[DOI]

Suman Banerjee

Christopher Kommareddy

Koushik Kar

Bobby Bhattacharjee

Comput. Networks, 2006

Data Migration on Parallel Disks: Algorithms and Evaluation.

[BibT_eX]

[DOI]

Svetlana Shargorodskaya

Algorithmica, 2006

A robust maximum completion time measure for scheduling.

[BibT_eX]

[DOI]

Moses Charikar

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Relay Placement for Higher Order Connectivity in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Abhishek Kashyap

Mark A. Shayman

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

Query Planning in the Presence of Overlapping Sources.

[BibT_eX]

[DOI]

Proceedings of the Advances in Database Technology, 2006

Improved Algorithms for Data Migration.

[BibT_eX]

[DOI]

Azarakhsh Malekian

Proceedings of the Approximation, 2006

Fast Reconfiguration of Data Placement in Parallel Disks.

[BibT_eX]

[DOI]

Srinivas R. Kashyap

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

2005

Four colors suffice!

[BibT_eX]

[DOI]

SIGACT News, 2005

On Degree Constrained Shortest Paths.

[BibT_eX]

[DOI]

Kwangil Lee

Mark A. Shayman

Proceedings of the Algorithms, 2005

2004

Algorithms for Data Migration with Cloning.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

Equivalence of two linear programming relaxations for broadcast scheduling.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

A coordinated data collection approach: design, evaluation, and comparison.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2004

Approximation algorithms for partial covering problems.

[BibT_eX]

[DOI]

Aravind Srinivasan

J. Algorithms, 2004

Guest Editors' Introduction.

[BibT_eX]

[DOI]

Klaus Jansen

Algorithmica, 2004

Algorithms for Minimizing Response Time in Broadcast Scheduling.

[BibT_eX]

[DOI]

Algorithmica, 2004

On broadcasting in heterogenous networks.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Data Migration on Parallel Disks.

[BibT_eX]

[DOI]

Svetlana Shargorodskaya

Proceedings of the Algorithms, 2004

Approximation Schemes for Broadcasting in Heterogenous Networks.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Proceedings of the Approximation, 2004

2003

On Local Search and Placement of Meters in Networks.

[BibT_eX]

[DOI]

Randeep Bhatia

Robert Pless

SIAM J. Comput., 2003

Capacitated vertex covering.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Bistro: a scalable and secure data transfer service for digital government applications.

[BibT_eX]

[DOI]

Commun. ACM, 2003

Large-scale Data Collection: a Coordinated Approach.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

Construction of an Efficient Overlay Multicast Infrastructure for Real-time Applications.

[BibT_eX]

[DOI]

Suman Banerjee

Christopher Kommareddy

Koushik Kar

Samrat Bhattacharjee

Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

On Generalized Gossiping and Broadcasting (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

A performance study of Bistro, a scalable upload architecture.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2002

Algorithms column: the vertex cover problem.

[BibT_eX]

[DOI]

SIGACT News, 2002

The General Steiner Tree-Star problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

On directed Steiner trees.

[BibT_eX]

[DOI]

Leonid Zosin

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Capacitated vertex covering with applications.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Dependent Rounding in Bipartite Graphs.

[BibT_eX]

[DOI]

Srinivasan Parthasarathy

Aravind Srinivasan

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Scalable and Secure Data Collection Using Bistro.

[BibT_eX]

[DOI]

Cheng-Fu Chou

William C. Cheng

Proceedings of the 2002 Annual National Conference on Digital Government Research, 2002

2001

Algorithms column.

[BibT_eX]

[DOI]

SIGACT News, 2001

Algorithms for Capacitated Vehicle Routing.

[BibT_eX]

[DOI]

Moses Charikar

SIAM J. Comput., 2001

Optimal collective dichotomous choice under partial order constraints.

[BibT_eX]

[DOI]

Ruth Ben-Yashar

Sarit Kraus

Math. Soc. Sci., 2001

z-Approximations.

[BibT_eX]

[DOI]

Refael Hassin

J. Algorithms, 2001

Algorithms for facility location problems with outliers.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

A Clustering Scheme for Hierarchical Control in Multi-hop Wireless Networks.

[BibT_eX]

[DOI]

Suman Banerjee

Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

2000

Fault tolerant K-center problems.

[BibT_eX]

[DOI]

Robert Pless

Yoram J. Sussmann

Theor. Comput. Sci., 2000

Bistro: a framework for building scalable wide-area Upload applications.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2000

The Capacitated K-Center Problem.

[BibT_eX]

[DOI]

Yoram J. Sussmann

SIAM J. Discret. Math., 2000

The full-degree spanning tree problem.

[BibT_eX]

[DOI]

Networks, 2000

The Loading Time Scheduling Problem.

[BibT_eX]

[DOI]

Randeep Bhatia

J. Algorithms, 2000

Addendum to "An O(|V|2) algorithm for single connectedness".

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Centers of sets of pixels.

[BibT_eX]

[DOI]

Angela Y. Wu

Discret. Appl. Math., 2000

Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem.

[BibT_eX]

[DOI]

Algorithmica, 2000

1999

The Book Review Column.

[BibT_eX]

[DOI]

William I. Gasarch

SIGACT News, 1999

Bases for Polynomial Invariants of Conjugates of Permutation Groups.

[BibT_eX]

[DOI]

Manfred Göbel

Jochen Walter

J. Algorithms, 1999

Open Problems Presented at SCG'98.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Joseph O'Rourke

J. Algorithms, 1999

Greedy Strikes Back: Improved Facility Location Algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 1999

The Budgeted Maximum Coverage Problem.

[BibT_eX]

[DOI]

Anna Moss

Inf. Process. Lett., 1999

An O(|V|2) algorithm for single connectedness.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets.

[BibT_eX]

[DOI]

Inf. Comput., 1999

A Uniform Framework for Approximating Weighted Connectivity Problems.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Basic Graph Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

Advanced Combinatorial Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Graphbots: cooperative motion planning in discrete spaces.

[BibT_eX]

[DOI]

Ehud Rivlin

IEEE Trans. Syst. Man Cybern. Part C, 1998

Book review: Selected Papers on Computer Science by Donald E. Knuth.

[BibT_eX]

[DOI]

SIGACT News, 1998

Open problems: 16.

[BibT_eX]

[DOI]

SIGACT News, 1998

Facility Location with Dynamic Distance Functions.

[BibT_eX]

[DOI]

J. Comb. Optim., 1998

Approximation Algorithms for Connected Dominating Sets.

[BibT_eX]

[DOI]

Algorithmica, 1998

Facility Location with Dynamic Distance Function (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1998

1997

Open problems: 15.

[BibT_eX]

[DOI]

SIGACT News, 1997

Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1997

A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Connected facility location problems.

[BibT_eX]

[DOI]

Proceedings of the Network Design: Connectivity and Facilities Location, 1997

Graph and Network Algorithms.

[BibT_eX]

Proceedings of the Computer Science and Engineering Handbook, 1997

1996

Open Problems 14.

[BibT_eX]

[DOI]

SIGACT News, 1996

Open Problems: 13.

[BibT_eX]

[DOI]

SIGACT News, 1996

Low-Degree Spanning Trees of Small Weight.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

Improved Approximation Algorithms for Uniform Connectivity Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1996

On Strongly Connected Digraphs with Bounded Cycle Length.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

Landmarks in Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

Graph and Network Algorithms.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1996

The Capacitated K-Center Problem (Extended Abstract).

[BibT_eX]

[DOI]

Yoram J. Sussmann

Proceedings of the Algorithms, 1996

1995

A Simple Randomized Sieve Algorithm for the Closest-Pair Problem

[BibT_eX]

[DOI]

Yossi Matias

Inf. Comput., April, 1995

Open Problems: 11.

[BibT_eX]

[DOI]

SIGACT News, 1995

Approximating the Minimum Equivalent Digraph.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality.

[BibT_eX]

[DOI]

J. Algorithms, 1995

Balancing Minimum Spanning Trees and Shortest-Path Trees.

[BibT_eX]

[DOI]

Algorithmica, 1995

Graphbots: Mobility in Discrete Spaces.

[BibT_eX]

[DOI]

Ehud Rivlin

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 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

On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages.

[BibT_eX]

[DOI]

Stephen G. Mitchell

Vijay V. Vazirani

Theor. Comput. Sci., 1994

A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers.

[BibT_eX]

[DOI]

J. Algorithms, 1994

Biconnectivity Approximations and Graph Carvings.

[BibT_eX]

[DOI]

J. ACM, 1994

On the Parallel Complexity of Digraph Reachability.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Designing Multi-Commodity Flow Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Flow in Planar Graphs with Vertex Capacities.

[BibT_eX]

[DOI]

Algorithmica, 1994

Approximating the Minimum Equivalent Diagraph.

[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

Approximation Algorithms for Graph Augmentation.

[BibT_eX]

[DOI]

Ramakrishna Thurimella

J. Algorithms, 1993

Geometric Knapsack Problems.

[BibT_eX]

[DOI]

Esther M. Arkin

Joseph S. B. Mitchell

Algorithmica, 1993

Balancing Minimum Spanning and Shortest Path Trees.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

A primal-dual parallel approximation technique applied to weighted set and vertex cover.

[BibT_eX]

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992

Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph.

[BibT_eX]

[DOI]

Stephen G. Mitchell

Vijay V. Vazirani

SIAM J. Comput., 1992

On Independent Spanning Trees.

[BibT_eX]

[DOI]

Baruch Schieber

Inf. Process. Lett., 1992

Efficient Minimum Cost Matching Using Quadrangle Inequality

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Planar Graph Coloring is not Self-Reducible, Assuming P != NP.

[BibT_eX]

[DOI]

Vijay V. Vazirani

Theor. Comput. Sci., 1991

Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs.

[BibT_eX]

[DOI]

Baruch Schieber

SIAM J. Comput., 1991

Flow in Planar Graphs: A Survey of Results.

[BibT_eX]

[DOI]

Proceedings of the Planar Graphs, 1991

1990

Extending Planar Graph Algorithms to K_3,3-Free Graphs

[BibT_eX]

[DOI]

Inf. Comput., January, 1990

Efficient Parallel Algorithms for Disjoint Paths and Connectivity.

[BibT_eX]

PhD thesis, 1990

Open problems.

[BibT_eX]

[DOI]

SIGACT News, 1990

On a Triangle Counting Problem.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Inf. Process. Lett., 1990

Coloring Algorithms for K_5-Minor Free Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

1989

Open problems: 3.

[BibT_eX]

[DOI]

SIGACT News, 1989

On Computing Graph Closures.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

Parallel Algorithms for the Subgraph Homeomorphism Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1989

Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)

[BibT_eX]

[DOI]

Baruch Schieber

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

1988

Extending Planar Graph Algorithms to K 3, 3-free Graphs.

[BibT_eX]

[DOI]