The following pages link to Giorgio Gambosi (Q235659):
Displaying 39 items.
- The incremental maintenance of a depth-first-search tree in directed acyclic graphs (Q286984) (← links)
- On-line scheduling with setup costs (Q294721) (← links)
- Preserving approximation in the min-weighted set cover problem (Q674914) (← links)
- The set union problem with dynamic weighted backtracking (Q804287) (← links)
- Min-max communities in graphs: complexity and computational properties (Q899313) (← links)
- On locally presented posets (Q913830) (← links)
- On-line load balancing made simple: greedy strikes back (Q924556) (← links)
- Worst-case analysis of the set-union problem with extended backtracking (Q1124334) (← links)
- A pointer-free data structure for merging heaps and min-max heaps (Q1177934) (← links)
- Optimization aspects of deadlock prevention in packet-switching networks (Q1197951) (← links)
- Multidimensional interval routing schemes (Q1275073) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- On devising Boolean Routing Schemes (Q1389768) (← links)
- On-line algorithms for the channel assignment problem in cellular networks. (Q1427805) (← links)
- (Q1816998) (redirect page) (← links)
- Distributed community detection in dynamic graphs (Q2345454) (← links)
- An efficient implicit data structure for relation testing and searching in partially ordered sets (Q2366649) (← links)
- Algorithms for the Relaxed Online Bin-Packing Model (Q2706124) (← links)
- Characterization results of all shortest paths interval routing schemes (Q2744657) (← links)
- Distributed Community Detection in Dynamic Graphs (Q2868627) (← links)
- Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks (Q3334062) (← links)
- (Q3355223) (← links)
- A partially persistent data structure for the set-union problem (Q3479514) (← links)
- (Q3767386) (← links)
- Time-Stamp Approach to Store-and-Forward Deadlock Prevention (Q3768391) (← links)
- (Q3783593) (← links)
- (Q3787478) (← links)
- (Q4258216) (← links)
- The Set Union Problem with Unlimited Backtracking (Q4286228) (← links)
- A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS (Q4312276) (← links)
- Optimal centralized algorithms for store-and-forward deadlock avoidance (Q4419809) (← links)
- (Q4449245) (← links)
- Interval routing schemes (Q4596629) (← links)
- (Q4712660) (← links)
- An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791) (← links)
- Interval routing schemes (Q5916403) (← links)
- On the design of efficient ATM routing schemes (Q5958312) (← links)
- Multi-dimensional Interval Routing Schemes (Q6084552) (← links)
- Topological routing schemes (Q6570920) (← links)
