Journals in DBLP
Andreas Brandstädt , Van Bang Le Split-Perfect Graphs: Characterizations and Algorithmic Use. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:17, n:3, pp:341-360 [Journal ] Gábor Bacsó , Sylvain Gravier , András Gyárfás , Myriam Preissmann , András Sebö Coloring the Maximal Cliques of Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:17, n:3, pp:361-376 [Journal ] William D. Banks , Alessandro Conflitti , Igor Shparlinski Number Theoretic Designs for Directed Regular Graphs of Small Diameter. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:17, n:3, pp:377-383 [Journal ] Christine T. Cheng Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:17, n:3, pp:384-402 [Journal ] Stefanie Gerke , Colin McDiarmid Graph Imperfection with a Co-Site Constraint. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:17, n:3, pp:403-425 [Journal ] Alexander Barg , Gilles Zémor Error Exponents of Expander Codes under Linear-Complexity Decoding. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:17, n:3, pp:426-445 [Journal ] W. R. Chen , Frank K. Hwang , Xuding Zhu Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:17, n:3, pp:446-452 [Journal ] Andrei A. Krokhin , Peter Jeavons , Peter Jonsson Constraint Satisfaction Problems on Intervals and Length. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:17, n:3, pp:453-477 [Journal ] Randall Dougherty , Vance Faber The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:17, n:3, pp:478-519 [Journal ]