|
871 |
On the complexity of 4-coloring graphs without long induced paths Le, Van Bang. - Rostock : Inst. für Informatik, 2006
|
|
|
872 |
On the graph bisection cut polytope Chemnitz : Techn. Univ., Fak. für Mathematik, 2006
|
|
|
873 |
On the OBDD size for graphs of bounded tree and clique width Meer, Klaus. - Bonn : Forschungsinst. für Diskrete Mathematik, 2006
|
|
|
874 |
On transitive orientations of G - ê Andresen, Michael. - Magdeburg : Univ., Fak. für Mathematik, 2006
|
|
|
875 |
Optimization and approximation problems related to polynomial system solving Meer, Klaus. - Bonn : Forschungsinst. für Diskrete Mathematik, 2006
|
|
|
876 |
Orte, Listen, Aggregate Deiser, Oliver, 2006
|
|
|
877 |
PCC '06 PCC (5 : 2006 : Ilmenau). - Ilmenau : Univ.-Verl., 2006
|
|
|
878 |
Piecewise linear interpolation revisited: BLaC-wavelets Duisburg : Univ., 2006
|
|
|
879 |
Planarity testing for c-connected clustered graphs Dahlhaus, Elias. - Dortmund : Univ., System Analysis Research Group, 2006
|
|
|
880 |
Probabilistic analysis of Euclidean multi depot vehicle routing and related problems Werth, Sören, 2006
|
|