Routing multiterminal nets around a rectangle
IEEE Transactions on Computers - The MIT Press scientific computation series
TROY: track router with yield-driven wire planning
Proceedings of the 44th annual Design Automation Conference
Optimal Wiring of Movable Terminals
IEEE Transactions on Computers
Mutual exclusion scheduling with interval graphs or related classes, Part I
Discrete Applied Mathematics
A solution method for a car fleet management problem with maintenance constraints
Journal of Heuristics
Jump number maximization for proper interval graphs and series-parallel graphs
Information Sciences: an International Journal
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
On the 2-Dimensional Channel Assignment Problem
IEEE Transactions on Computers
Track routing optimizing timing and yield
Proceedings of the 16th Asia and South Pacific Design Automation Conference
On the complexity of interval scheduling with a resource constraint
Theoretical Computer Science
Wavelength assignment for satisfying maximal number of requests in all-optical networks
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
New optimal layer assignment for bus-oriented escape routing
Integration, the VLSI Journal
Tactical fixed job scheduling with spread-time constraints
Computers and Operations Research
| Hi-index | 14.99 |
Given a set of intervals (pairs of real numbers), we look at the problem of finding a minimal partition of this set such that no element of the partition contains two overlapping intervals. We exhibit a T(N log N) algorithm which is optimal. The problem has applications in LSI layout design and job scheduling.