@article{Gunluk/07,
AUTHOR = {G{\"u}nl{\"u}k, Oktay},
TITLE = {A new min-cut max-flow ratio for multicommodity flows},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {1-15},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
URL = {http://link.aip.org/link/?SJD/21/1/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Sawada/07,
AUTHOR = {Sawada, J.},
TITLE = {A simple Gray code to list all minimal signed binary representations},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {16-25},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
URL = {http://link.aip.org/link/?SJD/21/16/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bresar-Klavzar/07,
AUTHOR = {Bre{\v{s}}ar, Bo{\v{s}}tjan and Klav{\v{z}}ar, Sandi},
TITLE = {Crossing graphs as joins of graphs and Cartesian products of median graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {26-32},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
URL = {http://link.aip.org/link/?SJD/21/26/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Wagner/07a,
AUTHOR = {Wagner, Stephan G.},
TITLE = {Correlation of graph-theoretical indices},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {33-46},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {trees, correlation, graph-theoretical index},
URL = {http://link.aip.org/link/?SJD/21/33/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Barik-Pati-Sarma/07,
AUTHOR = {Barik, S. and Pati, S. and Sarma, B.K.},
TITLE = {The spectrum of the corona of two graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {47-56},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {adjacency matrix, laplacian matrix, property (r), property (sr), corona},
URL = {http://link.aip.org/link/?SJD/21/47/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Diaz-Mitsche-Perez/07,
AUTHOR = {D{\'{i}}az, Josep and Mitsche, Dieter and P{\'e}rez, Xavier},
TITLE = {Sharp threshold for Hamiltonicity of random geometric graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {57-65},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {random geometric graphs, hamilton cycles},
URL = {http://link.aip.org/link/?SJD/21/57/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Alon-Krech-Szabo/07,
AUTHOR = {Alon, Noga and Krech, Anja and Szab{\'o}, Tibor},
TITLE = {Tur{\'a}n's theorem in the hypercube},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {66-72},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {hypercube, turan-type problems, ramsey's theorem, anti-ramsey problems},
URL = {http://link.aip.org/link/?SJD/21/66/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Avart-Rodl-Schacht/07,
AUTHOR = {Avart, Christian and R{\"o}dl, Vojt{\v{e}}ch and Schacht, Mathias},
TITLE = {Every monotone 3-graph property is testable},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {73-92},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {hypergraph, monotone properties, property testing, hypergraph regularity lemma},
URL = {http://link.aip.org/link/?SJD/21/73/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Cole-Kowalik-Skrekovski/07,
AUTHOR = {Cole, Richard and Kowalik, {\L}ukasz and {\v{S}}krekovski, Riste},
TITLE = {A generalization of Kotzig's theorem and its application},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {93-106},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {kotzig's theorem, planar graph, light edge, choosability, list-coloring, algorithm},
URL = {http://link.aip.org/link/?SJD/21/93/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kobayashi-Murota-Tanaka/07,
AUTHOR = {Kobayashi, Yusuke and Murota, Kazuo and Tanaka, Ken'ichiro},
TITLE = {Operations on M-convex functions on jump systems},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {107-129},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {jump system, m-convex function, aggregation, convolution, transformation by networks},
URL = {http://link.aip.org/link/?SJD/21/107/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{de_Mier/07,
AUTHOR = {de Mier, Anna},
TITLE = {A natural family of flag matroids},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {130-140},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {matroid, flag matroid, lattice path matroid, tennis ball problem},
URL = {http://link.aip.org/link/?SJD/21/130/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bagchi-Chaudhary-Scheideler-Kolman/07,
AUTHOR = {Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr},
TITLE = {Algorithms for fault-tolerant routing in circuit-switched networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {141-157},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {edge-disjoint paths, fault-tolerant routing, flow number, greedy algorithms, multicommodity flow},
URL = {http://link.aip.org/link/?SJD/21/141/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chlebik-Chlebikova/07,
AUTHOR = {Chleb{\'{i}}k, Miroslav and Chleb{\'{i}}kov{\'a}, Janka},
TITLE = {The complexity of combinatorial optimization problems on $d$-dimensional boxes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {158-169},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {independent set, geometric intersection graphs, rectangle graphs},
URL = {http://link.aip.org/link/?SJD/21/158/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gray/07,
AUTHOR = {Gray, Ian D.},
TITLE = {Vertex-magic total labelings of regular graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {170-177},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {vertex-magic, regular graph, quasi-prism, quasi-anti-prism, sparse magic square},
URL = {http://link.aip.org/link/?SJD/21/170/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gartner-Kaibel/07,
AUTHOR = {G{\"a}rtner, Bernd and Kaibel, Volker},
TITLE = {Two new bounds for the random-edge simplex-algorithm},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {178-190},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {simplex-algorithm, random-edge, pivot rule, cube},
URL = {http://link.aip.org/link/?SJD/21/178/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Barany-Matousek/07,
AUTHOR = {B{\'a}r{\'a}ny, Imre and Matou{\v{s}}ek, Ji{\v{r}}{\'{i}}},
TITLE = {Quadratically many colorful simplices},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {191-198},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {colorful simplicial depth, colorful caratheodory theorem, convex geometry},
URL = {http://link.aip.org/link/?SJD/21/191/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Neelamani-Dash-Baraniuk/07,
AUTHOR = {Neelamani, Ramesh and Dash, Sanjeeb and Baraniuk, Richard G.},
TITLE = {On nearly orthogonal lattice bases and random lattices},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {199-219},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {lattices, shortest lattice vector, random lattice, jpeg, compression},
URL = {http://link.aip.org/link/?SJD/21/199/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Koppe/07,
AUTHOR = {K{\"o}ppe, Matthias},
TITLE = {A primal Barvinok algorithm based on irrational decompositions},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {220-236},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {rational generating functions, irrational decompositions},
URL = {http://link.aip.org/link/?SJD/21/220/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Balister-Gyori-Lehel-Schelp/07,
AUTHOR = {Balister, P.N. and Gy{\"o}ri, E. and Lehel, J. and Schelp, R.H.},
TITLE = {Adjacent vertex distinguishing edge-colorings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {237-250},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {proper edge-colorings, chromatic number, bipartite graphs},
URL = {http://link.aip.org/link/?SJD/21/237/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Balbuena-Garcia-Vazquez/07,
AUTHOR = {Balbuena, C. and Garc{\'{i}}a-V\'a}zquez, P.},
TITLE = {On the minimum order of extremal graphs to have a prescribed girth},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {251-257},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {extremal graphs, girth, forbidden cycles, cages},
URL = {http://link.aip.org/link/?SJD/21/251/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Voigt/07,
AUTHOR = {Voigt, Margit},
TITLE = {Precoloring extension for 2-connected graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {258-263},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {list coloring, precoloring extension, distance constraints},
URL = {http://link.aip.org/link/?SJD/21/258/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Axenovich-Balogh/07,
AUTHOR = {Axenovich, Maria and Balogh, J{\'o}zsef},
TITLE = {Graphs having small number of sizes on induced $k$-subgraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {1},
PAGES = {264-272},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {induced subgraphs, reconstruction, homogeneous sets},
URL = {http://link.aip.org/link/?SJD/21/264/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Conforti-Gerards/07,
AUTHOR = {Conforti, Michele and Gerards, Bert},
TITLE = {Packing odd circuits},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {273-302},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {odd circuits, packing, excluded minors, decomposition, signed graphs},
URL = {http://link.aip.org/link/?SJD/21/273/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Stephen/07,
AUTHOR = {Stephen, Tamon},
TITLE = {A majorization bound for the eigenvalues of some graph Laplacians},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {303-312},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph laplacian, majorization, graph spectrum, degree sequence, dirichlet laplacian},
URL = {http://link.aip.org/link/?SJD/21/303/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Paletta-Pietramala/07,
AUTHOR = {Paletta, Giuseppe and Pietramala, Paolamaria},
TITLE = {A new approximation algorithm for the nonpreemptive scheduling of independent jobs on identical parallel processors},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {313-328},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {optimization, scheduling, approximation algorithm, worst-case performance ratio},
URL = {http://link.aip.org/link/?SJD/21/313/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Alon-Lubetzky/07c,
AUTHOR = {Alon, Noga and Lubetzky, Eyal},
TITLE = {Graph powers, Delsarte, Hoffman, Ramsey, and Shannon},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {329-348},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph powers, delsarte's linear programming bound, eigenvalue bounds, ramsey theory, cliques and independent sets},
URL = {http://link.aip.org/link/?SJD/21/329/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Makai/07,
AUTHOR = {Makai, M{\'a}rton},
TITLE = {On maximum cost $K_{T,T}$-free $T$-matchings of bipartite graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {349-360},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {submodularity, restricted matchings, integer polyhedra},
URL = {http://link.aip.org/link/?SJD/21/349/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kortsarz-Shende/07,
AUTHOR = {Kortsarz, Guy and Shende, Sunil},
TITLE = {An improved approximation of the achromatic number on bipartite graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {361-373},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {approximation algorithms, coloring of graphs and hypergraphs, graph algorithms},
URL = {http://link.aip.org/link/?SJD/21/361/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Nesetril-Svejdarova/07,
AUTHOR = {Ne{\v{s}}et{\v{r}}il, Jaroslav and {\v{S}}vejdarov{\'a}, Ida},
TITLE = {Small diameters of duals},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {374-384},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {homomorphisms duality, graphs, relational structures, duals},
URL = {http://link.aip.org/link/?SJD/21/374/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Perles-Pinchasi/07,
AUTHOR = {Perles, Micha A. and Pinchasi, Rom},
TITLE = {Forbidden $k$-sets in the plane},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {385-395},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {$k$-sets, skippable sets, allowable sequences},
URL = {http://link.aip.org/link/?SJD/21/385/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Conforti-Di_Summa-Wolsey/07a,
AUTHOR = {Conforti, Michele and Di Summa, Marco and Wolsey, Laurence A.},
TITLE = {The mixing set with flows},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {396-407},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {mixed integer programming, mixing, lot-sizing},
URL = {http://link.aip.org/link/?SJD/21/396/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kravitz/07,
AUTHOR = {Kravitz, David},
TITLE = {Random 2-SAT does not depend on a giant},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {408-422},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {satisfiability, sat, random processes, boolean, clauses, literals, online, offline, algorithms},
URL = {http://link.aip.org/link/?SJD/21/408/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Caceres-Hernando-Mora-Pelayo-Puertas-Seara-Wood/07,
AUTHOR = {C{\'a}ceres, Jos{\'e} and Hernando, Carmen and Mora, Merc{\`e} and Pelayo, Ignacio M. and Puertas, Mar{\'{i}}a L. and Seara, Carlos and Wood, David R.},
TITLE = {On the metric dimension of Cartesian products of graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {423-441},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph, distance, resolving set, metric dimension, metric basis, cartesian product, hamming graph, mastermind, coin weighing, djokovicwinkler relation},
URL = {http://link.aip.org/link/?SJD/21/423/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Rodl-Rucinski-Schacht/07,
AUTHOR = {R{\"o}dl, Vojt{\v{e}}ch and Ruci{\'n}ski, Andrzej and Schacht, Mathias},
TITLE = {Ramsey properties of random $k$-partite, $k$-uniform hypergraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {442-460},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {random hypergraphs, ramsey properties},
URL = {http://link.aip.org/link/?SJD/21/442/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{DeVos-Ebrahimi-Ghebleh-Goddyn-Mohar-Naserasr/07,
AUTHOR = {DeVos, Matt and Ebrahimi, Javad and Ghebleh, Mohammad and Goddyn, Luis and Mohar, Bojan and Naserasr, Reza},
TITLE = {Circular coloring the plane},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {461-465},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph coloring, circular coloring, unit distance graph},
URL = {http://link.aip.org/link/?SJD/21/461/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Constantinescu-Ilie/07,
AUTHOR = {Constantinescu, Sorin and Ilie, Lucian},
TITLE = {The Lempel-Ziv complexity of fixed points of morphisms},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {466-481},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {combinatorics on words, infinite words, lempelziv complexity, fixed points, morphisms, factors},
URL = {http://link.aip.org/link/?SJD/21/466/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hurkens-Keijsper-Stougie/07,
AUTHOR = {Hurkens, C.A.J. and Keijsper, J.C.M. and Stougie, L.},
TITLE = {Virtual private network design: A proof of the tree routing conjecture on ring networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {482-503},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {network design, duality, combinatorial optimization, multicommodity flows},
URL = {http://link.aip.org/link/?SJD/21/482/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Shioura-Tanaka/07,
AUTHOR = {Shioura, Akiyoshi and Tanaka, Ken'ichiro},
TITLE = {Polynomial-time algorithms for linear and convex optimization on jump systems},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {504-522},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {jump system, discrete convex function, bisubmodular function, bisubmodular polyhedron, polynomial-time algorithm},
URL = {http://link.aip.org/link/?SJD/21/504/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hartke-Vandenbussche-Wenger/07,
AUTHOR = {Hartke, Stephen G. and Vandenbussche, Jennifer and Wenger, Paul},
TITLE = {Further results on bar $k$-visibility graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {523-531},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {visibility graph, bar visibility graph, bar $k$-visibility graph, visibility representation of a graph},
URL = {http://link.aip.org/link/?SJD/21/523/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Graham-Li-Yao/07,
AUTHOR = {Graham, Ronald L. and Li, Minming and Yao, Frances F.},
TITLE = {Optimal tree structures for group key management with batch updates},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {532-547},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {key trees, group keys, batch updates, optimality},
URL = {http://link.aip.org/link/?SJD/21/532/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Feng-Kwak-Kwon/07,
AUTHOR = {Feng, Rongquan and Kwak, Jin Ho and Kwon, Young Soo},
TITLE = {Erratum to ``Enumerating typical circulant covering projections onto a circulant graph''},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {2},
PAGES = {548-550},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
URL = {http://link.aip.org/link/?SJD/21/548/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
NOTE = {Originally in SIAM J. Disc.~Math., Vol. 19, 2005, No. 1, 196-207},
}
@article{Yaman/07,
AUTHOR = {Yaman, Hande},
TITLE = {The integer knapsack cover polyhedron},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {551-572},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {integer knapsack cover polyhedron, valid inequalities, facets, sequence-independent lifting},
URL = {http://link.aip.org/link/?SJD/21/551/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Berry-Golumbic-Lipshteyn/07,
AUTHOR = {Berry, Anne and Golumbic, Martin Charles and Lipshteyn, Marina},
TITLE = {Recognizing chordal probe graphs and cycle-bicolorable graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {573-591},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {chordal graph, probe graph, triangulation, perfect graph, elimination scheme, bicoloring},
URL = {http://link.aip.org/link/?SJD/21/573/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hurkens-van_Iersel-Keijsper-Kelk-Stougie-Tromp/07,
AUTHOR = {Hurkens, Cor and van Iersel, Leo and Keijsper, Judith and Kelk, Steven and Stougie, Leen and Tromp, John},
TITLE = {Prefix reversals on binary and ternary strings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {592-611},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {algorithms, genome comparison, pancake flipping, prefix reversals, sorting, strings},
URL = {http://link.aip.org/link/?SJD/21/592/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Cheriyan-Vetta/07,
AUTHOR = {Cheriyan, Joseph and Vetta, Adrian},
TITLE = {Approximation algorithms for network design with metric costs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {612-636},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {approximation algorithm, linear programming relaxation, network design, vertex-connectivity, edge-connectivity},
URL = {http://link.aip.org/link/?SJD/21/612/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Berman/07,
AUTHOR = {Berman, Kenneth A.},
TITLE = {Locating servers for reliability and affine embeddings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {637-646},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph algorithms, server location, fault-tolerance, convex embeddings, affine embeddings, randomized algorithms, parallel algorithms},
URL = {http://link.aip.org/link/?SJD/21/637/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Vince/07,
AUTHOR = {Vince, A.},
TITLE = {Discrete lines and wandering paths},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {647-661},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {discrete line, polygonal path},
URL = {http://link.aip.org/link/?SJD/21/647/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Cornaz-Mahjoub/07,
AUTHOR = {Cornaz, Denis and Mahjoub, A. Ridha},
TITLE = {The maximum induced bipartite subgraph problem with edge weights},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {662-675},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {induced bipartite subgraph, edge weight, minimal dependent set, separation algorithm, polytope},
URL = {http://link.aip.org/link/?SJD/21/662/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Smorodinsky/07,
AUTHOR = {Smorodinsky, Shakhar},
TITLE = {On the chromatic number of geometric hypergraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {676-687},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {hypergraphs, conflict-free, coloring, wireless},
URL = {http://link.aip.org/link/?SJD/21/676/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Babilon-Jelinek-Kral-Valtr/07,
AUTHOR = {Babilon, Robert and Jel{\'{i}}nek, V{\'{i}}t and Kr{\'a}l', Daniel and Valtr, Pavel},
TITLE = {Labelings of graphs with fixed and variable edge-weights},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {688-706},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {channel assignment problem, graph labeling with distance conditions},
URL = {http://link.aip.org/link/?SJD/21/688/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Apfelbaum-Sharir/07,
AUTHOR = {Apfelbaum, Roel and Sharir, Micha},
TITLE = {Large complete bipartite subgraphs in incidence graphs of points and hyperplanes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {707-725},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {incidences, hyperplanes, incidence graph},
URL = {http://link.aip.org/link/?SJD/21/707/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Cheng/07,
AUTHOR = {Cheng, Qi},
TITLE = {Constructing finite field extensions with large order elements},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {726-730},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {finite fields, high order elements},
URL = {http://link.aip.org/link/?SJD/21/726/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ryan/07,
AUTHOR = {Ryan, Jeffrey A.},
TITLE = {A two-set problem on coloring the integers},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {731-736},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {combinatorics, ramsey theory, number theory, sequences mod m},
URL = {http://link.aip.org/link/?SJD/21/731/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Tardos-Toth/07,
AUTHOR = {Tardos, G{\'a}bor and T{\'o}th, G{\'e}za},
TITLE = {Crossing stars in topological graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {737-749},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {topological graph, crossing edges},
URL = {http://link.aip.org/link/?SJD/21/737/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Spacapan/07,
AUTHOR = {{\v{S}}pacapan, Simon},
TITLE = {Optimal Lee-type local structures in Cartesian products of cycles and paths},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {750-762},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {perfect lee codes, optimal local structure},
URL = {http://link.aip.org/link/?SJD/21/750/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gomez-Gutierrez-Ibeas/07,
AUTHOR = {G{\'o}mez, Domingo and Gutierrez, Jaime and Ibeas, {\'A}lvar},
TITLE = {Cayley digraphs of finite Abelian groups and monomial ideals},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {763-784},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {monomial ideals, cayley digraph, grobner bases, multiloop networks},
URL = {http://link.aip.org/link/?SJD/21/763/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Alderson-Mellinger/07,
AUTHOR = {Alderson, T.L. and Mellinger, Keith E.},
TITLE = {Constructions of optical orthogonal codes from finite geometry},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {785-793},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {optical orthogonal codes, arcs, baer subplanes},
URL = {http://link.aip.org/link/?SJD/21/785/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Landman-Robertson/07,
AUTHOR = {Landman, Bruce M. and Robertson, Aaron},
TITLE = {Avoiding monochromatic sequences with special gaps},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {794-801},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {arithmetic progressions, ramsey theory, primes in progression},
URL = {http://link.aip.org/link/?SJD/21/794/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Geelen-Webb/07,
AUTHOR = {Geelen, Jim and Webb, Kerri},
TITLE = {On Rota's basis conjecture},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {802-804},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {matroids, rado's theorem, rota's basis conjecture},
URL = {http://link.aip.org/link/?SJD/21/802/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chee-Ling/07,
AUTHOR = {Chee, Yeow Meng and Ling, Alan C.H.},
TITLE = {On extremal $k$-graphs without repeated copies of 2-intersecting edges},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {3},
PAGES = {805-821},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {combinatorial design, hypergraph, packing},
URL = {http://link.aip.org/link/?SJD/21/805/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bermond-Ferreira-Perennes-Peters/07,
AUTHOR = {Bermond, Jean-Claude and Ferreira, Afonso and P{\'e}rennes, St{\'e}phane and Peters, Joseph G.},
TITLE = {Neighborhood broadcasting in hypercubes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {823-843},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {broadcasting, hypercubes, neighborhood communication},
URL = {http://link.aip.org/link/?SJD/21/823/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Lai/07,
AUTHOR = {Lai, Hong-Jian},
TITLE = {Mod $(2p + 1)$-orientations and $K_{1,2p+1}$-decompositions},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {844-850},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {nowhere zero flows, circular flows, mod $(2p+1)$-orientations, $k_{1, 2p+1}$-decompositions},
URL = {http://link.aip.org/link/?SJD/21/844/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ge-Ling/07,
AUTHOR = {Ge, Gennian and Ling, Alan C.H.},
TITLE = {On the existence of $(K_5 \setminus e)$-designs with application to optical networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {851-864},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {$(k_5 \setminus e)$-design, optical networks, traffic grooming},
URL = {http://link.aip.org/link/?SJD/21/851/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Niederreiter-Ozbudak/07,
AUTHOR = {Niederreiter, Harald and {\"O}zbudak, Ferruh},
TITLE = {Improved asymptotic bounds for codes using distinguished divisors of global function fields},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {865-899},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {asymptotic theory of codes, gilbertvarshamov bound, global function fields, tsfasmanvladutzink bound, xing bound},
URL = {http://link.aip.org/link/?SJD/21/865/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Cameron-Eschen-Hoang-Sritharan/07,
AUTHOR = {Cameron, Kathie and Eschen, Elaine M. and Ho{\`a}ng, Chinh T. and Sritharan, R.},
TITLE = {The complexity of the list partition problem for graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {900-929},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph partition, list partition, complexity, algorithm},
URL = {http://link.aip.org/link/?SJD/21/900/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Motwani-Naor-Panigrahy/07,
AUTHOR = {Motwani, Rajeev and Naor, Assaf and Panigrahy, Rina},
TITLE = {Lower bounds on locality sensitive hashing},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {930-935},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {locality sensitive hashing, lower bounds, nearest neighbor search},
URL = {http://link.aip.org/link/?SJD/21/930/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Takata/07,
AUTHOR = {Takata, Ken},
TITLE = {A worst-case analysis of the sequential method to list the minimal hitting sets of a hypergraph},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {936-946},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {hypergraph, minimal hitting set, listing algorithms, sequential method, read-once boolean functions},
URL = {http://link.aip.org/link/?SJD/21/936/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Pittel-Shepp-Veklerov/07,
AUTHOR = {Pittel, B. and Shepp, L. and Veklerov, E.},
TITLE = {On the number of fixed pairs in a random instance of the stable marriage problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {947-958},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {stable matching, proposal algorithm, random instance, likely behavior, asymptotics},
URL = {http://link.aip.org/link/?SJD/21/947/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Momihara-Muller-Satoh-Jimbo/07,
AUTHOR = {Momihara, Koji and M{\"u}ller, Meinard and Satoh, Junya and Jimbo, Masakazu},
TITLE = {Constant weight conflict-avoiding codes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {959-979},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {conflict-avoiding codes, cyclotomic cosets, kronecker density, recursive constructions},
URL = {http://link.aip.org/link/?SJD/21/959/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Sudakov/07a,
AUTHOR = {Sudakov, Benny},
TITLE = {Ramsey numbers and the size of graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {980-986},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {ramsey numbers, probabilistic methods},
URL = {http://link.aip.org/link/?SJD/21/980/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Sloan-Szorenyi-Turan/07,
AUTHOR = {Sloan, Robert H. and Sz{\"o}r{\'e}nyi, Bal{\'a}zs and Tur{\'a}n, Gy{\"o}rgy},
TITLE = {On $k$-term DNF with the largest number of prime implicants},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {987-998},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {disjoint dnf, disjunctive normal form, prime implicant},
URL = {http://link.aip.org/link/?SJD/21/987/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Leveque-Maffray/07,
AUTHOR = {L{\'e}v{\'e}que, Benjamin and Maffray, Fr{\'e}d{\'e}ric},
TITLE = {Coloring bull-free perfectly contractile graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {999-1018},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {perfect graph, bull-free graph, coloring, lexbfs},
URL = {http://link.aip.org/link/?SJD/21/999/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dror-Orlin/07,
AUTHOR = {Dror, Moshe and Orlin, James B.},
TITLE = {Combinatorial optimization with explicit delineation of the ground set by a collection of subsets},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {1019-1034},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {inapproximability, approximation algorithms, subset travelling salesman, generalized bin packing, generalized scheduling problems},
URL = {http://link.aip.org/link/?SJD/21/1019/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dankelmann-Mukwembi-Swart/07,
AUTHOR = {Dankelmann, Peter and Mukwembi, Simon and Swart, Henda C.},
TITLE = {Average distance and edge-connectivity II},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {1035-1052},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {distance, average distance, edge-connectivity},
URL = {http://link.aip.org/link/?SJD/21/1035/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Lu/07a,
AUTHOR = {Lu, Linyuan},
TITLE = {Explicit construction of small Folkman graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {1053-1060},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {folkman graph, spectrum, $k_4$-free, monochromatic triangle, circulant graph},
URL = {http://link.aip.org/link/?SJD/21/1053/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Egawa-Inoue-Kawarabayashi/07,
AUTHOR = {Egawa, Yoshimi and Inoue, Katsumi and Kawarabayashi, Ken-ichi},
TITLE = {Nonseparating induced cycles consisting of contractible edges in $k$-connected graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {1061-1070},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {nonseparating cycle, contractible edge, $k$-connected graphs},
URL = {http://link.aip.org/link/?SJD/21/1061/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Sudeep-Vishwanathan/07,
AUTHOR = {Sudeep, K.S. and Vishwanathan, Sundar},
TITLE = {Matched-factor $d$-domatic coloring of graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {1071-1082},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph theory, algorithms, domination, matched-factor domatic number},
URL = {http://link.aip.org/link/?SJD/21/1071/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Pu-Shen-Ma-Ling/07,
AUTHOR = {Pu, Liqun and Shen, Hao and Ma, Jun and Ling, San},
TITLE = {Cycle systems in the complete bipartite graph plus a one-factor},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {21},
NUMBER = {4},
PAGES = {1083-1092},
YEAR = {2007},
EDITOR = {Griggs, J.R.},
KEYWORDS = {complete bipartite graph, one-factor, cycle system},
URL = {http://link.aip.org/link/?SJD/21/1083/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}