The following pages link to Gianluca Rossi (Q899312):
Displaying 17 items.
- Min-max communities in graphs: complexity and computational properties (Q899313) (← links)
- Text sparsification via local maxima. (Q1401406) (← links)
- Optimal covering designs: complexity results and new bounds (Q1765237) (← links)
- (Q1853511) (redirect page) (← links)
- On the Hamming distance of constraint satisfaction problems. (Q1853512) (← links)
- Smooth movement and Manhattan path based random waypoint mobility (Q1944081) (← links)
- Synchronous context-free grammars and optimal linear parsing strategies (Q2353407) (← links)
- Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
- On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
- On the approximability of the range assignment problem on radio networks in presence of selfish agents (Q2570125) (← links)
- (Q2762500) (← links)
- Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications (Q3408167) (← links)
- (Q4472452) (← links)
- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings (Q5302046) (← links)
- STACS 2004 (Q5309719) (← links)
- Structural Information and Communication Complexity (Q5710099) (← links)
- Approximation and Online Algorithms (Q5896937) (← links)
