J. M. S. Simões-Pereira - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2019

The Tower Matrix, an Alternative to Deal with Distances and Quasi-distancesYulin Zhang, António Veloso Da Costa, J. M. S. Simões-Pereira. mvl, 32(5-6):449-454, 2019. [doi]

2015

A Note on the Beauvois-Lopez Densification OperatorJ. M. S. Simões-Pereira. mvl, 25(4-5):529-534, 2015. [doi]

1990

An algorithm for tree-realizability of distance matricesVladimir Batagelj, Tomaz Pisanski, J. M. S. Simões-Pereira. ijcm, 34(3-4):171-176, 1990. [doi]

An algorithm and its role in the study of optimal graph realizations of distance matricesJ. M. S. Simões-Pereira. DM, 79(3):299-312, 1990. [doi]

1988

An Optimality Criterion for Graph Embeddings of MetricsJ. M. S. Simões-Pereira. siamdm, 1(2):223-229, 1988.

1987

A note on distance matrices with unicyclic graph realizationsJ. M. S. Simões-Pereira. DM, 65(3):277-287, 1987. [doi]

Underlying graph and total length of optimal realizations of variable distance matricesJ. M. S. Simões-Pereira. gc, 3(1):383-393, 1987. [doi]

1984

On optimal embeddings of metrics in graphsWilfried Imrich, J. M. S. Simões-Pereira, Christina Zamfirescu. JCT, 36(1):1-15, 1984. [doi]

1977

A note on finite topologies and switching functionsJ. M. S. Simões-Pereira. DM, 18(3):299-310, 1977. [doi]

1976

Joins of n-degenerate graphs and uniquely (m, n)-partitionable graphsJ. M. S. Simões-Pereira. JCT, 21(1):21-29, 1976. [doi]

1975

Subgraphs as circuits and bases of matroidsJ. M. S. Simões-Pereira. DM, 12(1):79-88, 1975. [doi]

On matroids on edge sets of graphs with connected subgraphs as circuits IIJ. M. S. Simões-Pereira. DM, 12(1):55-78, 1975. [doi]

Sign in or sign up to see more results.

runs on WebDSL