The following pages link to Giorgio Ausiello (Q289923):
Displaying 50 items.
- (Q203388) (redirect page) (← links)
- On resilient graph spanners (Q289925) (← links)
- Online maximum \(k\)-coverage (Q442204) (← links)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
- Chordality properties on graphs and minimal conceptual connections in semantic data models (Q579964) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- On-line algorithms for satisfiability problems with uncertainty (Q673379) (← links)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
- Dynamic maintenance of directed hypergraphs (Q913481) (← links)
- The on-line asymmetric traveling salesman problem (Q935844) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- The online prize-collecting traveling salesman problem (Q963439) (← links)
- Reoptimization of minimum and maximum traveling salesman's tours (Q1044031) (← links)
- On the existence of acyclic views in a database scheme (Q1060030) (← links)
- Structure preserving reductions among convex optimization problems (Q1143173) (← links)
- Toward a unified approach for the classification of NP-complete optimization problems (Q1143789) (← links)
- Combinatorial problems over power sets (Q1143948) (← links)
- Inclusion and equivalence between relational database schemata (Q1173416) (← links)
- On-line computation of minimal and maximal length paths (Q1184981) (← links)
- Partially dynamic maintenance of minimum weight hyperpaths (Q1775013) (← links)
- Reductions, completeness and the hardness of approximability (Q2488898) (← links)
- Teorie della complessità di calcolo (Q2544415) (← links)
- Abstract computational complexity and cycling computations (Q2548594) (← links)
- Una introduzione alla manipolazione algebrica (Q2556745) (← links)
- (Q2867360) (← links)
- Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components (Q2894245) (← links)
- (Q2906564) (← links)
- Graph Algorithms for Functional Dependency Manipulation (Q3026384) (← links)
- (Q3059319) (← links)
- (Q3059323) (← links)
- COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING (Q3084692) (← links)
- Online Maximum k-Coverage (Q3088282) (← links)
- (Q3138872) (← links)
- Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs (Q3167606) (← links)
- (Q3341929) (← links)
- LIMITING POLYNOMIAL APPROXIMATION OF COMPLEXITY CLASSES (Q3348409) (← links)
- Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments (Q3527251) (← links)
- Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming (Q3578313) (← links)
- (Q3680277) (← links)
- (Q3687754) (← links)
- (Q3691064) (← links)
- (Q3721810) (← links)
- Minimal Representation of Directed Hypergraphs (Q3738576) (← links)
- (Q3792253) (← links)
- (Q3863866) (← links)
- (Q3891804) (← links)
- (Q3902552) (← links)
