default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaulo E. D. Pinto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j5]Guilherme C. M. Gomes, Bruno Porto Masquio
, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Disconnected matchings. Theor. Comput. Sci. 956: 113821 (2023)- 2022
- [j4]Min Chih Lin, Fabiano de S. Oliveira, Paulo E. D. Pinto, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Restricted Hamming-Huffman trees. RAIRO Oper. Res. 56(3): 1823-1839 (2022) - 2018
- [j3]Anderson Zudio, Daniel Henrique da Silva Costa, Bruno Porto Masquio, Igor Machado Coelho, Paulo Eustáquio Duarte Pinto:
BRKGA/VND Hybrid Algorithm for the Classic Three-dimensional Bin Packing Problem. Electron. Notes Discret. Math. 66: 175-182 (2018) - 2012
- [j2]Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter:
Exact and approximation algorithms for error-detecting even codes. Theor. Comput. Sci. 440-441: 60-72 (2012) - 2005
- [j1]Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter:
Parity codes. RAIRO Theor. Informatics Appl. 39(1): 263-278 (2005)
Conference and Workshop Papers
- 2022
- [c6]Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Weighted Connected Matchings. LATIN 2022: 54-70 - 2021
- [c5]Guilherme de C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Disconnected Matchings. COCOON 2021: 579-590 - 2018
- [c4]Juan P. A. Lopes, Fabiano de S. Oliveira, Paulo E. D. Pinto, Valmir C. Barbosa:
Sketching Data Structures for Massive Graph Problems. Poly/DMAH@VLDB 2018: 57-67 - 2009
- [c3]Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter:
Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code. TAMC 2009: 311-324 - 2004
- [c2]Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter:
A Huffman-Based Error Detecting Code. WEA 2004: 446-457 - 1993
- [c1]Paulo Eustáquio Duarte Pinto, Fátima Janine Gaio:
Análise da Adoção de Novas Tecnologias no Processo de Desenvolvimento de Software da Petrobrás. SBES 1993: 92-106
Informal and Other Publications
- 2024
- [i3]Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Dieter Rautenbach, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter, Florian Werner:
Complexity of Deciding the Equality of Matching Numbers. CoRR abs/2409.04855 (2024) - 2022
- [i2]Guilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Weighted Connected Matchings. CoRR abs/2202.04746 (2022) - 2021
- [i1]Guilherme de C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Disconnected Matchings. CoRR abs/2112.09248 (2021)
Coauthor Index
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-10-10 22:19 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:
