The following pages link to Maurizio A. Bonuccelli (Q1066920):
Displayed 14 items.
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← 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)
- Preemptive scheduling of periodic jobs in uniform multiprocessor systems (Q1172385) (← links)
- (Q1257335) (redirect page) (← links)
- Minimum node disjoint path covering for circular-arc graphs (Q1257337) (← links)
- (Q3045183) (← links)
- A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes (Q3199199) (← links)
- (Q3675556) (← links)
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133) (← links)
- (Q4870828) (← links)
- (Q5184419) (← links)
- A gracefully degradable VLSI system for linear programming (Q5375480) (← links)