default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGaurav Rattan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Markus Anders, Sofia Brenner, Gaurav Rattan
:
The Complexity of Symmetry Breaking Beyond Lex-Leader. CP 2024: 3:1-3:24- [c16]Markus Anders, Sofia Brenner, Gaurav Rattan:
Satsuma: Structure-Based Symmetry Breaking in SAT. SAT 2024: 4:1-4:23 - [i17]Markus Anders, Sofia Brenner, Gaurav Rattan:
satsuma: Structure-based Symmetry Breaking in SAT. CoRR abs/2406.13557 (2024) - [i16]Markus Anders, Sofia Brenner, Gaurav Rattan:
The Complexity of Symmetry Breaking Beyond Lex-Leader. CoRR abs/2407.04419 (2024) - 2023
- [c15]Gaurav Rattan, Tim Seppelt:
Weisfeiler-Leman and Graph Spectra. SODA 2023: 2268-2285 - 2022
- [j5]Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan:
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. ACM Trans. Comput. Theory 14(2): 9:1-9:26 (2022) - [c14]Martin Grohe, Gaurav Rattan, Tim Seppelt:
Homomorphism Tensors and Linear Equations. ICALP 2022: 70:1-70:20 - [c13]Christopher Morris, Gaurav Rattan, Sandra Kiefer, Siamak Ravanbakhsh:
SpeqNets: Sparsity-aware permutation-equivariant graph networks. ICML 2022: 16017-16042 - [c12]Chendi Qian, Gaurav Rattan, Floris Geerts, Mathias Niepert, Christopher Morris:
Ordered Subgraph Aggregation Networks. NeurIPS 2022 - [i15]Christopher Morris, Gaurav Rattan, Sandra Kiefer, Siamak Ravanbakhsh:
SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks. CoRR abs/2203.13913 (2022) - [i14]Chendi Qian, Gaurav Rattan, Floris Geerts, Christopher Morris, Mathias Niepert:
Ordered Subgraph Aggregation Networks. CoRR abs/2206.11168 (2022) - 2021
- [i13]Gaurav Rattan, Tim Seppelt:
Weisfeiler-Leman, Graph Spectra, and Random Walks. CoRR abs/2103.02972 (2021) - [i12]Martin Grohe, Gaurav Rattan, Tim Seppelt:
Homomorphism Tensors and Linear Equations. CoRR abs/2111.11313 (2021) - 2020
- [c11]Christopher Morris, Gaurav Rattan, Petra Mutzel:
Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings. NeurIPS 2020
2010 – 2019
- 2019
- [c10]Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, Martin Grohe:
Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks. AAAI 2019: 4602-4609 - [c9]Jan Böker, Yijia Chen, Martin Grohe, Gaurav Rattan:
The Complexity of Homomorphism Indistinguishability. MFCS 2019: 54:1-54:13 - 2018
- [j4]Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan:
On the complexity of noncommutative polynomial factorization. Inf. Comput. 262: 22-39 (2018) - [c8]Holger Dell, Martin Grohe, Gaurav Rattan:
Lovász Meets Weisfeiler and Leman. ICALP 2018: 40:1-40:14 - [c7]Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger:
Graph Similarity and Approximate Isomorphism. MFCS 2018: 20:1-20:16 - [i11]Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger:
Graph Similarity and Approximate Isomorphism. CoRR abs/1802.08509 (2018) - [i10]Holger Dell, Martin Grohe, Gaurav Rattan:
Weisfeiler-Leman meets Homomorphisms. CoRR abs/1802.08876 (2018) - [i9]Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, Martin Grohe:
Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks. CoRR abs/1810.02244 (2018) - 2017
- [j3]Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
Graph Isomorphism, Color Refinement, and Compactness. Comput. Complex. 26(3): 627-685 (2017) - 2016
- [j2]Vikraman Arvind, Gaurav Rattan:
The Parameterized Complexity of Geometric Graph Isomorphism. Algorithmica 75(2): 258-276 (2016) - [c6]Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan:
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. MFCS 2016: 13:1-13:14 - [i8]Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan:
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. CoRR abs/1606.04383 (2016) - 2015
- [j1]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev:
On the isomorphism problem for decision trees and decision lists. Theor. Comput. Sci. 590: 38-54 (2015) - [c5]Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
On the Power of Color Refinement. FCT 2015: 339-350 - [c4]Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
On Tinhofer's Linear Programming Approach to Isomorphism Testing. MFCS (2) 2015: 26-37 - [c3]Vikraman Arvind, Gaurav Rattan, Pushkar S. Joglekar:
On the Complexity of Noncommutative Polynomial Factorization. MFCS (2) 2015: 38-49 - [i7]Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan:
On the Complexity of Noncommutative Polynomial Factorization. CoRR abs/1501.00671 (2015) - [i6]Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
Graph Isomorphism, Color Refinement, and Compactness. CoRR abs/1502.01255 (2015) - [i5]Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan:
On the Complexity of Noncommutative Polynomial Factorization. Electron. Colloquium Comput. Complex. TR15 (2015) - [i4]Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
Graph Isomorphism, Color Refinement, and Compactness. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c2]Vikraman Arvind, Gaurav Rattan:
The Parameterized Complexity of Geometric Graph Isomorphism. IPEC 2014: 51-62 - [i3]Vikraman Arvind, Gaurav Rattan:
Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity. CoRR abs/1408.3510 (2014) - [i2]Vikraman Arvind, Gaurav Rattan:
The Complexity of Geometric Graph Isomorphism. Electron. Colloquium Comput. Complex. TR14 (2014) - [i1]Vikraman Arvind, Gaurav Rattan:
Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c1]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev:
On the Isomorphism Problem for Decision Trees and Decision Lists. FCT 2013: 16-27
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
