Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Viorel Nitica

dblp:92/7205 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2018
0000-0003-2041-2822ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Combinatorics and discrete mathematics · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics › tiling
polyomino tiling
0.312018
Revisiting a Tiling Hierarchy · IEEE Trans. Inf. Theory 2018
Combinatorics and discrete mathematics
tiling
0.312018
Revisiting a Tiling Hierarchy · IEEE Trans. Inf. Theory 2018

Methods — techniques the papers use, named apart from their topics

counterexample construction · 0.3
YearPublicationVenuePosition
2018 Revisiting a Tiling Hierarchy
abstract
We revisit Golomb's tiling hierarchy for finite sets of polyominoes. We consider the case when only translations are allowed for the tiles in a tile set. In this classification, for several levels in Golomb's hierarchy, more types need to be considered. First, we show that there is no general relationship among the types corresponding to a fixed level for the existence of tilings. Second, we review the relationships among the levels from Golomb's hierarchy that are still valid in this setup, and third, we give counterexamples for several relationships in Golomb's hierarchy that fail. As a consequence of the results, we show alternative tiling hierarchies. We also show some unexpected additions to all of the above hierarchies and discuss various implications of tiling capabilities if deficient regions are added to the pool.
Viorel Nitica
IEEE Trans. Inf. Theory1
2015 On the dimension of max-min convex sets
abstract
We introduce a notion of dimension of max–min convex sets, following the approach of tropical convexity. We introduce a max–min analogue of the tropical rank of a matrix and show that it is equal to the dimension of the associated polytope. We describe the relation between this rank and the notion of strong regularity in max–min algebra, which is traditionally defined in terms of unique solvability of linear systems and the trapezoidal property.
Viorel Nitica, Sergei Sergeev
Fuzzy Sets Syst.1