Kamu erişimi zorunlu olan makaleler - VIkraman ArvindDaha fazla bilgi edinin
Hiçbir yerde sunulmuyor: 3
On the power of color refinement
V Arvind, J Köbler, G Rattan, O Verbitsky
Fundamentals of Computation Theory: 20th International Symposium, FCT 2015 …, 2015
Zorunlu olanlar: German Research Foundation
On Tinhofer’s linear programming approach to isomorphism testing
V Arvind, J Köbler, G Rattan, O Verbitsky
Mathematical Foundations of Computer Science 2015: 40th International …, 2015
Zorunlu olanlar: German Research Foundation
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms
V Arvind, J Köbler, S Kuhnert, J Torán
Algorithmica 83 (12), 3567-3601, 2021
Zorunlu olanlar: German Research Foundation
Bir yerde sunuluyor: 13
On weisfeiler-leman invariance: Subgraph counts and related graph properties
V Arvind, F Fuhlbrück, J Köbler, O Verbitsky
Journal of Computer and System Sciences 113, 42-59, 2020
Zorunlu olanlar: German Research Foundation
Approximate graph isomorphism
V Arvind, J Köbler, S Kuhnert, Y Vasudev
Mathematical Foundations of Computer Science 2012: 37th International …, 2012
Zorunlu olanlar: German Research Foundation
Graph isomorphism, color refinement, and compactness
V Arvind, J Köbler, G Rattan, O Verbitsky
computational complexity 26, 627-685, 2017
Zorunlu olanlar: German Research Foundation
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable
V Arvind, R Nedela, I Ponomarenko, P Zeman
International Workshop on Graph-Theoretic Concepts in Computer Science, 29-42, 2022
Zorunlu olanlar: Swiss National Science Foundation
Solving linear equations parameterized by hamming weight
V Arvind, J Köbler, S Kuhnert, J Torán
Algorithmica 75, 322-338, 2016
Zorunlu olanlar: German Research Foundation
The isomorphism problem for k-trees is complete for logspace
V Arvind, B Das, J Köbler, S Kuhnert
Information and Computation 217, 1-11, 2012
Zorunlu olanlar: German Research Foundation
On the isomorphism problem for decision trees and decision lists
V Arvind, J Köbler, S Kuhnert, G Rattan, Y Vasudev
Theoretical Computer Science 590, 38-54, 2015
Zorunlu olanlar: German Research Foundation
On the Weisfeiler-Leman dimension of fractional packing
V Arvind, F Fuhlbrück, J Köbler, O Verbitsky
Information and Computation 288, 104803, 2022
Zorunlu olanlar: German Research Foundation
CNF satisfiability in a subspace and related problems
V Arvind, V Guruswami
Algorithmica 84 (11), 3276-3299, 2022
Zorunlu olanlar: US National Science Foundation
Around and beyond the isomorphism problem for interval graphs
J Köbler, S Kuhnert, O Verbitsky, V Arvind
Bulletin of EATCS 2 (107), 2013
Zorunlu olanlar: German Research Foundation
Parameterized complexity of small weight automorphisms
V Arvind, J Köbler, S Kuhnert, J Torán
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), 7: 1 …, 2017
Zorunlu olanlar: German Research Foundation
The parameterized complexity of fixing number and vertex individualization in graphs
V Arvind, F Fuhlbrueck, J Koebler, S Kuhnert, G Rattan
ACM Transactions on Computation Theory (TOCT) 14 (2), 1-26, 2022
Zorunlu olanlar: German Research Foundation
On the Weisfeiler-Leman dimension of fractional packing
V Arvind, F Fuhlbrück, J Köbler, O Verbitsky
International Conference on Language and Automata Theory and Applications …, 2020
Zorunlu olanlar: German Research Foundation
Yayıncılık ve maddi kaynak bilgileri otomatik olarak bir bilgisayar programı tarafından belirlenmektedir