| Publication | Date of Publication | Type |
|---|
On computing optimal temporal branchings and spanning subgraphs
Journal of Computer and System Sciences | 2024-12-27 | Paper |
On computing large temporal (unilateral) connected components
Journal of Computer and System Sciences | 2024-07-01 | Paper |
On computing optimal temporal branchings
| 2024-05-29 | Paper |
On Computing the Diameter of (Weighted) Link Streams
ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
Paths and connectivity in temporal graphs. Textbook for a mini course at the 34th Brazilian mathematics colloquium -- 34\degree Colóquio Brasileiro de Matemática, IMPA, Rio de Janeiro, Brazil, Juli 2023
| 2024-03-25 | Paper |
On computing large temporal (unilateral) connected components
Lecture Notes in Computer Science | 2023-12-22 | Paper |
On computing the diameter of (weighted) link streams
| 2023-06-23 | Paper |
Finding structurally and temporally similar trajectories in graphs
| 2023-02-07 | Paper |
Proximity Search for Maximal Subgraph Enumeration
SIAM Journal on Computing | 2022-11-15 | Paper |
scientific article; zbMATH DE number 7561717 (Why is no real title available?)
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559396 (Why is no real title available?)
| 2022-07-18 | Paper |
Menger's Theorem for Temporal Paths (Not Walks)
| 2022-06-30 | Paper |
K-plex cover pooling for graph neural networks
Data Mining and Knowledge Discovery | 2021-11-01 | Paper |
Listing subgraphs by Cartesian decomposition
| 2021-08-04 | Paper |
Listing Maximal Independent Sets with Minimal Space and Bounded Delay
String Processing and Information Retrieval | 2021-02-16 | Paper |
Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
Algorithmica | 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
Information and Computation | 2020-01-17 | Paper |
A fast discovery algorithm for large common connected induced subgraphs
Discrete Applied Mathematics | 2019-09-19 | Paper |
Computing top-\(k\) closeness centrality faster in unweighted graphs
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Optimal listing of cycles and \(st\)-paths in undirected graphs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
SIAM Journal on Discrete Mathematics | 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
Discrete Applied Mathematics | 2018-06-27 | Paper |
Sums of multivariate polynomials in finite subgroups
International Journal of Number Theory | 2018-02-13 | Paper |
Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques
| 2017-12-19 | Paper |
Directing Road Networks by Listing Strong Orientations
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Listing Acyclic Orientations of Graphs with Single and Multiple Sources
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Enumerating cyclic orientations of a graph
Lecture Notes in Computer Science | 2016-04-04 | Paper |
On computing the hyperbolicity of real-world graphs
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Analysis and enumeration. Algorithms for biological graphs
Atlantis Studies in Computing | 2015-07-15 | Paper |
Synchronous context-free grammars and optimal linear parsing strategies
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs
Theoretical Computer Science | 2015-05-26 | Paper |
On computing the diameter of real-world undirected graphs
Theoretical Computer Science | 2013-12-11 | Paper |
Smooth movement and Manhattan path based random waypoint mobility
Information Processing Letters | 2013-04-04 | Paper |
Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets
Theoretical Computer Science | 2012-10-11 | Paper |
A comparison of three algorithms for approximating the distance distribution in real-world graphs
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Finding the diameter in real-world graphs. Experimentally turning a lower bound into an upper bound
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Spatial node distribution of Manhattan path based random waypoint mobility models with applications
Structural Information and Communication Complexity | 2010-02-24 | Paper |
