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
Theoretical Computer Science
Theoretical Computer Science
Filtre a busca
 Qualquer 
Pesquisador
Publicação
Publicação
A strategy for searching with different access costs
The Complexity of Makespan Minimization for Pipeline Transportation
List matrix partitions of chordal graphs
List matrix partitions of chordal graphs
Paths and trails in edgecolored graphs
Chromatic index of graphs with no cycle with a unique chord
Complexity dichotomy on partial grid recognition
A study on multidimensional products of graphs and hybrid logics
Exact and approximation algorithms for errordetecting even codes
Cycle transversals in perfect graphs and cographs
Cycle transversals in perfect graphs and cographs
Corrigendum to Cycle transversals in perfect graphs and cographs [Theoret. Comput. Sci. 469 (2013) 1523]
Corrigendum to Cycle transversals in perfect graphs and cographs [Theoret. Comput. Sci. 469 (2013) 1523]
Efficient sub5 approximations for minimum dominating sets in unit disk graphs
Tractability and hardness of floodfilling games on trees
Tractability and hardness of floodfilling games on trees
Tractability and hardness of floodfilling games on trees
The predecessor existence problem for kreversible processes
The edgerecoloring cost of monochromatic and properly edgecolored paths and cycles
Maximum induced matchings close to maximum matchings
Complexity analysis of
Complexity analysis of P_3convexity problems on boundeddegree and planar graphs
Hierarchical complexity of 2cliquecolouring weakly chordal graphs and perfect graphs having cliques of size at least 3
On a graph calculus for modalities
Generalized threshold processes on graphs
Corrigendum to Complexity analysis of P 3 convexity problems on boundeddegree and planar graphs [Theoret. Comput. Sci. 607 Part 1 (2015) 8395]
Corrigendum to Complexity analysis of P 3 convexity problems on boundeddegree and planar graphs [Theoret. Comput. Sci. 607 Part 1 (2015) 8395]
Bisimilar and logically equivalent programs in PDL with parallel operator
Towards reasoning about Petri nets: A Propositional Dynamic Logic based approach
Towards reasoning about Petri nets: A Propositional Dynamic Logic based approach
On the (parameterized) complexity of recognizing wellcovered ( r ,  )graph
Cograph generation with linear delay
Cograph generation with linear delay
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness
Hardness and efficiency on minimizing maximum distances in spanning trees
A Computational Complexity Comparative Study of Graph Tessellation Problems
Succinct certification of monotone circuits
A Computational Complexity Comparative Study of Graph Tessellation Problems
On knotfree vertex deletion: Finegrained parameterized complexity analysis of a deadlock resolution graph problem
On knotfree vertex deletion: Finegrained parameterized complexity analysis of a deadlock resolution graph problem