From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “graphs” 886

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
2024 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Corinna Mathwieser, Eranda Çela

2

citations
Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty
2022 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Corinna Mathwieser, Eranda Çela

0

citations
Fare Zone Assignment on Trees
2025 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Martin Hoefer, Lennart Kauther, Philipp Pabst, Britta Peis, Khai Van Tran

0

citations
Approximation Algorithms for Graphic Multi-Depot TSP and Graphic Multi-Path TSP
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Niklas Dahlmeier, Raoul Luqué, Philipp Pabst, Laura Vargas Koch

0

citations
Random Abstract Cell Complexes
2024 arXiv (Cornell University) preprint Computer Science Topological and Geometric Data Analysis Open access

Josef Hoppe, Michael T. Schaub

1

citations
The Complexity of Homomorphism Reconstructibility
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke

1

citations
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Tim Seppelt

1

citations
Reduction of the Random Access Memory Size in Adjoint Algorithmic Differentiation by Overloading
2022 arXiv (Cornell University) preprint Computer Science Parallel Computing and Optimization Techniques Open access

Uwe Naumann

0

citations
Computational Complexity of the Weisfeiler-Leman Dimension
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Simon Raßmann, Pascal Schweitzer

2

citations
Some Might Say All You Need Is Sum
2023 International Joint Conference on Artificial Intelligence conference-paper Computer Science Advanced Graph Neural Networks Open access

Eran Rosenbluth, Jan Tönshoff, Martin Grohe

4

citations
Some Might Say All You Need Is Sum
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Eran Rosenbluth, Jan Toenshoff, Martin Grohe

0

citations
The Iteration Number of Colour Refinement
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Graph Theory and Algorithms Open access

Sandra Kiefer, Brendan D. McKay

10

citations
The Iteration Number of Colour Refinement
2020 arXiv (Cornell University) preprint Computer Science Graph Theory and Algorithms Open access

Sandra Kiefer, Brendan D. McKay

1

citations
Counting Bounded Tree Depth Homomorphisms
2020 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Theory Research Open access

Martin Grohe

21

citations
Local, Global And Scale-Dependent Node Roles
2021 conference-paper Computer Science Advanced Graph Neural Networks Open access

Michael Scholkemper, Michael T. Schaub

3

citations
Are Targeted Messages More Effective?
2024 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Martin Grohe, Eran Rosenbluth

1

citations
Iteratively Learning Representations for Unseen Entities with Inter-Rule Correlations
2023 ACM International Conference on Information and Knowledge Management (CIKM) conference-paper Computer Science Advanced Graph Neural Networks Open access

Zihan Wang, Kai Zhao, Yongquan He, Zhumin Chen, Pengjie Ren, Maarten de Rijke, +1 more

1

citations
Distinguished In Uniform: Self Attention Vs. Virtual Nodes
2024 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Eran Rosenbluth, Jan Tönshoff, Martin Ritzert, Berke Kisin, Martin Grohe

0

citations
Towards the semantic formalization of science
2020 ACM Symposium on Applied Computing conference-paper Computer Science Semantic Web and Ontologies

Said Fathalla, Sören Auer, Christoph Lange

21

citations
Towards the "I" in FAIR – Interoperable Metadata Profiles for your Research Projects
2026 Zenodo (CERN European Organization for Nuclear Research) article Computer Science Research Data Management Practices Open access

Jacquline Wormstädt, Jürgen Windeck, Kseniia Dukkart

0

citations
How Does Bayesian Causal Discovery Fail? Characterising Structural Consequences in Linear Gaussian Networks under Latent Confounding
2026 arXiv (Cornell University) preprint Computer Science Bayesian Modeling and Causal Inference Open access

Debargha Ghosh, Silja Renooij, Anna Kononova

0

citations
Towards the "I" in FAIR – Interoperable Metadata Profiles for your Research Projects
2026 Zenodo (CERN European Organization for Nuclear Research) article Computer Science Research Data Management Practices Open access

Jacquline Wormstädt, Jürgen Windeck, Kseniia Dukkart

0

citations
Deep Weisfeiler Leman
2021 Society for Industrial and Applied Mathematics eBooks conference-paper Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Pascal Schweitzer, Daniel Wiebking

6

citations
Limitations of the invertible-map equivalences
2022 Journal of Logic and Computation article Computer Science Advanced Graph Theory Research Open access

Anuj Dawar, Erich Grädel, Moritz Lichter

4

citations
Remarks on the outer-independent double Italian domination number
2021 Opuscula Mathematica article Computer Science Advanced Graph Theory Research Open access

Lutz Volkmann

3

citations