Alan A. Bertossi

From MaRDI portal
Person:218028

Available identifiers

zbMath Open bertossi.alan-aMaRDI QIDQ218028

List of research outcomes





PublicationDate of PublicationType
A gracefully degradable VLSI system for linear programming2018-09-14Paper
Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks2017-10-06Paper
Storage Placement in Path Networks2017-05-16Paper
Optimal receiver scheduling algorithms for a multicast problem2010-04-28Paper
Theoretical Computer Science2010-02-23Paper
Efficient corona training protocols for sensor networks2008-08-14Paper
Approximate L12,…,δt)‐coloring of trees and interval graphs2007-05-23Paper
Channel assignment for interference avoidance in honeycomb wireless networks2005-01-31Paper
Time and work optimal simulation of basic reconfigurable meshes on hypercubes2004-09-08Paper
Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees2002-10-16Paper
https://portal.mardi4nfdi.de/entity/Q27668442002-07-22Paper
Cellular channel assignment: A new localized and distributed strategy2002-04-02Paper
Parallel string matching with variable length don't cares2000-07-06Paper
Rate-monotonic scheduling for hard-real-time systems1999-08-05Paper
https://portal.mardi4nfdi.de/entity/Q42249231999-04-11Paper
https://portal.mardi4nfdi.de/entity/Q43953181998-08-04Paper
https://portal.mardi4nfdi.de/entity/Q42063951990-01-01Paper
String matching with weighted errors1990-01-01Paper
Parallel algorithms on circular-arc graphs1990-01-01Paper
Parallel circle-cover algorithms1988-01-01Paper
On the domatic number of interval graphs1988-01-01Paper
Total Domination and Irredundance in Weighted Interval Graphs1988-01-01Paper
On some matching problems arising in vehicle scheduling models1987-01-01Paper
Some parallel algorithms on interval graphs1987-01-01Paper
Hamiltonian circuits in interval graph generalizations1986-01-01Paper
Total domination in interval graphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51844191985-01-01Paper
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors1985-01-01Paper
Dominating sets for split and bipartite graphs1984-01-01Paper
Finding Hamiltonian circuits in proper interval graphs1983-01-01Paper
Preemptive scheduling of periodic jobs in uniform multiprocessor systems1983-01-01Paper
The edge Hamiltonian path problem is NP-complete1981-01-01Paper
On the complexity of scheduling jobs on dedicated resources to minimize set-up costs1980-01-01Paper

Research outcomes over time

This page was built for person: Alan A. Bertossi