The following pages link to Paola Bertolazzi (Q235657):
Displaying 21 items.
- (Q322471) (redirect page) (← links)
- Integer programming models for feature selection: new extensions and a randomized solution algorithm (Q322475) (← links)
- Alternative group relaxation of integer programming problems (Q794928) (← links)
- Logic classification and feature selection for biomedical data (Q929151) (← links)
- Solving haplotyping inference parsimony problem using a new basic polynomial formulation (Q929154) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- An O(m n) algorithm for regular set-covering problems (Q1095668) (← links)
- A decomposition strategy for the vertex cover problem (Q1123907) (← links)
- Quasi-upward planarity (Q1348947) (← links)
- A nice class for the vertex packing problem (Q1363736) (← links)
- Logic based methods for SNPs tagging and reconstruction (Q2379650) (← links)
- (Q3691064) (← links)
- A Class of Polynomially Solvable Set-Covering Problems (Q3834089) (← links)
- (Q3888847) (← links)
- (Q3965558) (← links)
- HOW TO DRAW A SERIES-PARALLEL DIGRAPH (Q4327386) (← links)
- Optimal Upward Planarity Testing of Single-Source Digraphs (Q4388867) (← links)
- Computing orthogonal drawings with the minimum number of bends (Q4571369) (← links)
- How to draw a series-parallel digraph (Q5056147) (← links)
- Computing orthogonal drawings with the minimum number of bends (Q5096950) (← links)
- On the design of efficient ATM routing schemes (Q5958312) (← links)
