A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

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

Papers matching “clique-width” 6

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
2021 Lecture notes in computer science conference-paper Computer Science Advanced Graph Theory Research

Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy

5

citations
Isomorphism for Tournaments of Small Twin Width
2026 TheoretiCS article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Daniel Neuen

0

citations
Canonisation and Definability for Graphs of Bounded Rank Width
2022 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Daniel Neuen

7

citations
The Parameterized Complexity of Learning Monadic Second-Order Logic
2023 HAL (Le Centre pour la Communication Scientifique Directe) conference-paper Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem, Martin Grohe, Nina Runde

0

citations
The Parameterized Complexity of Learning Monadic Second-Order Logic
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem

0

citations
Definable decompositions for graphs of bounded linear cliquewidth
2021 Logical Methods in Computer Science article Computer Science Advanced Graph Theory Research Open access

Mikołaj Bojańczyk, Martin Grohe, Michał Pilipczuk

7

citations

6 results