|
891 |
Offline drawing of dynamic graphs Görg, Carsten. - Saarbrücken-Dudweiler : Pirrot, c 2006
|
|
|
892 |
On highly symmetric combinatorial designs Huber, Michael. - Aachen : Shaker, 2006
|
|
|
893 |
On the Bottleneck shortest path problem Kaibel, Volker. - Berlin : ZIB, 2006
|
|
|
894 |
On the complexity of 4-coloring graphs without long induced paths Le, Van Bang. - Rostock : Inst. für Informatik, 2006
|
|
|
895 |
On the graph bisection cut polytope Chemnitz : Techn. Univ., Fak. für Mathematik, 2006
|
|
|
896 |
On the OBDD size for graphs of bounded tree and clique width Meer, Klaus. - Bonn : Forschungsinst. für Diskrete Mathematik, 2006
|
|
|
897 |
On transitive orientations of G - ê Andresen, Michael. - Magdeburg : Univ., Fak. für Mathematik, 2006
|
|
|
898 |
Optimization and approximation problems related to polynomial system solving Meer, Klaus. - Bonn : Forschungsinst. für Diskrete Mathematik, 2006
|
|
|
899 |
Orte, Listen, Aggregate Deiser, Oliver, 2006
|
|
|
900 |
PCC '06 PCC (5 : 2006 : Ilmenau). - Ilmenau : Univ.-Verl., 2006
|
|