16 citations · 94 across the 30 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DM2012★ 10 cited
Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences
Jakub Gajarsky, Petr Hlineny
Fix an integer h>=1. In the universe of coloured trees of height at most h, we prove that for any graph decision problem defined by an MSO formula with r quantifiers, there exists…
cs.DS2012
Dynamic Scope-Based Dijkstra's Algorithm
Petr Hlineny, Ondrej Moris
We briefly report on the current state of a new dynamic algorithm for the route planning problem based on a concept of scope (the static variant presented at ESA'11, HM2011A). We f…