IRIS

Sfoglia per Autore  

Opzioni
Mostrati risultati da 1 a 20 di 64
Titolo Anno di pubblicazione Autori Unitn File
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 1-gen-1998 Rizzi, Romeo +
Improving a Family of Approximation Algorithms to Edge Color Multigraphs 1-gen-1998 Rizzi, Romeo +
Konig's Edge Coloring Theorem without augmenting paths 1-gen-1998 Rizzi, Romeo
Impaccando T-tagli e T-giunti 1-gen-1998 Rizzi, Romeo
Randomized Greedy Algorithms for the Hypergraph Partitioning Problem 1-gen-1998 Bertossi, Alan AlbertBattiti, RobertoRizzi, Romeo
Randomized greedy algorithms for the hypergraph partitioning problem 1-gen-1998 Battiti, RobertoBertossi, Alan AlbertRizzi, Romeo
Indecomposable r-graphs and some other counterexamples 1-gen-1999 Rizzi, Romeo
Indecomposable r-graphs and some other counterexamples 1-gen-1999 Rizzi, Romeo
A note on range-restricted circuit covers 1-gen-1999 Rizzi, Romeo
A short proof of König's matching theorem 1-gen-1999 Rizzi, Romeo
Edge­Coloring Bipartite Graphs 1-gen-1999 Rizzi, Romeo +
On minimizing symmetric set functions 1-gen-1999 Rizzi, Romeo
König's Edge Coloring Theorem without augmenting paths 1-gen-1999 Rizzi, Romeo
Edge-coloring bipartite graphs 1-gen-2000 Rizzi, Romeo +
On minimizing symmetric set functions 1-gen-2000 Rizzi, Romeo
A note on range-restricted circuit covers 1-gen-2000 Rizzi, Romeo
Excluding a Simple Good Pair Approach to Directed Cuts 1-gen-2000 Rizzi, Romeo
Shortest Paths in Conservative Graphs 1-gen-2000 Rizzi, Romeo +
Minimum T-cuts and optimal T-pairings 1-gen-2000 Rizzi, Romeo
A short proof of Konig's matching theorem 1-gen-2000 Rizzi, Romeo
Mostrati risultati da 1 a 20 di 64
Legenda icone

  •  file ad accesso aperto
  •  file disponibili sulla rete interna
  •  file disponibili agli utenti autorizzati
  •  file disponibili solo agli amministratori
  •  file sotto embargo
  •  nessun file disponibile