| Publication | Date of Publication | Type |
|---|
A gracefully degradable VLSI system for linear programming
IEEE Transactions on Computers | 2018-09-14 | Paper |
Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks
Journal of Discrete Algorithms | 2017-10-06 | Paper |
Storage Placement in Path Networks
IEEE Transactions on Computers | 2017-05-16 | Paper |
Optimal receiver scheduling algorithms for a multicast problem
Discrete Applied Mathematics | 2010-04-28 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Efficient corona training protocols for sensor networks
Theoretical Computer Science | 2008-08-14 | Paper |
Approximate <i>L</i>(δ<sub>1</sub>,δ<sub>2</sub>,…,δ<sub><i>t</i></sub>)‐coloring of trees and interval graphs
Networks | 2007-05-23 | Paper |
Channel assignment for interference avoidance in honeycomb wireless networks
Journal of Parallel and Distributed Computing | 2005-01-31 | Paper |
Time and work optimal simulation of basic reconfigurable meshes on hypercubes
Journal of Parallel and Distributed Computing | 2004-09-08 | Paper |
Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees
Journal of Parallel and Distributed Computing | 2002-10-16 | Paper |
| scientific article; zbMATH DE number 1696651 (Why is no real title available?) | 2002-07-22 | Paper |
Cellular channel assignment: A new localized and distributed strategy
Mobile Networks & Applications | 2002-04-02 | Paper |
Parallel string matching with variable length don't cares
Journal of Parallel and Distributed Computing | 2000-07-06 | Paper |
Rate-monotonic scheduling for hard-real-time systems
European Journal of Operational Research | 1999-08-05 | Paper |
| scientific article; zbMATH DE number 1241383 (Why is no real title available?) | 1999-04-11 | Paper |
| scientific article; zbMATH DE number 1163705 (Why is no real title available?) | 1998-08-04 | Paper |
| scientific article; zbMATH DE number 4126691 (Why is no real title available?) | 1990-01-01 | Paper |
Parallel algorithms on circular-arc graphs
Information Processing Letters | 1990-01-01 | Paper |
String matching with weighted errors
Theoretical Computer Science | 1990-01-01 | Paper |
Parallel circle-cover algorithms
Information Processing Letters | 1988-01-01 | Paper |
On the domatic number of interval graphs
Information Processing Letters | 1988-01-01 | Paper |
Total Domination and Irredundance in Weighted Interval Graphs
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
Some parallel algorithms on interval graphs
Discrete Applied Mathematics | 1987-01-01 | Paper |
On some matching problems arising in vehicle scheduling models
Networks | 1987-01-01 | Paper |
Hamiltonian circuits in interval graph generalizations
Information Processing Letters | 1986-01-01 | Paper |
Total domination in interval graphs
Information Processing Letters | 1986-01-01 | Paper |
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
Discrete Applied Mathematics | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3892606 (Why is no real title available?) | 1985-01-01 | Paper |
Dominating sets for split and bipartite graphs
Information Processing Letters | 1984-01-01 | Paper |
Finding Hamiltonian circuits in proper interval graphs
Information Processing Letters | 1983-01-01 | Paper |
Preemptive scheduling of periodic jobs in uniform multiprocessor systems
Information Processing Letters | 1983-01-01 | Paper |
The edge Hamiltonian path problem is NP-complete
Information Processing Letters | 1981-01-01 | Paper |
On the complexity of scheduling jobs on dedicated resources to minimize set-up costs
Information Processing Letters | 1980-01-01 | Paper |
