Alan A. Bertossi

Available identifiers

zbMath Open bertossi.alan-aMaRDI QIDQ218028

List of research outcomes

Publication	Date of Publication	Type
A gracefully degradable VLSI system for linear programming	2018-09-14	Paper
Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks	2017-10-06	Paper
Storage Placement in Path Networks	2017-05-16	Paper
Optimal receiver scheduling algorithms for a multicast problem	2010-04-28	Paper
Theoretical Computer Science	2010-02-23	Paper
Efficient corona training protocols for sensor networks	2008-08-14	Paper
Approximate L(δ1,δ2,…,δt)‐coloring of trees and interval graphs	2007-05-23	Paper
Channel assignment for interference avoidance in honeycomb wireless networks	2005-01-31	Paper
Time and work optimal simulation of basic reconfigurable meshes on hypercubes	2004-09-08	Paper
Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees	2002-10-16	Paper
https://portal.mardi4nfdi.de/entity/Q2766844	2002-07-22	Paper
Cellular channel assignment: A new localized and distributed strategy	2002-04-02	Paper
Parallel string matching with variable length don't cares	2000-07-06	Paper
Rate-monotonic scheduling for hard-real-time systems	1999-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q4224923	1999-04-11	Paper
https://portal.mardi4nfdi.de/entity/Q4395318	1998-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4206395	1990-01-01	Paper
String matching with weighted errors	1990-01-01	Paper
Parallel algorithms on circular-arc graphs	1990-01-01	Paper
Parallel circle-cover algorithms	1988-01-01	Paper
On the domatic number of interval graphs	1988-01-01	Paper
Total Domination and Irredundance in Weighted Interval Graphs	1988-01-01	Paper
On some matching problems arising in vehicle scheduling models	1987-01-01	Paper
Some parallel algorithms on interval graphs	1987-01-01	Paper
Hamiltonian circuits in interval graph generalizations	1986-01-01	Paper
Total domination in interval graphs	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5184419	1985-01-01	Paper
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors	1985-01-01	Paper
Dominating sets for split and bipartite graphs	1984-01-01	Paper
Finding Hamiltonian circuits in proper interval graphs	1983-01-01	Paper
Preemptive scheduling of periodic jobs in uniform multiprocessor systems	1983-01-01	Paper
The edge Hamiltonian path problem is NP-complete	1981-01-01	Paper
On the complexity of scheduling jobs on dedicated resources to minimize set-up costs	1980-01-01	Paper

Research outcomes over time

This page was built for person: Alan A. Bertossi