ftc - Floating precision texture compression. - Philipp Klaus Krause (Comput. Graph., 2010)

A lower bound for the tree-width of planar graphs with vital linkages - Isolde Adler; Philipp Klaus Krause (CoRR, 2010)

Adaptive voltage over-scaling for resilient applications. - Philipp Klaus Krause; Ilia Polian (DATE, 2011)

Tight Bounds for Linkages in Planar Graphs. - Isolde Adler; Stavros G. Kolliopoulos; Philipp Klaus Krause; Daniel Lokshtanov; Saket Saurabh 001; Dimitrios M. Thilikos (ICALP (1), 2011)

Optimal Register Allocation in Polynomial Time. - Philipp Klaus Krause (CC, 2013)

Optimal placement of bank selection instructions in polynomial time. - Philipp Klaus Krause (M-SCOPES, 2013)

The complexity of register allocation. - Philipp Klaus Krause (Discret. Appl. Math., 2014)

Bytewise Register Allocation. - Philipp Klaus Krause (SCOPES, 2015)

Graph decomposition in routing and compilers. - Philipp Klaus Krause (2016)

Irrelevant vertices for the planar Disjoint Paths Problem. - Isolde Adler; Stavros G. Kolliopoulos; Philipp Klaus Krause; Daniel Lokshtanov; Saket Saurabh 001; Dimitrios M. Thilikos (J. Comb. Theory B, 2017)

stdcbench: A Benchmark for Small Systems. - Philipp Klaus Krause (SCOPES, 2018)

A lower bound on the tree-width of graphs with irrelevant vertices. - Isolde Adler; Philipp Klaus Krause (J. Comb. Theory B, 2019)

Constant-time connectivity tests. - Philipp Klaus Krause (CoRR, 2020)

C for a tiny system. - Philipp Klaus Krause; Nicolas Lesser (CoRR, 2020)

The tree-width of C. - Philipp Klaus Krause; Lukas Larisch; Felix Salfelder (Discret. Appl. Math., 2020)

lospre in linear time. - Philipp Klaus Krause (SCOPES, 2021)

Efficient Calling Conventions for Irregular Architectures. - Philipp Klaus Krause (CoRR, 2021)