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
A Heuristic Approach to Hard Constrained Shortest Path Problems
New Efficient Heuristics for the Minimum Rectilinear Steiner Tree Problem
A Graph Theory Approach to Subcontracting, Machine Duplication and Intercell Moves in Cellular Manufacturing
Reduction Rules for the Covering Tour Problems
Variable Neighborhood Search for the DegreeConstrained Minimum Spanning Tree Problem
Partitioning chordal graphs into independent sets and cliques
Stable Skew Partition
Partitioning chordal graphs into independent sets and cliques
On decision and Optimization (k,l)Graph Sandwich Problems
On the hardness of the minimum height decision tree problem
Extremal graphs for the listcoloring version of a theorem of Nordhaus and Gaddum
Scheduling workover rigs for onshore oil production
Multiprocessor scheduling under precedence constraints
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
Characterization and recognition of generalized cliqueHelly graphs
Partition into cliques for cubic graphs: planar case, complexity and an approximation algorithm
Partition into cliques for cubic graphs: Planar case, complexity and approximation
On the strong pHelly property
The Polynomial Dichotomy for Three Nonempty Part Sandwich Problems
The minimum reload st path, trail and walk problems
Decompositions for edgecoloring join graphs and cobipartite graphs?
Complexity results related to monophonic convexity
Total chromatic number of unichordfree graphs
The external constraint 4 nonempty part sandwich problem
The ringstar problem: A new integer programming formulation and a branchandcut algorithm
On the forbidden induced subgraph sandwich problem
Characterization and recognition of P_4sparse graphs partitionable into k independent sets and l cliques
Characterization and recognition of sparse graphs partitionable into independent sets and cliques
Characterization and recognition of P_4 sparse graphs graphs partitionable into k independent sets and l cliques
2K2partition of some classes of graphs
On the contour of graphs
On the contour of graphs
More Fires and More Fighters
Complexity of trails, paths and circuits in arccolored digraphs
The hunting of a snark with total chromatic number 5
Domination and total domination in cubic graphs of large girth
Complexity of colouring problems restricted to unichordfree and { square,unichord }free graphs
Asymptotic surviving rate of trees with multiple fire sources
A branchandcut algorithm for the equitable coloring problem using a formulation by representatives
The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
Solitaire Clobber played on Cartesian product of graphs
On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges
Hamiltonian cycles in unitary prefix transposition rearrangement graphs
Distance kdomination, distance kguarding, and distance kvertex cover of maximal outerplanar graphs
Cycles in complementary prisms
Bicliquecolouring verification complexity and bicliquecolouring power graphs
Bicliquecolouring verification complexity and bicliquecolouring power graphs
A new measure for comparing biomedical regions of interest in segmentation of digital images
A new measure for comparing biomedical regions of interest in segmentation of digital images
Strong equality of Roman and weak Roman domination in trees
Slash and burn on graphs  Firefighting with general weights
On the equitable total chromatic number of cubic graphs
Extremal values and bounds for the zero forcing number
Clique cycletransversals in distancehereditary graphs
Clique cycletransversals in distancehereditary graphs
Averaging 2rainbow domination and Roman domination
Tractability, hardness, and kernelization lower bound for and/or graph solution
Tractability, hardness, and kernelization lower bound for and/or graph solution
The ( k ,  ) partitioned probe problem: NPcomplete versus polynomial dichotomy
Using SPQRtrees to speed up recognition algorithms based on 2cutsets
On the resilience of canonical reducible permutation graphs
On the contour of bipartite graphs
On the embedding of cone graphs in the line with distinct distances between neighbors
Computing the zigzag number of directed graphs
Algorithms, kernels and lower bounds for the FloodIt game parameterized by the vertex cover number
Algorithms, kernels and lower bounds for the FloodIt game parameterized by the vertex cover number
A branchandcut algorithm for the maximum balanced subgraph of a signed graph
A computational study of freversible processes on graphs
Timber game as a counting problem
The Solitaire Clobber game and correducibility of graphs
The distance matrix of caterpillar
Robust scheduling with budgeted uncertainty
On the computational complexity of closest genome problems
On the computational complexity of closest genome problems
Equitable total coloring of complete r partite p balanced graphs
Dijkstra graphs
The Solitaire Clobber game and correducibility of graphs
Short proofs on the structure of general partition, equistable and triangle graphs
Positive semidefiniteness of on some families of graphs
Positive semidefiniteness of on some families of graphs
On hyperHamiltonicity in graphs
On hyperHamiltonicity in graphs
Maximum cuts in edgecolored graphs
Complexity aspects of  chord convexities
Total tessellation cover: bounds, hardness, and applications
The biclique partitioning polytope
The biclique partitioning polytope
Hardness and efficiency on admissibility for graph operations
Determining equitable total chromatic number for infinite classes of complete r partite graphs
Compositions, decompositions, and conformability for total coloring on power of cycle graphs
Compositions, decompositions, and conformability for total coloring on power of cycle graphs
New bounds for the bchromatic number of vertex deleted graphs
Edge clique partition in graphs
Edge clique partition in (k,l)graphs