( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Parameterized Complexity of Geometric Graph Isomorphism.

, и . IPEC, том 8894 из Lecture Notes in Computer Science, стр. 51-62. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Gaurav Aggarwal

Gaurav Dhiman

Gaurav Baruah

Gaurav Gupta

Gaurav Sharma

 

Другие публикации лиц с тем же именем

The Parameterized Complexity of Geometric Graph Isomorphism., и . IPEC, том 8894 из Lecture Notes in Computer Science, стр. 51-62. Springer, (2014)Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity., и . Electron. Colloquium Comput. Complex., (2014)The Complexity of Geometric Graph Isomorphism., и . Electron. Colloquium Comput. Complex., (2014)Homomorphism Tensors and Linear Equations., , и . ICALP, том 229 из LIPIcs, стр. 70:1-70:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks., , , , , , и . CoRR, (2018)Weisfeiler-Leman and Graph Spectra., и . SODA, стр. 2268-2285. SIAM, (2023)The Complexity of Homomorphism Indistinguishability., , , и . MFCS, том 138 из LIPIcs, стр. 54:1-54:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Complexity of Symmetry Breaking Beyond Lex-Leader., , и . CP, том 307 из LIPIcs, стр. 3:1-3:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Ordered Subgraph Aggregation Networks., , , , и . NeurIPS, (2022)Satsuma: Structure-Based Symmetry Breaking in SAT., , и . SAT, том 305 из LIPIcs, стр. 4:1-4:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)