Mohammad R. Salavatipour

CoRR, April, 2025

Approximation Algorithms for the Generalized Point-To-Point Problem.

[BibT_eX]

[DOI]

Hao Sun

Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

A QPTAS for Facility Location on Unit Disk Graphs.

[BibT_eX]

[DOI]

Hao Sun

Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

A PTAS for TSP with Neighbourhoods over Parallel Line Segments.

[BibT_eX]

[DOI]

Benyamin Ghaseminia

Proceedings of the 41st International Symposium on Computational Geometry, 2025

Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics.

[BibT_eX]

[DOI]

Kinter Ren

Proceedings of the Approximation, 2025

2024

Approximation Algorithms for the Airport and Railway Problem.

[BibT_eX]

[DOI]

Lijiangnan Tian

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2023

Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021).

[BibT_eX]

[DOI]

Meng He

Anna Lubiw

Algorithmica, June, 2023

Preface.

[BibT_eX]

[DOI]

Meng He

Anna Lubiw

Comput. Geom., 2023

Approximation Schemes for Min-Sum k-Clustering.

[BibT_eX]

[DOI]

Ismail Naderi

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

2022

Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension.

[BibT_eX]

[DOI]

Aditya Jayaprakash

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

Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands.

[BibT_eX]

[DOI]

Ramin Mousavi

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021

Improved Approximations for CVRP with Unsplittable Demands.

[BibT_eX]

[DOI]

Ramin Mousavi

CoRR, 2021

Hierarchical Clustering: New Bounds and Objective.

[BibT_eX]

[DOI]

CoRR, 2021

Special Issue on Algorithms and Data Structures (WADS 2019).

[BibT_eX]

[DOI]

Jörg-Rüdiger Sack

Algorithmica, 2021

2020

Preface.

[BibT_eX]

[DOI]

Jörg-Rüdiger Sack

Comput. Geom., 2020

Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Approximation Algorithms for Generalized Path Scheduling.

[BibT_eX]

[DOI]

Haozhou Pang

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Approximations for Throughput Maximization.

[BibT_eX]

[DOI]

Dylan Hyatt-Denesik

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS.

[BibT_eX]

[DOI]

Kamyar Khodamoradi

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

2018

Approximation Algorithms for Minimum-Load k-Facility Location.

[BibT_eX]

[DOI]

Chaitanya Swamy

ACM Trans. Algorithms, 2018

Minimizing Latency of Capacitated k-Tours.

[BibT_eX]

[DOI]

Christopher S. Martin

Algorithmica, 2018

Approximation Schemes for Clustering with Outliers.

[BibT_eX]

[DOI]

Kamyar Khodamoradi

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

2017

Scheduling Problems over Network of Machines.

[BibT_eX]

[DOI]

Arnoosh Golestanian

Kamyar Khodamoradi

Christopher S. Martin

Yifeng Zhang

Proceedings of the Approximation, 2017

2016

Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Approximation Algorithms for Capacitated k-Travelling Repairmen Problems.

[BibT_eX]

[DOI]

Christopher S. Martin

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Local Search Yields a PTAS for k-Means in Doubling Metrics.

[BibT_eX]

[DOI]

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

2015

LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design.

[BibT_eX]

[DOI]

José A. Soto

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median.

[BibT_eX]

[DOI]

Babak Behsaz

Rohit Sivakumar

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Approximation Algorithms for Minimum-Load k-Facility Location.

[BibT_eX]

[DOI]

Chaitanya Swamy

Proceedings of the Approximation, 2014

2012

New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem.

[BibT_eX]

[DOI]

Babak Behsaz

Zoya Svitkina

Proceedings of the Algorithm Theory - SWAT 2012, 2012

On Minimum Sum of Radii and Diameters Clustering.

[BibT_eX]

[DOI]

Babak Behsaz

Proceedings of the Algorithm Theory - SWAT 2012, 2012

How to walk your dog in the mountains with no magic leash.

[BibT_eX]

[DOI]

Sariel Har-Peled

Amir Nayyeri

Anastasios Sidiropoulos

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs.

[BibT_eX]

[DOI]

MohammadAli Safari

SIAM J. Discret. Math., 2011

Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph.

[BibT_eX]

[DOI]

M. Reza Khani

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems.

[BibT_eX]

[DOI]

M. Reza Khani

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

2010

Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design.

[BibT_eX]

[DOI]

Chandra Chekuri

SIAM J. Comput., 2010

A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs.

[BibT_eX]

[DOI]

Imran A. Pirwani

Proceedings of the Algorithm Theory, 2010

Asymmetric Traveling Salesman Path and Directed Latency Problems.

[BibT_eX]

[DOI]

Zoya Svitkina

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

2009

A PTAS for Minimum Clique Partition in Unit Disk Graphs

[BibT_eX]

[DOI]

Imran A. Pirwani

CoRR, 2009

A logarithmic approximation for unsplittable flow on line graphs.

[BibT_eX]

[DOI]

Nikhil Bansal

Rohit Khandekar

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

2008

Minimizing Movement in Mobile Facility Location Problems.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Two-Stage Robust Network Design with Exponential Scenarios.

[BibT_eX]

[DOI]

Rohit Khandekar

Vahab S. Mirrokni

Proceedings of the Algorithms, 2008

A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs.

[BibT_eX]

[DOI]

MohammadAli Safari

Proceedings of the Approximation, 2008

2007

Approximation algorithms and hardness results for cycle packing problems.

[BibT_eX]

[DOI]

Michael Krivelevich

Zeev Nutov

Jacques Verstraëte

Raphael Yuster

ACM Trans. Algorithms, 2007

Recall Systems: Effcient Learning and Use of Category Indices.

[BibT_eX]

[DOI]

Omid Madani

Wiley Greiner

David Kempe

Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, 2007

Selecting dissimilar genes for multi-class classification, an application in cancer subtyping.

[BibT_eX]

[DOI]

Zhipeng Cai

Randy Goebel

Guohui Lin

BMC Bioinform., 2007

Survivable network design with degree or order constraints.

[BibT_eX]

[DOI]

Lap Chi Lau

Joseph Naor

Mohit Singh

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Approximation algorithms for node-weighted buy-at-bulk network design.

[BibT_eX]

[DOI]

Chandra Chekuri

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

Approximability of Packing Disjoint Cycles.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Selecting Genes with Dissimilar Discrimination Strength for Sample Class Prediction.

[BibT_eX]

[DOI]

Zhipeng Cai

Randy Goebel

Yi Shi

Lizhe Xu

Guohui Lin

Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006

Large Induced Forests in Triangle-Free Planar Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2006

Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

Approximating Buy-at-Bulk k-Steiner trees

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

Combination can be hard: approximability of the unique coverage problem.

[BibT_eX]

[DOI]

Erik D. Demaine

Uriel Feige

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

Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design.

[BibT_eX]

[DOI]

Chandra Chekuri

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

Using Gene Clustering to Identify Discriminatory Genes with Higher Classification Accuracy.

[BibT_eX]

[DOI]

Zhipeng Cai

Lizhe Xu

Yi Shi

Randy Goebel

Guohui Lin

Proceedings of the Sixth IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2006), 2006

Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2006

2005

A bound on the chromatic number of the square of a planar graph.

[BibT_eX]

[DOI]

Michael Molloy

J. Comb. Theory B, 2005

Planar graphs without cycles of length from 4 to 7 are 3-colorable.

[BibT_eX]

[DOI]

Oleg V. Borodin

Alexei N. Glebov

André Raspaud

J. Comb. Theory B, 2005

Disjoint Cycles: Integrality Gap, Hardness, and Approximation.

[BibT_eX]

[DOI]

Jacques Verstraëte

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

Packing Element-Disjoint Steiner Trees.

[BibT_eX]

[DOI]

Joseph Cheriyan

Proceedings of the Approximation, 2005

2004

A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2004

A polynomial time algorithm for strong edge coloring of partial k-trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Hardness and Approximation Results for Packing Steiner Trees.

[BibT_eX]

[DOI]

Joseph Cheriyan

Proceedings of the Algorithms, 2004

2003

Graph colouring via the discharging method.

[BibT_eX]

[DOI]

PhD thesis, 2003

On Sum Coloring of Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Packing Steiner trees.

[BibT_eX]

[DOI]

Kamal Jain

Mohammad Mahdian

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

The Resolution Complexity of Random Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Michael Molloy

Proceedings of the 44th Symposium on Foundations of Computer Science, 2003

2002

Frequency Channel Assignment on Planar Networks.

[BibT_eX]

[DOI]

Michael Molloy

Proceedings of the Algorithms, 2002

2000

On a conjecture of Keedwell and the cycle double cover conjecture.

[BibT_eX]

[DOI]

Mohammad Mahdian

Ebadollah S. Mahmoodian

Amin Saberi