4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DS2012
Detours in Scope-Based Route Planning
Petr Hliněný, Ondrej Moriš
We study a dynamic scenario of the static route planning problem in road networks. Particularly, we put accent on the most practical dynamic case - increased edge weights (up to in…
cs.DM2010★ 4 cited
Better algorithms for satisfiability problems for formulas of bounded rank-width
Robert Ganian, Petr Hliněný, Jan Obdržálek
We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single-exponential in the rank-width of a formula. Previo…