Rizzi, Romeo

Rizzi, Romeo  

Informatica e Telecomunicazioni (cess.31/12/07)  

Mostra records
Risultati 1 - 20 di 40 (tempo di esecuzione: 0.031 secondi).
Titolo Anno di pubblicazione Autori Unitn File
A DP Algorithm for Speaker Change Detection 1-gen-2003 Vescovi, MicheleRizzi, Romeo +
A greedy approach to compute a minimum cycle basis of a directed graph 1-gen-2005 Rizzi, Romeo +
A note on range-restricted circuit covers 1-gen-2000 Rizzi, Romeo
A short proof of Konig's matching theorem 1-gen-2000 Rizzi, Romeo
A Simple Minimum T-Cut Algorithm 1-gen-2003 Rizzi, Romeo
Allocating Servers in Infostations for Bounded Simultaneous Requests 1-gen-2004 Bertossi, Alan AlbertRizzi, Romeo +
Channel Assignment for Interference Avoidance in Honeycomb Wireless Networks 1-gen-2004 Rizzi, RomeoBertossi, Alan Albert +
Combinatorial Optimization - Polyhedra and efficiency: A book review 1-gen-2004 Rizzi, Romeo +
Complexity of Context-free Grammars with Exceptions, and the inadequacy of grammars as models for XML and SGML 1-gen-2001 Rizzi, Romeo
Cycle cover property and CPP=SCC property are not equivalent 1-gen-2002 Rizzi, Romeo
Edge-coloring bipartite graphs 1-gen-2000 Rizzi, Romeo +
Evaluation of BIC-based algorithms for audio segmentation 1-gen-2005 Vescovi, MicheleRizzi, Romeo +
Excluding a simple good pair approach to directed cuts 1-gen-2001 Rizzi, Romeo
Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs 1-gen-2002 Rizzi, Romeo
Impaccando T-tagli e T-giunti 1-gen-1998 Rizzi, Romeo
Improveda Approximation for breakpoint graph decompositionand sorting by reversals 1-gen-2002 Rizzi, Romeo +
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 1-gen-1998 Rizzi, Romeo +
Indecomposable r-graphs and some other counterexamples 1-gen-1999 Rizzi, Romeo
Konig's Edge Coloring Theorem without augmenting paths 1-gen-1998 Rizzi, Romeo
Least and most colorable bases 1-gen-2007 Benati, StefanoRizzi, Romeo +