Pedro Jussieu de Rezende

Orcid: 0000-0002-9529-4253

According to our database1, Pedro Jussieu de Rezende authored at least 60 papers between 1985 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exact and heuristic solutions for the prize-collecting geometric enclosure problem.
Int. Trans. Oper. Res., July, 2024

Solving the Graph Burning Problem for Large Graphs.
CoRR, 2024

A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Minimizing the Cost of Leveraging Influencers in Social Networks: IP and CP Approaches.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2024

2023
The Least Cost Directed Perfect Awareness Problem: complexity, algorithms and computations.
Online Soc. Networks Media, September, 2023

2022
Triangle-Based Heuristics for Area Optimal Polygonizations.
ACM J. Exp. Algorithmics, 2022

Optimal area polygonization problems: Exact solutions through geometric duality.
Comput. Oper. Res., 2022

2021
Solving the minimum convex partition of point sets with integer programming.
Comput. Geom., 2021

Effective Heuristics for the Perfect Awareness Problem.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Solving the Coarseness Problem by ILP Using Column Generation.
Proceedings of the Computational Science and Its Applications - ICCSA 2021, 2021

Object Delineation by Iterative Dynamic Trees.
Proceedings of the Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2021

Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020
A matheuristic for the firefighter problem on graphs.
Int. Trans. Oper. Res., 2020

2019
Solving dynamic labeling problems to optimality using solution space reductions.
Theor. Comput. Sci., 2019

Solving the geometric firefighter routing problem via integer programming.
Eur. J. Oper. Res., 2019

Minimum Convex Partition of Point Sets.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018
Finding exact solutions for the Geometric Firefighter Problem in practice.
Comput. Oper. Res., 2018

Optimal Solutions for a Geometric Knapsack Problem using Integer Programming.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Fast Optimal Labelings for Rotating Maps.
Proceedings of the WALCOM: Algorithms and Computation, 2017

2016
Engineering Art Galleries.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Algorithm 966: A Practical Iterative Algorithm for the Art Gallery Problem Using Integer Linear Programming.
ACM Trans. Math. Softw., 2016

Exact Solutions for the Geometric Firefighter Problem.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Robust active learning for the diagnosis of parasites.
Pattern Recognit., 2015

Arc-based integer programming formulations for three variants of proportional symbol maps.
Discret. Optim., 2015

Solving the natural wireless localization problem to optimality efficiently.
Comput. Geom., 2015

Faster Approximations of Shortest Geodesic Paths on Polyhedra Through Adaptive Priority Queue.
Proceedings of the VISAPP 2015, 2015

Computing Minimum Dilation Spanning Trees in Geometric Graphs.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation.
INFORMS J. Comput., 2014

An active learning paradigm based on a priori data reduction and organization.
Expert Syst. Appl., 2014

Engineering Art Galleries.
CoRR, 2014

An Exact Algorithm for the Discrete Chromatic Art Gallery Problem.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Superpixel-Based Interactive Classification of Very High Resolution Images.
Proceedings of the 27th SIBGRAPI Conference on Graphics, Patterns and Images, 2014

Active Semi-supervised Learning Using Optimum-Path Forest.
Proceedings of the 22nd International Conference on Pattern Recognition, 2014

Minimum Dilation Triangulation: Reaching Optimality Efficiently.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
A PTAS for the disk cover problem of geometric objects.
Oper. Res. Lett., 2013

A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps.
Comput. Oper. Res., 2013

The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Interactive Segmentation by Image Foresting Transform on Superpixel Graphs.
Proceedings of the XXVI Conference on Graphics, Patterns and Images, 2013

A data reduction and organization approach for efficient image annotation.
Proceedings of the 28th Annual ACM Symposium on Applied Computing, 2013

Point guards and point clouds: solving general art gallery problems.
Proceedings of the Symposium on Computational Geometry 2013, 2013

An Efficient Exact Algorithm for the Natural Wireless Localization Problem.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Generating optimal drawings of physically realizable symbol maps with integer programming.
Vis. Comput., 2012

2011
An exact algorithm for minimizing vertex guards on art galleries.
Int. Trans. Oper. Res., 2011

Determining an Optimal Visualization of Physically Realizable Symbol Maps.
Proceedings of the 24th SIBGRAPI Conference on Graphics, 2011

Optimizing the Layout of Proportional Symbol Maps.
Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Effective drawing of proportional symbol maps using GRASP.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Characterization of Shortest Paths on Directional Frictional Polyhedral Surfaces.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Improving the Accuracy of the Optimum-Path Forest Supervised Classifier for Large Datasets.
Proceedings of the Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2010

2009
An IP solution to the art gallery problem.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

2007
An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem.
Proceedings of the SIBGRAPI 2007, 2007

2005
An extension of CGAL to the oriented projective plane T<sup>2</sup> and its dynamic visualization system.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

2000
Additively Weighted Voronoi Diagram on the Oriented Projective Plane.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
The S2 Piggybacking Policy.
Multim. Tools Appl., 1999

An Optimal Algorithm to Construct all Voronoi Diagrams for k Nearest Neighbor Search in T2.
Proceedings of the XII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI '99), 1999

1995
Point Set Pattern Matching in d-Dimensions.
Algorithmica, 1995

1993
Animation of Geometric Algorithms Using GeoLab.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

GeoLab: An Environment for Development of Algorithms in Computational Geometry.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1989
Rectilinear Shortest Paths in the presence of Rectangular Barriers.
Discret. Comput. Geom., 1989

1985
Rectilinear shortest paths with rectangular barriers.
Proceedings of the First Annual Symposium on Computational Geometry, 1985


  Loading...