Rajiv Raman

Comput. Geom., June, 2023

On Hypergraph Supports.

[BibT_eX]

[DOI]

Karamjeet Singh

CoRR, 2023

2022

On the Geometric Set Multicover Problem.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

2021

On Geometric Priority Set Cover Problems.

[BibT_eX]

[DOI]

Aritra Banik

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Constructing Planar Support for Non-Piercing Regions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions.

[BibT_eX]

[DOI]

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

2018

Constant factor approximation for the weighted partial degree bounded edge packing problem.

[BibT_eX]

[DOI]

Pawan Aurora

Monalisa Jena

J. Comb. Optim., 2018

On the approximability of the maximum interval constrained coloring problem.

[BibT_eX]

[DOI]

Discret. Optim., 2018

Packing and Covering with Non-Piercing Regions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2018

Planar Support for Non-piercing Regions and Applications.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2015

Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

Assignment of trainees to software project requirements: A stable matching based approach.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2015

2014

QPTAS for Geometric Set-Cover Problems via Optimal Separators.

[BibT_eX]

[DOI]

CoRR, 2014

An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function.

[BibT_eX]

[DOI]

T.-H. Hubert Chan

Kevin L. Chang

Algorithmica, 2014

Settling the APX-Hardness Status for Geometric Set Cover.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

A toolbox for fast and approximate solutions for large linear and semidefinite programs.

[BibT_eX]

[DOI]

Ajay Shankar Bidyarthy

Dilys Thomas

Proceedings of the 7th ACM India Computing Conference, 2014

A Separator Theorem for Intersecting Objects in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2012

On the complexity of the highway problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Colouring vertices of triangle-free graphs without forests.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

Max-coloring and online coloring with bandwidths on interval graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

2010

Sub-Coloring and Hypo-Coloring Interval Graphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2010

Colouring Vertices of Triangle-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

2009

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems

[BibT_eX]

[DOI]

Khaled M. Elbassioni

CoRR, 2009

On the approximability of the maximum feasible subsystem problem with 0/1-coefficients.

[BibT_eX]

[DOI]

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

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

An experimental study of different approaches to solve the market equilibrium problem.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2008

2005

Approximating interval coloring and max-coloring in chordal graphs.

[BibT_eX]

[DOI]

Sriram Penumatcha

ACM J. Exp. Algorithmics, 2005

Approximation Algorithms for the Max-coloring Problem.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Computing Equilibrium Prices: Does Theory Meet Practice?.

[BibT_eX]

[DOI]

Bruno Codenotti

Benton McCune

Proceedings of the Algorithms, 2005

2004

Buffer minimization using max-coloring.

[BibT_eX]

[DOI]