default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexsander Andrade de Melo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
:
Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete. Discret. Comput. Geom. 71(3): 893-917 (2024)- 2023
- [j8]Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza:
On the computational difficulty of the terminal connection problem. RAIRO Theor. Informatics Appl. 57: 3 (2023) - [j7]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
MaxCut on permutation graphs is NP-complete. J. Graph Theory 104(1): 5-16 (2023) - 2022
- [j6]Mitre Costa Dourado, Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Mateus de Oliveira Oliveira, Uéverton S. Souza:
Computing the zig-zag number of directed graphs. Discret. Appl. Math. 312: 86-105 (2022) - [j5]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Diana Sasaki, Ana Silva:
Revising Johnson's table for the 21st century. Discret. Appl. Math. 323: 184-200 (2022) - [j4]Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
Second-Order Finite Automata. Theory Comput. Syst. 66(4): 861-909 (2022) - [c6]Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva:
Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage. WALCOM 2022: 251-262 - [i5]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
MaxCut on Permutation Graphs is NP-complete. CoRR abs/2202.13955 (2022) - 2021
- [j3]Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton dos Santos Souza:
On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems. Networks 77(4): 559-571 (2021) - [c5]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete. MFCS 2021: 38:1-38:15 - [c4]Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza:
On the Terminal Connection Problem. SOFSEM 2021: 278-292 - [i4]Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
On the Width of Regular Classes of Finite Structures. CoRR abs/2104.10286 (2021) - [i3]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Diana Sasaki, Ana Silva:
Revising Johnson's table for the 21st century. CoRR abs/2104.14395 (2021) - [i2]Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
Second-Order Finite Automata. CoRR abs/2108.12751 (2021) - 2020
- [j2]Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza:
A multivariate analysis of the strict terminal connection problem. J. Comput. Syst. Sci. 111: 22-41 (2020) - [c3]Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
Second-Order Finite Automata. CSR 2020: 46-63 - [c2]Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
Symbolic Solutions for Symbolic Constraint Satisfaction Problems. KR 2020: 49-58 - [i1]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
Maximum cut on interval graphs of interval count five is NP-complete. CoRR abs/2012.09804 (2020)
2010 – 2019
- 2019
- [c1]Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
On the Width of Regular Classes of Finite Structures. CADE 2019: 18-34 - 2017
- [j1]Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza:
Simple Undirected Two-Commodity Integral Flow with a Unitary Demand. Electron. Notes Discret. Math. 62: 279-284 (2017)
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-04-25 05:58 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:
