The following pages link to Alan A. Bertossi (Q218028):
Displayed 33 items.
- Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees (Q701181) (← links)
- Channel assignment for interference avoidance in honeycomb wireless networks (Q705558) (← links)
- Dominating sets for split and bipartite graphs (Q794174) (← links)
- String matching with weighted errors (Q909451) (← links)
- Efficient corona training protocols for sensor networks (Q936525) (← links)
- Optimal receiver scheduling algorithms for a multicast problem (Q967374) (← links)
- Finding Hamiltonian circuits in proper interval graphs (Q1050117) (← links)
- A polynomial feasibility test for preemptive periodic scheduling of unrelated processors (Q1067785) (← links)
- Hamiltonian circuits in interval graph generalizations (Q1092669) (← links)
- Some parallel algorithms on interval graphs (Q1098312) (← links)
- Parallel circle-cover algorithms (Q1108792) (← links)
- On the domatic number of interval graphs (Q1111388) (← links)
- On the complexity of scheduling jobs on dedicated resources to minimize set-up costs (Q1152708) (← links)
- The edge Hamiltonian path problem is NP-complete (Q1169818) (← links)
- Preemptive scheduling of periodic jobs in uniform multiprocessor systems (Q1172385) (← links)
- Rate-monotonic scheduling for hard-real-time systems (Q1278515) (← links)
- Parallel string matching with variable length don't cares (Q1344536) (← links)
- Time and work optimal simulation of basic reconfigurable meshes on hypercubes (Q1878709) (← links)
- Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks (Q2407947) (← links)
- (Q2766844) (← links)
- Storage Placement in Path Networks (Q2982333) (← links)
- Approximate <i>L</i>(δ<sub>1</sub>,δ<sub>2</sub>,…,δ<sub><i>t</i></sub>)‐coloring of trees and interval graphs (Q3442863) (← links)
- On some matching problems arising in vehicle scheduling models (Q3790928) (← links)
- Total Domination and Irredundance in Weighted Interval Graphs (Q3792718) (← links)
- (Q4206395) (← links)
- (Q4224923) (← links)
- (Q4395318) (← links)
- (Q5184419) (← links)
- A gracefully degradable VLSI system for linear programming (Q5375480) (← links)
- Theoretical Computer Science (Q5897357) (← links)
- Parallel algorithms on circular-arc graphs (Q5899761) (← links)
- Total domination in interval graphs (Q5903263) (← links)
- Cellular channel assignment: A new localized and distributed strategy (Q5950313) (← links)