@article{Dey-Rajan/04,
AUTHOR = {Dey, Bikash Kumar and Rajan, B. Sundar},
TITLE = {Codes closed under arbitrary Abelian group of permutations},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {1-18},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {quasi-cyclic codes, permutation group of codes, discrete fourier transform, self-dual codes},
URL = {http://dx.doi.org/10.1137/S0895480102416192},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Lin-Lu-Sun/04,
AUTHOR = {Lin, Ching-Chi and Lu, Hsueh-I and Sun, I-Fan},
TITLE = {Improved compact visibility representation of planar graph via Schnyder's realizer},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {19-29},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {visibility representation, planar graph algorithm, graph drawing, realizer, canonical ordering},
URL = {http://dx.doi.org/10.1137/S0895480103420744},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Guruswami-Khanna/04,
AUTHOR = {Guruswami, Venkatesan and Khanna, Sanjeev},
TITLE = {On the hardness of 4-coloring a 3-colorable graph},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {30-40},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph coloring, pcp theorem, $NP$-hardness, hardness of approximation},
URL = {http://dx.doi.org/10.1137/S0895480100376794},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gabow/04,
AUTHOR = {Gabow, Harold N.},
TITLE = {An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {41-70},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {approximation algorithms, network design, multigraphs, graph connectivity, edge connectivity, ear decomposition, depth-first search},
URL = {http://dx.doi.org/10.1137/S0895480102405476},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Miers-Ruskey/04a,
AUTHOR = {Miers, C.R. and Ruskey, F.},
TITLE = {Counting strings with given elementary symmetric function evaluations II: Circular strings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {71-82},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {elementary symmetric function, combinatorial enumeration, integers mod $q$, Lyndon word, M{\"{o}}bius inversion, multinomial coefficient, finite field},
URL = {http://dx.doi.org/10.1137/S0895480103428053},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Lau-Corneil/04,
AUTHOR = {Lau, Lap Chi and Corneil, Derek G.},
TITLE = {Recognizing powers of proper interval, split, and chordal graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {83-102},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {proper interval graphs, split graphs, chordal graphs, graph roots, graph powers, graph algorithms},
URL = {http://dx.doi.org/10.1137/S0895480103425930},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Lutz/04a,
AUTHOR = {Lutz, Frank H.},
TITLE = {Small examples of nonconstructible simplicial balls and spheres},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {103-109},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {simplicial balls and spheres, constructibility, shellability, vertex-decomposability, knots in 3-balls and 3-spheres},
URL = {http://dx.doi.org/10.1137/S0895480103430521},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Katta-Sethuraman/04,
AUTHOR = {Katta, Akshay-Kumar and Sethuraman, Jay},
TITLE = {A note on bandits with a twist},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {110-113},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {multiarmed bandit problem, generalized bandit problem, stochastic scheduling, priority rule, gittins index, game},
URL = {http://dx.doi.org/10.1137/S0895480103433549},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Engebretsen/04a,
AUTHOR = {Engebretsen, Lars},
TITLE = {The nonapproximability of non-Boolean predicates},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {114-129},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {combinatorial optimization, approximation, approximation hardness, maximum csp},
URL = {http://dx.doi.org/10.1137/S0895480100380458},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Goresky-Klapper-Murty-Shparlinski/04,
AUTHOR = {Goresky, Mark and Klapper, Andrew and Murty, Ram and Shparlinski, Igor},
TITLE = {On decimations of $l$-sequences},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {130-140},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {feedback with carry shift register, arithmetic correlation, exponential sum, binary sequence, $p$-adic number},
URL = {http://dx.doi.org/10.1137/S0895480102403428},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Schachtel/04,
AUTHOR = {Schachtel, Gabriel A.},
TITLE = {Exact word-run statistics in random orderings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {141-158},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {run test, word, sequence analysis, cluster, short tandem repeat, microsatellite},
URL = {http://dx.doi.org/10.1137/S0895480101390576},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hage-Harju/04,
AUTHOR = {Hage, Jurriaan and Harju, Tero},
TITLE = {A characterization of acyclic switching classes of graphs using forbidden subgraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {159-176},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph, switching class, Seidel switching, acyclic graph, trees, forbidden induced subgraph, critically cyclic graph},
URL = {http://dx.doi.org/10.1137/S0895480100381890},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chandran-Ram/04,
AUTHOR = {Chandran, L. Sunil and Ram, L. Shankar},
TITLE = {On the number of minimum cuts in a graph},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {177-194},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {minimum cuts, circular partition},
URL = {http://dx.doi.org/10.1137/S0895480103427138},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Lozin-Rautenbach/04,
AUTHOR = {Lozin, V. and Rautenbach, D.},
TITLE = {On the band-, tree-, and clique-width of graphs with bounded vertex degree},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {195-206},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {band-width, clique-width, tree-width, hereditary class, forbidden induced subgraph},
URL = {http://dx.doi.org/10.1137/S0895480102419755},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ageev-Ye-Zhang/04,
AUTHOR = {Ageev, Alexander and Ye, Yinyu and Zhang, Jiawei},
TITLE = {Improved combinatorial approximation algorithms for the $k$-level facility location problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {1},
PAGES = {207-217},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {facility location, approximation algorithm, performance guarantee, polynomial-time reduction},
URL = {http://dx.doi.org/10.1137/S0895480102417215},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Feige/04,
AUTHOR = {Feige, Uriel},
TITLE = {Approximating maximum clique by removing subgraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {219-225},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {approximation algorithm, clique, independent set},
URL = {http://dx.doi.org/10.1137/S089548010240415X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{de_Figueiredo-Maffray/04,
AUTHOR = {de Figueiredo, Celina M.H. and Maffray, Fr{\'{e}}d{\'{e}}ric},
TITLE = {Optimizing bull-free perfect graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {226-240},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph algorithms, perfect graphs, analysis of algorithms and problem complexity, combinatorial optimization},
URL = {http://dx.doi.org/10.1137/S0895480198339237},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Will-Hulett/04,
AUTHOR = {Will, Todd G. and Hulett, Heather},
TITLE = {Parsimonious multigraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {241-245},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {parsimonious, multigraph, degree sequence},
URL = {http://dx.doi.org/10.1137/S0895480103432477},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Saliola-Whiteley/04,
AUTHOR = {Saliola, Franco and Whiteley, Walter},
TITLE = {Constraining plane configurations in CAD: Circles, lines, and angles in the plane},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {246-271},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {computer aided design, constraint, inversive geometry, circles and angles, generic rigidity, hyperbolic geometry},
URL = {http://dx.doi.org/10.1137/S0895480100374138},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ramnath/04,
AUTHOR = {Ramnath, Sarnath},
TITLE = {Dynamic digraph connectivity hastens minimum sum-of-diameters clustering},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {272-286},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {dynamic digraph connectivity, sum-of-diameters clustering, semionline algorithms},
URL = {http://dx.doi.org/10.1137/S0895480102396099},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Huygens-Mahjoub-Pesneau/04,
AUTHOR = {Huygens, David and Mahjoub, Ali Ridha and Pesneau, Pierre},
TITLE = {Two edge-disjoint hop-constrained paths and polyhedra},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {287-312},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {survivable network, edge-disjoint paths, hop-constraints, polyhedron, facet},
URL = {http://dx.doi.org/10.1137/S0895480102419445},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hou/04,
AUTHOR = {Hou, Xiang-Dong},
TITLE = {A note on the proof of Niho's conjecture},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {313-319},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {almost perfect nonlinear function, cross-correlation, maximally nonlinear function, niho's conjecture},
URL = {http://dx.doi.org/10.1137/S0895480103432817},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Lu/04,
AUTHOR = {Lu, Chi-Jen},
TITLE = {Deterministic hypergraph coloring and its applications},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {320-331},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {hypergraph, approximation algorithm, Lov{\'a}sz local lemma, derandomization, approximate counting, partially ordered set},
URL = {http://dx.doi.org/10.1137/S0895480100367664},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kowalski-Pelc/04a,
AUTHOR = {Kowalski, Dariusz R. and Pelc, Andrzej},
TITLE = {Faster deterministic broadcasting in ad hoc radio networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {332-346},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {distributed algorithms, radio networks, broadcasting},
URL = {http://dx.doi.org/10.1137/S089548010342464X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Azar-Epstein/04,
AUTHOR = {Azar, Yossi and Epstein, Leah},
TITLE = {On-line load balancing of temporary tasks on identical machines},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {347-352},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {on-line, competitive ratio, temporary tasks, load balancing, scheduling},
URL = {http://dx.doi.org/10.1137/S0895480197329296},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chen-Davis-Hall-Li-Patel-Stewart/04,
AUTHOR = {Chen, Guantao and Davis, George and Hall, Frank and Li, Zhongshan and Patel, Kinnari and Stewart, Michael},
TITLE = {An interlacing result on normalized Laplacians},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {353-361},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {normalized laplacian, eigenvalues, graphs, subgraphs, cauchy interlacing property},
URL = {http://dx.doi.org/10.1137/S0895480103438589},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Galil-Park-Park/04,
AUTHOR = {Galil, Zvi and Park, Jong Geun and Park, Kunsoo},
TITLE = {Three-dimensional periodicity and its application to pattern matching},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {362-381},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {three-dimensional periodicity, pattern matching},
URL = {http://dx.doi.org/10.1137/S0895480101390308},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ostergard-Vardy/04,
AUTHOR = {{\"{O}}sterg{\aa}rd, Patric R.J. and Vardy, Alexander},
TITLE = {Resolving the existence of full-rank tilings of binary Hamming spaces},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {382-387},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {characters, exact cover, full-rank tilings, perfect codes},
URL = {http://dx.doi.org/10.1137/S0895480104435804},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Cera-Dianez-Marquez/04,
AUTHOR = {Cera, M. and Di{\'{a}}nez, A. and M{\'{a}}rquez, A.},
TITLE = {Extremal graphs without topological complete subgraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {388-396},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {extremal graph theory, topological complete subgraphs},
URL = {http://dx.doi.org/10.1137/S0895480100378677},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Athanasiadis-Reiner/04,
AUTHOR = {Athanasiadis, Christos A. and Reiner, Victor},
TITLE = {Noncrossing partitions for the group $D_n$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {397-417},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {noncrossing partition, nonnesting partition, reflection group, root poset, antichain, catalan number, narayana numbers, type d, garside structure},
URL = {http://dx.doi.org/10.1137/S0895480103432192},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hitczenko-Savage/04,
AUTHOR = {Hitczenko, Pawel and Savage, Carla D.},
TITLE = {On the multiplicity of parts in a random composition of a large integer},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {2},
PAGES = {418-435},
YEAR = {2004},
EDITOR = {Griggs, J.R.},
KEYWORDS = {compositions of an integer, random compositions, geometric random variables},
URL = {http://dx.doi.org/10.1137/S0895480199363155},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Franklin-Yung/05,
AUTHOR = {Franklin, Matthew and Yung, Moti},
TITLE = {Secure hypergraphs: Privacy from partial broadcast},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {437-450},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {secure communication, unconditional security, partial broadcast},
URL = {http://dx.doi.org/10.1137/S0895480198335215},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kral/05,
AUTHOR = {Kr{\'{a}}l', Daniel},
TITLE = {Coloring powers of chordal graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {451-461},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {chordal graphs, graph powers, graph coloring, $l(p, q)$-labeling},
URL = {http://dx.doi.org/10.1137/S0895480103424079},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chang-Hutchinson-Jacobson-Lehel-West/05,
AUTHOR = {Chang, Yi-Wu and Hutchinson, Joan P. and Jacobson, Michael S. and Lehel, Jen{\H{o}} and West, Douglas B.},
TITLE = {The bar visibility number of a graph},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {462-471},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {bar visibility graph, interval number, planar graph, thickness, splitting number},
URL = {http://dx.doi.org/10.1137/S0895480198343455},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{DeDeo-Velasquez/05,
AUTHOR = {DeDeo, Michelle R. and Velasquez, Elinor},
TITLE = {The Radon transform on $Z^k_n$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {472-478},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {radon transform, invertibility, fourier transform},
URL = {http://dx.doi.org/10.1137/S0895480103430764},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kawarabayashi-Stephens-Zha/05,
AUTHOR = {Kawarabayashi, Ken-ichi and Stephens, Chris and Zha, Xiaoya},
TITLE = {Orientable and nonorientable genera for some complete tripartite graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {479-487},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {complete tripartite graph, orientable genus, nonorientable genus},
URL = {http://dx.doi.org/10.1137/S0895480103429319},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Shachnai-Srinivasan/05,
AUTHOR = {Shachnai, Hadas and Srinivasan, Aravind},
TITLE = {Finding large independent sets in graphs and hypergraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {488-500},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {independent sets, parallel algorithms, randomized algorithms},
URL = {http://dx.doi.org/10.1137/S0895480102419731},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Demaine-Fomin-Hajiaghayi-Thilikos/05a,
AUTHOR = {Demaine, Erik D. and Fomin, Fedor V. and Hajiaghayi, MohammadTaghi and Thilikos, Dimitrios M.},
TITLE = {Bidimensional parameters and local treewidth},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {501-511},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {treewidth, local treewidth, graph minors, dominating set},
URL = {http://dx.doi.org/10.1137/S0895480103433410},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hwang-Rothblum/05,
AUTHOR = {Hwang, Frank K. and Rothblum, Uriel G.},
TITLE = {Partition-optimization with Schur convex sum objective functions},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {512-524},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {partitions, optimization, schur-convexity},
URL = {http://dx.doi.org/10.1137/S0895480198347167},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Janata/05,
AUTHOR = {Janata, Marek},
TITLE = {Matroids induced by packing subgraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {525-541},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph packing, matroid},
URL = {http://dx.doi.org/10.1137/S0895480102379830},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Albertson-Kostochka-West/05,
AUTHOR = {Albertson, Michael O. and Kostochka, Alexandr V. and West, Douglas B.},
TITLE = {Precoloring extensions of Brooks' theorem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {542-553},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {coloring extension, list coloring, brooks' theorem},
URL = {http://dx.doi.org/10.1137/S0895480103425942},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hell-Huang/05,
AUTHOR = {Hell, Pavol and Huang, Jing},
TITLE = {Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {554-570},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {proper interval graphs, proper interval bigraphs, bipartite permutation graphs, bipartite trapezoid graphs, proper circular arc graphs, lexicographic breadth first search, recognition algorithms, certifying algorithms, forbidden subgraph characterizations},
URL = {http://dx.doi.org/10.1137/S0895480103430259},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hoang-Reed/05,
AUTHOR = {Ho{\`a}ng, Ch{\'{i}}nh T. and Reed, Bruce},
TITLE = {On the co-$P_3$-structure of perfect graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {571-576},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph coloring, perfect graph, claw-free graph},
URL = {http://dx.doi.org/10.1137/S0895480100370797},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Constantine/05,
AUTHOR = {Constantine, Gregory M.},
TITLE = {Edge-disjoint isomorphic multicolored trees and cycles in complete graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {577-580},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {proper coloring, orthogonal latin squares, multicolored spanning paths},
URL = {http://dx.doi.org/10.1137/S0895480101397402},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fleiner/05,
AUTHOR = {Fleiner, Bal{\'{a}}zs},
TITLE = {Detachment of vertices of graphs preserving edge-connectivity},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {581-591},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {detachment, graph, edge-connectivity},
URL = {http://dx.doi.org/10.1137/S0895480198341511},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Vsemirnov/05,
AUTHOR = {Vsemirnov, Maxim},
TITLE = {Automorphisms of projective spaces and min-wise independent sets of permutations},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {592-607},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {min-wise independent permutations, projective plane, projective linear group},
URL = {http://dx.doi.org/10.1137/S089548010241818X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chekuri-Khanna-Naor-Zosin/05,
AUTHOR = {Chekuri, C. and Khanna, S. and Naor, J. and Zosin, L.},
TITLE = {A linear programming formulation and approximation algorithms for the metric labeling problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {608-625},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {metric labeling, linear program, approximation algorithm, truncated linear metric},
URL = {http://dx.doi.org/10.1137/S0895480101396937},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dietz-Seiferas-Zhang/05,
AUTHOR = {Dietz, Paul F. and Seiferas, Joel I. and Zhang, Ju},
TITLE = {A tight lower bound for online monotonic list labeling},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {626-637},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {monotonic list labeling, order maintenance, density/congestion management and exploitation, load balancing, bucketing, online, lower bound, adversary argument},
URL = {http://dx.doi.org/10.1137/S0895480100315808},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Geelen-Hlineny-Whittle/05,
AUTHOR = {Geelen, Jim and Hlin{\v{e}}n{\'{y}}, Petr and Whittle, Geoff},
TITLE = {Bridging separations in matroids},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {638-646},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {matroids, connectivity, blocking sequences},
URL = {http://dx.doi.org/10.1137/S089548010139638X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Swartz/05,
AUTHOR = {Swartz, E.},
TITLE = {Lower bounds for $h$-vectors of $k$-CM, independence, and broken circuit complexes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {3},
PAGES = {647-661},
YEAR = {2004-2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {$k$-cohen--macaulay, matroid, $h$-vector, independence complex, broken circuit complex, short simplicial $h$-vector},
URL = {http://dx.doi.org/10.1137/S0895480102411358},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ge-Miao-Wang/05,
AUTHOR = {Ge, Gennian and Miao, Ying and Wang, Lihua},
TITLE = {Combinatorial constructions for optimal splitting authentication codes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {663-678},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph design, optimal, splitting authentication code, splitting balanced incomplete block design, splitting group divisible design},
URL = {http://dx.doi.org/10.1137/S0895480103435469},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Janssen-Wentzell-Fitzpatrick/05,
AUTHOR = {Janssen, J.C.M. and Wentzell, T.E. and Fitzpatrick, S.L.},
TITLE = {Lower bounds from tile covers for the channel assignment problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {679-696},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {channel assignment, graph labeling, polyhedral lower bounds},
URL = {http://dx.doi.org/10.1137/S0895480101384402},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Alon-Asodi/05,
AUTHOR = {Alon, Noga and Asodi, Vera},
TITLE = {Learning a hidden subgraph},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {697-712},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {hidden subgraphs, stars, complete graphs},
URL = {http://dx.doi.org/10.1137/S0895480103431071},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Keevash-Sudakov/05b,
AUTHOR = {Keevash, Peter and Sudakov, Benny},
TITLE = {Set systems with restricted cross-intersections and the minimum rank of inclusion matrices},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {713-727},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {set systems, restricted intersections, inclusion matrices},
URL = {http://dx.doi.org/10.1137/S0895480103434634},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Cooper-Frieze/05,
AUTHOR = {Cooper, Colin and Frieze, Alan},
TITLE = {The cover time of random regular graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {728-740},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {cover time, random graphs},
URL = {http://dx.doi.org/10.1137/S0895480103428478},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chu-Colbourn-Golomb/05,
AUTHOR = {Chu, Wensong and Colbourn, Charles J. and Golomb, Solomon W.},
TITLE = {A recursive construction for regular difference triangle sets},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {741-748},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {difference triangle set, directed design, directed packing, golomb ruler, spanning ruler set},
URL = {http://dx.doi.org/10.1137/S0895480103436761},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Munoz/05,
AUTHOR = {Mu{\~{n}}oz, S.},
TITLE = {On identifying maximal covers},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {749-768},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {maximal covers, tighter formulations, knapsack constraints, dominated inequalities},
URL = {http://dx.doi.org/10.1137/S0895480103409584},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gaber/05,
AUTHOR = {Gaber, I.},
TITLE = {Minimal-time $k$-line broadcasting},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {769-777},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {broadcasting, $k$-line broadcasting},
URL = {http://dx.doi.org/10.1137/S0895480101386620},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bresar-Imrich-Klavzar-Zmazek/05,
AUTHOR = {Bre{\v{s}}ar, Bo{\v{s}}tjan and Imrich, Wilfried and Klav{\v{z}}ar, Sandi and Zmazek, Bla{\v{z}}},
TITLE = {Hypercubes as direct products},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {778-786},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {direct product, hypercube, automorphism, involution},
URL = {http://dx.doi.org/10.1137/S0895480103438358},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Sullivant/05,
AUTHOR = {Sullivant, Seth},
TITLE = {Small contingency tables with large gaps},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {787-793},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {disclosure limitation, integer programming, Gr{\"o}bner basis, contingency table},
URL = {http://dx.doi.org/10.1137/S0895480104444090},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Callaghan-Chew-Tanny/05,
AUTHOR = {Callaghan, Joseph and Chew III, John J. and Tanny, Stephen M.},
TITLE = {On the behavior of a family of meta-Fibonacci sequences},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {794-824},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {hofstadter, iterated recursion, meta-fibonacci, $q$ sequence},
URL = {http://dx.doi.org/10.1137/S0895480103421397},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Laihonen/05,
AUTHOR = {Laihonen, Tero},
TITLE = {On optimal edge-robust and vertex-robust $(1,\leq l)$-identifying codes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {825-834},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {identifying code, multiprocessor system, optimal code, multiple covering, hamming space},
URL = {http://dx.doi.org/10.1137/S0895480104440754},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Huber-Moulton-Steel/05,
AUTHOR = {Huber, Katharina T. and Moulton, Vincent and Steel, Mike},
TITLE = {Four characters suffice to convexly define a phylogenetic tree},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {835-843},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {phylogenetic tree, x-tree, convexly define, display, semidyadic closure, character compatibility},
URL = {http://dx.doi.org/10.1137/S0895480102416696},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ben-Haim-Etzion/05,
AUTHOR = {Ben-Haim, Yael and Etzion, Tuvi},
TITLE = {On the optimality of coloring with a lattice},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {18},
NUMBER = {4},
PAGES = {844-878},
YEAR = {2005},
EDITOR = {Griggs, J.R.},
KEYWORDS = {coloring, lattice, lee sphere, tristance},
URL = {http://dx.doi.org/10.1137/S0895480104439589},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}