default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPedro Jussieu de Rezende
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Natanael Ramos
, Rafael G. Cano, Pedro J. de Rezende, Cid C. de Souza:
Exact and heuristic solutions for the prize-collecting geometric enclosure problem. Int. Trans. Oper. Res. 31(4): 2093-2122 (2024)- [c35]Felipe de Carvalho Pereira, Pedro J. de Rezende, Tallys H. Yunes:
Minimizing the Cost of Leveraging Influencers in Social Networks: IP and CP Approaches. CPAIOR (2) 2024: 111-127 - [c34]Felipe de Carvalho Pereira, Pedro Jussieu de Rezende, Tallys H. Yunes, Luiz Fernando Batista Morato:
A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs. ESA 2024: 94:1-94:17 - [i3]Felipe de Carvalho Pereira, Pedro Jussieu de Rezende, Tallys H. Yunes, Luiz Fernando Batista Morato:
Solving the Graph Burning Problem for Large Graphs. CoRR abs/2404.17080 (2024) - 2023
- [j22]Felipe de Carvalho Pereira, Pedro J. de Rezende:
The Least Cost Directed Perfect Awareness Problem: complexity, algorithms and computations. Online Soc. Networks Media 37-38: 100255 (2023) - 2022
- [j21]Natanael Ramos, Pedro J. de Rezende, Cid C. de Souza:
Optimal area polygonization problems: Exact solutions through geometric duality. Comput. Oper. Res. 145: 105842 (2022) - [j20]Natanael Ramos, Raí C. de Jesus, Pedro J. de Rezende, Cid C. de Souza, Fábio Luiz Usberti:
Triangle-Based Heuristics for Area Optimal Polygonizations. ACM J. Exp. Algorithmics 27: 2.1:1-2.1:25 (2022) - 2021
- [j19]Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza:
Solving the minimum convex partition of point sets with integer programming. Comput. Geom. 99: 101794 (2021) - [c33]Allan Sapucaia, André A. Ciré, Pedro J. de Rezende, Cid C. de Souza:
Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips. CCCG 2021: 185-194 - [c32]David Aparco-Cardenas, Pedro J. de Rezende, Alexandre X. Falcão:
Object Delineation by Iterative Dynamic Trees. CIARP 2021: 131-140 - [c31]Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza:
Solving the Coarseness Problem by ILP Using Column Generation. ICCSA (5) 2021: 30-45 - [c30]Felipe de Carvalho Pereira, Pedro J. de Rezende, Cid C. de Souza:
Effective Heuristics for the Perfect Awareness Problem. LAGOS 2021: 489-498 - 2020
- [j18]Natanael Ramos, Cid Carvalho de Souza, Pedro Jussieu de Rezende:
A matheuristic for the firefighter problem on graphs. Int. Trans. Oper. Res. 27(2): 739-766 (2020) - [i2]Allan Sapucaia, Pedro J. de Rezende, Cid C. de Souza:
Solving the Minimum Convex Partition of Point Sets with Integer Programming. CoRR abs/2012.03381 (2020)
2010 – 2019
- 2019
- [j17]Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza:
Solving the geometric firefighter routing problem via integer programming. Eur. J. Oper. Res. 274(3): 1090-1101 (2019) - [j16]Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende:
Solving dynamic labeling problems to optimality using solution space reductions. Theor. Comput. Sci. 789: 77-92 (2019) - [c29]Allan S. Barboza, Cid C. de Souza, Pedro J. de Rezende:
Minimum Convex Partition of Point Sets. CIAC 2019: 25-37 - 2018
- [j15]Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza:
Finding exact solutions for the Geometric Firefighter Problem in practice. Comput. Oper. Res. 97: 72-83 (2018) - [c28]Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende:
Optimal Solutions for a Geometric Knapsack Problem using Integer Programming. CCCG 2018: 265-271 - 2017
- [c27]Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende:
Fast Optimal Labelings for Rotating Maps. WALCOM 2017: 161-173 - 2016
- [j14]Davi C. Tozoni, Pedro J. de Rezende, Cid C. de Souza:
Algorithm 966: A Practical Iterative Algorithm for the Art Gallery Problem Using Integer Linear Programming. ACM Trans. Math. Softw. 43(2): 16:1-16:27 (2016) - [c26]Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza:
Exact Solutions for the Geometric Firefighter Problem. CCCG 2016: 223-229 - [p1]Pedro J. de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni:
Engineering Art Galleries. Algorithm Engineering 2016: 379-417 - 2015
- [j13]Bruno E. Crepaldi, Pedro J. de Rezende, Cid C. de Souza:
Solving the natural wireless localization problem to optimality efficiently. Comput. Geom. 48(5): 370-379 (2015) - [j12]Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende, Tallys H. Yunes:
Arc-based integer programming formulations for three variants of proportional symbol maps. Discret. Optim. 18: 87-110 (2015) - [j11]Priscila T. M. Saito, Celso T. N. Suzuki, Jancarlo F. Gomes, Pedro Jussieu de Rezende, Alexandre X. Falcão:
Robust active learning for the diagnosis of parasites. Pattern Recognit. 48(11): 3572-3583 (2015) - [c25]Aléx F. Brandt, Miguel F. A. de Gaiowski, Pedro J. de Rezende, Cid C. de Souza:
Computing Minimum Dilation Spanning Trees in Geometric Graphs. COCOON 2015: 297-309 - [c24]William Robson Schwartz, Pedro Jussieu de Rezende, Hélio Pedrini:
Faster Approximations of Shortest Geodesic Paths on Polyhedra Through Adaptive Priority Queue. VISAPP (1) 2015: 371-378 - 2014
- [j10]Priscila T. M. Saito, Pedro J. de Rezende, Alexandre X. Falcão, Celso T. N. Suzuki, Jancarlo F. Gomes:
An active learning paradigm based on a priori data reduction and organization. Expert Syst. Appl. 41(14): 6086-6097 (2014) - [j9]Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza, Tallys H. Yunes:
Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation. INFORMS J. Comput. 26(2): 199-207 (2014) - [c23]Aléx F. Brandt, Miguel M. Gaiowski, Cid C. de Souza, Pedro J. de Rezende:
Minimum Dilation Triangulation: Reaching Optimality Efficiently. CCCG 2014 - [c22]Priscila T. M. Saito, Willian Paraguassu Amorim, Alexandre X. Falcão, Pedro Jussieu de Rezende, Celso T. N. Suzuki, Jancarlo F. Gomes, Marcelo Henriques de Carvalho:
Active Semi-supervised Learning Using Optimum-Path Forest. ICPR 2014: 3798-3803 - [c21]John E. Vargas, Priscila T. M. Saito, Alexandre X. Falcão, Pedro Jussieu de Rezende, Jefersson Alex dos Santos:
Superpixel-Based Interactive Classification of Very High Resolution Images. SIBGRAPI 2014: 173-179 - [c20]Maurício J. O. Zambon, Pedro J. de Rezende, Cid C. de Souza:
An Exact Algorithm for the Discrete Chromatic Art Gallery Problem. SEA 2014: 59-73 - [i1]Pedro Jussieu de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni:
Engineering Art Galleries. CoRR abs/1410.8720 (2014) - 2013
- [j8]Rafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende:
A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps. Comput. Oper. Res. 40(5): 1435-1447 (2013) - [j7]Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende, Tallys H. Yunes:
Arc-based integer programming formulations for three variants of proportional symbol maps. Electron. Notes Discret. Math. 44: 251-256 (2013) - [j6]Pedro J. de Rezende, Flávio Keidi Miyazawa, Anderson T. Sasaki:
A PTAS for the disk cover problem of geometric objects. Oper. Res. Lett. 41(5): 552-555 (2013) - [c19]Bruno E. Crepaldi, Pedro J. de Rezende, Cid C. de Souza:
An Efficient Exact Algorithm for the Natural Wireless Localization Problem. CCCG 2013 - [c18]Dorit Borrmann, Pedro J. de Rezende, Cid C. de Souza, Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Andreas Nüchter, Christiane Schmidt, Davi C. Tozoni:
Point guards and point clouds: solving general art gallery problems. SoCG 2013: 347-348 - [c17]Priscila T. M. Saito, Pedro J. de Rezende, Alexandre X. Falcão, Celso T. N. Suzuki, Jancarlo F. Gomes:
A data reduction and organization approach for efficient image annotation. SAC 2013: 53-57 - [c16]Paulo E. Rauber, Alexandre X. Falcão, Thiago Vallin Spina, Pedro J. de Rezende:
Interactive Segmentation by Image Foresting Transform on Superpixel Graphs. SIBGRAPI 2013: 131-138 - [c15]Davi C. Tozoni, Pedro J. de Rezende, Cid C. de Souza:
The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm. SEA 2013: 320-336 - 2012
- [j5]Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza, Tallys H. Yunes:
Generating optimal drawings of physically realizable symbol maps with integer programming. Vis. Comput. 28(10): 1015-1026 (2012) - 2011
- [j4]Marcelo C. Couto, Pedro J. de Rezende, Cid C. de Souza:
An exact algorithm for minimizing vertex guards on art galleries. Int. Trans. Oper. Res. 18(4): 425-448 (2011) - [c14]Gutemberg Guerra-Filho, Pedro J. de Rezende:
Characterization of Shortest Paths on Directional Frictional Polyhedral Surfaces. CCCG 2011 - [c13]Rafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende:
Effective drawing of proportional symbol maps using GRASP. CTW 2011: 97-100 - [c12]Guilherme Kunigami, Pedro Jussieu de Rezende, Cid C. de Souza, Tallys H. Yunes:
Optimizing the Layout of Proportional Symbol Maps. ICCSA (3) 2011: 1-16 - [c11]Guilherme Kunigami, Pedro Jussieu de Rezende, Cid Carvalho de Souza, Tallys H. Yunes:
Determining an Optimal Visualization of Physically Realizable Symbol Maps. SIBGRAPI 2011: 117-124 - 2010
- [c10]César Castelo-Fernández, Pedro J. de Rezende, Alexandre X. Falcão, João Paulo Papa:
Improving the Accuracy of the Optimum-Path Forest Supervised Classifier for Large Datasets. CIARP 2010: 467-475
2000 – 2009
- 2009
- [c9]Marcelo C. Couto, Pedro Jussieu de Rezende, Cid C. de Souza:
An IP solution to the art gallery problem. SCG 2009: 88-89 - 2008
- [c8]Marcelo C. Couto, Cid C. de Souza, Pedro Jussieu de Rezende:
Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem. WEA 2008: 101-113 - 2007
- [c7]Marcelo C. Couto, Cid C. de Souza, Pedro Jussieu de Rezende:
An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem. SIBGRAPI 2007: 87-94 - 2005
- [c6]A. G. Oliveira, Pedro Jussieu de Rezende, F. P. Selmi-Dei:
An extension of CGAL to the oriented projective plane T2 and its dynamic visualization system. SCG 2005: 380-381 - 2000
- [c5]Guilherme Albuquerque Pinto, Pedro Jussieu de Rezende:
Additively Weighted Voronoi Diagram on the Oriented Projective Plane. CCCG 2000
1990 – 1999
- 1999
- [j3]Roberto De A. Façanha, Nelson L. S. da Fonseca, Pedro Jussieu de Rezende:
The S2 Piggybacking Policy. Multim. Tools Appl. 8(3): 371-383 (1999) - [c4]Pedro Jussieu de Rezende, Rodrigo B. Westrupp:
An Optimal Algorithm to Construct all Voronoi Diagrams for k Nearest Neighbor Search in T2. SIBGRAPI 1999: 7-16 - 1995
- [j2]Pedro Jussieu de Rezende, D. T. Lee:
Point Set Pattern Matching in d-Dimensions. Algorithmica 13(4): 387-404 (1995) - 1993
- [c3]Pedro Jussieu de Rezende, Welson R. Jacometti:
GeoLab: An Environment for Development of Algorithms in Computational Geometry. CCCG 1993: 175-180 - [c2]Pedro Jussieu de Rezende, Welson R. Jacometti:
Animation of Geometric Algorithms Using GeoLab. SCG 1993: 401-402
1980 – 1989
- 1989
- [j1]Pedro Jussieu de Rezende, D. T. Lee, Ying-Fung Wu:
Rectilinear Shortest Paths in the presence of Rectangular Barriers. Discret. Comput. Geom. 4: 41-53 (1989) - 1985
- [c1]Pedro Jussieu de Rezende, D. T. Lee, Ying-Fung Wu:
Rectilinear shortest paths with rectangular barriers. SCG 1985: 204-213
Coauthor Index
aka: Cid Carvalho de Souza
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 00:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
