@article{Remila/03,
AUTHOR = {R{\'e}mila, Eric},
TITLE = {On the structure of some spaces of tilings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {1},
PAGES = {1-19},
YEAR = {2002-2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {tilings, lattice, tiling group, height function},
URL = {http://dx.doi.org/10.1137/S0895480100373297},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Parnas-Ron-Samorodnitsky/03,
AUTHOR = {Parnas, Michal and Ron, Dana and Samorodnitsky, Alex},
TITLE = {Testing basic Boolean formulae},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {1},
PAGES = {20-46},
YEAR = {2002-2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {property testing, boolean functions, randomized algorithms, approximation algorithms},
URL = {http://dx.doi.org/10.1137/S0895480101407444},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Pippenger/03,
AUTHOR = {Pippenger, Nicholas},
TITLE = {Enumeration of matchings in the incidence graphs of complete and complete bipartite graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {1},
PAGES = {47-64},
YEAR = {2002-2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {generating functions, asymptotic enumeration},
URL = {http://dx.doi.org/10.1137/S0895480101395695},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Palmer-Read-Robinson/03,
AUTHOR = {Palmer, Edgar M. and Read, Ronald C. and Robinson, Robert W.},
TITLE = {Counting claw-free cubic graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {1},
PAGES = {65-73},
YEAR = {2002-2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {labeled graph counting, claw-free graph, cubic graph, exponential generating function, $p$-recursive sequence},
URL = {http://dx.doi.org/10.1137/S0895480194274777},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Collins-Shemmer/03,
AUTHOR = {Collins, Karen L. and Shemmer, Benjamin},
TITLE = {Constructions of 3-colorable cores},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {1},
PAGES = {74-80},
YEAR = {2002-2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {core, 3-colorable, retract, homomorphism, minor, subdivision, circular chromatic number},
URL = {http://dx.doi.org/10.1137/S0895480101390898},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Schirokauer/03,
AUTHOR = {Schirokauer, Oliver},
TITLE = {The special function field sieve},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {1},
PAGES = {81-98},
YEAR = {2002-2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {finite field, discrete logarithm, function field sieve},
URL = {http://dx.doi.org/10.1137/S0895480100372668},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Pikhurko/03a,
AUTHOR = {Pikhurko, Oleg},
TITLE = {Asymptotic size Ramsey results for bipartite graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {1},
PAGES = {99-113},
YEAR = {2002-2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {size ramsey number, bipartite graphs, mixed integer programming, farkas lemma},
URL = {http://dx.doi.org/10.1137/S0895480101384086},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bohossian-Bruck/03,
AUTHOR = {Bohossian, Vasken and Bruck, Jehoshua},
TITLE = {Algebraic techniques for constructing minimal weight threshold functions},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {1},
PAGES = {114-126},
YEAR = {2002-2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {threshold functions, computational complexity, neural networks},
URL = {http://dx.doi.org/10.1137/S0895480197326048},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Canovas-Landete-Marin/03,
AUTHOR = {C{\'a}novas, L{\'a}zaro and Landete, Mercedes and Mar{\'{i}}n, Alfredo},
TITLE = {Facet obtaining procedures for set packing problems},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {1},
PAGES = {127-155},
YEAR = {2002-2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {facet, set packing, independent set, stable set},
URL = {http://dx.doi.org/10.1137/S0895480100366786},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dohmen/03,
AUTHOR = {Dohmen, Klaus},
TITLE = {Improved inclusion-exclusion identities and Bonferroni inequalities with reliability applications},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {1},
PAGES = {156-171},
YEAR = {2002-2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {convex geometry, inclusion-exclusion, bonferroni inequalities, sieve formula, abstract tube, abstract simplicial complex, contractible, system reliability, consecutive $k$-out-of-$n$ system, reliability covering problem},
URL = {http://dx.doi.org/10.1137/S0895480101392630},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Mutoh-Morihara-Jimbo-Fu/03,
AUTHOR = {Mutoh, Yukiyasu and Morihara, Toshio and Jimbo, Masakazu and Fu, Hung-Lin},
TITLE = {The existence of $2\times4$ grid-block designs and their applications},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {2},
PAGES = {173-178},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph decomposition, graph design, grid-block},
URL = {http://dx.doi.org/10.1137/S0895480101387364},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kemkes-Lee-Merlini-Richmond/03,
AUTHOR = {Kemkes, Graeme and Lee, Chiu Fan and Merlini, Donatella and Richmond, Bruce},
TITLE = {Stirling numbers for complex arguments: Asymptotics and identities},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {2},
PAGES = {179-191},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {stirling numbers, asymptotic enumeration},
URL = {http://dx.doi.org/10.1137/S0895480102401119},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hochbaum-Queyranne/03,
AUTHOR = {Hochbaum, Dorit S. and Queyranne, Maurice},
TITLE = {Minimizing a convex cost closure set},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {2},
PAGES = {192-207},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {closure problem, nonlinear costs, bayesian estimation, maximum flow, parametric minimum cut, convex optimization},
URL = {http://dx.doi.org/10.1137/S0895480100369584},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Autebert-Schwer/03,
AUTHOR = {Autebert, Jean-Michel and Schwer, Sylviane R.},
TITLE = {On generalized Delannoy paths},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {2},
PAGES = {208-223},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {delannoy path, thue system, lattice},
URL = {http://dx.doi.org/10.1137/S0895480101387406},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Blundo-DArco-de_Santis-Stinson/03,
AUTHOR = {Blundo, C. and D'Arco, P. and de Santis, A. and Stinson, D.R.},
TITLE = {Contrast optimal threshold visual cryptography schemes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {2},
PAGES = {224-261},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {visual cryptography, secret sharing schemes},
URL = {http://dx.doi.org/10.1137/S0895480198336683},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Pebody-Radcliffe-Scott/03,
AUTHOR = {Pebody, L. and Radcliffe, A.J. and Scott, A.D.},
TITLE = {Finite subsets of the plane are 18-reconstructible},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {2},
PAGES = {262-275},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {reconstruction problem, group action},
URL = {http://dx.doi.org/10.1137/S0895480101391648},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Brent-Gao-Lauder/03,
AUTHOR = {Brent, Richard P. and Gao, Shuhong and Lauder, Alan G.B.},
TITLE = {Random Krylov spaces over finite fields},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {2},
PAGES = {276-287},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {finite field, vector space, linear transformation, krylov subspace},
URL = {http://dx.doi.org/10.1137/S089548010139388X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Jansen-Solis-Oba-Sviridenko/03,
AUTHOR = {Jansen, Klaus and Solis-Oba, Roberto and Sviridenko, Maxim},
TITLE = {Makespan minimization in job shops: A linear time approximation scheme},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {2},
PAGES = {288-300},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {approximation algorithm, approximation scheme, job shop, scheduling},
URL = {http://dx.doi.org/10.1137/S0895480199363908},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Engel-Guttmann/03,
AUTHOR = {Engel, Konrad and Guttmann, Sven},
TITLE = {Testing bandwidth $k$ for $k$-connected graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {2},
PAGES = {301-312},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {bandwidth, bandwidth-$k$ graph, $k$-connected graph, linear-time algorithm, linear layout, start sequence},
URL = {http://dx.doi.org/10.1137/S0895480199351148},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Sviridenko/03,
AUTHOR = {Sviridenko, M.},
TITLE = {Makespan minimization in no-wait flow shops: A polynomial time approximation scheme},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {2},
PAGES = {313-322},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {approximation algorithms, shop scheduling},
URL = {http://dx.doi.org/10.1137/S0895480100370803},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bandelt-Chepoi/03,
AUTHOR = {Bandelt, Hans-J{\"u}rgen and Chepoi, Victor},
TITLE = {1-hyperbolic graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {2},
PAGES = {323-334},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {trees, graphs, 4-point condition, hyperbolicity},
URL = {http://dx.doi.org/10.1137/S0895480100380902},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bang-Jensen-Huang-Yeo/03,
AUTHOR = {Bang-Jensen, J{\o}rgen and Huang, Jing and Yeo, Anders},
TITLE = {Strongly connected spanning subdigraphs with the minimum number of arcs in quasi-transitive digraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {2},
PAGES = {335-343},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {minimum equivalent digraph, strong subdigraph, hamiltonian cycle, polynomial algorithm, quasi-transitive digraph, extended semicomplete digraph, path factor, cycle factor, path cover, longest cycle},
URL = {http://dx.doi.org/10.1137/S0895480199354220},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Lucena/03,
AUTHOR = {Lucena, Brian},
TITLE = {A new lower bound for tree-width using maximum cardinality search},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {345-353},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {tree-width, lower bound, triangulation, maximum cardinality search},
URL = {http://dx.doi.org/10.1137/S0895480101397773},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Cheon-Chee/03,
AUTHOR = {Cheon, Jung Hee and Chee, Seongtaek},
TITLE = {Nonlinearity of Boolean functions and hyperelliptic curves},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {354-365},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {s-box, nonlinearity, boolean functions, hyperelliptic curves},
URL = {http://dx.doi.org/10.1137/S0895480199366251},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chandran/03a,
AUTHOR = {Chandran, L. Sunil},
TITLE = {A high girth graph construction},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {366-370},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {girth, algorithm},
URL = {http://dx.doi.org/10.1137/S0895480101387893},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Linusson-Shareshian/03,
AUTHOR = {Linusson, Svante and Shareshian, John},
TITLE = {Complexes of $t$-colorable graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {371-389},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {monotone graph property, chromatic number, discrete morse theory},
URL = {http://dx.doi.org/10.1137/S0895480100366968},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Trachtenberg-Vardy/03,
AUTHOR = {Trachtenberg, Ari and Vardy, Alexander},
TITLE = {Full-rank tilings of $F^8_2$ do not exist},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {390-392},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {full-rank tilings, perfect binary codes},
URL = {http://dx.doi.org/10.1137/S0895480102410213},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Alon-Dar-Parnas-Ron/03,
AUTHOR = {Alon, Noga and Dar, Seannie and Parnas, Michal and Ron, Dana},
TITLE = {Testing of clustering},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {393-417},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {property testing, clustering, randomized algorithms, approximation algorithms},
URL = {http://dx.doi.org/10.1137/S0895480102410973},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Comellas-Mitjana/03,
AUTHOR = {Comellas, Francesc and Mitjana, Margarida},
TITLE = {The spectra of cycle prefix digraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {418-421},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {directed graphs, cycle prefix digraph, adjacency matrix, eigenvalues},
URL = {http://dx.doi.org/10.1137/S0895480100380604},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kumar-Sivakumar/03,
AUTHOR = {Kumar, Ravi and Sivakumar, D.},
TITLE = {On polynomial-factor approximations to the shortest lattice vector length},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {422-425},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {lattice algorithms, shortest lattice vector, svp},
URL = {http://dx.doi.org/10.1137/S0895480100379981},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kral-Skrekovski/03,
AUTHOR = {Kr{\'a}l', Daniel and {\v{S}}krekovski, Riste},
TITLE = {A theorem about the channel assignment problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {426-437},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph coloring, list-coloring, channel assignment problem},
URL = {http://dx.doi.org/10.1137/S0895480101399449},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Metelsky-Tyshkevich/03,
AUTHOR = {Metelsky, Yury and Tyshkevich, Regina},
TITLE = {Line graphs of Helly hypergraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {438-448},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph, hypergraph, $r$-mino, line graph of hypergraph, helly hypergraph, rank of hypergraph, clique, $r$-covering, induced subgraph, finite characterization},
URL = {http://dx.doi.org/10.1137/S089548019936521X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Feder-Hell-Klein-Motwani/03,
AUTHOR = {Feder, Tomas and Hell, Pavol and Klein, Sulamita and Motwani, Rajeev},
TITLE = {List partitions},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {449-478},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {list homomorphisms, $h$-colorings, graph partitions, perfect graphs, split graphs, skew cutsets, clique cutsets, 2-joins, communication bound, dichotomy, constraint satisfaction problems, quasi-polynomial algorithms, np-completeness, polynomial time algorithms},
URL = {http://dx.doi.org/10.1137/S0895480100384055},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Liu-Strang-Ott/03,
AUTHOR = {Liu, Xiangwei and Strang, Gilbert and Ott, Susan},
TITLE = {Localized eigenvectors from widely spaced matrix modifications},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {479-498},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {localized eigenvectors, toeplitz matrix, adjacency matrix},
URL = {http://dx.doi.org/10.1137/S0895480102409048},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Blackburn/03a,
AUTHOR = {Blackburn, Simon R.},
TITLE = {Frameproof codes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {499-510},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {frameproof codes, digital fingerprinting, watermarking},
URL = {http://dx.doi.org/10.1137/S0895480101384633},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gijswijt-Schrijver/03,
AUTHOR = {Gijswijt, Dion and Schrijver, Alexander},
TITLE = {On the $b$-stable set polytope of graphs without bad $K_4$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {3},
PAGES = {511-516},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {t-perfect, graph, polytope, stable set},
URL = {http://dx.doi.org/10.1137/S0895480102417343},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ko-Shepherd/03,
AUTHOR = {Ko, C.W. and Shepherd, F.B.},
TITLE = {Bipartite domination and simultaneous matroid covers},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {4},
PAGES = {517-523},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {matroids, network matrices, induced matching, domination, linear programming},
URL = {http://dx.doi.org/10.1137/S089548019828371X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Yuster/03,
AUTHOR = {Yuster, Raphael},
TITLE = {Equitable coloring of $k$-uniform hypergraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {4},
PAGES = {524-532},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {hypergraph, coloring},
URL = {http://dx.doi.org/10.1137/S089548010240276769},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kushilevitz-Ostrovsky-Rosen/03,
AUTHOR = {Kushilevitz, Eyal and Ostrovsky, Rafail and Ros{\'e}n, Adi},
TITLE = {Amortizing randomness in private multiparty computations},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {4},
PAGES = {533-544},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {private distributed computations, randomness, round-complexity, amortization},
URL = {http://dx.doi.org/10.1137/S089548010135274X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Scarabotti/03,
AUTHOR = {Scarabotti, Fabio},
TITLE = {Fourier analysis of a class of finite Radon transforms},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {4},
PAGES = {545-554},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {finite radon transforms, intertwining functions, gelfand pairs, symmetric group, finite general linear group},
URL = {http://dx.doi.org/10.1137/S0895480102416398},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hunsaker-Kleywegt-Savelsbergh-Tovey/03,
AUTHOR = {Hunsaker, Brady and Kleywegt, Anton J. and Savelsbergh, Martin W.P. and Tovey, Craig A.},
TITLE = {Optimal online algorithms for minimax resource scheduling},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {4},
PAGES = {555-590},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {online algorithms, competitive analysis, worst-case analysis, single-machine scheduling, multiprocessor scheduling, line balancing},
URL = {http://dx.doi.org/10.1137/S0895480101397761},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kim-Mellinger-Pless/03,
AUTHOR = {Kim, Jon-Lark and Mellinger, Keith E. and Pless, Vera},
TITLE = {Projections of binary linear codes onto larger fields},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {4},
PAGES = {591-603},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {additive codes, projection onto larger fields},
URL = {http://dx.doi.org/10.1137/S0895480102404367},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dumitriu-Tetali-Winkler/03,
AUTHOR = {Dumitriu, Ioana and Tetali, Prasad and Winkler, Peter},
TITLE = {On playing golf with two balls},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {4},
PAGES = {604-615},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {gittins index, markov chain, markov decision theory, random walk, hitting time, game theory},
URL = {http://dx.doi.org/10.1137/S0895480102408341},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Curran-Yu/03,
AUTHOR = {Curran, Sean and Yu, Xingxing},
TITLE = {Nonseparating cycles in 4-connected graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {4},
PAGES = {616-629},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {nonseparating cycle, k-connected graph, disjoint paths, hamilton cycle},
URL = {http://dx.doi.org/10.1137/S089548010139518X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Capalbo/03,
AUTHOR = {Capalbo, M.},
TITLE = {An explicit construction of lower-diameter cubic graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {4},
PAGES = {630-634},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {diameter, shuffle-exchange graph},
URL = {http://dx.doi.org/10.1137/S0895480197330266},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fiala-Jansen-Le-Seidel/03,
AUTHOR = {Fiala, Ji{\v{r}}{\'{\i}} and Jansen, Klaus and Le, Van Bang and Seidel, Eike},
TITLE = {Graph subcolorings: Complexity and algorithms},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {4},
PAGES = {635-650},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph subcoloring, computational complexity, cograph, cliquewidth, treewidth},
URL = {http://dx.doi.org/10.1137/S0895480101395245},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Agnarsson-Halldorsson/03,
AUTHOR = {Agnarsson, Geir and Halld{\'o}rsson, Magn{\'u}s M.},
TITLE = {Coloring powers of planar graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {4},
PAGES = {651-662},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {distance-2 coloring, radio coloring},
URL = {http://dx.doi.org/10.1137/S0895480100367950},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dinwoodie-Mosteig/03,
AUTHOR = {Dinwoodie, I.H. and Mosteig, Edward},
TITLE = {Statistical inference for internal network reliability with spatial dependence},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {16},
NUMBER = {4},
PAGES = {663-674},
YEAR = {2003},
EDITOR = {Griggs, J.R.},
KEYWORDS = {curie-weiss model, gr{\"{o}}bner basis, maximum likelihood estimators, network tomography, parameter identifiability},
URL = {http://dx.doi.org/10.1137/S0895480101390813},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}