Giampiero Chiaselotti

Orcid: 0000-0003-2247-2386

According to our database1, Giampiero Chiaselotti authored at least 35 papers between 2002 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Real subset sums and posets with an involution.
Int. J. Algebra Comput., 2022

2021
Some classifications of graphs with respect to a set adjacency relation.
Discret. Math. Algorithms Appl., 2021

2020
Object similarity measures and Pawlak's indiscernibility on decision tables.
Inf. Sci., 2020

Lattice Representations with Set Partitions Induced by Pairings.
Electron. J. Comb., 2020

2019
Local dissymmetry on graphs and related algebraic structures.
Int. J. Algebra Comput., 2019

2018
Granular computing on information tables: Families of subsets and operators.
Inf. Sci., 2018

Notions from rough set theory in a generalized dependency relation context.
Int. J. Approx. Reason., 2018

Rough sets on graphs: New dependency and accuracy measures.
Discret. Math. Algorithms Appl., 2018

Dependency and accuracy measures for directed graphs.
Appl. Math. Comput., 2018

2017
Knowledge pairing systems in granular computing.
Knowl. Based Syst., 2017

Micro and macro models of granular computing induced by the indiscernibility relation.
Inf. Sci., 2017

Dependency structures for decision tables.
Int. J. Approx. Reason., 2017

Rough Set Theory and Digraphs.
Fundam. Informaticae, 2017

Intersection properties of maximal directed cuts in digraphs.
Discret. Math., 2017

2016
The granular partition lattice of an information table.
Inf. Sci., 2016

Simple graphs in granular computing.
Inf. Sci., 2016

On the connection of hypergraph theory with formal concept analysis and rough set theory.
Inf. Sci., 2016

Generalizations of Rough Set Tools Inspired by Graph Theory.
Fundam. Informaticae, 2016

A new discrete dynamical system of signed integer partitions.
Eur. J. Comb., 2016

2015
The Lattice Structure of Equally Extended Signed Partitions.
Fundam. Informaticae, 2015

Rough Set Theory Applied to Simple Undirected Graphs.
Proceedings of the Rough Sets and Knowledge Technology - 10th International Conference, 2015

Preclusivity and Simple Graphs: The n-cycle and n-path Cases.
Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2015

Preclusivity and Simple Graphs.
Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2015

Simple Undirected Graphs as Formal Contexts.
Proceedings of the Formal Concept Analysis - 13th International Conference, 2015

2014
Parallel and sequential dynamics of two discrete models of signed integer partitions.
Appl. Math. Comput., 2014

Non Uniform Cellular Automata Description of Signed Partition Versions of Ice and Sand Pile Models.
Proceedings of the Cellular Automata, 2014

2013
A Discrete Dynamical Model of Signed Partitions.
J. Appl. Math., 2013

Parallel Rank of Two Sandpile Models of Signed Integer Partitions.
J. Appl. Math., 2013

2012
A Minimum Problem for Finite Sets of Real Numbers with Nonnegative Sum.
J. Appl. Math., 2012

2010
Minimizing the Makespan in Nonpreemptive Parallel Machine Scheduling Problem.
J. Math. Model. Algorithms, 2010

Extension results for boolean maps and a class of systems of linear inequalities
CoRR, 2010

A Class of lattices and boolean functions related to some extremal sum problems
CoRR, 2010

2008
New results related to a conjecture of Manickam and Singhi.
Eur. J. Comb., 2008

2002
A Method to Count the Positive 3-Subsets in a Set of Real Numbers with Non-Negative Sum.
Eur. J. Comb., 2002

On a Problem Concerning the Weight Functions.
Eur. J. Comb., 2002


  Loading...