Romeo Rizzi

Foto,  January 15, 2015
Position
Full Professor
Role
professore ordinario
Academic sector
MAT/09 - OPERATIONS RESEARCH
Research sector (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

Office
Ca' Vignal 2,  Floor 1,  Room 81
Telephone
+39 045 8027088
E-mail
romeo|rizzi*univr|it <== Replace | with . and * with @ to have the right email address.
Personal web page
http://profs.sci.univr.it/~rrizzi/

Office Hours

Wednesday, Hours 6:30 PM - 8:30 PM,  

  • Orario di Ricevimento fisso: Se sei studente di uno dei miei corsi in Verona, nel periodo di erogazione del tuo corso ti è molto facile trovarmi in ufficio, e disponibile, nei giorni centrali della settimana.
    In ogni caso, specie se vieni appositamente da fuori, ti conviene prima farmi uno squillo per assincerarti preventivamente di mia effettiva presenza e disponibilità, o anche per meglio coordinarci (mail, cellulare, Telegram garantiscono tutte alta responsività).
  • Ricevimenti e Reperibilità generale: Per tutti: Sono sempre disponibile sui canali di contatto forniti sotto (e molto risponivo sui primi quattro). Potete utilizzarli con disinvoltura. Sono inoltre ben disposto al concordare ricevimenti anche fuori da un particolare giorno o fascia oraria.

Canali di Contatto:

e-mail:  
Zoom or other telecommunication media
cell-phone: phone: +39.3518684000
Telegram/WhatsApp:  +39.3518684000
phone office: phone: +39.045.802.7088
physical mailing address: Romeo Rizzi, Department of Computer Science - University of Verona
Ca' Vignal 2, strada le Grazie 15         I-37134 Verona (VR), ITALY

Office Location:

piano 1, stanza 81 by the Department of Computer Science, in Ca' Vignal 2, strada le Grazie 15, Verona.

Curriculum

Modules

Modules running in the period selected: 56.
Click on the module to see the timetable and course details.

Course Name Total credits Online Teacher credits Modules offered by this teacher
Master's degree in Data Science Discrete optimization and decision making (2024/2025)   6   
Master's degree in Data Science Discrete optimization and decision making (2023/2024)   6  eLearning
Bachelor's degree in Applied Mathematics Operations Research (2023/2024)   6  eLearning
Master's degree in Computer Science and Engineering Problems solving: Algorithms and Complexity (2023/2024)   12  eLearning (Teoria)
(Laboratorio)
Bachelor's degree in Bioinformatics Programming Challanges (2023/2024)   6   
Master's degree in Data Science Discrete optimization and decision making (2022/2023)   6  eLearning
Interuniversity PhD in Mathematics Lezioni Dottorandi (2022/2023)   5   
Bachelor's degree in Applied Mathematics Operations Research (2022/2023)   6  eLearning
Master's degree in Computer Science and Engineering Problems solving: Algorithms and Complexity (2022/2023)   12  eLearning (Teoria)
(Laboratorio)
Bachelor's degree in Bioinformatics Programming Challanges (2022/2023)   6   
Master's degree in Mathematics Mathematics for decisions (2021/2022)   6  eLearning
Bachelor's degree in Applied Mathematics Operations Research (2021/2022)   6  eLearning
Master's degree in Computer Science and Engineering Problems solving: Algorithms and Complexity (2021/2022)   12  eLearning (Laboratorio)
(Teoria)
Master's degree in Mathematics Mathematics for decisions (2020/2021)   6  eLearning
Bachelor's degree in Applied Mathematics Operations Research (2020/2021)   6  eLearning
Master's degree in Computer Science and Engineering Problems solving: Algorithms and Complexity (2020/2021)   12  eLearning
Master's degree in Computer Science and Engineering Programming Challanges (2020/2021)   6   
Master's degree in Computer Science and Engineering Algorithms (2019/2020)   12  eLearning ALGORITMI
Master's degree in Mathematics Mathematics for Decisions (seminar course) (2019/2020)   6  eLearning
Bachelor's degree in Applied Mathematics Operations Research (2019/2020)   6  eLearning
Master's degree in Computer Science and Engineering Programming Challanges (2019/2020)   6  eLearning
Master's degree in Computer Science and Engineering Algorithms (2018/2019)   12  eLearning ALGORITMI
Bachelor's degree in Applied Mathematics Computer Programming with Laboratory (2018/2019)   12  eLearning (Esercitazioni)
Master's degree in Mathematics Mathematics for Decisions (seminar course) (2018/2019)   6  eLearning
Bachelor's degree in Applied Mathematics Operations Research (2018/2019)   6  eLearning
Master's degree in Computer Science and Engineering Programming Challanges (2018/2019)   6  eLearning
Master's degree in Computer Science and Engineering Algorithms (2017/2018)   12  eLearning ALGORITMI
Master's degree in Mathematics Mathematics for Decisions (seminar course) (2017/2018)   6  eLearning
Bachelor's degree in Applied Mathematics Operations Research (2017/2018)   6  eLearning
Master's degree in Computer Science and Engineering Programming Challanges (2017/2018)   6   
Master's degree in Computer Science and Engineering Algorithms (2016/2017)   12  eLearning ALGORITMI
Master's degree in Mathematics Mathematics for Decisions (seminar course) (2016/2017)   6  eLearning
Bachelor's degree in Applied Mathematics Operations Research (2016/2017)   6  eLearning
Master's degree in Computer Science and Engineering Programming Challanges (2016/2017)   6   
Master's degree in Computer Science and Engineering Algorithms (2015/2016)   12    ALGORITMI
Master's degree in Mathematics Mathematics for Decisions (seminar course) (2015/2016)   6   
Bachelor's degree in Applied Mathematics Operations Research (2015/2016)   6   
Master's degree in Computer Science and Engineering Programming Challanges (2015/2016)   6   
Master's degree in Computer Science and Engineering Algorithms (2014/2015)   12    ALGORITMI
Master's degree in Mathematics Mathematics for Decisions (seminar course) (2014/2015)   6   
Bachelor's degree in Applied Mathematics Operations Research (2014/2015)   6   
Master's degree in Computer Science and Engineering Programming Challanges (2014/2015)   6   
PAS C310 Industrial IT workshop Fondamenti e programmazione (2014/2015)   4    COMPLEMENTI
TFA A042 Computer science (secondary school) Fondamenti e programmazione (2014/2015)   6    COMPLEMENTI
Master's degree in Computer Science and Engineering Algorithms (2013/2014)   12    ALGORITMI
Bachelor's degree in Applied Mathematics Operations Research (2013/2014)   6   
Master's degree in Computer Science and Engineering Programming Challanges (2013/2014)   6   
PAS A042 Computer science Fondamenti e programmazione (2013/2014)   6    COMPLEMENTI
Master's degree in Computer Science and Engineering Algorithms (2012/2013)   12    ALGORITMI
Bachelor's degree in Applied Mathematics Operations Research (2012/2013)   6   
TFA A042 Computer science (secondary school) Fondamenti e programmazione (2012/2013)   6    MODULO C
Master's degree in Computer Science and Engineering Algorithms (2011/2012)   12    ALGORITMI
Bachelor's degree in Applied Mathematics Operations Research (2011/2012)   6   

News for students

There you will find information, resources and services useful during your time at the University (Student’s exam record, your study plan on ESSE3, Distance Learning courses, university email account, office forms, administrative procedures, etc.). You can log into MyUnivr with your GIA login details: only in this way will you be able to receive notification of all the notices from your teachers and your secretariat via email and soon also via the Univr app.

MyUnivr
 

Research groups

Algorithms
The group investigates structural aspects of fundamental problems in Computer Science and their mathematical models. This leads to the design of better algorithms protocols and systems as well as understanding of their implicit computational limits. Specific areas of interests include: algorithm design, data structures, string algorithms, computational complexity, combinatorial optimization, coding and information theory, machine learning. Most results obtained are in the intersection of algorithmics with several other areas in theory and applications, including bioinformatics, communication networks, operating research and artificial intelligence.
ForMe - Formal Methods for the Design of Engineering Systems
The aim of the research group is to apply formal methods to modelling, verification and synthesis of engineering systems. The domains range from timed systems to nonlinear cyberphysical systems.
Networked Systems and Technologies
Design and verification of communication technologies capable of bringing efficiency and sustainability to key applications such as industry, agriculture, building automation, transport and land management.
Research interests
Topic Description Research area
Combinatorial Algorithms and algorithmic 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. Discrete and computational mathematics
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. Discrete and computational mathematics
Computer science
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. Discrete and computational mathematics
Operations research, mathematical programming
Polytopes and Polihedra 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. Discrete and computational mathematics
Polytopes and polyhedra
Design and analysis of algorithms for graphs Design and analysis of algorithms for constraint analysis in graphs. Theory of computation
Design and analysis of algorithms
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. Discrete and computational mathematics
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. Bioinformatics and medical informatics
Operations research
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. Discrete and computational mathematics
Graph theory
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. Discrete and computational mathematics
Computer science



Organization

Department facilities

Share