2 citations · 4 across the 5 of their papers we have counts for
6 papers
A Systematic Approach to Programming
Maurice Chandoo
We show how to systematically implement an algorithm in any imperative or functional programming language. The method is based on the premise that it is easy to write down how an a…
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…
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…
Canonical Representations for Circular-Arc Graphs Using Flip Sets
Maurice Chandoo
We show that computing canonical representations for circular-arc (CA) graphs reduces to computing certain subsets of vertices called flip sets. For a broad class of CA graphs, whi…
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…
Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace
Maurice Chandoo
We compute a canonical circular-arc representation for a given circular-arc (CA) graph which implies solving the isomorphism and recognition problem for this class. To accomplish t…