Pular para o conteúdo principal
Portal do Governo Brasileiro
Atualize sua Barra de Governo
Buscar:
Pesquisador(a)

Publicação
Menu principal
PESQUISADORES
REVISTAS
ASSUNTOS
PUBLICAÇÕES
Início
MATEMATICA CONTEMPORANEA
MATEMATICA CONTEMPORANEA
Filtre a busca
 Qualquer 
Pesquisador
Publicação
Publicação
Cusp forms of weight 2 over an imaginary quadratic field as homology classes
Existence, uniqueness and controllability for Parabolic Equations in noncylindrical domains
The (p,q)Helly property and its application to the family of cliques of a graph
Geometry and commutability of symmetric operators
Remarks on carrier evolution equation
Global and Decay of Solutions of a Damped KirchhoffCarrier Equation in Banach Spaces
Upper bounds and exact values on transposition distance of permutations
Decompositions by maxclique separators
Upper bounds and exact values on transposition distance of permutations
Convex covers of graphs
Carleman inequality and null controllability for parabolic equations.
An evidence for Lovász conjecture about Hamiltonian paths and cycles
Two Families of Cayley Graph Interconnection Networks
Minimal Graphs in PSL(R,t)
Design of connection networks with bounded number of nonterminal vertices
Design of connection networks with bounded number of nonterminal vertices
Design of connection networks with bounded number of nonterminal vertices
(k,l)sandwich problems: why not ask for special kinds of bread?
(k,l)sandwich problems: why not ask for special kinds of bread?.
Sorting Separable permutations by restricted multibreak rearrangements
Sorting Separable permutations by restricted multibreak rearrangements
On the diameter of the Cayley Graph Hl,p
New results of the geodeticity of the contour of a graph
Constructing pairs of Laplacian equienergetic threshold graphs
Constructing pairs of Laplacian equienergetic threshold graphs
Short blockmoveCPP is NPcomplete
Short BlockMove?CPP is NPComplete
Geração de Obstruções Minimais de Grafos(2; 1)
Geração de Obstruções Minimais de Grafos(2; 1)
DLintegral and DQintegral graphs
Connecting terminals using at most one router
Bounds and Complexity for the Tessellation Problem
Geração de Obstruções Minimais de Grafos(2, 1)
Aspects of the complexity of (\gamma,\mu)coloring
An algorithmic strategy to select vertices as router candidates in a Steiner tree
A linear algorithm for the distance in Cayley Graph Hl,p
The Strict Terminal Connection Problem on Chordal Bipartite Graphs