Guilherme Dias da Fonseca

CoRR, January, 2025

2024

Further Connectivity Results on Plane Spanning Path Reconfiguration.

[BibT_eX]

[DOI]

Valentino Boucard

CoRR, 2024

Shadoks Approach to Knapsack Polygonal Packing.

[BibT_eX]

[DOI]

CoRR, 2024

Short Flip Sequences to Untangle Segments in the Plane.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2024

Shadoks Approach to Knapsack Polygonal Packing (CG Challenge).

[BibT_eX]

[DOI]

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

2023

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring.

[BibT_eX]

[DOI]

Florian Fontan

Pascal Lafourcade

Luc Libralesso

Benjamin Momège

Jack Spalding-Jamieson

Brandon Zhang

Da Wei Zheng

ACM J. Exp. Algorithmics, December, 2023

Shadoks Approach to Convex Covering.

[BibT_eX]

[DOI]

CoRR, 2023

On the Longest Flip Sequence to Untangle Segments in the Plane.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2023

Economical Convex Coverings and Applications.

[BibT_eX]

[DOI]

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

Shadoks Approach to Convex Covering (CG Challenge).

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Shadoks Approach to Low-Makespan Coordinated Motion Planning.

[BibT_eX]

[DOI]

Pascal Lafourcade

Luc Libralesso

ACM J. Exp. Algorithmics, 2022

Greedy and Local Search Heuristics to Build Area-Optimal Polygons.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2022

Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings.

[BibT_eX]

[DOI]

Arun Kumar Das

Sandip Das

CoRR, 2022

Complexity Results on Untangling Red-Blue Matchings.

[BibT_eX]

[DOI]

Arun Kumar Das

Sandip Das

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge).

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Efficient Algorithms for Battleship.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge).

[BibT_eX]

[DOI]

Pascal Lafourcade

Luc Libralesso

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons.

[BibT_eX]

[DOI]

J. Math. Imaging Vis., 2020

Efficient independent set approximation in unit disk graphs.

[BibT_eX]

[DOI]

Gautam K. Das

Ramesh K. Jallu

Discret. Appl. Math., 2020

Optimal Bound on the Combinatorial Complexity of Approximating Polytopes.

[BibT_eX]

[DOI]

Rahul Arya

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

2019

Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances.

[BibT_eX]

[DOI]

Ahmed Abdelkader

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

Efficient Algorithms to Test Digital Convexity.

[BibT_eX]

[DOI]

Yan Gérard

Proceedings of the Discrete Geometry for Computer Imagery, 2019

Peeling Digital Potatoes.

[BibT_eX]

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums.

[BibT_eX]

[DOI]

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

2017

Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs.

[BibT_eX]

[DOI]

Celina Miraglia Herrera de Figueiredo

Int. J. Comput. Geom. Appl., 2017

Near-Optimal ε-Kernel Construction and Related Problems.

[BibT_eX]

[DOI]

CoRR, 2017

Optimal Approximate Polytope Membership.

[BibT_eX]

[DOI]

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

Near-Optimal epsilon-Kernel Construction and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

On the ratio between maximum weight perfect matchings and maximum weight matchings in grids.

[BibT_eX]

[DOI]

Bernard Ries

Diana Sasaki

Discret. Appl. Math., 2016

The cost of perfection for matchings in graphs.

[BibT_eX]

[DOI]

Emilio Vital Brazil

Diana Sasaki

Discret. Appl. Math., 2016

On the Combinatorial Complexity of Approximating Polytopes.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges.

[BibT_eX]

[DOI]

Raphael Carlos Santos Machado

Celina Miraglia Herrera de Figueiredo

Discret. Appl. Math., 2015

2014

Efficient sub-5 approximations for minimum dominating sets in unit disk graphs.

[BibT_eX]

[DOI]

Raphael C. S. Machado

Theor. Comput. Sci., 2014

Linear-Time Approximation Algorithms for Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2012

The Cost of Perfection for Matchings in Graphs

[BibT_eX]

[DOI]

Emilio Vital Brazil

CoRR, 2012

Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs.

[BibT_eX]

[DOI]

Raphael Machado

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Polytope approximation and the Mahler volume.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Optimal area-sensitive bounds for polytope approximation.

[BibT_eX]

[DOI]

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

2011

Complexity dichotomy on partial grid recognition.

[BibT_eX]

[DOI]

Raphael C. S. Machado

Theor. Comput. Sci., 2011

Fitting Flats to Points with Outliers.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

Approximate polytope membership queries.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010

Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges.

[BibT_eX]

[DOI]

Raphael Machado

Electron. Notes Discret. Math., 2010

Approximate range searching: The absolute model.

[BibT_eX]

[DOI]

Comput. Geom., 2010

A Unified Approach to Approximate Proximity Searching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Enclosing weighted points with an almost-unit ball.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

2008

Tradeoffs in Approximate Range Searching Made Simpler.

[BibT_eX]

[DOI]

Proceedings of the SIBGRAPI 2008, 2008

2007

Approximate Range Searching In The Absolute Error Model.

[BibT_eX]

[DOI]

PhD thesis, 2007

Approximate Range Searching: The Absolute Model.

[BibT_eX]

[DOI]

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

2006

Algorithms for the Homogeneous Set Sandwich Problem.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

Algorithmica, 2006

2004

Kinetic hanger.

[BibT_eX]

[DOI]

Paulo Cezar Pinto Carvalho

Inf. Process. Lett., 2004

Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003

The stable marriage problem with restricted pairs.

[BibT_eX]

[DOI]

Vânia M. Félix Dias

Jayme Luiz Szwarcfiter

Theor. Comput. Sci., 2003

Kinetic heap-ordered trees: Tight analysis and improved algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

2001

Stable marriages with restricted pairs.

[BibT_eX]

[DOI]

Vânia M. Félix Dias