Martin Grohe

Navedeno

	Vse	Od leta 2018
Navedbe	13684	6187
indeks h	55	36
indeks i10	139	99

1500

750

375

1125

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202335 41 70 58 126 212 186 280 361 471 498 493 494 643 744 568 569 658 752 627 739 952 1192 1406 1261

Javni dostop

Prikaži vse

30 člankov

3 članki

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Martin RitzertGeorg-August Universität GöttingenPreverjeni e-poštni naslov na informatik.uni-goettingen.de
Nicole SchweikardtProfessor of Computer Science, Humboldt-University BerlinPreverjeni e-poštni naslov na informatik.hu-berlin.de
Stephan KreutzerProfessor of Computer Science, Technical University BerlinPreverjeni e-poštni naslov na tu-berlin.de
Markus FrickAda HealthPreverjeni e-poštni naslov na ada.com
Dániel MarxCISPA Helmholtz Center for Information SecurityPreverjeni e-poštni naslov na cispa.saarland
Gaurav RattanResearcher, TU DarmstadtPreverjeni e-poštni naslov na mathematik.tu-darmstadt.de
Christopher MorrisRWTH Aachen UniversityPreverjeni e-poštni naslov na cs.rwth-aachen.de
Christoph KochProfessor of Computer Science, EPFLPreverjeni e-poštni naslov na epfl.ch
Anuj DawarUniversity of CambridgePreverjeni e-poštni naslov na cl.cam.ac.uk
Yijia ChenShanghai Jiao Tong UniversityPreverjeni e-poštni naslov na cs.sjtu.edu.cn
Daniel NeuenCISPA Helmholtz CenterPreverjeni e-poštni naslov na cispa.saarland
Matthias FeyFounding Engineer @ kumo.aiPreverjeni e-poštni naslov na tu-dortmund.de
Sebastian SiebertzUniversität Bremen, AG Theoretische InformatikPreverjeni e-poštni naslov na uni-bremen.de
Andrei BulatovSimon Fraser UniversityPreverjeni e-poštni naslov na sfu.ca
Albert AtseriasUniversitat Politècnica de Catalunya, BarcelonaPreverjeni e-poštni naslov na cs.upc.edu
Jan Eric LenssenMax Planck Institute for InformaticsPreverjeni e-poštni naslov na mpi-inf.mpg.de
William L HamiltonAssistant Professor of Computer Science, McGill University and MilaPreverjeni e-poštni naslov na cs.mcgill.ca
Thomas SchwentickProfessor of Computer Science, TU Dortmund UniversityPreverjeni e-poštni naslov na udo.edu
Peter LindnerEPFLPreverjeni e-poštni naslov na epfl.ch
Georg GottlobProfessor of Informatics, University of OxfordPreverjeni e-poštni naslov na cs.ox.ac.uk

Spremljaj

Martin Grohe

Professor of Computer Science, RWTH Aachen University

Preverjeni e-poštni naslov na informatik.rwth-aachen.de - Domača stran


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Parameterized Complexity Theory, 1st edn. Texts in Theoretical Computer Science. An EATCS Series1 edition J Flum, M Grohe Springer (March 2006), 2006	2859*	2006
Weisfeiler and leman go neural: Higher-order graph neural networks C Morris, M Ritzert, M Fey, WL Hamilton, JE Lenssen, G Rattan, M Grohe Proceedings of the AAAI Conference on Artificial Intelligence 33, 4602-4609, 2019	1159	2019
The complexity of homomorphism and constraint satisfaction problems seen from the other side M Grohe Journal of the ACM (JACM) 54 (1), 1, 2007	327	2007
The complexity of first-order and monadic second-order logic revisited M Frick, M Grohe Annals of pure and applied logic 130 (1-3), 3-31, 2004	324	2004
Size bounds and query plans for relational joins A Atserias, M Grohe, D Marx SIAM Journal on Computing 42 (4), 1737-1767, 2013	319	2013
The parameterized complexity of counting problems J Flum, M Grohe SIAM Journal on Computing 33 (4), 892-922, 2004	307	2004
Path queries on compressed XML P Buneman, M Grohe, C Koch Proceedings 2003 VLDB Conference, 141-152, 2003	282	2003
Constraint solving via fractional edge covers M Grohe, D Marx ACM Transactions on Algorithms (TALG) 11 (1), 4, 2014	278	2014
Deciding first-order properties of nowhere dense graphs M Grohe, S Kreutzer, S Siebertz Journal of the ACM (JACM) 64 (3), 1-32, 2017	262	2017
Query evaluation via tree-decompositions J Flum, M Frick, M Grohe Journal of the ACM (JACM) 49 (6), 716-752, 2002	252	2002
Deciding first-order properties of locally tree-decomposable structures M Frick, M Grohe Journal of the ACM (JACM) 48 (6), 1184-1206, 2001	252	2001
The complexity of partition functions A Bulatov, M Grohe Theoretical Computer Science 348 (2-3), 148-186, 2005	184	2005
Local tree-width, excluded minors, and approximation algorithms M Grohe arXiv preprint math/0001128, 2000	180	2000
Descriptive complexity, canonisation, and definable graph structure theory M Grohe Cambridge University Press, 2017	169	2017
When is the evaluation of conjunctive queries tractable? M Grohe, T Schwentick, L Segoufin Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001	167	2001
Finding topological subgraphs is fixed-parameter tractable M Grohe, K Kawarabayashi, D Marx, P Wollan Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	152	2011
Locally excluding a minor A Dawar, M Grohe, S Kreutzer 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 270-279, 2007	152	2007
Fixed-parameter tractability, definability, and model-checking J Flum, M Grohe SIAM Journal on Computing 31 (1), 113-145, 2001	149	2001
Logic, graphs, and algorithms. M Grohe Logic and automata 2, 357-422, 2008	141	2008
word2vec, node2vec, graph2vec, x2vec: Towards a theory of vector embeddings of structured data M Grohe Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020	140	2020

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji