Suchergebnisse - Rautenbach, Dieter 1972-

Domination and degree

Timing optimization by restructuring long combinatorial paths

On the OBDD size for graphs of bounded tree and clique width

A conjecture of Borodin and a coloring of Grünbaum

Asymptotically optimal Boolean circuits for functions of the form gn-1(gn-2(...g3(g2(g1(x1,x2),x3),x4)...,xn-1),x n) given input arrival times

Domination und Degree

Large induced forests in C3- and C4-free graphs of maximum degree at most 3

A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing

Delay optimization of linear depth boolean circuits with prescribed input arrival times

Fast circuits for functions whose inputs have specified arrival times

Binary trees wirh choosable edge lengths

Bonntools: mathematical innovation for layout and timing closure of systems on a chip