Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Grohe
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j71]Artur M. Schweidtmann
, Jan G. Rittig, Jana M. Weber, Martin Grohe, Manuel Dahmen, Kai Leonhard, Alexander Mitsos:
Physical pooling functions in graph neural networks for molecular property prediction. Comput. Chem. Eng. 172: 108202 (2023)- [j70]Martin Grohe, Daniel Neuen, Daniel Wiebking:
Isomorphism Testing for Graphs Excluding Small Minors. SIAM J. Comput. 52(1): 238-272 (2023) - [j69]Martin Grohe, Daniel Neuen:
Canonisation and Definability for Graphs of Bounded Rank Width. ACM Trans. Comput. Log. 24(1): 6:1-6:31 (2023) - [c138]Yuval Lev Lubarsky, Jan Tönshoff, Martin Grohe, Benny Kimelfeld:
Selecting Walk Schemes for Database Embedding. CIKM 2023: 1677-1686 - [c137]Jan Tönshoff, Neta Friedman, Martin Grohe, Benny Kimelfeld:
Stable Tuple Embeddings for Dynamic Databases. ICDE 2023: 1286-1299 - [c136]Martin Grohe, Peter Lindner, Christoph Standke:
Probabilistic Query Evaluation with Bag Semantics. ICDT 2023: 20:1-20:19 - [c135]Christopher Morris, Floris Geerts, Jan Tönshoff, Martin Grohe:
WL meet VC. ICML 2023: 25275-25302 - [c134]Eran Rosenbluth, Jan Tönshoff, Martin Grohe:
Some Might Say All You Need Is Sum. IJCAI 2023: 4172-4179 - [c133]Jan Tönshoff, Berke Kisin, Jakob Lindner, Martin Grohe:
One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction. IJCAI 2023: 4280-4288 - [c132]Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus:
Simulating Logspace-Recursion with Logarithmic Quantifier Depth. LICS 2023: 1-13 - [c131]Martin Grohe:
The Descriptive Complexity of Graph Neural Networks. LICS 2023: 1-14 - [c130]Martin Grohe, Moritz Lichter, Daniel Neuen:
The Iteration Number of the Weisfeiler-Leman Algorithm. LICS 2023: 1-13 - [i96]Christopher Morris, Floris Geerts, Jan Tönshoff, Martin Grohe:
WL meet VC. CoRR abs/2301.11039 (2023) - [i95]Martin Grohe, Moritz Lichter, Daniel Neuen:
The Iteration Number of the Weisfeiler-Leman Algorithm. CoRR abs/2301.13317 (2023) - [i94]Eran Rosenbluth, Jan Tönshoff, Martin Grohe:
Some Might Say All You Need Is Sum. CoRR abs/2302.11603 (2023) - [i93]Martin Grohe:
The Descriptive Complexity of Graph Neural Networks. CoRR abs/2303.04613 (2023) - [i92]Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus:
Simulating Logspace-Recursion with Logarithmic Quantifier Depth. CoRR abs/2304.12948 (2023) - [i91]Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer:
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. CoRR abs/2308.11970 (2023) - [i90]Hinrikus Wolf, Luca Oeljeklaus, Pascal Kühner, Martin Grohe:
Structural Node Embeddings with Homomorphism Counts. CoRR abs/2308.15283 (2023) - [i89]Jan Tönshoff, Martin Ritzert, Eran Rosenbluth, Martin Grohe:
Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark. CoRR abs/2309.00367 (2023) - [i88]Steffen van Bergerem, Martin Grohe, Nina Runde:
On the Parameterized Complexity of Learning Monadic Second-Order Formulas. CoRR abs/2309.10489 (2023) - 2022
- [j68]Martin Grohe, Peter Lindner:
Independence in Infinite Probabilistic Databases. J. ACM 69(5): 37:1-37:42 (2022) - [j67]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Generative Datalog with Continuous Distributions. J. ACM 69(6): 46:1-46:52 (2022) - [j66]Martin Grohe, Peter Lindner:
Infinite Probabilistic Databases. Log. Methods Comput. Sci. 18(1) (2022) - [c129]Martin Grohe, Gaurav Rattan, Tim Seppelt:
Homomorphism Tensors and Linear Equations. ICALP 2022: 70:1-70:20 - [c128]Timo Gervens, Martin Grohe:
Graph Similarity Based on Matrix Norms. MFCS 2022: 52:1-52:15 - [c127]Steffen van Bergerem, Martin Grohe, Martin Ritzert:
On the Parameterized Complexity of Learning First-Order Logic. PODS 2022: 337-346 - [i87]Martin Grohe, Peter Lindner, Christoph Standke:
Probabilistic Query Evaluation with Bag Semantics. CoRR abs/2201.11524 (2022) - [i86]Luis Böttcher, Hinrikus Wolf, Bastian Jung, Philipp Lutat, Marc Trageser, Oliver Pohl, Andreas Ulbig, Martin Grohe:
Solving AC Power Flow with Graph Neural Networks under Realistic Constraints. CoRR abs/2204.07000 (2022) - [i85]Jan G. Rittig, Martin Ritzert, Artur M. Schweidtmann, Stefanie Winkler, Jana M. Weber, Philipp Morsch, K. Alexander Heufer, Martin Grohe, Alexander Mitsos, Manuel Dahmen:
Graph Machine Learning for Design of High-Octane Fuels. CoRR abs/2206.00619 (2022) - [i84]Timo Gervens, Martin Grohe:
Graph Similarity Based on Matrix Norms. CoRR abs/2207.00090 (2022) - [i83]Artur M. Schweidtmann, Jan G. Rittig, Jana M. Weber, Martin Grohe, Manuel Dahmen, Kai Leonhard, Alexander Mitsos:
Physical Pooling Functions in Graph Neural Networks for Molecular Property Prediction. CoRR abs/2207.13779 (2022) - [i82]Jan Tönshoff, Berke Kisin, Jakob Lindner, Martin Grohe:
One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction. CoRR abs/2208.10227 (2022) - [i81]Martin Grohe, Stephan Günnemann, Stefanie Jegelka, Christopher Morris:
Graph Embeddings: Theory meets Practice (Dagstuhl Seminar 22132). Dagstuhl Reports 12(3): 141-155 (2022) - [i80]Martin Grohe, Venkatesan Guruswami, Dániel Marx, Stanislav Zivný:
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201). Dagstuhl Reports 12(5): 112-130 (2022) - 2021
- [j65]Martin Grohe, Daniel Neuen:
Isomorphism, canonization, and definability for graphs of bounded rank width. Commun. ACM 64(5): 98-105 (2021) - [j64]Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk:
Definable decompositions for graphs of bounded linear cliquewidth. Log. Methods Comput. Sci. 17(1) (2021) - [j63]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Probabilistic Data with Continuous Distributions. SIGMOD Rec. 50(1): 69-76 (2021) - [c126]Martin Grohe, Daniel Neuen:
Recent advances on the graph isomorphism problem. BCC 2021: 187-234 - [c125]Martin Grohe, Sandra Kiefer:
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs. ICALP 2021: 134:1-134:20 - [c124]Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi:
Database Repairing with Soft Functional Dependencies. ICDT 2021: 16:1-16:17 - [c123]Ralph Abboud, Ismail Ilkan Ceylan, Martin Grohe, Thomas Lukasiewicz:
The Surprising Power of Graph Neural Networks with Random Node Initialization. IJCAI 2021: 2112-2118 - [c122]Martin Grohe:
The Logic of Graph Neural Networks. LICS 2021: 1-17 - [c121]Martin Grohe:
A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk). MFCS 2021: 2:1-2:1 - [c120]Tobias Schumacher, Hinrikus Wolf, Martin Ritzert, Florian Lemmerich, Martin Grohe, Markus Strohmaier:
The Effects of Randomness on the Stability of Node Embeddings. PKDD/ECML Workshops (1) 2021: 197-215 - [c119]Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke:
Tuple-Independent Representations of Infinite Probabilistic Databases. PODS 2021: 388-401 - [c118]Martin Grohe, Pascal Schweitzer, Daniel Wiebking:
Deep Weisfeiler Leman. SODA 2021: 2600-2614 - [i79]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Probabilistic Data with Continuous Distributions. CoRR abs/2101.12289 (2021) - [i78]Jan Tönshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe:
Graph Learning with 1D Convolutions on Random Walks. CoRR abs/2102.08786 (2021) - [i77]Steffen van Bergerem, Martin Grohe, Martin Ritzert:
On the Parameterized Complexity of Learning Logic. CoRR abs/2102.12201 (2021) - [i76]Jan Tönshoff, Neta Friedman, Martin Grohe, Benny Kimelfeld:
Dynamic Database Embeddings with FoRWaRD. CoRR abs/2103.06766 (2021) - [i75]Martin Grohe:
The Logic of Graph Neural Networks. CoRR abs/2104.14624 (2021) - [i74]Martin Grohe, Sandra Kiefer:
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs. CoRR abs/2106.16218 (2021) - [i73]Martin Grohe, Gaurav Rattan, Tim Seppelt:
Homomorphism Tensors and Linear Equations. CoRR abs/2111.11313 (2021) - [i72]Christopher Morris, Yaron Lipman, Haggai Maron, Bastian Rieck, Nils M. Kriege, Martin Grohe, Matthias Fey, Karsten M. Borgwardt:
Weisfeiler and Leman go Machine Learning: The Story so far. CoRR abs/2112.09992 (2021) - 2020
- [j62]Martin Grohe, Pascal Schweitzer:
The graph isomorphism problem. Commun. ACM 63(11): 128-134 (2020) - [j61]Jan Tönshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe:
Graph Neural Networks for Maximum Constraint Satisfaction. Frontiers Artif. Intell. 3: 580607 (2020) - [j60]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An Improved Isomorphism Test for Bounded-tree-width Graphs. ACM Trans. Algorithms 16(3): 34:1-34:31 (2020) - [c117]Martin Grohe, Daniel Wiebking, Daniel Neuen:
Isomorphism Testing for Graphs Excluding Small Minors. FOCS 2020: 625-636 - [c116]Martin Grohe, Peter Lindner:
Infinite Probabilistic Databases. ICDT 2020: 16:1-16:20 - [c115]Martin Grohe:
Counting Bounded Tree Depth Homomorphisms. LICS 2020: 507-520 - [c114]Martin Grohe:
word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data. PODS 2020: 1-16 - [c113]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Generative Datalog with Continuous Distributions. PODS 2020: 347-360 - [c112]Martin Grohe:
Weisfeiler and Leman's Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk). STACS 2020: 2:1-2:1 - [i71]Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
Generative Datalog with Continuous Distributions. CoRR abs/2001.06358 (2020) - [i70]Martin Grohe:
Counting Bounded Tree Depth Homomorphisms. CoRR abs/2003.08164 (2020) - [i69]Martin Grohe, Pascal Schweitzer, Daniel Wiebking:
Deep Weisfeiler Leman. CoRR abs/2003.10935 (2020) - [i68]Martin Grohe:
word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data. CoRR abs/2003.12590 (2020) - [i67]Martin Grohe, Daniel Neuen, Daniel Wiebking:
Isomorphism Testing for Graphs Excluding Small Minors. CoRR abs/2004.07671 (2020) - [i66]Tobias Schumacher, Hinrikus Wolf, Martin Ritzert, Florian Lemmerich, Jan Bachmann, Florian Frantzen, Max Klabunde, Martin Grohe, Markus Strohmaier:
The Effects of Randomness on the Stability of Node Embeddings. CoRR abs/2005.10039 (2020) - [i65]Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke:
Tuple-Independent Representations of Infinite Probabilistic Databases. CoRR abs/2008.09511 (2020) - [i64]Nofar Carmeli, Martin Grohe, Benny Kimelfeld, Ester Livshits, Muhammad Tibi:
Database Repairing with Soft Functional Dependencies. CoRR abs/2009.13821 (2020) - [i63]Ralph Abboud, Ismail Ilkan Ceylan, Martin Grohe, Thomas Lukasiewicz:
The Surprising Power of Graph Neural Networks with Random Node Initialization. CoRR abs/2010.01179 (2020) - [i62]Martin Grohe, Peter Lindner:
Independence in Infinite Probabilistic Databases. CoRR abs/2011.00096 (2020) - [i61]Martin Grohe, Daniel Neuen:
Recent Advances on the Graph Isomorphism Problem. CoRR abs/2011.01366 (2020) - [i60]Martin Grohe, Peter Lindner:
Standard Probabilistic Databases. CoRR abs/2011.14860 (2020) - [i59]Martin Grohe, Pascal Schweitzer, Daniel Wiebking:
Automorphism groups of graphs of bounded Hadwiger number. CoRR abs/2012.14300 (2020)
2010 – 2019
- 2019
- [j59]Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa:
A Finite-Model-Theoretic View on Propositional Proof Complexity. Log. Methods Comput. Sci. 15(1) (2019) - [c111]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 - [c110]Martin Grohe:
Symmetry and Similarity (Invited Talk). ICALP 2019: 2:1-2:1 - [c109]Martin Grohe, Sandra Kiefer:
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus. ICALP 2019: 117:1-117:15 - [c108]Martin Grohe, Daniel Neuen:
Canonisation and Definability for Graphs of Bounded Rank Width. LICS 2019: 1-13 - [c107]Jan Böker, Yijia Chen, Martin Grohe, Gaurav Rattan:
The Complexity of Homomorphism Indistinguishability. MFCS 2019: 54:1-54:13 - [c106]Martin Grohe, Peter Lindner:
Probabilistic Databases with an Infinite Open-World Assumption. PODS 2019: 17-31 - [i58]Martin Grohe, Daniel Neuen:
Canonisation and Definability for Graphs of Bounded Rank Width. CoRR abs/1901.10330 (2019) - [i57]Martin Grohe, Peter Lindner:
Infinite Probabilistic Databases. CoRR abs/1904.06766 (2019) - [i56]Martin Grohe, Sandra Kiefer:
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus. CoRR abs/1904.07216 (2019) - [i55]Jan Tönshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe:
RUN-CSP: Unsupervised Learning of Message Passing Networks for Binary Constraint Satisfaction Problems. CoRR abs/1909.08387 (2019) - 2018
- [j58]Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Konstantinos S. Stavropoulos:
Coloring and Covering Nowhere Dense Graphs. SIAM J. Discret. Math. 32(4): 2467-2481 (2018) - [c105]Martin Grohe, Daniel Neuen, Pascal Schweitzer:
A Faster Isomorphism Test for Graphs of Small Degree. FOCS 2018: 89-100 - [c104]Holger Dell, Martin Grohe, Gaurav Rattan:
Lovász Meets Weisfeiler and Leman. ICALP 2018: 40:1-40:14 - [c103]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An Improved Isomorphism Test for Bounded-Tree-Width Graphs. ICALP 2018: 67:1-67:14 - [c102]Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk:
Definable decompositions for graphs of bounded linear cliquewidth. LICS 2018: 135-144 - [c101]Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger:
Graph Similarity and Approximate Isomorphism. MFCS 2018: 20:1-20:16 - [c100]Martin Grohe, Nicole Schweikardt:
First-Order Query Evaluation with Cardinality Conditions. PODS 2018: 253-266 - [i54]Martin Grohe, Daniel Neuen, Pascal Schweitzer:
Towards faster isomorphism tests for bounded-degree graphs. CoRR abs/1802.04659 (2018) - [i53]Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger:
Graph Similarity and Approximate Isomorphism. CoRR abs/1802.08509 (2018) - [i52]Holger Dell, Martin Grohe, Gaurav Rattan:
Weisfeiler-Leman meets Homomorphisms. CoRR abs/1802.08876 (2018) - [i51]Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa:
A Finite-Model-Theoretic View on Propositional Proof Complexity. CoRR abs/1802.09377 (2018) - [i50]Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk:
Definable decompositions for graphs of bounded linear cliquewidth. CoRR abs/1803.05937 (2018) - [i49]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An improved isomorphism test for bounded-tree-width graphs. CoRR abs/1803.06858 (2018) - [i48]Martin Grohe, Peter Lindner:
Probabilistic Databases with an Infinite Open-World Assumption. CoRR abs/1807.00607 (2018) - [i47]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) - [i46]Martin Grohe, Venkatesan Guruswami, Stanislav Zivný:
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231). Dagstuhl Reports 8(6): 1-18 (2018) - 2017
- [b2]Martin Grohe:
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory. Lecture Notes in Logic 47, Cambridge University Press 2017, ISBN 9781139028868 - [j57]Martin Grohe, Stephan Kreutzer, Sebastian Siebertz:
Deciding First-Order Properties of Nowhere Dense Graphs. J. ACM 64(3): 17:1-17:32 (2017) - [j56]Christoph Berkholz, Paul S. Bonsma, Martin Grohe:
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. Theory Comput. Syst. 60(4): 581-614 (2017) - [c99]Martin Grohe, Christof Löding, Martin Ritzert:
Learning MSO-definable hypotheses on strings. ALT 2017: 434-451 - [c98]Martin Grohe, Wied Pakusa:
Descriptive complexity of linear equation systems and applications to propositional proof complexity. LICS 2017: 1-12 - [c97]Martin Grohe, Martin Ritzert:
Learning first-order definable concepts over structures of small degree. LICS 2017: 1-12 - [c96]Christoph Berkholz, Martin Grohe:
Linear Diophantine Equations, Group CSPs, and Graph Isomorphism. SODA 2017: 327-339 - [c95]Yijia Chen, Martin Grohe, Bingkai Lin:
The Hardness of Embedding Grids and Walls. WG 2017: 180-192 - [i45]Martin Grohe, Martin Ritzert:
Learning first-order definable concepts over structures of small degree. CoRR abs/1701.05487 (2017) - [i44]Yijia Chen, Martin Grohe, Bingkai Lin:
The Hardness of Embedding Grids and Walls. CoRR abs/1703.06423 (2017) - [i43]Martin Grohe, Nicole Schweikardt:
First-Order Query Evaluation with Cardinality Conditions. CoRR abs/1707.05945 (2017) - [i42]Martin Grohe, Christof Löding, Martin Ritzert:
Learning MSO-definable hypotheses on string. CoRR abs/1708.08081 (2017) - [i41]Albert Atserias, Martin Grohe, Dániel Marx:
Size bounds and query plans for relational joins. CoRR abs/1711.03860 (2017) - [i40]Martin Grohe, Dániel Marx:
Constraint Solving via Fractional Edge Covers. CoRR abs/1711.04506 (2017) - 2016
- [j55]Martin Grohe, Pascal Schweitzer:
Computing with Tangles. SIAM J. Discret. Math. 30(2): 1213-1247 (2016) - [j54]Michael Elberfeld, Martin Grohe, Till Tantau:
Where First-Order and Monadic Second-Order Logic Coincide. ACM Trans. Comput. Log. 17(4): 25 (2016) - [c94]Martin Grohe:
Quasi-4-Connected Components. ICALP 2016: 8:1-8:13 - [c93]Martin Grohe:
Tangles and Connectivity in Graphs. LATA 2016: 24-41 - [c92]Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe:
Order Invariance on Decomposable Structures. LICS 2016: 397-406 - [e6]Martin Grohe, Eric Koskinen, Natarajan Shankar:
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016. ACM 2016, ISBN 978-1-4503-4391-6 [contents] - [i39]Martin Grohe:
Quasi-4-Connected Components. CoRR abs/1602.04505 (2016) - [i38]Martin Grohe:
Tangles and Connectivity in Graphs. CoRR abs/1602.04727 (2016) - [i37]Martin Grohe:
Tangled up in Blue (A Survey on Connectivity, Decompositions, and Tangles). CoRR abs/1605.06704 (2016) - [i36]