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
DISCRETE APPLIED MATHEMATICS
DISCRETE APPLIED MATHEMATICS
Filtre a busca
 Qualquer 
Pesquisador
Publicação
Publicação
The ringstar problem: A new integer programming formulation and a branchandcut algorithm
A branchandcut algorithm for the maximum balanced subgraph of a signed graph
Reduction Rules for the Covering Tour Problems
Hamiltonian cycles in unitary prefix transposition rearrangement graphs
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Characterization and recognition of generalized cliqueHelly graphs
Cycles in complementary prisms
Complexity results related to monophonic convexity
On the strong pHelly property
A computational study of freversible processes on graphs
Characterization and recognition of P_4sparse graphs partitionable into k independent sets and l cliques
Domination and total domination in cubic graphs of large girth
Averaging 2rainbow domination and Roman domination
On the forbidden induced subgraph sandwich problem
Distance kdomination, distance kguarding, and distance kvertex cover of maximal outerplanar graphs
The external constraint 4 nonempty part sandwich problem
Equitable total coloring of complete r partite p balanced graphs
Asymptotic surviving rate of trees with multiple fire sources
Timber game as a counting problem
The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
On the equitable total chromatic number of cubic graphs
More Fires and More Fighters
Strong equality of Roman and weak Roman domination in trees
2K2partition of some classes of graphs
The hunting of a snark with total chromatic number 5
Bicliquecolouring verification complexity and bicliquecolouring power graphs
The Polynomial Dichotomy for Three Nonempty Part Sandwich Problems
The ( k ,  ) partitioned probe problem: NPcomplete versus polynomial dichotomy
Solitaire Clobber played on Cartesian product of graphs
Slash and burn on graphs  Firefighting with general weights
Extremal graphs for the listcoloring version of a theorem of Nordhaus and Gaddum
Stable Skew Partition
On decision and Optimization (k,l)Graph Sandwich Problems
A branchandcut algorithm for the equitable coloring problem using a formulation by representatives
Scheduling workover rigs for onshore oil production
Variable Neighborhood Search for the DegreeConstrained Minimum Spanning Tree Problem
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
Multiprocessor scheduling under precedence constraints
New Efficient Heuristics for the Minimum Rectilinear Steiner Tree Problem
A Heuristic Approach to Hard Constrained Shortest Path Problems
A Graph Theory Approach to Subcontracting, Machine Duplication and Intercell Moves in Cellular Manufacturing
Characterization and recognition of sparse graphs partitionable into independent sets and cliques
Complexity of trails, paths and circuits in arccolored digraphs
Partition into cliques for cubic graphs: planar case, complexity and an approximation algorithm
The minimum reload st path, trail and walk problems
Characterization and recognition of P_4 sparse graphs graphs partitionable into k independent sets and l cliques
Partitioning chordal graphs into independent sets and cliques
Clique cycletransversals in distancehereditary graphs
On the hardness of the minimum height decision tree problem
A new measure for comparing biomedical regions of interest in segmentation of digital images
On the contour of graphs
On the contour of bipartite graphs
Tractability, hardness, and kernelization lower bound for and/or graph solution
Algorithms, kernels and lower bounds for the FloodIt game parameterized by the vertex cover number
Extremal values and bounds for the zero forcing number