Skip to main content
English
Italiano
Search form
Search
legibility:
standard
|
enhanced
Department of Computer, Control and Management Engineering
Toggle navigation
Department
Contacts
Foreword
How to reach us
Management
People
Structures
Laboratories
Classrooms
Library
Teaching
Study programs
PhD programs
Teaching laboratories
Multimedia
Research
Overview
Research areas
Research Laboratories
Seminars and events
Research reports
DIAG Reports
Technical reports
interdepartmental centers
Spin-offs
Public engagement
News
News
Events calendar
DIAG on media
Seminars & events
Home
»
Tipologia Iris
»
01a Articolo Rivista
01a Articolo in rivista
An Enumerative Algorithm for the Frequency Assignment Problem
Minimizing the Span of d-walks to Compute Optimum Frequency Assignments
Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
On the P-median Polytope
Models and Algorithms for Terrestrial Digital Broadcasting
Ideal 0,1,-1 Matrices
A Lagrangian Based Heuristic for Large Scale Set-Covering Problems
The rank facets of the stable set polytope for claw-free graphs
Chair-free Berge Graphs are Perfect
Solving Hard Set Covering Problems
« first
‹ previous
…
373
374
375
376
377
378
379
380
381
…
next ›
last »
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma
