Journal: Discrete Applied Mathematics

Found 533 papers in total
Capacitated two-parallel machines scheduling to minimize sum of job completion times
Capacitated two-parallel machines scheduling to minimize sum of job completion times
1993,
In this paper the authors study the n- job two-parallel machines scheduling problem...
A note on subtrees rooted along the primary path of a binary tree
A note on subtrees rooted along the primary path of a binary tree
1993,
Let denote the set of rooted binary plane trees with n external nodes, for given let...
Polyhedral results for the precedence-constrained knapsack problem
Polyhedral results for the precedence-constrained knapsack problem
1993,
A problem characteristic common to a number of important integer programming problems...
Solving makespan minimization problems with Lagrangean decomposition
Solving makespan minimization problems with Lagrangean decomposition
1993,
The problem of minimizing makespan in a single stage manufacturing process with...
Rational and affine expressions for image description
Rational and affine expressions for image description
1993,
In this paper, the representation, generation and inference of images using...
P4-trees and substitution decomposition
P4-trees and substitution decomposition
1992,
This paper introduces a new data structure called a P 4 - tree, and uses the data...
The parallel complexity of single rule logic programs
The parallel complexity of single rule logic programs
1992,
The paper considers logic programs without function symbols, called Datalog programs,...
Partial dependencies in relational databases and their realization
Partial dependencies in relational databases and their realization
1992,
Weakening the functional dependencies introduced by Armstrong the authors get the...
On the complexity of inferring functional dependencies
On the complexity of inferring functional dependencies
1992,
The dependency inference problem is to find a cover for the set of functional...
Minimizing restricted-fanout queries
Minimizing restricted-fanout queries
1992,
Conjunctive queries form an important subset of relational algebra. Each conjunctive...
The characterization of branching dependencies
The characterization of branching dependencies
1992,
A new type of dependencies in a relational database model is introduced. If b is an...
Balanced block spacing for VLSI layout
Balanced block spacing for VLSI layout
1992,
Placement algorithms for VLSI layout tend to stick the building blocks togehter. The...
Set to set broadcasting in communication networks
Set to set broadcasting in communication networks
1992,
Suppose G=(V,E) is a graph whose vertices represent people and edges represent...
Errata to ‘Selecting the top three elements’ by M. Aigner: A result of a computer-assisted proof search
Errata to ‘Selecting the top three elements’ by M. Aigner: A result of a computer-assisted proof search
1993,
Based on negative results of an attempt to re-establish the known results for the...
Fractional arboricity, strength, and principal partitions in graphs and matroids
Fractional arboricity, strength, and principal partitions in graphs and matroids
1992,
In a 1983 paper, D. Gusfield introduced a function which is called the strength of a...
A simple proof of Liang’s lower bound for on-line packing and the extension to the parametric case
A simple proof of Liang’s lower bound for on-line packing and the extension to the parametric case
1993,
In this note the authors present a simplified proof of a lower bound for on-line bin...
Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under -distance
Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under -distance
1992,
In this paper, the weighted tailored 2-partition problem and the weighted 2-center...
Matching parentheses in parallel
Matching parentheses in parallel
1992,
Parallel algorithms for evaluating arithmetic expressions generally assume the...
The capacity of the subarray partial concentrators
The capacity of the subarray partial concentrators
1992,
A partial concentrator with parameters n,m, and c , is an n (inputs)× m...
Strong elimination ordering of the total graph of a tree
Strong elimination ordering of the total graph of a tree
1992,
Total graphs of trees were proved strongly chordal by Martin Farber. The authors give...
Search and sweep numbers of finite directed acyclic graphs
Search and sweep numbers of finite directed acyclic graphs
1993,
The search number of a graph is the least number of searchers needed to find any...
Coloring drawings of bipartite graphs: A problem in automated assembly
Coloring drawings of bipartite graphs: A problem in automated assembly
1993,
Several workpiece carriers or vehicles are tethered to fixed bases. The vehicles are...
Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
1993,
An in-tournament digraph is a digraph in which the set of in-neighbours of every...
Stability number of bull- and chair-free graphs
Stability number of bull- and chair-free graphs
1993,
A bull is the graph with vertices a,b,c,d,e and edges ab,ac,bc,ad,be; a chair is the...
Papers per page: