Andrea Marino

Available identifiers

zbMath Open marino.andreaMaRDI QIDQ386903

List of research outcomes

Publication	Date of Publication	Type
On Computing the Diameter of (Weighted) Link Streams	2024-04-14	Paper
https://portal.mardi4nfdi.de/entity/Q6201550	2024-03-25	Paper
On computing large temporal (unilateral) connected components	2023-12-22	Paper
https://portal.mardi4nfdi.de/entity/Q6159898	2023-06-23	Paper
Proximity Search for Maximal Subgraph Enumeration	2022-11-15	Paper
https://portal.mardi4nfdi.de/entity/Q5092436	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5089189	2022-07-18	Paper
Menger's Theorem for Temporal Paths (Not Walks)	2022-06-30	Paper
K-plex cover pooling for graph neural networks	2021-11-01	Paper
https://portal.mardi4nfdi.de/entity/Q5005188	2021-08-04	Paper
Listing Maximal Independent Sets with Minimal Space and Bounded Delay	2021-02-16	Paper
Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs	2020-04-14	Paper
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs	2020-02-25	Paper
Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs	2020-02-12	Paper
Large-scale clique cover of real-world networks	2020-01-17	Paper
A fast discovery algorithm for large common connected induced subgraphs	2019-09-19	Paper
Computing Top-k Closeness Centrality Faster in Unweighted Graphs	2019-09-12	Paper
Optimal Listing of Cycles and st-Paths in Undirected Graphs	2019-05-15	Paper
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties	2019-04-24	Paper
Tight lower bounds for the number of inclusion-minimal \(st\)-cuts	2018-11-22	Paper
Finding maximal common subgraphs via time-space efficient reverse search	2018-10-04	Paper
Efficient enumeration of graph orientations with sources	2018-06-27	Paper
Sums of multivariate polynomials in finite subgroups	2018-02-13	Paper
https://portal.mardi4nfdi.de/entity/Q4598291	2017-12-19	Paper
Directing Road Networks by Listing Strong Orientations	2016-09-29	Paper
Listing Acyclic Orientations of Graphs with Single and Multiple Sources	2016-05-03	Paper
Enumerating Cyclic Orientations of a Graph	2016-04-04	Paper
On Computing the Hyperbolicity of Real-World Graphs	2015-11-19	Paper
Analysis and enumeration. Algorithms for biological graphs	2015-07-15	Paper
Synchronous context-free grammars and optimal linear parsing strategies	2015-07-13	Paper
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs	2015-05-26	Paper
On computing the diameter of real-world undirected graphs	2013-12-11	Paper
Smooth movement and Manhattan path based random waypoint mobility	2013-04-04	Paper
Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets	2012-10-11	Paper
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs	2011-05-12	Paper
Finding the Diameter in Real-World Graphs	2010-09-06	Paper
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications	2010-02-24	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Andrea Marino