-
-
An Efficient Parallel Logarithmic Time Algorithm for
the Channel Routing Problem
-
-
The Order-Theoretic Approach to Scheduling: The
Stochastic Case
-
-
Graph Separation is NP-hard even for Graphs
with Bounded Degree
-
-
A Generalization of the Zero-One Principle for
Sorting Algorithms
-
-
Area-Optimal Three-Layer Channel Routing
-
-
A 3/2-Approximation Algorithm for the Jump Number of
Interval Orders
-
-
On the Pathwidth of Chordal Graphs
-
-
Graph Problems related to Gate Matrix Layout and PLA
Folding
-
-
Design Aspects of an Advanced Model-Oriented DSS for
Scheduling Problems in Civil Engineering
-
-
alpha-Vertex-Separation is NP-hard even
for 3-regular Graphs
-
Maciej M. Syslo
Bounds to the Page Number of Partially Ordered Sets
-
-
Decomposition of Partial Orders
-
-
A Minmax Facility Location Problem
-
-
Efficient Computations in Tree-Like Graphs
-
-
Channel Routing under Different Optimization
Criteria
