Detecting directed 4-cycles still faster
Information Processing Letters
On the complexity of fixed parameter clique and dominating set
Theoretical Computer Science
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Efficient algorithms for clique problems
Information Processing Letters
Finding, minimizing, and counting weighted subgraphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
Discrete Applied Mathematics
Unique small subgraphs are not easier to find
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Counting and detecting small subgraphs via equations and matrix multiplication
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Finding the smallest H-Subgraph in real weighted graphs and related problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Arboricity, h-index, and dynamic algorithms
Theoretical Computer Science
Exact weight subgraphs and the k-sum conjecture
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A dynamic data structure for counting subgraphs in sparse graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Finding a smallest odd hole in a claw-free graph using global structure
Discrete Applied Mathematics
Hi-index | 0.90 |