| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm | Fuhlbrück, Frank et al. | 2020 |
| 2 | Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable | Arvind, Vikraman et al. | 2018 |
| 3 | Parameterized Complexity of Small Weight Automorphisms | Arvind, Vikraman et al. | 2017 |
| 4 | The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs | Arvind, Vikraman et al. | 2016 |
| 5 | Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace | Köbler, Johannes et al. | 2012 |
| 6 | Colored Hypergraph Isomorphism is Fixed Parameter Tractable | Arvind, V. et al. | 2010 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |