Aravind Srinivasan

David Wajc

CoRR, 2023

Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median.

[BibT_eX]

[DOI]

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

Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Group Fairness in Set Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Efficient and Equitable Deployment of Mobile Vaccine Distribution Centers.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Rawlsian Fairness in Online Bipartite Matching: Two-Sided, Group, and Individual.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Low-complexity scheduling algorithms with constant queue length and throughput guarantees.

[BibT_eX]

[DOI]

Subrahmanya Swamy Peruru

Radha Krishna Ganti

Krishna P. Jagannathan

Perform. Evaluation, 2022

Dependent randomized rounding for clustering and partition systems with knapsack constraints.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2022

Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median.

[BibT_eX]

[DOI]

CoRR, 2022

Dynamic Layout Design Optimization to Improve Patient Flow in Outpatient Clinics Using Genetic Algorithms.

[BibT_eX]

[DOI]

Algorithms, 2022

Effective Social Network-Based Allocation of COVID-19 Vaccines.

[BibT_eX]

[DOI]

Srinivasan Venkatramanan

Arash Haddadan

Parantapa Bhattacharya

Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Forecasting Patient Outcomes in Kidney Exchange.

[BibT_eX]

[DOI]

Naveen Durvasula

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

The Generalized Magician Problem under Unknown Distributions and Related Applications.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Theoretical Models and Preliminary Results for Contact Tracing and Isolation.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

Fair Disaster Containment via Graph-Cut Problems.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

A New Notion of Individually Fair Clustering: α-Equitable k-Center.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Allocation Problems in Ride-sharing Platforms: Online Matching with Offline Reusable Resources.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2021

Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines.

[BibT_eX]

[DOI]

Nikhil Bansal

Ola Svensson

SIAM J. Comput., 2021

Partial resampling to approximate covering integer programs.

[BibT_eX]

[DOI]

Antares Chen

Random Struct. Algorithms, 2021

A Markov Decision Process Framework for Efficient and Implementable Contact Tracing and Isolation.

[BibT_eX]

[DOI]

CoRR, 2021

Fair Disaster Containment via Graph-Cut Problems.

[BibT_eX]

[DOI]

CoRR, 2021

Fair Clustering Under a Bounded Cost.

[BibT_eX]

[DOI]

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

Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes.

[BibT_eX]

[DOI]

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

Property B: Two-Coloring Non-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Approximating Two-Stage Stochastic Supplier Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2021

Follow Your Star: New Frameworks for Online Stochastic Matching with Known and Unknown Patience.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Algorithms to Approximate Column-sparse Packing Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

An intelligent real-time scheduler for out-patient clinics: A multi-agent system model.

[BibT_eX]

[DOI]

Jyoti R. Munavalli

Shyam Vasudeva Rao

Godefridus G. van Merode

Health Informatics J., 2020

Integral patient scheduling in outpatient clinics under demand uncertainty to minimize patient waiting times.

[BibT_eX]

[DOI]

Jyoti R. Munavalli

Shyam Vasudeva Rao

Godefridus G. van Merode

Health Informatics J., 2020

Improved Approximation Algorithms for Stochastic-Matching Problems.

[BibT_eX]

[DOI]

Marek Adamczyk

Fabrizio Grandoni

CoRR, 2020

Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints.

[BibT_eX]

[DOI]

CoRR, 2020

Online Stochastic Matching: New Algorithms and Bounds.

[BibT_eX]

[DOI]

Algorithmica, 2020

Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts.

[BibT_eX]

[DOI]

Algorithmica, 2020

Meddling Metrics: the Effects of Measuring and Constraining Partisan Gerrymandering on Voter Incentives.

[BibT_eX]

[DOI]

Shawn Zhao

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 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

Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours.

[BibT_eX]

[DOI]

Vedant Nanda

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Editorial.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

A Lottery Model for Center-Type Problems With Outliers.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Approximation Algorithms for Stochastic Clustering.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2019

The Moser-Tardos Framework with Partial Resampling.

[BibT_eX]

[DOI]

J. ACM, 2019

Mix and Match: Markov Chains & Mixing Times for Matching in Rideshare.

[BibT_eX]

[DOI]

Michael J. Curry

Yuhao Wan

CoRR, 2019

Vertex-weighted Online Stochastic Matching with Patience Constraints.

[BibT_eX]

[DOI]

Nathaniel Grammel

CoRR, 2019

Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare.

[BibT_eX]

[DOI]

Michael J. Curry

Yuhao Wan

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Online Resource Allocation with Matching Constraints.

[BibT_eX]

[DOI]

Kanthi Kiran Sarpatwar

Kun-Lung Wu

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

A Unified Approach to Online Matching with Conflict-Aware Constraints.

[BibT_eX]

[DOI]

Yongxin Tong

Leonidas Tsepenekas

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Probability and Computing.

[BibT_eX]

[DOI]

SIGACT News, 2018

Approximation Algorithms for Stochastic and Risk-Averse Optimization.

[BibT_eX]

[DOI]

Jaroslaw Byrka

SIAM J. Discret. Math., 2018

A new approximation technique for resource-allocation problems.

[BibT_eX]

[DOI]

Barna Saha

Random Struct. Algorithms, 2018

Improved bounds and algorithms for graph cuts and network reliability.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2018

An Improved Approximation Algorithm for Knapsack Median Using Sparsification.

[BibT_eX]

[DOI]

Algorithmica, 2018

Improved Bounds in Stochastic Matching and Optimization.

[BibT_eX]

[DOI]

Algorithmica, 2018

Hierarchical scheduling algorithms with throughput guarantees and low delay.

[BibT_eX]

[DOI]

Peruru Subrahmanya Swamy

Radha Krishna Ganti

Krishna P. Jagannathan

Proceedings of the 16th International Symposium on Modeling and Optimization in Mobile, 2018

Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

A Constructive Lovász Local Lemma for Permutations.

[BibT_eX]

[DOI]

Theory Comput., 2017

Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

Symmetric Randomized Dependent Rounding.

[BibT_eX]

[DOI]

CoRR, 2017

Better Greedy Sequence Clustering with Fast Banded Alignment.

[BibT_eX]

[DOI]

Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016

Minimum Weighted Completion Time.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

On Computing Maximal Independent Sets of Hypergraphs in Parallel.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2016

Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

A note on near-optimal coloring of shift hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

Efficient computation of sparse structures.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

A constructive algorithm for the LLL on permutations.

[BibT_eX]

[DOI]

CoRR, 2016

New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2015

On the Energy Efficiency of Device Discovery in Mobile Opportunistic Networks: A Systematic Approach.

[BibT_eX]

[DOI]

Jian Li

IEEE Trans. Mob. Comput., 2015

Model-Based Forecasting of Significant Societal Events.

[BibT_eX]

[DOI]

Kristen Maria Summers

IEEE Intell. Syst., 2015

Towards numerical temporal-frequency system modelling of associations between electrocardiogram and ballistocardiogram.

[BibT_eX]

[DOI]

Proceedings of the 37th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2015

Selling Tomorrow's Bargains Today.

[BibT_eX]

[DOI]

Melika Abolhassani

Hossein Esfandiari

MohammadTaghi Hajiaghayi

Hamid Mahini

David L. Malec

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random-Walk Sampling.

[BibT_eX]

[DOI]

Jian Li

IEEE/ACM Trans. Netw., 2014

On Random Sampling Auctions for Digital Goods.

[BibT_eX]

[DOI]

Saeed Alaei

Azarakhsh Malekian

ACM Trans. Economics and Comput., 2014

Review of Visions of Infinity: The Great Mathematical Problems by Ian Stewart.

[BibT_eX]

[DOI]

SIGACT News, 2014

An Improved Approximation for $k$-median, and Positive Correlation in Budgeted Optimization.

[BibT_eX]

[DOI]

CoRR, 2014

A monolithically-integrated optical transmitter and receiver in a zero-change 45nm SOI process.

[BibT_eX]

[DOI]

Proceedings of the Symposium on VLSI Circuits, 2014

A constructive algorithm for the Lovász Local Lemma on permutations.

[BibT_eX]

[DOI]

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

'Beating the news' with EMBERS: forecasting civil unrest using open source indicators.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

2013

Approximation Algorithms for Throughput Maximization in Wireless Networks With Delay Constraints.

[BibT_eX]

[DOI]

Guanhong Pei

Anil Kumar S. Vullikanti

IEEE/ACM Trans. Netw., 2013

Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010).

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Constraint satisfaction, packet routing, and the lovasz local lemma.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Enabling energy-aware collaborative mobile data offloading for smartphones.

[BibT_eX]

[DOI]

Proceedings of the 10th Annual IEEE International Conference on Sensing, 2013

Efficient Computation of Balanced Structures.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Solving Packing Integer Programs via Randomized Rounding with Alterations.

[BibT_eX]

[DOI]

Theory Comput., 2012

Mobile Data Offloading through Opportunistic Communications and Social Participation.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2012

The Effect of Random Edge Removal on Network Degree Sequence.

[BibT_eX]

[DOI]

Stephen G. Eubank

Electron. J. Comb., 2012

Your friends have more friends than you do: identifying influential mobile users through random walks.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2012

Optimizing epidemic protection for socially essential workers.

[BibT_eX]

[DOI]

Proceedings of the ACM International Health Informatics Symposium, 2012

eDiscovery: Energy efficient device discovery for mobile opportunistic communications.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE International Conference on Network Protocols, 2012

Efficient booster pump placement in water networks using graph theoretic principles.

[BibT_eX]

[DOI]

Anand Sivasubramaniam

B. S. Murt

Shankar Narasimhan

Proceedings of the 2012 International Green Computing Conference, 2012

Networking lessons: From computers to water.

[BibT_eX]

[DOI]

Anand Sivasubramaniam

Proceedings of the Fourth International Conference on Communication Systems and Networks, 2012

2011

Capacity of wireless networks under SINR interference constraints.

[BibT_eX]

[DOI]

Deepti Chafekar

Wirel. Networks, 2011

Maximum bipartite flow in networks with adaptive channel width.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

New Constructive Aspects of the Lovász Local Lemma.

[BibT_eX]

[DOI]

Bernhard Haeupler

Barna Saha

J. ACM, 2011

Network Clustering Approximation Algorithm Using One Pass Black Box Sampling

[BibT_eX]

[DOI]

Jennifer Golbeck

CoRR, 2011

Predicting Trust and Distrust in Social Networks.

[BibT_eX]

[DOI]

Jennifer Golbeck

Proceedings of the PASSAT/SocialCom 2011, Privacy, 2011

2010

Mobile data offloading in metropolitan area networks.

[BibT_eX]

[DOI]

Pan Hui

ACM SIGMOBILE Mob. Comput. Commun. Rev., 2010

Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009.

[BibT_eX]

[DOI]

SIGACT News, 2010

LP-rounding algorithms for facility-location problems

[BibT_eX]

[DOI]

Jaroslaw Byrka

Mohammadreza Ghodsi

CoRR, 2010

Cellular traffic offloading through opportunistic communications: a case study.

[BibT_eX]

[DOI]

Proceedings of the 5th ACM workshop on Challenged networks, 2010

Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm.

[BibT_eX]

[DOI]

Jaroslaw Byrka

Chaitanya Swamy

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

On k-Column Sparse Packing Programs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Mélange: Supporting heterogeneous QoS requirements in delay tolerant sensor networks.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Networked Sensing Systems, 2010

2009

A unified approach to scheduling on unrelated parallel machines.

[BibT_eX]

[DOI]

J. ACM, 2009

Scheduling on Unrelated Machines under Tree-Like Precedence Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2009

Rigorous Probabilistic Trust-Inference with Applications to Clustering.

[BibT_eX]

[DOI]

Jennifer Golbeck

Proceedings of the 2009 IEEE/WIC/ACM International Conference on Web Intelligence, 2009

Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks.

[BibT_eX]

[DOI]

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

2008

Minimum Weighted Completion Time.

[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

A note on the distribution of the number of prime factors of the integers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Cost-Sharing Mechanisms for Network Design.

[BibT_eX]

[DOI]

Anupam Gupta

Éva Tardos

Algorithmica, 2008

Improved algorithmic versions of the Lovász Local Lemma.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Capacity of Asynchronous Random-Access Scheduling in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints.

[BibT_eX]

[DOI]

Deepti Chafekar

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

The Randomized Coloring Procedure with Symmetry-Breaking.

[BibT_eX]

[DOI]

Sriram V. Pemmaraju

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Budgeted Allocations in the Full-Information Setting.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2008

Innovization: Discovery of Innovative Design Principles Through Multiobjective Evolutionary Optimization.

[BibT_eX]

[DOI]

Kalyanmoy Deb

Proceedings of the Multiobjective Problem Solving from Nature, 2008

2007

Integrality Ratio for Group Steiner Trees and Directed Steiner Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Efficient lookup on unstructured topologies.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2007

Approximation algorithms for stochastic and risk-averse optimization.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Randomized Algorithms and Probabilistic Analysis in Wireless Networking.

[BibT_eX]

[DOI]

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

Cross-layer latency minimization in wireless networks with SINR constraints.

[BibT_eX]

[DOI]

Deepti Chafekar

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

Distributed Ranked Search.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing, 2007

INT-MANUS: Interactive Production Control in a Distributed Environment.

[BibT_eX]

[DOI]

Anja Herrmann Praturlon

Proceedings of the Human-Computer Interaction. HCI Applications and Services, 2007

2006

Resilient multicast using overlays.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2006

An Improved Approximation Ratio for the Covering Steiner Problem.

[BibT_eX]

[DOI]

Anupam Gupta

Theory Comput., 2006

Client-driven channel management for wireless LANs.

[BibT_eX]

[DOI]

ACM SIGMOBILE Mob. Comput. Commun. Rev., 2006

Review of "The Random Projection Method by Santosh Vempala".

[BibT_eX]

[DOI]

SIGACT News, 2006

An Extension of the Lovász Local Lemma, and its Applications to Integer Programming.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Approximation algorithms for channel allocation problems in broadcast networks.

[BibT_eX]

[DOI]

Networks, 2006

Foreword.

[BibT_eX]

[DOI]

Peter Sanders

Berthold Vöcking

Theory Comput. Syst., 2006

Provable algorithms for parallel generalized sweep scheduling.

[BibT_eX]

[DOI]

Sibylle Zust

J. Parallel Distributed Comput., 2006

An improved approximation algorithm for vertex cover with hard capacities.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Dependent rounding and its applications to approximation algorithms.

[BibT_eX]

[DOI]

Rajiv Gandhi

Samir Khuller

J. ACM, 2006

Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

A Client-Driven Approach for Channel Management in Wireless LANs.

[BibT_eX]

[DOI]

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

Innovization: innovating design principles through optimization.

[BibT_eX]

[DOI]

Kalyanmoy Deb

Proceedings of the Genetic and Evolutionary Computation Conference, 2006

A Population-Based, Parent Centric Procedure for Constrained Real-Parameter Optimization.

[BibT_eX]

[DOI]

Ankur Sinha

Kalyanmoy Deb

Proceedings of the IEEE International Conference on Evolutionary Computation, 2006

2005

Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons.

[BibT_eX]

[DOI]

Devdatt P. Dubhashi

Alessandro Mei

J. Comput. Syst. Sci., 2005

P5: A protocol for scalable anonymous communication.

[BibT_eX]

[DOI]

Rob Sherwood

Bobby Bhattacharjee

J. Comput. Secur., 2005

Algorithmic aspects of capacity in wireless networks.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2005

Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes.

[BibT_eX]

[DOI]

Sibylle Zust

Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

Approximation Algorithms for Scheduling on Multiple Machines.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

Finding Large Independent Sets in Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Hadas Shachnai

SIAM J. Discret. Math., 2004

Special issue: 35th Annual ACM Symposium on Theory of Computing.

[BibT_eX]

[DOI]

Sanjeev Khanna

J. Comput. Syst. Sci., 2004

Approximation algorithms for partial covering problems.

[BibT_eX]

[DOI]

Rajiv Gandhi

Samir Khuller

J. Algorithms, 2004

Lower bounds on the Deterministic and Quantum Communication Complexity of HAMna

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance

[BibT_eX]

[DOI]

CoRR, 2004

End-to-end packet-scheduling in wireless ad-hoc networks.

[BibT_eX]

[DOI]

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

Structural and algorithmic aspects of massive social networks.

[BibT_eX]

[DOI]

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

Scalable resilient media streaming.

[BibT_eX]

[DOI]

Proceedings of the Network and Operating System Support for Digital Audio and Video, 2004

Structure of Social Contact Networks and Their Impact on Epidemics.

[BibT_eX]

[DOI]

Proceedings of the Discrete Methods in Epidemiology, 2004

2003

When does a random Robin Hood win?

[BibT_eX]

[DOI]

William I. Gasarch

Evan Golub

Theor. Comput. Sci., 2003

Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2003

On the approximability of clique and related maximization problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

On the Covering Steiner Problem.

[BibT_eX]

[DOI]

Anupam Gupta

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

Approximating the Domatic Number.

[BibT_eX]

[DOI]

Uriel Feige

Magnús M. Halldórsson

Guy Kortsarz

SIAM J. Comput., 2002

Approximation algorithms for the covering Steiner problem.

[BibT_eX]

[DOI]

Goran Konjevod

R. Ravi

Random Struct. Algorithms, 2002

Wavelength rerouting in optical networks, or the Venetian Routing problem.

[BibT_eX]

[DOI]

J. Algorithms, 2002

P5: A Protocol for Scalable Anonymous Communication.

[BibT_eX]

[DOI]

Rob Sherwood

Bobby Bhattacharjee

Proceedings of the 2002 IEEE Symposium on Security and Privacy, 2002

Clustering and Server Selection using Passive Monitoring.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

Dependent Rounding in Bipartite Graphs.

[BibT_eX]

[DOI]

Rajiv Gandhi

Samir Khuller

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

Improved Approximation Algorithms for the Partial Vertex Cover Problem.

[BibT_eX]

[DOI]

Eran Halperin

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

The one-inclusion graph algorithm is near-optimal for the prediction model of learning.

[BibT_eX]

[DOI]

Yi Li

IEEE Trans. Inf. Theory, 2001

Better Approximation Guarantees for Job-Shop Scheduling.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.

[BibT_eX]

[DOI]

Frank Thomson Leighton

Chi-Jen Lu

Satish Rao

SIAM J. Comput., 2001

Improved Bounds on the Sample Complexity of Learning.

[BibT_eX]

[DOI]

Yi Li

J. Comput. Syst. Sci., 2001

Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 2001

Finding large independent sets of hypergraphs in parallel.

[BibT_eX]

[DOI]

Hadas Shachnai

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Domatic partitions and the Lovász local lemma.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

New approaches to covering and packing problems.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Efficient algorithms for location and sizing problems in network design.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2001

Distributions on Level-Sets with Applications to Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria.

[BibT_eX]

[DOI]

Chung-Piaw Teo

SIAM J. Comput., 2000

Improved bounds and algorithms for hypergraph 2-coloring.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems.

[BibT_eX]

[DOI]

Alok Baveja

Math. Oper. Res., 2000

Retrieval Scheduling for Collaborative Multimedia Presentations.

[BibT_eX]

[DOI]

Ping Bai

B. Prabhakaran

Multim. Syst., 2000

Improved Algorithms via Approximations of Probability Distributions.

[BibT_eX]

[DOI]

Suresh Chari

Pankaj Rohatgi

J. Comput. Syst. Sci., 2000

Contention resolution with constant expected delay.

[BibT_eX]

[DOI]

J. ACM, 2000

Low discrepancy sets yield approximate min-wise independent permutation families.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Approximating low-congestion routing and column-restricted packing problems.

[BibT_eX]

[DOI]

Alok Baveja

Inf. Process. Lett., 2000

Approximating Hyper-Rectangles: Learning and Pseudo-random Sets

[BibT_eX]

[DOI]

Peter Auer

Electron. Colloquium Comput. Complex., 2000

The value of strong inapproximability results for clique.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Optimal Design of Signaling Networks for Internet Telephony.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999

Computing with Very Weak Random Sources.

[BibT_eX]

[DOI]

David Zuckerman

SIAM J. Comput., 1999

Improved Approximation Guarantees for Packing and Covering Integer Programs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.

[BibT_eX]

[DOI]

Frank Thomson Leighton

Satish Rao

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

Application-layer broker for scalable Internet services with resource reservation.

[BibT_eX]

[DOI]

Ping Bai

B. Prabhakaran

Proceedings of the 7th ACM International Conference on Multimedia '99, Orlando, FL, USA, October 30, 1999

1998

Approximating Hyper-Rectangles: Learning and Pseudorandom Sets.

[BibT_eX]

[DOI]

Peter Auer

J. Comput. Syst. Sci., 1998

Explicit OR-Dispersers with Polylogarithmic Degree.

[BibT_eX]

[DOI]

Michael E. Saks

Shiyu Zhou

J. ACM, 1998

Low-Bandwidth Routing and Electrical Power Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Multicommodity Flow and Circuit Switching.

[BibT_eX]

[DOI]

Tom Leighton

Satish Rao

Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

Improved Bounds and Algorithms for Hypergraph Two-Coloring.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

Improved Parallel Approximation of a Class of Integer Programming Problems.

[BibT_eX]

[DOI]

Noga Alon

Algorithmica, 1997

Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.

[BibT_eX]

[DOI]

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

Mechanism design for intellectual property rights protection.

[BibT_eX]

[DOI]

P. S. Giridharan

Proceedings of the Eighteenth International Conference on Information Systems, 1997

Improved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing Problems.

[BibT_eX]

[DOI]

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

A survey of the role of multicommodity flow and randomization in network design and routing.

[BibT_eX]

[DOI]

Proceedings of the Randomization Methods in Algorithm Design, 1997

1996

On the Complexity of Distributed Network Decomposition.

[BibT_eX]

[DOI]

J. Algorithms, 1996

Improved Parallel Approximation of a Class of Integer Programming Programming Problems.

[BibT_eX]

[DOI]

Noga Alon

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995

Chernoff-Hoeffding Bounds for Applications with Limited Independence.

[BibT_eX]

[DOI]

Jeanette P. Schmidt

Alan Siegel

SIAM J. Discret. Math., 1995

Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems.

[BibT_eX]

[DOI]

Suresh Chari

Pankaj Rohatgi

SIAM J. Comput., 1995

The Local Natur of Delta-Coloring and its Algorithmic Applications.

[BibT_eX]

[DOI]

Comb., 1995

Improved approximations of packing and covering problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Explicit dispersers with polylog degree.

[BibT_eX]

[DOI]

Michael E. Saks

Shiyu Zhou

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Contention Resolution with Bounded Delay.

[BibT_eX]

[DOI]

Mike Paterson

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

Splitters and Near-Optimal Derandomization.

[BibT_eX]

[DOI]

Moni Naor

Leonard J. Schulman

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

1994

Improved algorithms via approximations of probability distributions (extended abstract).

[BibT_eX]

[DOI]

Suresh Chari

Pankaj Rohatgi

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993

Techniques for Probabilistic Analysis and Randomness-Efficient Computation.

[BibT_eX]

PhD thesis, 1993

1992

Improved Distributed Algorithms for Coloring and Network Decomposition Problems

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991

On Finding the Minimum Bandwidth of Interval Graphs

[BibT_eX]

[DOI]

R. Mahesh

C. Pandu Rangan

Inf. Comput., December, 1991

Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs.

[BibT_eX]

[DOI]