The following pages link to Giampiero Chiaselotti (Q655174):
Displaying 50 items.
- (Q329542) (redirect page) (← links)
- Intersection properties of maximal directed cuts in digraphs (Q329544) (← links)
- A minimum problem for finite sets of real numbers with nonnegative sum (Q443111) (← links)
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176) (← links)
- On a problem concerning the weight functions (Q1348764) (← links)
- Some presentations for the special linear groups on finite fields. (Q1420362) (← links)
- Notions from rough set theory in a generalized dependency relation context (Q1644893) (← links)
- Parallel and sequential dynamics of two discrete models of signed integer partitions (Q1646236) (← links)
- Simple graphs in granular computing (Q1671713) (← links)
- Dominance order on signed integer partitions (Q1707382) (← links)
- On the connection of hypergraph theory with formal concept analysis and rough set theory (Q1750616) (← links)
- A method to count the positive 3-subsets in a set of real numbers with non-negative sum (Q1864576) (← links)
- Sand piles models of signed partitions with \(d\) piles (Q1952722) (← links)
- Pairings and related symmetry notions (Q1989479) (← links)
- New perspectives of granular computing in relation geometry induced by pairings (Q2000596) (← links)
- Dependency relations (Q2011325) (← links)
- Alexandroff topologies and monoid actions (Q2178808) (← links)
- Some classes of abstract simplicial complexes motivated by module theory (Q2196332) (← links)
- Granular computing on information tables: families of subsets and operators (Q2198022) (← links)
- Lattice representations with set partitions induced by pairings (Q2290345) (← links)
- The granular partition lattice of an information table (Q2293047) (← links)
- Set relations and set systems induced by some families of integral domains (Q2295472) (← links)
- The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
- Parallel rank of two sandpile models of signed integer partitions (Q2375483) (← links)
- A discrete dynamical model of signed partitions (Q2375738) (← links)
- Simplicial complexes and closure systems induced by indistinguishability relations (Q2408539) (← links)
- Dependency structures for decision tables (Q2411274) (← links)
- Dependency and accuracy measures for directed graphs (Q2423026) (← links)
- New results related to a conjecture of Manickam and Singhi (Q2472830) (← links)
- A natural extension of the Young partition lattice (Q2515404) (← links)
- Object similarity measures and Pawlak's indiscernibility on decision tables (Q2666859) (← links)
- On additive bases with two elements (Q2773324) (← links)
- The Lattice Structure of Equally Extended Signed Partitions (Q3187015) (← links)
- Preclusivity and Simple Graphs (Q3300262) (← links)
- Preclusivity and Simple Graphs: The n–cycle and n–path Cases (Q3300263) (← links)
- Rough Set Theory Applied to Simple Undirected Graphs (Q3300371) (← links)
- (Q4280682) (← links)
- (Q4324791) (← links)
- (Q4398586) (← links)
- Rough sets on graphs: New dependency and accuracy measures (Q4554547) (← links)
- Generalizations of Rough Set Tools Inspired by Graph Theory (Q4589231) (← links)
- Rough Set Theory and Digraphs (Q4599819) (← links)
- A class of lattices and boolean functions related to the Manickam–Miklös–Singhi conjecture (Q4906555) (← links)
- (Q4982500) (← links)
- Indiscernibility structures induced from function sets : Graph and digraph case (Q5031926) (← links)
- Real subset sums and posets with an involution (Q5063203) (← links)
- Locally finite complexes, modules and generalized information systems (Q5073316) (← links)
- Local dissymmetry on graphs and related algebraic structures (Q5242804) (← links)
- Simple Undirected Graphs as Formal Contexts (Q5255665) (← links)
- Decision systems in rough set theory: A set operatorial perspective (Q5376483) (← links)
