| Publication | Date of Publication | Type |
|---|
Fully dynamic maintenance of vertex cover
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Relay Node Placement in Wireless Sensor Networks
IEEE Transactions on Computers | 2018-06-12 | Paper |
Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
Information Processing Letters | 2016-05-26 | Paper |
Cost constrained fixed job scheduling.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Fully Dynamic Bin Packing
Fundamental Problems in Computing | 2009-08-05 | Paper |
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
SIAM Journal on Computing | 1998-09-21 | Paper |
River routing with a generalized model
Journal of Computer and System Sciences | 1997-08-07 | Paper |
A fundamental restriction on fully dynamic maintenance of bin packing
Information Processing Letters | 1997-02-27 | Paper |
On the \(k\)-coloring of intervals
Discrete Applied Mathematics | 1995-11-20 | Paper |
Graph theoretic analysis of PLA folding heuristics
Journal of Computer and System Sciences | 1993-08-18 | Paper |
The benefits of external wires in single row routing
Information Processing Letters | 1992-06-28 | Paper |
A fast algorithm for finding interlocking sets
Information Processing Letters | 1989-01-01 | Paper |
On locating minimum feedback vertex sets
Journal of Computer and System Sciences | 1988-01-01 | Paper |
The Complexity of Near-Optimal Programmable Logic Array Folding
SIAM Journal on Computing | 1988-01-01 | Paper |
Scheduling with semaphore constraints
Operations Research Letters | 1987-01-01 | Paper |
scientific article; zbMATH DE number 3958751 (Why is no real title available?)
| 1986-01-01 | Paper |
Two processor scheduling with limited preemption
Performance Evaluation | 1986-01-01 | Paper |
Feedback vertex sets and cyclically reducible graphs
Journal of the ACM | 1985-01-01 | Paper |
On the worst case performance of buddy systems
Acta Informatica | 1985-01-01 | Paper |
One-layer routing without component constraints
Journal of Computer and System Sciences | 1984-01-01 | Paper |
An O(n log m) algorithm for the Josephus Problem
Journal of Algorithms | 1983-01-01 | Paper |
On a simple deadlock recovery problem
Information Processing Letters | 1983-01-01 | Paper |
Critical Path Scheduling with Resource and Processor Constraints
Journal of the ACM | 1982-01-01 | Paper |
Concurrent Task Systems
Operations Research | 1981-01-01 | Paper |
Coffman-Graham scheduling of UET task systems with 0-1 resources
Information Processing Letters | 1981-01-01 | Paper |
List scheduling bounds for UET systems with resources
Information Processing Letters | 1980-01-01 | Paper |
