@article{Czygrinow-Hurlbert/06,
AUTHOR = {Czygrinow, Andrzej and Hurlbert, Glenn},
TITLE = {Girth, pebbling, and grid thresholds},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {1-10},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {girth, pebbling, grids, threshold, connectivity},
URL = {http://link.aip.org/link/?SJD/20/1/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Joswig-Pfetsch/06,
AUTHOR = {Joswig, Michael and Pfetsch, Marc E.},
TITLE = {Computing optimal morse matchings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {11-25},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {discrete morse function, morse matching},
URL = {http://link.aip.org/link/?SJD/20/11/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Isler-Kannan-Khanna/06,
AUTHOR = {Isler, Volkan and Kannan, Sampath and Khanna, Sanjeev},
TITLE = {Randomized pursuit-evasion with local visibility},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {26-41},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {pursuit-evasion games, local information, path planning, visibility},
URL = {http://link.aip.org/link/?SJD/20/26/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Conforti-Cornuejols-Liu-Vuskovic-Zambelli/06,
AUTHOR = {Conforti, Michele and Cornu{\'e}jols, G{\'e}rard and Liu, Xinming and Vu{\v{s}}kovi{\'c}, Kristina and Zambelli, Giacomo},
TITLE = {Odd hole recognition in graphs of bounded clique size},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {42-48},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {odd hole, recognition algorithm, cleaning, decomposition},
URL = {http://link.aip.org/link/?SJD/20/42/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Axenovich-Martin/06a,
AUTHOR = {Axenovich, Maria and Martin, Ryan},
TITLE = {Avoiding patterns in matrices via a small number of changes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {49-54},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {forbidden patterns, editing, graph editing, editing distance, coloring},
URL = {http://link.aip.org/link/?SJD/20/49/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dvorak-Skrekovski/06,
AUTHOR = {Dvo{\v{r}}{\'a}k, Zden{\v{e}}k and {\v{S}}krekovski, Riste},
TITLE = {A theorem about a contractible and light edge},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {55-61},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {light graph theory, contractible edges, planar graphs},
URL = {http://link.aip.org/link/?SJD/20/55/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kuhn-Osthus/06c,
AUTHOR = {K{\"u}hn, Daniela and Osthus, Deryk},
TITLE = {Improved bounds for topological cliques in graphs of large girth},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {62-78},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {subdivisions, topological minors, girth, hajos conjecture},
URL = {http://link.aip.org/link/?SJD/20/62/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ogata-Kurosawa-Stinson/06,
AUTHOR = {Ogata, Wakaha and Kurosawa, Kaoru and Stinson, Douglas R.},
TITLE = {Optimum secret sharing scheme secure against cheating},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {79-95},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {cryptography, secret sharing schemes, cheaters, balanced incomplete block design, difference sets},
URL = {http://link.aip.org/link/?SJD/20/79/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Li-Zang/06,
AUTHOR = {Li, Yusheng and Zang, Wenan},
TITLE = {Differential methods for finding independent sets in hypergraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {96-104},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {hypergraph, independent set, differential method, convex function, algorithm},
URL = {http://link.aip.org/link/?SJD/20/96/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Corneil-Kohler-Olariu-Stewart/06,
AUTHOR = {Corneil, Derek G. and K{\"o}hler, Ekkehard and Olariu, Stephan and Stewart, Lorna},
TITLE = {Linear orderings of subfamilies of AT-free graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {105-118},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph algorithms, complexity, asteroidal triple free graphs, recognition algorithm, linear ordering},
URL = {http://link.aip.org/link/?SJD/20/105/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chekuri-Gupta-Newman-Rabinovich-Sinclair/06,
AUTHOR = {Chekuri, Chandra and Gupta, Anupam and Newman, Ilan and Rabinovich, Yuri and Sinclair, Alistair},
TITLE = {Embedding $k$-outerplanar graphs into $l_1$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {119-136},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {metric embeddings, $k$-outerplanar graphs, planar graphs, low-distortion embeddings, probabilistic approximation, metric spaces},
URL = {http://link.aip.org/link/?SJD/20/119/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Alon/06,
AUTHOR = {Alon, Noga},
TITLE = {Ranking tournaments},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {137-142},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {tournament, feedback arc set problem},
URL = {http://link.aip.org/link/?SJD/20/137/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Pippenger/06,
AUTHOR = {Pippenger, Nicholas},
TITLE = {The linking probability of deep spider-web networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {143-159},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {communiation networks, crossbar switching networks, blocking probability},
URL = {http://link.aip.org/link/?SJD/20/143/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dinitz/06,
AUTHOR = {Dinitz, Michael},
TITLE = {Full rank tilings of finite Abelian groups},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {160-170},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {tiling, full rank, finite abelian group, factorization, direct sum, hamming codes},
URL = {http://link.aip.org/link/?SJD/20/160/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dulio-Gardner-Peri/06,
AUTHOR = {Dulio, Paolo and Gardner, Richard J. and Peri, Carla},
TITLE = {Discrete point X-rays},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {171-188},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {convex lattice set, discrete tomography, geometric tomography, lattice, x-ray},
URL = {http://link.aip.org/link/?SJD/20/171/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{de_Klerk-Maharry-Pasechnik-Richter-Salazar/06,
AUTHOR = {de Klerk, E. and Maharry, J. and Pasechnik, D.V. and Richter, R.B. and Salazar, G.},
TITLE = {Improved bounds for the crossing numbers of $K_{m,n}$ and $K_n$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {189-202},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {crossing number, semidefinite programming, copositive cone, invariants and centralizer rings of permutation groups},
URL = {http://link.aip.org/link/?SJD/20/189/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Korner-Malvenuto/06,
AUTHOR = {K{\"o}rner, J{\'a}nos and Malvenuto, Claudia},
TITLE = {Pairwise colliding permutations and the capacity of infinite graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {203-212},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {extremal combinatorics, shannon capacity of graphs, permutations, infinite graphs},
URL = {http://link.aip.org/link/?SJD/20/203/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Murota/06,
AUTHOR = {Murota, Kazuo},
TITLE = {M-convex functions on jump systems: A general framework for minsquare graph factor problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {213-226},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {jump system, degree sequence, graph factor, discrete convex function, local optimality},
URL = {http://link.aip.org/link/?SJD/20/213/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Alpers-Gritzmann/06,
AUTHOR = {Alpers, Andreas and Gritzmann, Peter},
TITLE = {On stability, error correction, and noise compensation in discrete tomography},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {227-239},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {discrete tomography, stability, discrete inverse problems, computational complexity},
URL = {http://link.aip.org/link/?SJD/20/227/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dragan-Yan-Lomonosov/06,
AUTHOR = {Dragan, Feodor F. and Yan, Chenyu and Lomonosov, Irina},
TITLE = {Collective tree spanners of graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {240-260},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {sparse spanners, tree spanners, graph distance, balanced separator, graph decomposition, chordal graphs, c-chordal graphs, message routing, efficient algorithms},
URL = {http://link.aip.org/link/?SJD/20/240/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chekuri-Guha-Naor/06,
AUTHOR = {Chekuri, Chandra and Guha, Sudipto and Naor, Joseph (Seffi)},
TITLE = {The Steiner $k$-cut problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {1},
PAGES = {261-271},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {multiway cut, $k$-cut, steiner tree, minimum cut, linear program, approximation algorithm},
URL = {http://link.aip.org/link/?SJD/20/261/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kuhn-Osthus/06d,
AUTHOR = {K{\"u}hn, Daniela and Osthus, Deryk},
TITLE = {Multicolored Hamilton cycles and perfect matchings in pseudorandom graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {273-286},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {hamilton cycles, perfect matchings, random graphs, pseudorandom graphs},
URL = {http://link.aip.org/link/?SJD/20/273/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chen-Hwang/06a,
AUTHOR = {Chen, Hong-Bin and Hwang, Frank K.},
TITLE = {On multicast rearrangeable 3-stage Clos networks without first-stage fan-out},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {287-290},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {rearrange, clos networks, multicast, affine plane},
URL = {http://link.aip.org/link/?SJD/20/287/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Feder/06,
AUTHOR = {Feder, Tom{\'a}s},
TITLE = {A dichotomy theorem on fixed points of several nonexpansive mappings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {291-301},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {fixed points, nonexpansive mappings, product graphs, apiculate graphs, retractions},
URL = {http://link.aip.org/link/?SJD/20/291/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Griggs-Jin/06,
AUTHOR = {Griggs, Jerrold R. and Jin, Xiaohua Teresa},
TITLE = {Real number graph labellings with distance conditions},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {302-327},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {channel assignment, graph labelling, generalized coloring},
URL = {http://link.aip.org/link/?SJD/20/302/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Goldberg/06,
AUTHOR = {Goldberg, Paul W.},
TITLE = {A bound on the precision required to estimate a Boolean perceptron from its average satisfying assignment},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {328-343},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {boolean functions, threshold functions, geometry, inductive learning},
URL = {http://link.aip.org/link/?SJD/20/328/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bokal-Fijavz-Mohar/06,
AUTHOR = {Bokal, Drago and Fijav{\v{z}}, Ga{\v{s}}per and Mohar, Bojan},
TITLE = {The minor crossing number},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {344-356},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {crossing number, graph minor},
URL = {http://link.aip.org/link/?SJD/20/344/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Demaine-Hajiaghayi-Thilikos/06,
AUTHOR = {Demaine, Erik D. and Hajiaghayi, MohammadTaghi and Thilikos, Dimitrios M.},
TITLE = {The bidimensional theory of bounded-genus graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {357-371},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {treewidth, grids, graphs on surfaces, graph minors, graph contractions},
URL = {http://link.aip.org/link/?SJD/20/357/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Feder-Ford/06,
AUTHOR = {Feder, Tom{\'a}s and Ford, Daniel},
TITLE = {Classification of bipartite Boolean constraint satisfaction through delta-matroid intersection},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {372-394},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {boolean constraint satisfaction, delta matroids, blossoms},
URL = {http://link.aip.org/link/?SJD/20/372/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chung-Lu/06,
AUTHOR = {Chung, Fan and Lu, Linyuan},
TITLE = {The volume of the giant component of a random graph with given expected degrees},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {395-411},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {random graphs, expected degree sequences, giant connected component},
URL = {http://link.aip.org/link/?SJD/20/395/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bose-Devroye-Evans-Kirkpatrick/06,
AUTHOR = {Bose, Prosenjit and Devroye, Luc and Evans, William and Kirkpatrick, David},
TITLE = {On the spanning ratio of Gabriel graphs and $\beta$-skeletons},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {412-427},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {gabriel graph, $\beta$-skeletons, spanners, proximity graphs, probabilistic analysis, computational geometry, geometric spanners},
URL = {http://link.aip.org/link/?SJD/20/412/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fishburn-Roberts/06,
AUTHOR = {Fishburn, Peter C. and Roberts, Fred S.},
TITLE = {Full color theorems for $L(2,1)$-colorings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {428-443},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {distance-two colorings, no-hole colorings, channel assignment problems},
URL = {http://link.aip.org/link/?SJD/20/428/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Djidjev/06,
AUTHOR = {Djidjev, Hristo N.},
TITLE = {A linear-time algorithm for finding a maximal planar subgraph},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {444-462},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {planar graphs, planarity testing, incremental algorithms, graph planarization, data structures, triconnectivity},
URL = {http://link.aip.org/link/?SJD/20/444/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Coppersmith-Elkin/06,
AUTHOR = {Coppersmith, Don and Elkin, Michael},
TITLE = {Sparse sourcewise and pairwise distance preservers},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {463-501},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph theory, spanners, distance preservation},
URL = {http://link.aip.org/link/?SJD/20/463/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Weinard-Schnitger/06,
AUTHOR = {Weinard, Maik and Schnitger, Georg},
TITLE = {On the greedy superstring conjecture},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {502-522},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {superstring, dna fragment assembly, approximation, performance analysis},
URL = {http://link.aip.org/link/?SJD/20/502/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hoory-Szeider/06,
AUTHOR = {Hoory, Shlomo and Szeider, Stefan},
TITLE = {A note on unsatisfiable $k$-CNF formulas with few occurrences per variable},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {523-528},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {unsatisfiable cnf formulas, np-completeness, occurrence of variables},
URL = {http://link.aip.org/link/?SJD/20/523/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Rabern/06,
AUTHOR = {Rabern, Landon},
TITLE = {On graph associations},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {529-535},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph coloring, reed's conjecture},
URL = {http://link.aip.org/link/?SJD/20/529/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kral-Skrekovski-Tancer/06,
AUTHOR = {Kr{\'a}l', Daniel and {\v{S}}krekovski, Riste and Tancer, Martin},
TITLE = {Construction of large graphs with no optimal surjective $L(2,1)$-labelings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {2},
PAGES = {536-543},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {channel assignment problem, graph labeling with distance conditions},
URL = {http://link.aip.org/link/?SJD/20/536/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Jansen-Porkolab/06,
AUTHOR = {Jansen, Klaus and Porkolab, Lorant},
TITLE = {On preemptive resource constrained scheduling: Polynomial-time approximation schemes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {545-563},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {scheduling, linear programming, approximation algorithms},
URL = {http://link.aip.org/link/?SJD/20/545/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Akbari-Alipour-Fu-Lo/06,
AUTHOR = {Akbari, S. and Alipour, A. and Fu, H.L. and Lo, Y.H.},
TITLE = {Multicolored parallelisms of isomorphic spanning trees},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {564-567},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {complete graph, multicolored tree, parallelism},
URL = {http://link.aip.org/link/?SJD/20/564/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Xu-Qi/06,
AUTHOR = {Xu, Hong and Qi, Wen-Feng},
TITLE = {Autocorrelations of maximum period FCSR sequences},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {568-577},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {feedback with carry shift register, l-sequences, 2-adic numbers, autocorrelations, exponential sum},
URL = {http://link.aip.org/link/?SJD/20/568/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Geelen-Zhou/06,
AUTHOR = {Geelen, Jim and Zhou, Xiangqian},
TITLE = {A splitter theorem for internally 4-connected binary matroids},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {578-587},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {binary matroids, splitter theorem, 4-connectivity},
URL = {http://link.aip.org/link/?SJD/20/578/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Geelen-Gerards-Whittle/06a,
AUTHOR = {Geelen, Jim and Gerards, Bert and Whittle, Geoff},
TITLE = {Matroid $T$-connectivity},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {588-596},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {matroids, gallai's t-paths theorem, paths, connectivity, matching},
URL = {http://link.aip.org/link/?SJD/20/588/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gorgos-Hoang-Voloshin/06,
AUTHOR = {Gorgos, Ion and Ho{\`a}ng, Ch{\'{i}}nh T. and Voloshin, Vitaly},
TITLE = {A note on quasi-triangulated graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {597-602},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {triangulated graphs, chordal graphs, quasi-triangulated graphs},
URL = {http://link.aip.org/link/?SJD/20/597/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ma-Pu-Shen/06,
AUTHOR = {Ma, Jun and Pu, Liqun and Shen, Hao},
TITLE = {Cycle decompositions of $K_{n,n}-I$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {603-609},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {decomposition, cycle, complete bipartite graph, $1$-factor},
URL = {http://link.aip.org/link/?SJD/20/603/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Romik/06,
AUTHOR = {Romik, Dan},
TITLE = {Shortest paths in the tower of Hanoi graph and finite automata},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {610-622},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {tower of hanoi, finite automata, sierpinski gasket},
URL = {http://link.aip.org/link/?SJD/20/610/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Solymosi/06,
AUTHOR = {Solymosi, J{\'o}zsef},
TITLE = {Dense arrangements are locally very dense. I},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {623-627},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {point-line incidences, szemereditrotter theorem, regularity lemma},
URL = {http://link.aip.org/link/?SJD/20/623/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fagin-Kumar-Mahdian-Sivakumar-Vee/06,
AUTHOR = {Fagin, Ronald and Kumar, Ravi and Mahdian, Mohammad and Sivakumar, D. and Vee, Erik},
TITLE = {Comparing partial rankings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {628-648},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {partial ranking, bucket order, permutation, metric},
URL = {http://link.aip.org/link/?SJD/20/628/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Munarini/06,
AUTHOR = {Munarini, Emanuele},
TITLE = {A combinatorial interpretation of the Chebyshev polynomials},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {649-655},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {chebyshev polynomials, principle of inclusion-exclusion, generalized fences, generalized crowns, order ideals, multisets},
URL = {http://link.aip.org/link/?SJD/20/649/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fan-Puglisi-Smyth-Turpin/06,
AUTHOR = {Fan, Kangmin and Puglisi, Simon J. and Smyth, W.F. and Turpin, Andrew},
TITLE = {A new periodicity lemma},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {656-668},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {string, word, periodicity, square, repetition, run, maximal periodicity},
URL = {http://link.aip.org/link/?SJD/20/656/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Abueida-Sritharan/06,
AUTHOR = {Abueida, Atif and Sritharan, R.},
TITLE = {Cycle extendability and Hamiltonian cycles in chordal graph classes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {669-681},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {cycle, hamiltonian, extendability, chordal graph},
URL = {http://link.aip.org/link/?SJD/20/669/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chen-Faudree-Gould-Jacobson/06,
AUTHOR = {Chen, Guantao and Faudree, Ralph J. and Gould, Ronald J. and Jacobson, Michael S.},
TITLE = {Cycle extendability of Hamiltonian interval graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {682-689},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {interval graph, hamiltonian, cycle extendable},
URL = {http://link.aip.org/link/?SJD/20/682/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kral/06a,
AUTHOR = {Kr{\'a}l', Daniel},
TITLE = {The channel assignment problem with variable weights},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {690-704},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {channel assignment problem, graph labeling with distance conditions},
URL = {http://link.aip.org/link/?SJD/20/690/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Arias-Cowen-Laing-Rajaraman-Taka/06,
AUTHOR = {Arias, Marta and Cowen, Lenore J. and Laing, Kofi A. and Rajaraman, Rajmohan and Taka, Orjeta},
TITLE = {Compact routing with name independence},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {705-726},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {compact routing, name independence, stretch, routing table, networks},
URL = {http://link.aip.org/link/?SJD/20/705/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gat-Viks-Karp-Shamir-Sharan/06,
AUTHOR = {Gat-Viks, Irit and Karp, Richard M. and Shamir, Ron and Sharan, Roded},
TITLE = {Reconstructing chain functions in genetic networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {727-740},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {network reconstruction, experimental design},
URL = {http://link.aip.org/link/?SJD/20/727/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Axenovich-Martin/06b,
AUTHOR = {Axenovich, Maria and Martin, Ryan},
TITLE = {On the strong chromatic number of graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {741-747},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {strong chromatic number, triangle factors, transversals},
URL = {http://link.aip.org/link/?SJD/20/741/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kovaleva-Spieksma/06,
AUTHOR = {Kovaleva, Sofia and Spieksma, Frits C.R.},
TITLE = {Approximation algorithms for rectangle stabbing and interval stabbing problems},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {748-768},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {rectangle stabbing, approximation algorithms, combinatorial optimization},
URL = {http://link.aip.org/link/?SJD/20/748/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Milans-Clark/06,
AUTHOR = {Milans, Kevin and Clark, Bryan},
TITLE = {The complexity of graph pebbling},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {769-798},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {graph pebbling, complexity, ${\pi_2^{\mathrm{p}}}$-completeness},
URL = {http://link.aip.org/link/?SJD/20/769/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dong-Koh/06,
AUTHOR = {Dong, F.M. and Koh, K.M.},
TITLE = {On graphs having no chromatic zeros in (1,2)},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {3},
PAGES = {799-810},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {chromatic polynomial, chromatic zero},
URL = {http://link.aip.org/link/?SJD/20/799/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Lladser/06,
AUTHOR = {Lladser, Manuel},
TITLE = {Uniform formulae for coefficients of meromorphic functions in two variables --- Part I},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {811-828},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {asymptotic enumeration, analysis of algorithms, bivariate generating functions, canonical representations, coalescing saddles, combinatorial enumeration, discrete random structures, uniform asymptotic expansions},
URL = {http://link.aip.org/link/?SJD/20/811/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gould-Kostochka-Yu/06,
AUTHOR = {Gould, Ronald J. and Kostochka, Alexandr and Yu, Gexin},
TITLE = {On minimum degree implying that a graph is $H$-linked},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {829-840},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {minimum degree, connectivity, $k$-linked, $h$-linked},
URL = {http://link.aip.org/link/?SJD/20/829/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Jiang-Cook-Bruck/06,
AUTHOR = {Jiang, Anxiao (Andrew) and Cook, Matthew and Bruck, Jehoshua},
TITLE = {Optimal interleaving on tori},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {841-879},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {bursts, chromatic number, cluster, error-correcting code, lee distance, multidimensional interleaving, $t$-interleaving, torus},
URL = {http://link.aip.org/link/?SJD/20/841/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Juttner/06,
AUTHOR = {J{\"u}ttner, Alp{\'a}r},
TITLE = {On budgeted optimization problems},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {880-892},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {budgeted optimization, inverse problems, matroid intersections, submodular flows},
URL = {http://link.aip.org/link/?SJD/20/880/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fiorini/06,
AUTHOR = {Fiorini, Samuel},
TITLE = {$\{0, \frac{1}{2}\}$-cuts and the linear ordering problem: Surfaces that define facets},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {893-912},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {linear ordering problem, $\{0,\frac{1}{2}\}$-cut, surface, cyclic order, matching theory},
URL = {http://link.aip.org/link/?SJD/20/893/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gentile-Ventura-Weismantel/06,
AUTHOR = {Gentile, C. and Ventura, P. and Weismantel, R.},
TITLE = {Mod-2 cuts generation yields the convex hull of bounded integer feasible sets},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {913-919},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {integer programming, mod-2 cuts, convex hull},
URL = {http://link.aip.org/link/?SJD/20/913/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Szabo/06,
AUTHOR = {Szab{\'o}, S{\'a}ndor},
TITLE = {Factoring finite Abelian groups by subsets with maximal span},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {920-931},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {factorization of finite abelian groups, redei property, full-rank tilings},
URL = {http://link.aip.org/link/?SJD/20/920/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gimenez-Hlineny-Noy/06,
AUTHOR = {Gim{\'e}nez, Omer and Hlin{\v{e}}n{\'y}, Petr and Noy, Marc},
TITLE = {Computing the Tutte polynomial on graphs of bounded clique-width},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {932-946},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {tutte polynomial, cographs, clique-width, subexponential algorithm, $u$ polynomial},
URL = {http://link.aip.org/link/?SJD/20/932/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Martinez-Moro-Rua/06,
AUTHOR = {Mart{\'{i}}nez-Moro, E. and R{\'u}a, I.F.},
TITLE = {Multivariable codes over finite chain rings: Serial codes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {947-959},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {finite chain ring, multivariate codes, serial codes},
URL = {http://link.aip.org/link/?SJD/20/947/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Klazar/06,
AUTHOR = {Klazar, Martin},
TITLE = {On identities concerning the numbers of crossings and nestings of two edges in matchings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {960-976},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {matching, crossing, nesting},
URL = {http://link.aip.org/link/?SJD/20/960/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kabadi-Punnen/06,
AUTHOR = {Kabadi, Santosh N. and Punnen, Abraham P.},
TITLE = {On cost matrices with two and three distinct values of Hamiltonian paths and cycles},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {977-998},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {combinatorial optimization, graphs, hamiltonian cycles, hamiltonian paths, approximation algorithms},
URL = {http://link.aip.org/link/?SJD/20/977/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Little-Schenck/06,
AUTHOR = {Little, John and Schenck, Hal},
TITLE = {Toric surface codes and Minkowski sums},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {999-1014},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {toric variety, coding theory, minkowski sum},
URL = {http://link.aip.org/link/?SJD/20/999/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Epstein/06,
AUTHOR = {Epstein, Leah},
TITLE = {Online bin packing with cardinality constraints},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {1015-1030},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {online algorithms, bin packing, cardinality constraints},
URL = {http://link.aip.org/link/?SJD/20/1015/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Keevash-Mubayi-Wilson/06,
AUTHOR = {Keevash, Peter and Mubayi, Dhruv and Wilson, Richard M.},
TITLE = {Set systems with no singleton intersection},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {1031-1041},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {extremal set theory, restricted intersections},
URL = {http://link.aip.org/link/?SJD/20/1031/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Geelen-Humphries/06,
AUTHOR = {Geelen, Jim and Humphries, Peter J.},
TITLE = {Rota's basis conjecture for paving matroids},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {1042-1045},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {rota's basis conjecture, paving matroids},
URL = {http://link.aip.org/link/?SJD/20/1042/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Padro-Gracia/06,
AUTHOR = {Padr{\'o}, Carles and Gracia, Ignacio},
TITLE = {Representing small identically self-dual matroids by self-dual codes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {1046-1055},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {identically self-dual matroids, self-dual codes, multiparty computation, multiplicative linear secret sharing schemes},
URL = {http://link.aip.org/link/?SJD/20/1046/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fekete-Kohler-Teich/06,
AUTHOR = {Fekete, S{\'a}ndor P. and K{\"o}hler, Ekkehard and Teich, J{\"u}rgen},
TITLE = {Higher-dimensional packing with order constraints},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {20},
NUMBER = {4},
PAGES = {1056-1078},
YEAR = {2006},
EDITOR = {Griggs, J.R.},
KEYWORDS = {higher-dimensional packing, higher-dimensional scheduling, reconfigurable computing, precedence constraints, exact algorithms, modular decomposition},
URL = {http://link.aip.org/link/?SJD/20/1056/1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}