Romeo Rizzi

Foto,  15 gennaio 2015
Qualifica
Professore associato
Settore disciplinare
MAT/09 - RICERCA OPERATIVA
Settore di Ricerca (ERC)
PE6_6 - Algorithms, distributed, parallel and network algorithms, algorithmic game theory

PE6_13 - Bioinformatics, biocomputing, and DNA and molecular computation

PE6_12 - Scientific computing, simulation and modelling tools

Ufficio
Ca' Vignal 2,  Piano 1,  Stanza 81
Telefono
+39 045 8027088
Telefono mobile
3291780915
Fax
+39 045 8027068
E-mail
romeo|rizzi*univr|it <== Sostituire il carattere | con . e il carattere * con @ per avere indirizzo email corretto.
Pagina Web personale
http://profs.sci.univr.it/~rrizzi/

Orario di ricevimento

 Orari di ricevimento e contacts mantenuti aggiornati alla pagina:

http://profs.sci.univr.it/~rrizzi/classes/getMe.html

Insegnamenti

Insegnamenti attivi nel periodo selezionato: 27.
Clicca sull'insegnamento per vedere orari e dettagli del corso.

Corso Nome Crediti totali Online Crediti del docente Moduli svolti da questo docente
Laurea magistrale in Ingegneria e scienze informatiche Algoritmi (2017/2018)   12    ALGORITMI
Laurea magistrale in Mathematics Mathematics for decisions (seminar course) (2017/2018)   6   
Laurea in Matematica Applicata Ricerca operativa (2017/2018)   6   
Laurea magistrale in Ingegneria e scienze informatiche Sfide di programmazione (2017/2018)   6   
Laurea magistrale in Ingegneria e scienze informatiche Algoritmi (2016/2017)   12  eLearning ALGORITMI
Laurea magistrale in Mathematics Mathematics for decisions (seminar course) (2016/2017)   6  eLearning
Laurea in Matematica Applicata Ricerca operativa (2016/2017)   6  eLearning
Laurea magistrale in Ingegneria e scienze informatiche Sfide di programmazione (2016/2017)   6   
Laurea magistrale in Ingegneria e scienze informatiche Algoritmi (2015/2016)   12  eLearning ALGORITMI
Laurea magistrale in Mathematics Mathematics for decisions (seminar course) (2015/2016)   6   
Laurea in Matematica Applicata Ricerca operativa (2015/2016)   6  eLearning
Laurea magistrale in Ingegneria e scienze informatiche Sfide di programmazione (2015/2016)   6   
Laurea magistrale in Ingegneria e scienze informatiche Algoritmi (2014/2015)   12  eLearning ALGORITMI
PAS C310 - Laboratorio di Informatica Industriale Fondamenti e programmazione (2014/2015)   4  eLearning COMPLEMENTI
TFA A042 - Informatica (II grado) Fondamenti e programmazione (2014/2015)   6  eLearning COMPLEMENTI
Laurea magistrale in Mathematics Mathematics for decisions (seminar course) (2014/2015)   6   
Laurea in Matematica Applicata Ricerca operativa (2014/2015)   6   
Laurea magistrale in Ingegneria e scienze informatiche Sfide di programmazione (2014/2015)   6  eLearning
Laurea magistrale in Ingegneria e scienze informatiche Algoritmi (2013/2014)   12  eLearning ALGORITMI
PAS A042 - Informatica Fondamenti e programmazione (2013/2014)   6  eLearning COMPLEMENTI
Laurea in Matematica Applicata Ricerca operativa (2013/2014)   6   
Laurea magistrale in Ingegneria e scienze informatiche Sfide di programmazione (2013/2014)   6   
Laurea magistrale in Ingegneria e scienze informatiche Algoritmi (2012/2013)   12  eLearning ALGORITMI
TFA A042 - Informatica (II grado) Fondamenti e programmazione (2012/2013)   6    MODULO C
Laurea in Matematica Applicata Ricerca operativa (2012/2013)   6   
Laurea magistrale in Ingegneria e scienze informatiche Algoritmi (2011/2012)   12  eLearning ALGORITMI
Laurea in Matematica Applicata Ricerca operativa (2011/2012)   6   

 
Competenze
Argomento Descrizione Area di ricerca
Algorithms for numerical algorithms; for combinatorics and graph theory When we say that our approach to graph theory and combinatorics is algorithmic we not only want to underline the fact that we are most often interested in the obtaining effective algorithms for the problems investigated but also that we indulge unraveling the mathematical problems down till the bottom most level to achieve a most elementary comprehension. Also, we rest on computational complexity as the methodological lighthouse of our research approaches and investigations. This depth and awareness characterizes the strength of the research by our department in Verona. Matematica discreta e computazionale
Computer science - -
Discrete mathematics in relation to computer science Discrete mathematics has a privileged link to computer science, and the converse is also true. As algorithmists, we tangle discrete mathematics in order to give our contribution to computer science. Discrete mathematics in relation to computer science is a huge factory all over the world, and our computer science department here in Verona is well present in all this. Matematica discreta e computazionale
Computer science - -
Graph theory Graphs are a flexible model for core combinatorial problems as arising in various applications. In particular, graphs are encountered in various fields of mathematics, computer science, science in general, and technology. With this, graph theory is not only fun, but it is also a well established and central area of discrete mathematics of topmost interdisciplinarity. Some topics we are interested in: matching, factoring, edge-coloring, flows, cycle basis, packing, covering and partitioning, graph classes, algorithmic graph theory. Matematica discreta e computazionale
Combinatorics - Graph theory
Mathematical programming In mathematics, statistics, empirical sciences, computer science, or management science, mathematical optimization (alternatively, mathematical programming) is the selection of a best element (with regard to some criteria) from some set of available alternatives. Here, optimization includes finding "best available" values of some objective function given a defined domain, including a variety of different types of objective functions and different types of domains. Optimization theory, techniques, and algorithms, comprises a large area of applied mathematics. Among the many sectors of mathematical programming, some of those represented in Verona are the following: linear programming, integer linear programming, combinatorial optimization, multiobjective optimization. Matematica discreta e computazionale
Operations research, mathematical programming - -
Operations research Operations research is a discipline that deals with the application of advanced analytical methods to help make better decisions. The terms management science and decision science are sometimes used as more modern-sounding synonyms. Employing techniques from other mathematical sciences, such as mathematical modeling, statistical analysis, and mathematical optimization, operations research arrives at optimal or near-optimal solutions to complex decision-making problems. Operations Research is often concerned with determining the maximum (of profit, performance, or yield) or minimum (of loss, risk, or cost) of some real-world objective. Originating in military efforts before World War II, its techniques have grown to concern problems in a variety of industries. Besides its applications in industry and in management, Operations Research is at the very junction of mathematics and economics. Operations research embodies lots of deep results and theory but, at the same time, it is the archetype of applied mathematics. In Verona, we draw applications of the tools and methodologies of operations research to computational biology. More generally, we actively work in combinatorial optimization and contribute to algorithmic graph theory. We also apply and express methods and competencies of mathematical programming. In mathematics, statistics, empirical sciences, computer science, or management science, mathematical optimization (alternatively, mathematical programming) is the selection of a best element (with regard to some criteria) from some set of available alternatives. Here, optimization includes finding "best available" values of some objective function given a defined domain, including a variety of different types of objective functions and different types of domains. Optimization theory, techniques, and algorithms, comprises a large area of applied mathematics. Among the many sectors of mathematical programming, some of those represented in Verona are the following: linear programming, integer linear programming, combinatorial optimization, multiobjective optimization. Bioinformatica e informatica medica
Applied computing - Operations research
Operations research and management science Operations research is a discipline that deals with the application of advanced analytical methods to help make better decisions. The terms management science and decision science are sometimes used as more modern-sounding synonyms. Employing techniques from other mathematical sciences, such as mathematical modeling, statistical analysis, and mathematical optimization, operations research arrives at optimal or near-optimal solutions to complex decision-making problems. Operations Research is often concerned with determining the maximum (of profit, performance, or yield) or minimum (of loss, risk, or cost) of some real-world objective. Originating in military efforts before World War II, its techniques have grown to concern problems in a variety of industries. Besides its applications in industry and in management, Operations Research is at the very junction of mathematics and economics. Operations research embodies lots of deep results and theory but, at the same time, it is the archetype of applied mathematics. Matematica discreta e computazionale
Operations research, mathematical programming - -
Polytopes and polyhedra Polytopes and polyhedra are objects of study in topology, computational geometry, mathematical programming, and combinatorial optimization. The last two perspectives offer tools of operations research which find employment in some of the applied mathematics research lines in Verona. Matematica discreta e computazionale
Convex and discrete geometry - Polytopes and polyhedra
Progettazione e analisi algoritmi per grafi Studio di algoritmi per analisi di vincoli su grafi. Informatica teorica
Theory of computation - Design and analysis of algorithms
Theory of computing The theory of computation is the branch of mathematics and computer science that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm. In more than one way, this fascinating field has affected our perception of the world and of mathematics itself. In mathematics, it is an eye opener and a source of methodology and philosophical inspiration. This is particularly true for its two main branches of computability theory and computational complexity. Matematica discreta e computazionale
Computer science - -



Organizzazione

Strutture del dipartimento