P. Bertolazzi

Available identifiers

Publication	Date of Publication	Type
How to draw a series-parallel digraph	2022-12-09	Paper
Computing orthogonal drawings with the minimum number of bends	2022-08-19	Paper
Computing orthogonal drawings with the minimum number of bends	2018-07-09	Paper
Integer programming models for feature selection: new extensions and a randomized solution algorithm	2016-10-07	Paper
Logic based methods for SNPs tagging and reconstruction	2010-03-19	Paper
Upward drawings of triconnected digraphs.	2008-12-21	Paper
Logic classification and feature selection for biomedical data	2008-06-12	Paper
Solving haplotyping inference parsimony problem using a new basic polynomial formulation	2008-06-12	Paper
Quasi-upward planarity	2002-05-21	Paper
On the design of efficient ATM routing schemes	2002-03-03	Paper
Optimal Upward Planarity Testing of Single-Source Digraphs	1998-05-10	Paper
A nice class for the vertex packing problem	1997-12-22	Paper
HOW TO DRAW A SERIES-PARALLEL DIGRAPH	1995-04-06	Paper
A decomposition strategy for the vertex cover problem	1989-01-01	Paper
A Class of Polynomially Solvable Set-Covering Problems	1988-01-01	Paper
An O(m n) algorithm for regular set-covering problems	1987-01-01	Paper
Alternative group relaxation of integer programming problems	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3691064	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3965558	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3888847	1980-01-01	Paper

This page was built for person: P. Bertolazzi