Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Chandoo, Maurice"'
Autor:
Chandoo, Maurice
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 algorithm proceeds on a concrete input. This information---which we cal
Externí odkaz:
http://arxiv.org/abs/1808.08989
Autor:
Chandoo, Maurice
Flum and Grohe define a parameter (parameterization) as a function $\kappa$ which maps words over a given alphabet to natural numbers. They require such functions to be polynomial-time computable. We show how this technical restriction can be lifted
Externí odkaz:
http://arxiv.org/abs/1804.11089
Autor:
Chandoo, Maurice
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 representation of a graph from that class is given by the set of its verte
Externí odkaz:
http://arxiv.org/abs/1802.02819
Autor:
Chandoo, Maurice
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, which we call uniform, it suffices to compute a CA representation to find
Externí odkaz:
http://arxiv.org/abs/1702.05763
Autor:
Chandoo, Maurice
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 conjecture by investigating classes of label decoders defined in terms
Externí odkaz:
http://arxiv.org/abs/1603.01977
Autor:
Chandoo, Maurice
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 this we split the class of CA graphs into uniform and non-uniform ones
Externí odkaz:
http://arxiv.org/abs/1507.03348
Autor:
Chandoo, Maurice
A labeling scheme is a space-efficient data structure for encoding graphs from a particular class. The idea is to assign each vertex of a graph a short label s.t. adjacency of two vertices can be determined by feeding their labels to an algorithm whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84c675b5b94a0e9b5dfe7bae186b0384
Publikováno v:
Tagungsband 9. Fachtagung Hochschuldidaktik Informatik (HDI) 2021
We describe an approach to teaching algorithmic thinking and programming and the first experiences that we made with it in practice. The idea is to present computational problems as a certain kind of game that the learner can play in order for them t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8ced423a0844c7c04edc2a49a0e859b
Autor:
Chandoo, Maurice
We show how the first steps of algorithmic thinking and programming can be trained separately. The learner is not assumed to have any prior experience. A general framework and a sequence of training tasks is described and tested in practice with two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::030eae9db0a80b9fc163eebc47b948a4