@article{Gabow/05a,
AUTHOR = {Gabow, Harold N.},
TITLE = {An improved analysis for approximating the smallest $k$-edge connected spanning subgraph of a multigraph},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {1-18},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {approximation algorithms, network design, multigraphs, graph connectivity, edge connectivity, laminar family},
URL = {http://link.aip.org/link/?SJD/19/1/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Drmota-Hwang/05,
AUTHOR = {Drmota, Michael and Hwang, Hsien-Kuei},
TITLE = {Bimodality and phase transitions in the profile variance of random binary search trees},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {19-45},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {binary search trees, asymptotic bimodality, profile, bessel functions, stirling numbers of the first kind, singularity analysis, saddle-point method},
URL = {http://link.aip.org/link/?SJD/19/19/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Forst-Thorup/05,
AUTHOR = {Forst, Gunnar and Thorup, Anders},
TITLE = {What costs are minimized by Huffman trees?},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {46-68},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
URL = {http://link.aip.org/link/?SJD/19/46/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ben-Haim-Litsyn/05,
AUTHOR = {Ben-Haim, Yael and Litsyn, Simon},
TITLE = {Exact minimum density of codes identifying vertices in the square grid},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {69-82},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {identifying code, square grid, graph, density},
URL = {http://link.aip.org/link/?SJD/19/69/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kostochka-Nakprasit-Pemmaraju/05,
AUTHOR = {Kostochka, A.V. and Nakprasit, K. and Pemmaraju, S.V.},
TITLE = {On equitable coloring of $d$-degenerate graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {83-95},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph coloring, equitable coloring, d-degenerate graphs},
URL = {http://link.aip.org/link/?SJD/19/83/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kushilevitz-Mansour/05,
AUTHOR = {Kushilevitz, Eyal and Mansour, Yishay},
TITLE = {Computation in noisy radio networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {96-108},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {radio networks, broadcast networks, noisy computation, threshold functions},
URL = {http://link.aip.org/link/?SJD/19/96/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chardon-Moukrim/05,
AUTHOR = {Chardon, Marc and Moukrim, Aziz},
TITLE = {The Coffman-Graham algorithm optimally solves UET task systems with overinterval orders},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {109-121},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {nonpreemptive profile scheduling, list scheduling, makespan, quasi-interval order},
URL = {http://link.aip.org/link/?SJD/19/109/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Robins-Zelikovsky/05,
AUTHOR = {Robins, Gabriel and Zelikovsky, Alexander},
TITLE = {Tighter bounds for graph Steiner tree approximation},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {122-134},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {steiner trees, approximation algorithms, graph steiner problem, iterated 1-steiner},
URL = {http://link.aip.org/link/?SJD/19/122/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dvorak/05,
AUTHOR = {Dvo{\v{r}}{\'a}k, Tom{\'a}{\v{s}}},
TITLE = {Hamiltonian cycles with prescribed edges in hypercubes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {135-144},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {hamiltonian cycles passing through given edges, hypercube},
URL = {http://link.aip.org/link/?SJD/19/135/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Encheva/05,
AUTHOR = {Encheva, Sylvia},
TITLE = {On projective codes satisfying the chain condition},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {145-148},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {binary linear projective codes, chain condition},
URL = {http://link.aip.org/link/?SJD/19/145/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chen-Zame-Lin-Wu/05,
AUTHOR = {Chen, Robert W. and Zame, Alan and Lin, Chien-Tai and Wu, Hsiu-Fen},
TITLE = {A random version of Shepp's urn scheme},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {149-164},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {urn scheme, optimal drawing policy, random coin tossing process, stopping time, the "k" in the hole policy},
URL = {http://link.aip.org/link/?SJD/19/149/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Muir-Stinson/05,
AUTHOR = {Muir, James A. and Stinson, Douglas R.},
TITLE = {Alternative digit sets for nonadjacent representations},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {165-191},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {nonadjacent representations, redundant representations, digit sets, radix 2},
URL = {http://link.aip.org/link/?SJD/19/165/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Brass/05,
AUTHOR = {Brass, Peter},
TITLE = {An upper bound for the $d$-dimensional analogue of Heilbronn's triangle problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {192-195},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {heilbronn's triangle problem, spanned simplices},
URL = {http://link.aip.org/link/?SJD/19/192/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Feng-Kwak-Kwon/05,
AUTHOR = {Feng, Rongquan and Kwak, Jin Ho and Kwon, Young Soo},
TITLE = {Enumerating typical circulant covering projections onto a circulant graph},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {196-207},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph covering, enumeration, voltage assignment, circulant graph},
URL = {http://link.aip.org/link/?SJD/19/196/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
NOTE = {see Erratum in SIAM J. Disc.~Math., Vol. 21, 2007, No. 2, 548-550},
}
@article{Georges-Mauro/05,
AUTHOR = {Georges, John P. and Mauro, David W.},
TITLE = {On the structure of graphs with non-surjective $L(2,1)$-labelings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {208-223},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {l(2, 1)-labeling, $\lambda$-labeling, hole index, dominating vertex set},
URL = {http://link.aip.org/link/?SJD/19/208/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Radcliffe-Scott-Wilmer/05,
AUTHOR = {Radcliffe, A.J. and Scott, A.D. and Wilmer, E.L.},
TITLE = {Reversals and transpositions over finite alphabets},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {224-244},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {strings, sorting, genome comparison, reversals, transpositions, np-complete problems, max-snp hardness, approximation algorithms},
URL = {http://link.aip.org/link/?SJD/19/224/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Khanna-Naor-Shepherd/05,
AUTHOR = {Khanna, Sanjeev and Naor, Joseph (Seffi) and Shepherd, F. Bruce},
TITLE = {Directed network design with orientation constraints},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {245-257},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {connectivity, orientation, submodular flow, approximation algorithms},
URL = {http://link.aip.org/link/?SJD/19/245/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Beimel-Ishai/05,
AUTHOR = {Beimel, Amos and Ishai, Yuval},
TITLE = {On the power of nonlinear secret-sharing},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {1},
PAGES = {258-280},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {secret-sharing, nonlinear secret-sharing, monotone span programs, quadratic residuosity},
URL = {http://link.aip.org/link/?SJD/19/258/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Liu-Zhu/05a,
AUTHOR = {Liu, Daphne Der-Fen and Zhu, Xuding},
TITLE = {Circular distance two labeling and the $\lambda$-number for outerplanar graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {281-293},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {circular distance two labeling, distance two labeling, l(2, 1)-labeling, outerplanar graphs},
URL = {http://link.aip.org/link/?SJD/19/281/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Apfelbaum-Sharir/05,
AUTHOR = {Apfelbaum, Roel and Sharir, Micha},
TITLE = {Repeated angles in three and four dimensions},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {294-300},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {combinatorial geometry, geometric incidences, repeated angles},
URL = {http://link.aip.org/link/?SJD/19/294/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Coppersmith-Lewenstein/05,
AUTHOR = {Coppersmith, Don and Lewenstein, Moshe},
TITLE = {Constructive bounds on ordered factorizations},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {301-303},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {factorizations, riemann zeta function},
URL = {http://link.aip.org/link/?SJD/19/301/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Iwata-McCormick-Shigeno/05,
AUTHOR = {Iwata, Satoru and McCormick, S. Thomas and Shigeno, Maiko},
TITLE = {A strongly polynomial cut canceling algorithm for minimum cost submodular flow},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {304-320},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {combinatorial optimization, strongly polynomial time algorithm, submodular function, network flow},
URL = {http://link.aip.org/link/?SJD/19/304/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chaichanavong-Marcus/05,
AUTHOR = {Chaichanavong, Panu and Marcus, Brian H.},
TITLE = {Stabilization of block-type-decodability properties for constrained systems},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {321-344},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {constrained systems, block encoders, block-decodable encoders, deterministic encoders, sets of principal states, integer programming, np-complete problems},
URL = {http://link.aip.org/link/?SJD/19/321/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hsu-Kao/05,
AUTHOR = {Hsu, Tsan-Sheng and Kao, Ming-Yang},
TITLE = {Optimal augmentation for bipartite componentwise biconnectivity in linear time},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {345-362},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {biconnectivity, data security, bipartite graph augmentation},
URL = {http://link.aip.org/link/?SJD/19/345/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bouyukliev-Ostergard/05,
AUTHOR = {Bouyukliev, Iliya and {\"O}sterg{\aa}rd, Patric R.J.},
TITLE = {Classification of self-orthogonal codes over $F_3$ and $F_4$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {363-370},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {code equivalence, quantum codes, self-dual codes, self-orthogonal codes},
URL = {http://link.aip.org/link/?SJD/19/363/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Burstein-Kitaev/05,
AUTHOR = {Burstein, Alexander and Kitaev, Sergey},
TITLE = {On unavoidable sets of word patterns},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {371-381},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {pattern, word, (un)avoidability, de bruijn graph, universal cycles, stirling numbers of the second kind},
URL = {http://link.aip.org/link/?SJD/19/371/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Luz-Schrijver/05,
AUTHOR = {Luz, Carlos J. and Schrijver, Alexander},
TITLE = {A convex quadratic characterization of the Lov{\'a}sz theta number},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {382-387},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {combinatorial optimization, graph theory, maximum stable set, quadratic programming},
URL = {http://link.aip.org/link/?SJD/19/382/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kwak-Mednykh-Liskovets/05,
AUTHOR = {Kwak, Jin Ho and Mednykh, Alexander and Liskovets, Valery},
TITLE = {Enumeration of branched coverings of nonorientable surfaces with cyclic branch points},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {388-398},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {cyclic branch point, covering of a nonorientable surface, ramanujan sum, von sterneck function, fundamental group, permutation tuple, hurwitz number},
URL = {http://link.aip.org/link/?SJD/19/388/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Curran-Lee-Yu/05,
AUTHOR = {Curran, Sean and Lee, Orlando and Yu, Xingxing},
TITLE = {Nonseparating planar chains in 4-connected graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {399-419},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {connectivity, planar chain, nonseparating, algorithm},
URL = {http://link.aip.org/link/?SJD/19/399/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ji-Zhu/05,
AUTHOR = {Ji, L. and Zhu, L.},
TITLE = {Resolvable Steiner quadruple systems for the last 23 orders},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {420-430},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {resolvable steiner quadruple system, candelabra quadruple system, h design},
URL = {http://link.aip.org/link/?SJD/19/420/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Mudgal-Tovey-Greenberg-Koenig/05,
AUTHOR = {Mudgal, Apurva and Tovey, Craig and Greenberg, Sam and Koenig, Sven},
TITLE = {Bounds on the travel cost of a Mars rover prototype search heuristic},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {431-447},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {robot travel, d*, grid graph, girth, planar graph, search heuristic, mars rover, greedy algorithm},
URL = {http://link.aip.org/link/?SJD/19/431/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Alstrup-Bille-Rauhe/05,
AUTHOR = {Alstrup, Stephen and Bille, Philip and Rauhe, Theis},
TITLE = {Labeling schemes for small distances in trees},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {448-462},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {labeling schemes, trees},
URL = {http://link.aip.org/link/?SJD/19/448/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Daniel-Semple/05,
AUTHOR = {Daniel, Philip and Semple, Charles},
TITLE = {A class of general supertree methods for nested taxa},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {463-480},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {rooted phylogenetic tree, rooted semilabeled tree, nested taxa, supertree method, supertree},
URL = {http://link.aip.org/link/?SJD/19/463/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{de_Graaf-Valiant/05,
AUTHOR = {de Graaf, Mart and Valiant, Paul},
TITLE = {Polynomial representations of symmetric partial Boolean functions},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {481-488},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {boolean function complexity, polynomial interpolation, lower bounds on degree, polynomial representation of boolean functions, approximate majority function},
URL = {http://link.aip.org/link/?SJD/19/481/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Erdos-Furedi-Katona/05,
AUTHOR = {Erd{\H{o}}s, P{\'e}ter L. and F{\"u}redi, Zolt{\'a}n and Katona, Gyula O.H.},
TITLE = {Two-part and $k$-Sperner families: New proofs using permutations},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {489-500},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {extremal problems, sperner families, permutation method},
URL = {http://link.aip.org/link/?SJD/19/489/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Yaman/05,
AUTHOR = {Yaman, Hande},
TITLE = {Polyhedral analysis for the uncapacitated hub location problem with modular arc capacities},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {501-522},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {hub location, polyhedral analysis, lifting},
URL = {http://link.aip.org/link/?SJD/19/501/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bermond-Colbourn-Coudert-Ge-Ling-Munoz/05,
AUTHOR = {Bermond, Jean-Claude and Colbourn, Charles J. and Coudert, David and Ge, Gennian and Ling, Alan C.H. and Mu{\~n}oz, Xavier},
TITLE = {Traffic grooming in unidirectional wavelength-division multiplexed rings with grooming ratio $C = 6$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {2},
PAGES = {523-542},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {traffic grooming, combinatorial designs, block designs, group-divisible designs, optical networks, wavelength-division multiplexing},
URL = {http://link.aip.org/link/?SJD/19/523/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Feder-Subi/05,
AUTHOR = {Feder, Tom{\'a}s and Subi, Carlos},
TITLE = {Disks on a tree: Analysis of a combinatorial game},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {543-552},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {disks, tree, chip-firing games},
URL = {http://link.aip.org/link/?SJD/19/543/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Maffray-Trotignon/05,
AUTHOR = {Maffray, Fr{\'e}d{\'e}ric and Trotignon, Nicolas},
TITLE = {Algorithms for perfectly contractile graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {553-574},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {perfect graph, even pair, perfectly contractile, recognition algorithm},
URL = {http://link.aip.org/link/?SJD/19/553/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Biha/05,
AUTHOR = {Biha, Mohamed Didi},
TITLE = {On the 3-terminal cut polyhedron},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {575-587},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {$a$-cut, polyhedron},
URL = {http://link.aip.org/link/?SJD/19/575/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fiala-Kral-Skrekovski/05,
AUTHOR = {Fiala, Ji{\v{r}}{\'{i}} and Kr{\'a}l', Daniel and {\v{S}}krekovski, Riste},
TITLE = {A Brooks-type theorem for the generalized list $T$-coloring},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {588-609},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph coloring, channel assignment problem, t-coloring, brooks' theorem},
URL = {http://link.aip.org/link/?SJD/19/588/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Liu-Zhu/05b,
AUTHOR = {Liu, Daphne Der-Fen and Zhu, Xuding},
TITLE = {Multilevel distance labelings for paths and cycles},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {610-621},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {channel assignment, distance two labeling, radio labeling, diameter},
URL = {http://link.aip.org/link/?SJD/19/610/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kubicki-Morayne/05,
AUTHOR = {Kubicki, Grzegorz and Morayne, Micha{\l}},
TITLE = {Graph-theoretic generalization of the secretary problem: The directed path case},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {622-632},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph, directed path, secretary problem, best choice},
URL = {http://link.aip.org/link/?SJD/19/622/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Jonsson/05a,
AUTHOR = {Jonsson, Jakob},
TITLE = {Simplicial complexes of graphs and hypergraphs with a bounded covering number},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {633-650},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {monotone graph property, simplicial homology, vertex cover, discrete morse theory},
URL = {http://link.aip.org/link/?SJD/19/633/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Pike-Zou/05,
AUTHOR = {Pike, David A. and Zou, Yubo},
TITLE = {Decycling Cartesian products of two cycles},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {651-663},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {decycling, cycle, cartesian product, maximum induced forest},
URL = {http://link.aip.org/link/?SJD/19/651/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kaski/05,
AUTHOR = {Kaski, Petteri},
TITLE = {Isomorph-free exhaustive generation of designs with prescribed groups of automorphisms},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {664-690},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {classification algorithm, combinatorial search, consistency checking, isomorph rejection, isomorph-free generation, kramer--mesner method, steiner triple system, symmetry reduction},
URL = {http://link.aip.org/link/?SJD/19/664/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Wild/05,
AUTHOR = {Wild, Marcel},
TITLE = {The asymptotic number of binary codes and binary matroids},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {691-699},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {asymptotic enumeration, binary codes, binary matroids, lattice of invariant subspaces},
URL = {http://link.aip.org/link/?SJD/19/691/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Friedman-Tillich/05,
AUTHOR = {Friedman, Joel and Tillich, Jean-Pierre},
TITLE = {Generalized Alon-Boppana theorems and error-correcting codes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {700-718},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {eigenvalues, graphs, error-correcting codes, alon--boppana, expanders, faber--krahn},
URL = {http://link.aip.org/link/?SJD/19/700/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Frieze-Krivelevich-Sudakov/05,
AUTHOR = {Frieze, Alan and Krivelevich, Michael and Sudakov, Benny},
TITLE = {The strong chromatic index of random graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {719-727},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {strong chromatic index, random graphs},
URL = {http://link.aip.org/link/?SJD/19/719/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Schaefer-Stefankovic/05,
AUTHOR = {Schaefer, Marcus and {\v{S}}tefankovi{\v{c}}, Daniel},
TITLE = {Solvability of graph inequalities},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {728-743},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph inequalities, graph theory, decidability},
URL = {http://link.aip.org/link/?SJD/19/728/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Brueni-Heath/05,
AUTHOR = {Brueni, Dennis J. and Heath, Lenwood S.},
TITLE = {The PMU placement problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {744-761},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {phasor measurement unit, power system graph observability, domination, electric power monitoring, np-completeness},
URL = {http://link.aip.org/link/?SJD/19/744/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bar-Yehuda-Rawitz/05a,
AUTHOR = {Bar-Yehuda, Reuven and Rawitz, Dror},
TITLE = {On the equivalence between the primal-dual schema and the local ratio technique},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {762-797},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {approximation algorithms, combinatorial optimization, covering problems, local ratio, primal-dual},
URL = {http://link.aip.org/link/?SJD/19/762/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gijswijt/05,
AUTHOR = {Gijswijt, Dion},
TITLE = {Integer decomposition for polyhedra defined by nearly totally unimodular matrices},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {798-806},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {integer decomposition, totally unimodular, circular arc graph, nearly bipartite graph, cyclic scheduling, coloring},
URL = {http://link.aip.org/link/?SJD/19/798/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Abrams-Fishkind/05,
AUTHOR = {Abrams, Lowell and Fishkind, Donniell E.},
TITLE = {A genus bound for digital image boundaries},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {3},
PAGES = {807-813},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {digital image, digital topology, combinatorial topology, surface},
URL = {http://link.aip.org/link/?SJD/19/807/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fich-Kundgen-Pelsmajer-Ramamurthi/06,
AUTHOR = {Fich, Faith Ellen and K{\"u}ndgen, Andr{\'e} and Pelsmajer, Michael J. and Ramamurthi, Radhika},
TITLE = {Graph minors and reliable single message transmission},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {815-847},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {end-to-end communication, reliable transmission, graph minors, tree-width, tree decomposition},
URL = {http://link.aip.org/link/?SJD/19/815/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Curran-Lee-Yu/06,
AUTHOR = {Curran, Sean and Lee, Orlando and Yu, Xingxing},
TITLE = {Chain decompositions of 4-connected graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {848-880},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {connectivity, nonseparating, good chain, chain decomposition, algorithm},
URL = {http://link.aip.org/link/?SJD/19/848/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Elkin-Kortsarz/06b,
AUTHOR = {Elkin, Michael and Kortsarz, Guy},
TITLE = {Polylogarithmic additive inapproximability of the radio broadcast problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {881-899},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {approximation, broadcast, radio},
URL = {http://link.aip.org/link/?SJD/19/881/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Heggernes-Telle-Villanger/06,
AUTHOR = {Heggernes, Pinar and Telle, Jan Arne and Villanger, Yngve},
TITLE = {Computing minimal triangulations in time $O(n^{\alpha} \log n) = o(n^{2.376})$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {900-913},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {chordal graph, minimal triangulation, minimal fill, matrix multiplication},
URL = {http://link.aip.org/link/?SJD/19/900/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Nesetril-Tardif/06,
AUTHOR = {Ne{\v{s}}et{\v{r}}il, Jaroslav and Tardif, Claude},
TITLE = {Short answers to exponentially long questions: Extremal aspects of homomorphism duality},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {914-920},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {homomorphism duality, graphs, relational structures, duals, colorings, finite models},
URL = {http://link.aip.org/link/?SJD/19/914/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kashyap-Siegel-Vardy/06,
AUTHOR = {Kashyap, Navin and Siegel, Paul H. and Vardy, Alexander},
TITLE = {An application of Ramsey theory to coding for the optical channel},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {921-937},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {optical communication, constrained coding, ghost pulse constraints, ramsey theory},
URL = {http://link.aip.org/link/?SJD/19/921/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Albers-Bals/06,
AUTHOR = {Albers, Susanne and Bals, Helge},
TITLE = {Dynamic TCP acknowledgment: Penalizing long delays},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {938-951},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {online algorithm, competitive analysis, tcp, data packet, acknowledgment},
URL = {http://link.aip.org/link/?SJD/19/938/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Brown-Nowakowski/06,
AUTHOR = {Brown, J.I. and Nowakowski, R.J.},
TITLE = {Well-covered vector spaces of graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {952-965},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {well-covered, independent, weighting, vector space, dimension},
URL = {http://link.aip.org/link/?SJD/19/952/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Khachiyan-Boros-Elbassioni-Gurvich-Makino/06,
AUTHOR = {Khachiyan, L. and Boros, E. and Elbassioni, K. and Gurvich, V. and Makino, K.},
TITLE = {On the complexity of some enumeration problems for matroids},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {966-984},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {matroid, incremental polynomial time, base, circuit, flat, hyperplane, enumeration, hypergraph, steiner tree, multiway cut},
URL = {http://link.aip.org/link/?SJD/19/966/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Zhou/06a,
AUTHOR = {Zhou, Sanming},
TITLE = {Labelling Cayley graphs on Abelian groups},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {985-1003},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {channel assignment, hamming graph, $l(j, k)$-labelling, $\l_j, k$-number, $\l$-number, radio chromatic number, cayley graph, hypercube},
URL = {http://link.aip.org/link/?SJD/19/985/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Scarabotti/06,
AUTHOR = {Scarabotti, Fabio},
TITLE = {The discrete sine transform and the spectrum of the finite $q$-ary tree},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {1004-1010},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {tree, spectrum, discrete sine transform, radon transform},
URL = {http://link.aip.org/link/?SJD/19/1004/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ling-Ozbudak/06,
AUTHOR = {Ling, San and {\"O}zbudak, Ferruh},
TITLE = {Improved $p$-ary codes and sequence families from Galois rings of characteristic $p^2$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {1011-1028},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {galois rings, $p$-ary code, exponential sum, $p$-ary sequence},
URL = {http://link.aip.org/link/?SJD/19/1011/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bollobas-Coppersmith-Elkin/06,
AUTHOR = {Bollob{\'a}s, B{\'e}la and Coppersmith, Don and Elkin, Michael},
TITLE = {Sparse distance preservers and additive spanners},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {1029-1055},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph theory, spanners, distance preservation},
URL = {http://link.aip.org/link/?SJD/19/1029/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dumitriu-Spencer/06,
AUTHOR = {Dumitriu, Ioana and Spencer, Joel},
TITLE = {The two-batch liar game over an arbitrary channel},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {1056-1064},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {liar games, coding theory, channel, asymptotics, adaptive strategy},
URL = {http://link.aip.org/link/?SJD/19/1056/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fujishige-Iwata/06,
AUTHOR = {Fujishige, Satoru and Iwata, Satoru},
TITLE = {Bisubmodular function minimization},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {19},
NUMBER = {4},
PAGES = {1065-1073},
YEAR = {2005-2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {bisubmodular function, delta-matroid, scaling algorithm},
URL = {http://link.aip.org/link/?SJD/19/1065/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}