In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information

If the computed velocity u n exceeds the propagation speed U n , one is led to conclude from the convective breaking criterion (2.8) that around the time t n the wave is start- ing

In particular, we show that for all positive integers t and W , the Minimum Weight t -spanner problem admits a EPTAS on apex-minor-free graphs with positive integer weights of edges

✩ A preliminary version of these results appeared in proceedings of WADS’07 [F.V. Liedloff, Branch and recharge: Exact algorithms for generalized domination, in:.. Proceedings of

In this paper, we study the pa- rameterized complexity of local search for the Minimum Fill-in problem in the following form: Given a triangulation H of a graph G, is there a

We show that for several classes of sparse graphs, including planar graphs, graphs of bounded vertex degree and graphs excluding some fixed graph as a minor, an improved solution in

The energy loss in the shallow-water theory for an undular bore is thought to be due to oscillations that carry away the energy lost at the front of the bore.. Using a higher-

In what follows next we adhere to edge representation strategy and form gadgets in the context of reduction from Multicolor Clique to Equitable Coloring Problem on graphs with

The game of cops and robbers is a pursuit-evasion game played on a graph, where a team of pursuers is trying to catch an evader. See also [5,28] for references on