2 citations · 4 across the 5 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2018
Fundamentals of Parameterized Complexity Revisited
Maurice Chandoo
Flum and Grohe define a parameter (parameterization) as a function which maps words over a given alphabet to natural numbers. They require such functions to be polynomial-time…
cs.CC2018★ 2 cited
A Complexity Theory for Labeling Schemes
Maurice Chandoo
In a labeling scheme the vertices of a given graph from a particular class are assigned short labels such that adjacency can be algorithmically determined from these labels. A repr…
cs.CC2016
On the Implicit Graph Conjecture
Maurice Chandoo
The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this c…