| Publication | Date of Publication | Type |
|---|
PhyBWT: alignment-free phylogeny via eBWT positional clustering
| 2024-08-13 | Paper |
CAGE: cache-aware graphlet enumeration
| 2024-05-29 | Paper |
On strings having the same length-\(k\) substrings
| 2024-05-06 | Paper |
Online algorithms on antipowers and antiperiods
| 2024-04-19 | Paper |
Polynomial-delay enumeration of maximal common subsequences
| 2024-04-19 | Paper |
Refined bounds on the number of Eulerian tours in undirected graphs
Algorithmica | 2024-01-09 | Paper |
Finding the Anticover of a String
| 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 |
Beyond the BEST theorem: fast assessment of Eulerian trails
| 2022-05-20 | Paper |
Enumeration of maximal common subsequences between two strings
Algorithmica | 2022-03-22 | Paper |
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
Theoretical Computer Science | 2021-12-22 | Paper |
K-plex cover pooling for graph neural networks
Data Mining and Knowledge Discovery | 2021-11-01 | Paper |
Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
| 2021-10-04 | Paper |
Maximal strongly connected cliques in directed graphs: algorithms and bounds
Discrete Applied Mathematics | 2021-09-15 | 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 |
On maximal cliques with connectivity constraints in directed graphs
| 2020-11-25 | Paper |
Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
Algorithmica | 2020-04-14 | Paper |
Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
Theoretical Computer Science | 2020-04-07 | Paper |
Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs
| 2020-02-25 | Paper |
New polynomial delay bounds for maximal subgraph enumeration by proximity search
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | 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 |
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 subgraphs and induced subgraphs with bounded girth
| 2018-09-06 | Paper |
Efficient enumeration of graph orientations with sources
Discrete Applied Mathematics | 2018-06-27 | Paper |
Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs
| 2018-03-26 | Paper |
Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques
| 2017-12-19 | Paper |
Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph
| 2017-10-23 | 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 |
