Giovanni Daián Rottoli

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Carlos Antonio Casanova Pietroboni

> Home > Persons > Giovanni Daián Rottoli

Publications

2023
[j1]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/fcomp/CasanovaSPR23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fcomp/CasanovaSPR23
Carlos Casanova, Esteban Schab, Lucas Prado, Giovanni Daián Rottoli:
Hierarchical clustering-based framework for a posteriori exploration of Pareto fronts: application on the bi-objective next release problem. Frontiers Comput. Sci. 5 (2023)
2021
[c6]
- view
  - electronic edition @ ceur-ws.org (open access)
  - details & citations
- export record
  dblp key:
  - conf/icai2/RottoliC21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icai2/RottoliC21
Giovanni Daián Rottoli, Carlos Casanova:
Multi-criteria group requirement prioritization in software engineering using fuzzy linguistic labels. ICAI Workshops 2021: 16-28
2019
[c5]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - conf/seke/PietroboniRSBRB19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/seke/PietroboniRSBRB19
Carlos Antonio Casanova Pietroboni, Giovanni Daián Rottoli, Esteban Schab, Luciano Bracco, Fernando Pereyra Rausch, Anabella De Battista:
Fuzzy Bi-Objective Particle Swarm Optimization for Next Release Problem (S). SEKE 2019: 509-660

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.