The following pages link to Alessio Conte (Q1627157):
Displaying 36 items.
- Tight lower bounds for the number of inclusion-minimal \(st\)-cuts (Q1627159) (← links)
- Efficient enumeration of graph orientations with sources (Q1647832) (← links)
- Efficient enumeration of subgraphs and induced subgraphs with bounded girth (Q1671003) (← links)
- Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs (Q1708606) (← links)
- Finding maximal common subgraphs via time-space efficient reverse search (Q1790989) (← links)
- Maximal strongly connected cliques in directed graphs: algorithms and bounds (Q1983136) (← links)
- Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603) (← links)
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232) (← links)
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119) (← links)
- Enumeration of maximal common subsequences between two strings (Q2118209) (← links)
- Beyond the BEST theorem: fast assessment of Eulerian trails (Q2140495) (← links)
- Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2232246) (← links)
- K-plex cover pooling for graph neural networks (Q2238356) (← links)
- A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
- Large-scale clique cover of real-world networks (Q2288213) (← links)
- Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs (Q2301741) (← links)
- Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph (Q2412406) (← links)
- Enumerating Cyclic Orientations of a Graph (Q2798221) (← links)
- Listing Acyclic Orientations of Graphs with Single and Multiple Sources (Q2802950) (← links)
- Directing Road Networks by Listing Strong Orientations (Q2819493) (← links)
- (Q4598291) (← links)
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties (Q4631095) (← links)
- (Q5005188) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- (Q5089189) (← links)
- (Q5092436) (← links)
- (Q5136240) (← links)
- Listing Maximal Independent Sets with Minimal Space and Bounded Delay (Q5150928) (← links)
- New polynomial delay bounds for maximal subgraph enumeration by proximity search (Q5212857) (← links)
- Finding the Anticover of a String (Q5874427) (← links)
- Refined bounds on the number of Eulerian tours in undirected graphs (Q6185942) (← links)
- On strings having the same length-\(k\) substrings (Q6496844) (← links)
- Online algorithms on antipowers and antiperiods (Q6536254) (← links)
- Polynomial-delay enumeration of maximal common subsequences (Q6536255) (← links)
- CAGE: cache-aware graphlet enumeration (Q6545420) (← links)
- PhyBWT: alignment-free phylogeny via eBWT positional clustering (Q6587086) (← links)
