| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm | Fuhlbrück, Frank et al. | 2020 |
| 2 | On the First-Order Complexity of Induced Subgraph Isomorphism | Verbitsky, Oleg et al. | 2017 |
| 3 | Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy | Berkholz, Christoph et al. | 2013 |
| 4 | Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace | Köbler, Johannes et al. | 2012 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 4 |