Show
Sort by
-
- Journal Article
- A1
- open access
MmWave physical layer network modeling and planning for fixed wireless access applications
-
- Journal Article
- A1
- open access
A simple and elementary proof of Whitney's unique embedding theorem
-
A unified approach to construct snarks with circular flow number 5
-
Coloring the normalized Laplacian for oriented hypergraphs
-
Computational results and new bounds for the circular flow number of snarks
-
An efficient algorithm for computing network reliability in small treewidth
-
- Journal Article
- A1
- open access
A visualization tool for flood dynamics monitoring using a graph-based approach
-
- Journal Article
- A1
- open access
Polarization and depolarization of monomial ideals with application to multi-state system reliability
-
- Journal Article
- A1
- open access
SIAS-miner : mining subjectively interesting attributed subgraphs
-
On minimum leaf spanning trees and a criticality notion
-
- Journal Article
- A1
- open access
On the status sequences of trees
-
- Journal Article
- A1
- open access
Object-based flood analysis using a graph-based representation
-
- Journal Article
- A1
- open access
Strongly graded groupoids and strongly graded Steinberg algebras
-
A scalable node ordering strategy based on community structure for enhanced temporal network visualization
-
- Miscellaneous
- open access
EvalNE : a framework for evaluating network embeddings on link prediction
(2019) p.1-5 -
Grinberg’s criterion
-
- Journal Article
- A1
- open access
Subjectively interesting connecting trees and forests
-
- Journal Article
- A1
- open access
On the size of maximally non-hamiltonian digraphs
-
- Conference Paper
- C1
- open access
EvalNE : a framework for Evaluating Network Embeddings on link prediction
-
- Journal Article
- A1
- open access
Computing the maximal canonical form for trees in polynomial time