Giorgio Gambosi

From MaRDI portal
Revision as of 20:04, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:235659

Available identifiers

zbMath Open gambosi.giorgioWikidataQ112452964 ScholiaQ112452964MaRDI QIDQ235659

List of research outcomes





PublicationDate of PublicationType
Topological routing schemes2024-07-11Paper
On devising Boolean Routing schemes2024-02-28Paper
Multi-dimensional Interval Routing Schemes2023-12-01Paper
Interval routing schemes2017-12-04Paper
On-line scheduling with setup costs2016-06-16Paper
The incremental maintenance of a depth-first-search tree in directed acyclic graphs2016-05-26Paper
Min-max communities in graphs: complexity and computational properties2015-12-28Paper
Distributed community detection in dynamic graphs2015-05-22Paper
Distributed Community Detection in Dynamic Graphs2013-12-17Paper
On-line load balancing made simple: greedy strikes back2008-05-16Paper
On-line algorithms for the channel assignment problem in cellular networks.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44492452004-02-08Paper
Optimal centralized algorithms for store-and-forward deadlock avoidance2003-10-16Paper
Characterization results of all shortest paths interval routing schemes2003-06-26Paper
On the design of efficient ATM routing schemes2002-03-03Paper
Algorithms for the Relaxed Online Bin-Packing Model2001-03-19Paper
https://portal.mardi4nfdi.de/entity/Q42582161999-09-01Paper
Multidimensional interval routing schemes1999-01-12Paper
On devising Boolean Routing Schemes1998-06-30Paper
Preserving approximation in the min-weighted set cover problem1997-06-30Paper
Interval routing schemes1997-01-29Paper
The Set Union Problem with Unlimited Backtracking1994-12-21Paper
A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS1994-11-06Paper
Graph theoretical issues in computer networks1994-04-12Paper
An efficient implicit data structure for relation testing and searching in partially ordered sets1993-08-30Paper
Optimization aspects of deadlock prevention in packet-switching networks1993-01-16Paper
A pointer-free data structure for merging heaps and min-max heaps1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q47126601992-06-25Paper
The set union problem with dynamic weighted backtracking1991-01-01Paper
On locally presented posets1990-01-01Paper
A partially persistent data structure for the set-union problem1990-01-01Paper
Worst-case analysis of the set-union problem with extended backtracking1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33552231989-01-01Paper
An application of $m$-ary trees to the design of data structures for geometric searching problems1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37874781988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37673861987-01-01Paper
Time-Stamp Approach to Store-and-Forward Deadlock Prevention1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37835931987-01-01Paper
Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks1984-01-01Paper

Research outcomes over time

This page was built for person: Giorgio Gambosi