3 papers
cs.SE2018
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…
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
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…