Search Results - "Santos, Vinicius Fernandes dos"

Climbing the Hill with ILP to Grow Patterns in Fuzzy Tensors by Maciel, Lucas, Alves, Jônatas, dos Santos, Vinicius Fernandes, Cerf, Loïc

“…Fuzzy tensors encode to what extent n -ary predicates are satisfied. The disjunctive box cluster model is a regression model where sub-tensors are explanatory…”
Get full text

On the proper interval completion problem within some chordal subclasses by Dross, François, Hilaire, Claire, Koch, Ivo, Leoni, Valeria, Pardal, Nina, Pujato, María Inés Lopez, Santos, Vinicius Fernandes dos

“…Given a property (graph class) Π, a graph G, and an integer k, the Π-completion problem consists of deciding whether we can turn G into a graph with the…”
Get full text

Integer programming formulations for the k$k$‐in‐a‐tree problem in graphs by Ferreira, Lucas Saldanha, Santos, Vinicius Fernandes dos, Valle, Cristiano Arbex

“…Chudnovsky and Seymour proposed the Three‐in‐a‐tree algorithm which solves the following problem in polynomial time: given three fixed vertices in a simple…”
Get full text

Computational complexity and linear formulations for optimizing the location of shared mobility stations by Monteiro, Cristiano Martins, Santos, Vinicius Fernandes, Davis Junior, Clodoveu Augusto

“…Properly planned shared mobility services can be attractive even for who owns and drives a private vehicle, but would consider not owning it anymore if a…”
Get full text

Connectivity with backbone structures in obstructed wireless networks by Neto, Manassés Ferreira, Goussevskaia, Olga, Santos, Vinícius Fernandes dos

“…In this work we consider a wireless ad-hoc network deployed on a finite street grid, where communication between nodes is disrupted by regularly spaced…”
Get full text

Dual Parameterization of Weighted Coloring by Araújo, Júlio, Campos, Victor A., Lima, Carlos Vinícius G. C., dos Santos, Vinícius Fernandes, Sau, Ignasi, Silva, Ana

“…Given a graph G , a proper k - coloring of G is a partition c = ( S i ) i ∈ [ 1 , k ] of V ( G ) into k stable sets S 1 , … , S k . Given a weight function w :…”
Get full text

Importance of Clinical and Laboratory Findings in the Diagnosis and Surgical Prognosis of Patients with Constrictive Pericarditis by Fernandes, Fábio, Melo, Dirceu Thiago Pessoa de, Ramires, Felix José Alvarez, Dias, Ricardo Ribeiro, Tonini, Marcio, Fernandes, Vinicius Dos Santos, Rochitte, Carlos Eduardo, Moreira, Carlos Henrique Valente, Mady, Charles

“…International studies have reported the value of the clinical profile and laboratory findings in the diagnosis of constrictive pericarditis. However, Brazilian…”
Get full text

An upper bound on the P 3 -Radon number by Dourado, Mitre C., Rautenbach, Dieter, Fernandes dos Santos, Vinícius, Schäfer, Philipp M., Szwarcfiter, Jayme L., Toman, Alexandre

Get full text

Characterization and representation problems for intersection betweennesses by Rautenbach, Dieter, dos Santos, Vinícius Fernandes, Schäfer, Philipp M., Szwarcfiter, Jayme L.

“…For a set system M = ( M v ) v ∈ V indexed by the elements of a finite set V , the intersection betweenness B ( M ) induced by M consists of all triples ( u ,…”
Get full text

Edge deletion to tree-like graph classes by Koch, Ivo, Pardal, Nina, dos Santos, Vinicius Fernandes

“…For a fixed property (graph class) Π, given a graph G and an integer k, the Π-deletion problem consists in deciding if we can turn G into a graph with the…”
Get full text

On recognition of threshold tolerance graphs and their complements by Golovach, Petr A., Heggernes, Pinar, Lindzey, Nathan, McConnell, Ross M., dos Santos, Vinícius Fernandes, Spinrad, Jeremy P., Szwarcfiter, Jayme Luiz

“…A graph G=(V,E) is a threshold tolerance graph if each vertex v∈V can be assigned a weight wv and a tolerance tv such that two vertices x,y∈V are adjacent if…”
Get full text

On the Carathéodory number of interval and graph convexities by Dourado, Mitre C., Rautenbach, Dieter, dos Santos, Vinícius Fernandes, Schäfer, Philipp M., Szwarcfiter, Jayme L.

“…Inspired by a result of Carathéodory [Über den Variabilitätsbereich der Fourierschen Konstanten von positiven harmonischen Funktionen, Rend. Circ. Mat. Palermo…”
Get full text

Irreversible conversion processes with deadlines by Rautenbach, Dieter, dos Santos, Vinícius Fernandes, Schäfer, Philipp M.

“…Given a graph G, a deadline td(u) and a time-dependent threshold f(u,t) for every vertex u of G, we study sequences C=(c0,c1,…) of 0/1-labelings ci of the…”
Get full text

Characterization and recognition of Radon-independent sets in split graphs by Dourado, Mitre C., Rautenbach, Dieter, dos Santos, Vinícius Fernandes, Szwarcfiter, Jayme L.

“…Let R be a set of vertices of a split graph G. We characterize when R allows a partition into two disjoint set R1 and R2 such that the convex hulls of R1 and…”
Get full text

On subbetweennesses of trees: Hardness, algorithms, and characterizations by Rautenbach, Dieter, dos Santos, Vinícius Fernandes, Schäfer, Philipp M., Szwarcfiter, Jayme L.

“…We study so-called betweennesses induced by trees and forests. Algorithmic problems related to betweennesses are typically hard. They have been studied as…”
Get full text

On the coloring of generalized Petersen graphs by Dantas, Simone, de Figueiredo, Celina, Mazzuoccolo, Giuseppe, Preissmann, Myriam, Santos, Vinicius Fernandes Dos, Sasaki, Diana

Get full text

On the equitable total chromatic number of cubic graphs by Dantas, S., de Figueiredo, C.M.H., Mazzuoccolo, G., Preissmann, M., dos Santos, V.F., Sasaki, D.

“…A total coloring is equitable if the number of elements colored with each color differs by at most one, and the least integer for which a graph has such a…”
Get full text

Algorithmic and structural aspects of the -Radon number by Dourado, Mitre C, Rautenbach, Dieter, dos Santos, Vinicius Fernandes, Schafer, Philipp M, Szwarcfiter, Jayme L, Toman, Alexandre

“…The generalization of classical results about convex sets in [R.sup.n] to abstract convexity spaces, defined by sets of paths in graphs, leads to many…”
Get full text

An upper bound on the -Radon number by Dourado, Mitre C, Rautenbach, Dieter, Fernandes dos Santos, Vinicius, Schaefer, Philipp M, Szwarcfiter, Jayme L, Toman, Alexandre

“…The generalization of classical results about convex sets in R n to abstract convexity spaces, defined by sets of paths in graphs, leads to many challenging…”
Get full text

Edge deletion to tree-like graph classes by Koch, Ivo, Pardal, Nina, Santos, Vinicius Fernandes dos

“…For a fixed property (graph class) ${\Pi}$, given a graph G and an integer k, the ${\Pi}$-deletion problem consists in deciding if we can turn $G$ into a graph…”
Get full text