Jan Böker

Orcid: 0000-0003-4584-121X

According to our database1, Jan Böker authored at least 6 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Complexity of Homomorphism Reconstructibility.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023
Weisfeiler-Leman Indistinguishability of Graphons.
Electron. J. Comb., 2023

Fine-grained Expressivity of Graph Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2021
Graph Similarity and Homomorphism Densities.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2019
Color Refinement, Homomorphisms, and Hypergraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

The Complexity of Homomorphism Indistinguishability.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019


  Loading...