The following pages link to Michele Zito (Q385395):
Displaying 46 items.
- (Q218706) (redirect page) (← links)
- An improved upper bound on the non-3-colourability threshold (Q293171) (← links)
- The complexity of the empire colouring problem for linear forests (Q385396) (← links)
- The complexity of the empire colouring problem (Q476435) (← links)
- A PTAS for the sparsest 2-spanner of 4-connected planar triangulations (Q876695) (← links)
- The block connectivity of random trees (Q1010911) (← links)
- An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm (Q1026103) (← links)
- Large independent sets in random regular graphs (Q1034530) (← links)
- On a relation between uniform coding and problems of the form DTIMEF\((\mathcal F)=?\)DSPACEF\((\mathcal F)\) (Q1284694) (← links)
- Small maximal matchings in random graphs. (Q1401316) (← links)
- On polynomial-time approximation algorithms for the variable length scheduling problem. (Q1401344) (← links)
- Sparse hypercube 3-spanners (Q1570842) (← links)
- Complexity-theoretic models of phase transitions in search problems (Q1583531) (← links)
- A predicative and decidable characterization of the polynomial classes of languages (Q1589422) (← links)
- Maximum induced matchings of random cubic graphs (Q1612292) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- Easy knapsacks and the complexity of energy allocation problems in the smart grid (Q1800444) (← links)
- Independent sets in Line of Sight networks (Q2201775) (← links)
- Dynamic programming optimization in line of sight networks (Q2288208) (← links)
- The unsatisfiability threshold revisited (Q2643297) (← links)
- (Q2741515) (← links)
- (Q2766812) (← links)
- Finding Large Independent Sets in Line of Sight Networks (Q2971663) (← links)
- Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem (Q3104775) (← links)
- Martingales on Trees and the Empire Chromatic Number of Random Trees (Q3183598) (← links)
- Dominating sets of random recursive trees (Q3439556) (← links)
- (Q3439700) (← links)
- Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs (Q3525555) (← links)
- (Q3597153) (← links)
- Colouring Random Empire Trees (Q3599154) (← links)
- An Upper Bound on the Space Complexity of Random Formulae in Resolution (Q4405552) (← links)
- (Q4448374) (← links)
- (Q4500845) (← links)
- (Q4508359) (← links)
- (Q4708563) (← links)
- (Q4796200) (← links)
- (Q4875216) (← links)
- (Q4944970) (← links)
- Independent Sets in Restricted Line of Sight Networks (Q5056064) (← links)
- Algorithms and Models for the Web-Graph (Q5311172) (← links)
- Packing vertices and edges in random regular graphs (Q5436974) (← links)
- Lower Bounds and Algorithms for Dominating Sets in Web Graphs (Q5474650) (← links)
- Leafy spanning trees in hypercubes (Q5950587) (← links)
- Efficient web searching using temporal factors (Q5958137) (← links)
- Vertex-connectivity for node failure identification in Boolean network tomography (Q6121431) (← links)
- Vertex-connectivity for node failure identification in Boolean network tomography (Q6536156) (← links)
