Saurabh Ray

Discret. Comput. Geom., April, 2024

A fast algorithm for computing a planar support for non-piercing rectangles.

[BibT_eX]

[DOI]

CoRR, 2024

Sweeping Arrangements of Non-Piercing Curves in Plane.

[BibT_eX]

[DOI]

CoRR, 2024

Learning to Prune Instances of Steiner Tree Problem in Graphs.

[BibT_eX]

[DOI]

Proceedings of the 11th International Network Optimization Conference, 2024

Sweeping Arrangements of Non-Piercing Regions in the Plane.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

On the geometric priority set cover problem.

[BibT_eX]

[DOI]

Aritra Banik

Comput. Geom., June, 2023

2022

On the Geometric Set Multicover Problem.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

Learning to Prune Instances of k-median and Related Problems.

[BibT_eX]

[DOI]

Dena Tayebi

Deepak Ajwani

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021

Threshold Rounding for the Standard LP Relaxation of some Geometric Stabbing Problems.

[BibT_eX]

[DOI]

CoRR, 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

Discrete Helly type theorems.

[BibT_eX]

Frederik Brinck Jensen

Aadi Joshi

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs.

[BibT_eX]

[DOI]

Imran Rauf

Theor. Comput. Sci., 2019

On a Problem of Danzer.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2019

2018

Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" [J. Symb. Comput. 45 (2010) 677-683].

[BibT_eX]

[DOI]

Przemyslaw Koprowski

Kurt Mehlhorn

J. Symb. Comput., 2018

Packing and Covering with Non-Piercing Regions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2018

Practical and efficient algorithms for the geometric hitting set problem.

[BibT_eX]

[DOI]

Norbert Bus

Discret. Appl. Math., 2018

Planar Support for Non-piercing Regions and Applications.

[BibT_eX]

[DOI]

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

2017

ε -Mnets: Hitting Geometric Set Systems with Subsets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Limits of Local Search: Quality and Efficiency.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

2016

Point Line Cover: The Easy Kernel is Essentially Tight.

[BibT_eX]

[DOI]

Stefan Kratsch

Geevarghese Philip

ACM Trans. Algorithms, 2016

An optimal generalization of the Colorful Carathéodory theorem.

[BibT_eX]

[DOI]

Discret. Math., 2016

Tighter estimates for ϵ-nets for disks.

[BibT_eX]

[DOI]

Comput. Geom., 2016

2015

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

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

k-Centerpoints Conjectures for Pointsets in ℝd.

[BibT_eX]

[DOI]

Mudassir Shabbir

Int. J. Comput. Geom. Appl., 2015

Counting Triangulations and Other Crossing-Free Structures via Onion Layers.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Tighter Estimates for epsilon-nets for Disks.

[BibT_eX]

[DOI]

CoRR, 2015

Counting triangulations and other crossing-free structures approximately.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Improved Local Search for Geometric Hitting Set.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Geometric Hitting Sets for Disks: Theory and Practice.

[BibT_eX]

[DOI]

Norbert Bus

Proceedings of the Algorithms - ESA 2015, 2015

2014

On totally positive matrices and geometric incidences.

[BibT_eX]

[DOI]

Miriam Farber

Shakhar Smorodinsky

J. Comb. Theory A, 2014

QPTAS for Geometric Set-Cover Problems via Optimal Separators.

[BibT_eX]

[DOI]

CoRR, 2014

Near-Optimal Generalisations of a Theorem of Macbeath.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 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

2013

A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations.

[BibT_eX]

[DOI]

Victor Alvarez

Karl Bringmann

CoRR, 2013

Counting Triangulations Approximately.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

On the complexity of the highway problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

A theorem of bárány revisited and extended.

[BibT_eX]

[DOI]

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

Counting crossing-free structures.

[BibT_eX]

[DOI]

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

2011

Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane.

[BibT_eX]

[DOI]

Mudassir Shabbir

Proceedings of the Algorithms - ESA 2011, 2011

Enumerating Minimal Transversals of Geometric Hypergraphs.

[BibT_eX]

[DOI]

Imran Rauf

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Faster algorithms for computing Hong's bound on absolute positiveness.

[BibT_eX]

[DOI]

Kurt Mehlhorn

J. Symb. Comput., 2010

Improved Results on Geometric Hitting Set Problems.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Hitting Simplices with Points in R3.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Centerpoints and Tverberg's technique.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Improving the first selection lemma in R3.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Weak and strong epsilon-nets for geometric range spaces.

[BibT_eX]

[DOI]

PhD thesis, 2009

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems

[BibT_eX]

[DOI]

CoRR, 2009

An optimal extension of the centerpoint theorem.

[BibT_eX]

[DOI]

Comput. Geom., 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

PTAS for geometric hitting set problems via local search.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Matching edges and faces in polygonal partitions.

[BibT_eX]

[DOI]

Comput. Geom., 2008

New existence proofs epsilon-nets.

[BibT_eX]

[DOI]

Evangelia Pyrga

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

On Computing the Centroid of the Vertices of an Arrangement and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Conflict-free coloring for rectangle ranges using O(n.382) colors.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

An optimal generalization of the centerpoint theorem, and its extensions.

[BibT_eX]

[DOI]