5 citations · 9 across the 2 of their papers we have counts for
3 papers
cs.PL2020
lospre in linear time
Philipp Klaus Krause
Lifetime-optimal speculative partial redundancy elimination (lospre) is the most advanced currently known redundancy elimination technique. It subsumes many previously known approa…
cs.DM2019★ 5 cited
A lower bound on the tree-width of graphs with irrelevant vertices
Isolde Adler, Philipp Klaus Krause
For their famous algorithm for the disjoint paths problem, Robertson and Seymour proved that there is a function such that if the tree-width of a graph with pairs of te…
cs.DS2010★ 4 cited
A lower bound for the tree-width of planar graphs with vital linkages
Isolde Adler, Philipp Klaus Krause
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s_0,t_0), ...,(s_k,t_k), whether there are k+1 pairwise disjoint paths P_0, ...,P_k, such that P_i c…