Mohit Singh

CoRR, 2024

Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs.

[BibT_eX]

[DOI]

Adam Brown

Aditi Laddha

Madhusudhan Reddy Pittu

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

2023

Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021.

[BibT_eX]

[DOI]

Santanu S. Dey

David P. Williamson

Math. Program., February, 2023

Balancing Notions of Equity: Approximation Algorithms for Fair Portfolio of Solutions in Combinatorial Optimization.

[BibT_eX]

[DOI]

Swati Gupta

Jai Moondra

CoRR, 2023

An Online Self-calibrating Refractive Camera Model with Application to Underwater Odometry.

[BibT_eX]

[DOI]

Mihir Dharmadhikari

Kostas Alexis

CoRR, 2023

Linear Programming based Reductions for Multiple Visit TSP and Vehicle Routing Problems.

[BibT_eX]

[DOI]

Aditya Pillai

CoRR, 2023

Which Lp norm is the fairest? Approximations for fair facility location across all "p".

[BibT_eX]

[DOI]

Swati Gupta

Jai Moondra

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Fast and Lightweight UAV-based Road Image Enhancement Under Multiple Low-Visibility Conditions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events, 2023

Attention-enabled Deep Neural Network for Enhancing UAV-Captured Pavement Imagery in Poor Visibility.

[BibT_eX]

[DOI]

Proceedings of the 6th IEEE International Conference on Multimedia Information Processing and Retrieval, 2023

An Improved Approximation Algorithm for the Max-3-Section Problem.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Adaptive Bin Packing with Overflow.

[BibT_eX]

[DOI]

Math. Oper. Res., November, 2022

Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

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

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

Socially fair network design via iterative rounding.

[BibT_eX]

[DOI]

Aditi Laddha

Oper. Res. Lett., 2022

Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design.

[BibT_eX]

[DOI]

Aleksandar Nikolov

Uthaipon Tao Tantipongpipat

Math. Oper. Res., 2022

Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency.

[BibT_eX]

[DOI]

Ishai Menache

Oper. Res., 2022

Heterogeneous Multi-resource Allocation with Subset Demand Requests.

[BibT_eX]

[DOI]

Arden Baxter

Pinar Keskinocak

INFORMS J. Comput., 2022

Visibility enhancement and dehazing: Research contribution challenges and direction.

[BibT_eX]

[DOI]

Vijay Laxmi

Parvez Faruki

Comput. Sci. Rev., 2022

Socially Fair and Hierarchical Facility Location Problems.

[BibT_eX]

[DOI]

Swati Gupta

Jai Moondra

CoRR, 2022

Efficient Determinant Maximization for All Matroids.

[BibT_eX]

[DOI]

CoRR, 2022

The IID Prophet Inequality with Limited Flexibility.

[BibT_eX]

[DOI]

CoRR, 2022

Constant-Factor Approximation Algorithms for Socially Fair k-Clustering.

[BibT_eX]

[DOI]

Mehrdad Ghadiri

CoRR, 2022

Dense spatially-weighted attentive residual-haze network for image dehazing.

[BibT_eX]

[DOI]

Vijay Laxmi

Parvez Faruki

Appl. Intell., 2022

Determinant Maximization via Matroid Intersection Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Detecting Secure Memory Deallocation Violations with CBMC.

[BibT_eX]

[DOI]

Proceedings of the 8th ACM on Cyber-Physical System Security Workshop, 2022

2021

Timing Matters: Online Dynamics in Broadcast Games.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2021

Effect of Discrete Breathers on the Specific Heat of a Nonlinear Chain.

[BibT_eX]

[DOI]

J. Nonlinear Sci., 2021

Structured Robust Submodular Maximization: Offline and Online Algorithms.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2021

Robust Online Selection with Uncertain Offer Acceptance.

[BibT_eX]

[DOI]

CoRR, 2021

A Highly Maneuverable Hybrid Energy-Efficient Rolling/Flying System.

[BibT_eX]

[DOI]

Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2021

Amplitude Recovery of Saturated Sinusoidal Signals.

[BibT_eX]

[DOI]

Ravi Abhishek Shankar

Proceedings of the 2021 IEEE Sensors, Sydney, Australia, October 31 - Nov. 3, 2021, 2021

2020

Approximation Algorithms for <i>D</i>-optimal Design.

[BibT_eX]

[DOI]

Math. Oper. Res., 2020

Rank one tensor completion problem.

[BibT_eX]

[DOI]

Alexander Shapiro

Rui Zhang

CoRR, 2020

Online Adaptive Bin Packing with Overflow.

[BibT_eX]

[DOI]

CoRR, 2020

Simple Graph Density Inequalities with No Sum of Squares Proofs.

[BibT_eX]

[DOI]

Comb., 2020

Towards Bone Aware Image Enhancement in Musculoskeletal Ultrasound Imaging.

[BibT_eX]

[DOI]

Mahesh Raveendranatha Panicker

K. V. Rajagopal

Proceedings of the 2020 IEEE Region 10 Conference, 2020

Magnetic Position Tracking using Inductor Coils and IMU.

[BibT_eX]

[DOI]

Ravi Abhishek Shankar

Proceedings of the 2020 IEEE Sensors, Rotterdam, The Netherlands, October 25-28, 2020, 2020

On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness.

[BibT_eX]

[DOI]

Sebastian Pokutta

Alfredo Torrico

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

Maximizing Determinants under Matroid Constraints.

[BibT_eX]

[DOI]

Vivek Madan

Aleksandar Nikolov

Uthaipon Tantipongpipat

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Integrality gap of the vertex cover linear programming relaxation.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2019

Online and Offline Greedy Algorithms for Routing with Switching Costs.

[BibT_eX]

[DOI]

Roy Schwartz

Sina Yazdanbod

CoRR, 2019

Fair Dimensionality Reduction and Iterative Rounding for SDPs.

[BibT_eX]

[DOI]

Jamie Morgenstern

Samira Samadi

Uthaipon Tao Tantipongpipat

CoRR, 2019

LESS: A Matrix Split and Balance Algorithm for Parallel Circuit (Optical) or Hybrid Data Center Switching and More.

[BibT_eX]

[DOI]

Liang Liu

Jun (Jim) Xu

Proceedings of the 12th IEEE/ACM International Conference on Utility and Cloud Computing, 2019

Multi-Criteria Dimensionality Reduction with Applications to Fairness.

[BibT_eX]

[DOI]

Uthaipon Tantipongpipat

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Online and Offline Algorithms for Circuit Switch Scheduling.

[BibT_eX]

[DOI]

Roy Schwartz

Sina Yazdanbod

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

Combinatorial Algorithms for Optimal Design.

[BibT_eX]

[DOI]

Vivek Madan

Uthaipon Tantipongpipat

Proceedings of the Conference on Learning Theory, 2019

2018

Approximating Minimum Cost Connectivity Orientation and Augmentation.

[BibT_eX]

[DOI]

László A. Végh

SIAM J. Comput., 2018

Efficient algorithms for discrepancy minimization in convex sets.

[BibT_eX]

[DOI]

Ronen Eldan

Random Struct. Algorithms, 2018

k-Trails: recognition, complexity, and approximations.

[BibT_eX]

[DOI]

Rico Zenklusen

Math. Program., 2018

Symmetric sums of squares over k-subset hypercubes.

[BibT_eX]

[DOI]

Math. Program., 2018

Efficient algorithms for robust submodular maximization under matroid constraints.

[BibT_eX]

[DOI]

Sebastian Pokutta

Alfredo Torrico

CoRR, 2018

Approximate Positively Correlated Distributions and Approximation Algorithms for D-optimal Design.

[BibT_eX]

[DOI]

CoRR, 2018

Approximate Positive Correlated Distributions and Approximation Algorithms for D-optimal Design.

[BibT_eX]

[DOI]

Uthaipon Tao Tantipongpipat

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

The Price of Fair PCA: One Extra dimension.

[BibT_eX]

[DOI]

Samira Samadi

Jamie Morgenstern

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017

LP-Based Algorithms for Capacitated Facility Location.

[BibT_eX]

[DOI]

Hyung-Chan An

Ola Svensson

SIAM J. Comput., 2017

Robust Submodular Maximization: Offline and Online Algorithms.

[BibT_eX]

[DOI]

CoRR, 2017

High-definition wireless personal area tracking using AC magnetic field for virtual reality.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Virtual Reality, 2017

Minimum Birkhoff-von Neumann Decomposition.

[BibT_eX]

[DOI]

Janardhan Kulkarni

Euiwoong Lee

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Random Walks in Polytopes and Negative Dependence.

[BibT_eX]

[DOI]

Yuval Peres

Nisheeth K. Vishnoi

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Nash Social Welfare, Matrix Permanent, and Stable Polynomials.

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

An Improved Integrality Gap for Asymmetric TSP Paths.

[BibT_eX]

[DOI]

Zachary Friggstad

Anupam Gupta

Math. Oper. Res., 2016

Maximizing determinants under partition constraints.

[BibT_eX]

[DOI]

Aleksandar Nikolov

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Live demonstration: High-definition wireless personal area tracking using AC magnetic field.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE SENSORS, Orlando, FL, USA, October 30 - November 3, 2016, 2016

2015

Sharing Buffer Pool Memory in Multi-Tenant Relational Database-as-a-Service.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2015

Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal.

[BibT_eX]

[DOI]

J. ACM, 2015

Symmetry in Turán Sums of Squares Polynomials from Flag Algebras.

[BibT_eX]

[DOI]

Annie Raymond

Rekha R. Thomas

CoRR, 2015

A geometric alternative to Nesterov's accelerated gradient descent.

[BibT_eX]

[DOI]

Sébastien Bubeck

Yin Tat Lee

CoRR, 2015

Online Caching with Convex Costs: Extended Abstract.

[BibT_eX]

[DOI]

Ishai Menache

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

On Weighted Bipartite Edge Coloring.

[BibT_eX]

[DOI]

Arindam Khan

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

2014

New approaches to multi-objective optimization.

[BibT_eX]

[DOI]

Math. Program., 2014

Secretary Problems via Linear Programming.

[BibT_eX]

[DOI]

Niv Buchbinder

Math. Oper. Res., 2014

Measurement-based performance analysis of wind energy systems.

[BibT_eX]

[DOI]

IEEE Instrum. Meas. Mag., 2014

Multi-Level Pseudo Random Sequence Generation for Coherent Optical Transmission Systems.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2014

Entropy, optimization and counting.

[BibT_eX]

[DOI]

Nisheeth K. Vishnoi

Proceedings of the Symposium on Theory of Computing, 2014

Short Tours through Large Linear Forests.

[BibT_eX]

[DOI]

Uriel Feige

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

Discrepancy Without Partial Colorings.

[BibT_eX]

[DOI]

Nicholas J. A. Harvey

Roy Schwartz

Proceedings of the Approximation, 2014

Approximation Algorithms.

[BibT_eX]

[DOI]

Kunal Talwar

Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013

Additive Approximation for Bounded Degree Survivable Network Design.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Set Covering with Our Eyes Closed.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

On the Approximation of Submodular Functions

[BibT_eX]

[DOI]

CoRR, 2013

2012

Development and comparison of quality award: based on existing quality awards.

[BibT_eX]

[DOI]

Irshad Ahmad Khan

Sandeep Grover

Int. J. Syst. Assur. Eng. Manag., 2012

Degree bounded matroids and submodular flows.

[BibT_eX]

[DOI]

Tamás Király

Comb., 2012

Buffer Design and Eye-Diagram Based Characterization of a 20 GS/s CMOS DAC.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on VLSI Design, 2012

A 4 × 20 Gb/s 29-1 PRBS Generator for Testing a High-Speed DAC in 90nm CMOS Technology.

[BibT_eX]

[DOI]

Mahendra Sakare

Proceedings of the Progress in VLSI Design and Test - 16th International Symposium, 2012

A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem.

[BibT_eX]

[DOI]

Bundit Laekhanukit

Shayan Oveis Gharan

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

Selection of manufacturing process using graph theoretic approach.

[BibT_eX]

[DOI]

Irshad Ahmad Khan

Sandeep Grover

Int. J. Syst. Assur. Eng. Manag., 2011

Assessing quality of manufacturing organizations - a Graph Theoretic Approach.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2011

Online Node-Weighted Steiner Tree and Related Problems.

[BibT_eX]

[DOI]

Joseph Naor

Debmalya Panigrahi

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

A Randomized Rounding Approach to the Traveling Salesman Problem.

[BibT_eX]

[DOI]

Shayan Oveis Gharan

Amin Saberi

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

Testing of high-speed DACs using PRBS generation with "Alternate-Bit-Tapping".

[BibT_eX]

[DOI]

Mahendra Sakare

Proceedings of the Design, Automation and Test in Europe, 2011

2010

Simpler analysis of LP extreme points for traveling salesman and survivable network design problems.

[BibT_eX]

[DOI]

Viswanath Nagarajan

Oper. Res. Lett., 2010

Incentives in Online Auctions via Linear Programming.

[BibT_eX]

[DOI]

Niv Buchbinder

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Deploying Mesh Nodes under Non-Uniform Propagation.

[BibT_eX]

[DOI]

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

Improving Integrality Gaps via Chvátal-Gomory Rounding.

[BibT_eX]

[DOI]

Kunal Talwar

Proceedings of the Approximation, 2010

2009

Secretary problems and incentives via linear programming.

[BibT_eX]

[DOI]

Niv Buchbinder

SIGecom Exch., 2009

Survivable Network Design with Degree or Order Constraints.

[BibT_eX]

[DOI]

Joseph Naor

Mohammad R. Salavatipour

SIAM J. Comput., 2009

A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem

[BibT_eX]

[DOI]

Michel X. Goemans

Nicholas J. A. Harvey

CoRR, 2009

Iterative Rounding for Multi-Objective Optimization Problems.

[BibT_eX]

[DOI]

Fabrizio Grandoni

Proceedings of the Algorithms, 2009

2008

Edge Coloring and Decompositions of Weighted Graphs.

[BibT_eX]

[DOI]

Uriel Feige

Proceedings of the Algorithms, 2008

2007

On an extremal problem related to a theorem of Whitney.

[BibT_eX]

[DOI]

Amitabha Tripathi

Discret. Appl. Math., 2007

Closed-Loop Solution of Transient Recovery Voltage for Interrupted Induction Motor Starting.

[BibT_eX]

[DOI]

Surya Santoso

Christopher J. Melhorn

Mark F. McGranaghan

Proceedings of the Conference Record of the 2007 IEEE Industry Applications Conference Forty-Second IAS Annual Meeting, 2007

Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs.

[BibT_eX]

[DOI]

Uriel Feige

Proceedings of the Approximation, 2007

2006

Approximating the <i>k</i>-multicut problem.

[BibT_eX]

[DOI]

Daniel Golovin

Viswanath Nagarajan

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

Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

On Two-Stage Stochastic Minimum Spanning Trees.

[BibT_eX]

[DOI]

Kedar Dhamdhere

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems.

[BibT_eX]

[DOI]

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

2004

On the Crossing Spanning Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2004

2003

Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree.

[BibT_eX]

[DOI]