Rautenbach, Dieter
9  Ergebnisse:
Personensuche X
?
1

Exact and Parameterized Algorithms for the Independent Cuts..:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,
 
?
2

Approximating Maximum Acyclic Matchings by Greedy and Local..:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
 
?
3

The Hull Number in the Convexity of Induced Paths of Order :

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
 
?
4

Bipartizing with a Matching:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,
 
?
5

CLOUDFARM : An Elastic Cloud Platform with Flexible and ..:

, In: Proceedings of the 2014 IEEE/ACM 7th International Conference on Utility and Cloud Computing,
 
?
6

Fast buffering for optimizing worst slack and resource cons..:

, In: Proceedings of the 2009 international symposium on Physical design,
 
?
7

Timing optimization by restructuring long combinatorial pat..:

, In: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design,
 
?
8

Efficient generation of short and fast repeater tree topolo..:

, In: Proceedings of the 2006 international symposium on Physical design,
 
?
9

Approximately covering by cycles in planar graphs:

, In: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms,
Rautenbach, Dieter ; Reed, Bruce - p. 402-406 , 2001
 
1-9