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
Demo Data from VLDB 2026 / reviewers in the wild / expert

J. M. S. Simões-Pereira

dblp:49/2079 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1988
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 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
Computational geometry · 50% Combinatorics and discrete mathematics · 50%

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

TopicWeightPapersLastEvidence papers
Computational geometry › geometric modeling and processing › geometric constraint solving
minimal solution		 0.011965
On the Boolean Matrix Equation M · J. ACM 1965

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

graph theory · 0.0
YearPublicationVenuePosition
1988 An Optimality Criterion for Graph Embeddings of Metrics
abstract
A criterion for optimality of graph realizations of distance matrices is presented. In order to illustrate the criterion’s potential, it is used to prove the optimality of several well-known graph realizations and a few new ones.
J. M. S. Simões-Pereira
 SIAM J. Discret. Math.1
1967 Corrigendum: "On the Boolean Matrix Equation M..."
abstract
No abstract available.
J. M. S. Simões-Pereira
 J. ACM1
1965 On the Boolean Matrix Equation M
abstract
The equation M′ = V d i -1 M i where M′ is supposed to be given is discussed. First it is proved that there is a necessary and sufficient condition for the existence of a solution and, simultaneously, that under such condition, M′ will itself be a solution. However, the main aim is precisely to present an algorithm which gives the so-called minimal solutions: Boolean matrices M satisfying the equation with the least possible number of unity entries. This is proved by the last theorem. The subject may be studied in the context of graph theory and it seems of interest in various fields of operational research.
J. M. S. Simões-Pereira
 J. ACM1