One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible w...