Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Fabiano de S. Oliveira"'
Publikováno v:
Discrete Applied Mathematics. 323:76-95
Interval and proper interval graphs are very well-known graph classes, for which there is a wide literature. As a consequence, some generalizations of interval graphs have been proposed, in which graphs in general are expressed in terms of $k$ interv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::60aefac5158cd6eab3e845295159b9a6
https://doi.org/10.1016/j.dam.2021.05.020
https://doi.org/10.1016/j.dam.2021.05.020
Publikováno v:
LAGOS
Let F be a family of intervals on the real line. An interval graph is the intersection graph of F . An interval order is a partial order ( F , ≺ ) such that for all I 1 , I 2 ∈ F , I1 ≺ I2 if and only if I1 lies entirely at the left of I2. Such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c0ae83de1d03fb70e54f0cf50a5f3ec
https://doi.org/10.1016/j.entcs.2019.08.055
https://doi.org/10.1016/j.entcs.2019.08.055
Publikováno v:
Anais do VI Encontro de Teoria da Computação (ETC 2021).
O emprego de técnicas de otimização combinatória associadas ao problema da contagem de intervalo foi explorado por Joos et al., resolvendo de forma eficiente uma versão restrita do problema da contagem de intervalo 2. Para o problema de determin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c71a05c9e0f564a008d6c8ba2eaf66be
https://doi.org/10.5753/etc.2021.16367
https://doi.org/10.5753/etc.2021.16367
Autor:
Flavia Bonomo-Braberman, Fabiano de S. Oliveira, Moysés S. Sampaio, Carolina Gonzalez, Jayme Luiz Szwarcfiter
The thinness of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Many NP-complete problems can be solved in polynomial time for graphs with bounded thinness, given a suita
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::52b834c31465abf7b590fb9946d6a305
http://arxiv.org/abs/2006.16887
http://arxiv.org/abs/2006.16887
Publikováno v:
Anais do Encontro de Teoria da Computação (ETC 2020).
Estamos interessados em imergir árvores T com grau máximo limitado a 4 em uma grade retangular, de modo que os vértices de T correspondam a pontos da grade, enquanto que as arestas de T correspondam a segmentos retos não intersectantes das retas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7bf3765ec3c25de8a5c10bb685d04c9
https://doi.org/10.5753/etc.2020.11082
https://doi.org/10.5753/etc.2020.11082
Publikováno v:
Anais do Encontro de Teoria da Computação (ETC 2020).
The class of precedence proper k-thin graphs is a subclass of proper k-thin graphs. The complexity status of recognizing proper k-thin graphs is unknown for any fixed k ≥ 2. In this work, we prove that, when k is part of the input, the problem of r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96fc7f48736203482aa25b82a38a02a7
https://doi.org/10.5753/etc.2020.11076
https://doi.org/10.5753/etc.2020.11076
Autor:
O. Solé-Pi, Jayme Luiz Szwarcfiter, Vitor Tocci F. de Luca, Nestaly Marín, A. Ramírez-Vigueras, Fabiano de S. Oliveira, Jorge Urrutia
Publikováno v:
Information Processing Letters. 174:106210
A grid embedding of a tree T whose vertices have degree at most four is an embedding in which the vertices of T are represented by points with integer coordinates, and the edges are represented by interior-disjoint horizontal or vertical line segment
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99cf71571694630eb056460b4c09dbd1
https://doi.org/10.1016/j.ipl.2021.106210
https://doi.org/10.1016/j.ipl.2021.106210
Autor:
Flavia Bonomo-Braberman, Jayme Luiz Szwarcfiter, Uéverton S. Souza, Julliano R. Nascimento, Fabiano de S. Oliveira
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030581497
COCOON
COCOON
Since many \({\mathsf {NP}}\)-complete graph problems have been shown polynomial-time solvable when restricted to claw-free graphs, we study the problem of determining the distance of a given graph to a claw-free graph, considering vertex elimination
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::054aefbe721490ec6824b03cb03eedd9
https://doi.org/10.1007/978-3-030-58150-3_2
https://doi.org/10.1007/978-3-030-58150-3_2
Autor:
Jorge Luiz de Jesus Goulart, Paulo Pinto, Giancarlo F. Roberto, Vinicius Sathler, Fabiano de S. Oliveira
Publikováno v:
Anais dos Workshops do VIII Congresso Brasileiro de Informática na Educação (CBIE 2019).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d6a7b13bf535f24fbc9f8302912b45b
https://doi.org/10.5753/cbie.wcbie.2019.337
https://doi.org/10.5753/cbie.wcbie.2019.337
Publikováno v:
Anais do Workshop sobre Educação em Computação (WEI).
Este estudo tem como objetivo avaliar a eficácia da ferramenta TuPy Online na aprendizagem de disciplinas do curso de Ciência da Computação da Universidade do Estado do Rio de Janeiro (UERJ). O TuPy foi idealizado como uma ferramenta para visuali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1980212d1ffc7c93e103cf83b04fa74
https://doi.org/10.5753/wei.2019.6631
https://doi.org/10.5753/wei.2019.6631