2004-07-15 On Existence of t-Designs with Large v and lambda. 98-104 1988 1 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm1.html#Ray-ChaudhuriS88 2003-11-27 On Covering a Bipartite Graph with Cycles. 86-96 2001 15 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/31048 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm15.html#Wang01 2003-11-27 Finding a 2-Core of a Tree in Linear Time. 193-210 2002 15 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/37424 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm15.html#Wang02 2003-11-27 Tight Bounds for Dynamic Storage Allocation. 155-166 1996 9 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/25647 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm9.html#LubyNO96 2003-11-27 Linear Steiner Trees for Infinite Spirals. 388-398 1997 10 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/27403 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#Weng97 2003-11-27 Monochromatic Partitions of Complete Uniform Hypergraphs. 286-290 2001 14 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/35771 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm14.html#BrysL01 2003-11-27 On the Influence of Single Participant in Coin Flipping Schemes. 411-415 1988 1 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm1.html#ChorG88 2003-11-27 A Zero-One Law for Boolean Privacy. 36-47 1991 4 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm4.html#ChorK91 2003-11-27 A Geometric Approach to Betweenness. 511-523 1998 11 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/29622 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm11.html#ChorS98 2003-11-27 <i>k</i>-Payment Problem. 436-453 2000 13 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/31811 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm13.html#Patt-ShamirTF00 2003-11-27 Images and Preimages in Random Mappings. 246-269 1997 10 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/26842 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#DrmotaS97 2003-11-27 Switching Distance Between Graphs with the Same Degrees. 298-306 1999 12 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/33115 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm12.html#Will99 2003-11-27 Labelling Graphs with a Condition at Distance 2. 586-595 1992 5 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm5.html#GriggsY92 2003-11-27 Reciprocal Sums over Partitions and Compositions. 388-399 1993 6 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm6.html#KnopfmacherR93 2003-11-27 Pebbling in Hypercubes. 467-472 1989 2 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm2.html#Chung89 2003-11-27 Weak Three-Linking in Eulerian Digraphs. 84-98 1991 4 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm4.html#IbarakiP91 2003-11-27 On the Distribution of Diffie-Hellman Triples with Sparse Exponents. 162-169 2001 14 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/36174 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm14.html#FriedlanderS01 2003-11-27 Tree-Matchings in Graph Processes. 107-120 1991 4 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm4.html#LuczakR91 2003-11-27 A Greedy Algorithm Estimating the Height of Random Trees. 318-329 1998 11 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/25896 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm11.html#Luczak98 2003-11-27 An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing. 458-470 2001 14 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/36994 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm14.html#Seiden01 2003-11-27 Low Rank Matrices with a Given Sign Pattern. 51-63 1989 2 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm2.html#DelsarteK89 2003-11-27 Search Problems in the Decision Tree Model. 119-132 1995 8 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/23386 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm8.html#LovaszNNW95 2003-11-27 Tight Bounds on Minimum Broadcast Networks. 207-222 1991 4 SIAM J. Discrete Math. 2 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm4.html#GrigniP91 2003-11-27 Fourier Analysis of a Class of Finite Radon Transforms. 545-554 2003 16 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/41639 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm16.html#Scarabotti03 2003-11-27 Dynamic Steiner Tree Problem. 369-384 1991 4 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm4.html#ImaseW91 2003-11-27 On Generalized Delannoy Paths. 208-223 2003 16 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/38740 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm16.html#AutebertS03 2003-11-27 A Class of Polynomially Solvable Set-Covering Problems. 306-316 1988 1 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm1.html#BertolazziS88 2003-11-27 Representations of Graphs on a Cylinder. 139-149 1991 4 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm4.html#TamassiaT91 2004-02-18 A Fundamental Monotonicity in Group Testing. 256-259 1988 1 SIAM J. Discrete Math. 2 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm1.html#YaoH88 2003-11-27 Cycle Lengths and Graph Orientations. 544- 1990 3 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm3.html#PretzelY90 2003-11-27 The Complexity of the Hajos Calculus. 464-483 1995 8 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/24024 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm8.html#PitassiU95 2003-11-27 New Facets of the Linear Ordering Polytope. 326-336 1999 12 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/30014 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm12.html#BolotashviliKG99 2003-11-27 Labeling Products of Complete Graphs with a Condition at Distance Two. 28-35 2001 14 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/35185 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm14.html#GeorgesMS01 2003-11-27 Infinite Graphs with Nonconstant Dirichlet Finite Harmonic Functions. 380-385 1992 5 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm5.html#CartwrightW92 2003-11-27 <i>k</i><i>n</i>-Set. 598-604 1994 7 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/22086 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm7.html#Hurlbert94 2003-11-27 The Complexity of the Extendibility Problem for Finite Posets. 114-121 2003 17 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/38947 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm17.html#LaroseZ03 2003-11-27 Edge-Connectivity Augmentation Preserving Simplicity. 603-623 1998 11 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/31887 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm11.html#Bang-JensenJ98 2003-11-27 A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs. 366-376 1992 5 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm5.html#Bang-JensenT92 2003-11-27 Generalizations of the Normal Basis Theorem of Finite Fields. 330-337 1990 3 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm3.html#BshoutyS90 2003-11-27 Calcul Saalschützien des Partitions et des Dérangements Colorés. 149-156 1990 3 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm3.html#Zeng90 2003-11-27 Hypercubes and Multicommodity Flows. 190-200 1997 10 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/26560 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#YuCH97 2005-01-28 A Matter of Degree. 456-466 1989 2 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm2.html#ChartrandHOSS89 2003-11-27 Obstructions For 2-Möbius Band Embedding Extension Problem. 57-72 1997 10 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/26415 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#JuvanM97 2003-11-27 A Lower Bound for Adjacencies on the Traveling Salesman Polytope. 431-435 1997 10 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/28379 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#Sarangarajan97 2003-11-27 Almost Every Randomly Near-Traceable Graph Has Diameter at Most Two. 260-268 1988 1 SIAM J. Discrete Math. 2 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm1.html#Zhou88 2003-11-27 On the Nonmultiplicativity of Oriented Cycles. 207-218 1992 5 SIAM J. Discrete Math. 2 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm5.html#Zhou92 2003-11-27 Characterization of the Homomorphic Preimages of Certain Oriented Cycles. 87-99 1993 6 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm6.html#Zhou93 2003-11-27 List Partitions. 449-478 2003 16 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/38405 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm16.html#FederHKM03 2003-11-27 On the Weakness of an Ordered Set. 655-663 1998 11 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/31962 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm11.html#GimbelT98 2003-11-27 Overlap and Covering Polynomials with Applications to Designs and Self-Dual Codes. 154-178 2000 13 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/34176 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm13.html#Janusz00 2003-11-27 Universal Chains and Wiring Layouts. 80-85 1988 1 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm1.html#Paterson88 2003-11-27 A Bound of 4 for the Diameter of the Symmetric Traveling Salesman Polytope. 373-380 1998 11 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/31246 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm11.html#RispoliC98 2003-11-27 On the Number of Distinct Forests. 574-581 1990 3 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm3.html#Takacs90 2003-11-27 2-Competition Graphs. 524-538 1992 5 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm5.html#IsaakKMMR92 2003-11-27 Laplacian Permanents of Trees. 460-466 1992 5 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm5.html#BottiMV92 2003-11-27 <i>n+1</i><i>n</i>. 491-500 1993 6 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm6.html#Torocsik93 2003-11-27 On Path-Tough Graphs. 571-584 1994 7 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/24276 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm7.html#DankelmannNS94 2003-11-27 Matchings in the Partition Lattice. 100-109 1993 6 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm6.html#Canfield93 2003-11-27 Advantageous Properties of Dual Transhipment Polyhedra. 157-167 1990 3 SIAM J. Discrete Math. 2 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm3.html#AdlerC90 2005-09-06 Steiner Distance-Hereditary Graphs. 437-442 1994 7 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/22503 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm7.html#DayOS94 2003-11-27 Cyclic Chromatic Number of 3-Connected Plane Graphs. 121-137 2001 14 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/34615 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm14.html#EnomotoHJ01 2003-11-27 On the Structure of the Strong Orientations of a Graph. 30-43 1993 6 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm6.html#DonaldE93 2003-11-27 Hamiltonian Properties of Grid Graphs. 564-570 1992 5 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm5.html#ZamfirescuZ92 2003-11-27 The Combinatorics of Perfect Authentication Schemes. 102-107 1994 7 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/17818 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm7.html#MitchellWW94 2003-11-27 An Almost Linear Time Algorithm for Generalized Matrix Searching. 81-97 1990 3 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm3.html#KlaweK90 2003-11-27 A Tight Lower Bound on the Size of Planar Permutation Networks. 558-563 1992 5 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm5.html#KlaweL92 2003-11-27 Upper and Lower Bounds on Constructing Alphabetic Binary Trees. 638-651 1995 8 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/25665 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm8.html#KlaweM95 2003-11-27 Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location. 50-64 1988 1 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm1.html#HaimovichM88 2003-11-27 Locally Symmetric Graphs of Prescribed Girth and Coxeter Groups. 277-280 1990 3 SIAM J. Discrete Math. 2 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm3.html#Lubotzky90 2003-11-27 Thicknesses of Ordered Sets. 489-501 1990 3 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm3.html#Fishburn90a 2003-11-27 Super Arrovian Domains with Strict Preferences. 83-95 1997 10 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/26350 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#FishburnK97 2003-11-27 Bell Inequalities, Grothendieck's Constant, and Root Two. 48-56 1994 7 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/21935 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm7.html#FishburnR94 2003-11-27 Interference Patterns in Regular Graphs with Bijective Colorings. 382-402 2002 15 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/38234 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm15.html#FishburnW02 2003-11-27 Competition Graphs of Hamiltonian Digraphs. 128-134 1998 11 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/29735 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm11.html#Guichard98 2003-11-27 Dual Eulerian Properties of Plane Multigraphs. 33-50 1995 8 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/23817 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm8.html#CarlsonCM95 2003-11-27 Equitable Coloring of k-Uniform Hypergraphs. 524-532 2003 16 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/40276 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm16.html#Yuster03 2003-11-27 Detachments Preserving Local Edge-Connectivity of Graphs. 72-87 2003 17 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/36393 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm17.html#JordanS03 2003-11-27 Transversals of Vertex Partitions in Graphs. 206-215 1990 3 SIAM J. Discrete Math. 2 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm3.html#Fellows90 2003-11-27 Partial Cubes and Crossing Graphs. 235-251 2002 15 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/38320 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm15.html#KlavzarM02 2003-11-27 Sorting Strings by Reversals and by Transpositions. 193-206 2001 14 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/33199 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm14.html#ChristieI01 2003-11-27 Infinite Families of 3-Designs from Z4-Goethals Codes with Block Size 8. 289-304 2002 15 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/38588 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm15.html#Ranto02 2003-11-27 The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs. 403-418 1994 7 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/17704 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm7.html#HartvigsenM94 2003-11-27 On the Contour of Random Trees. 434-458 1999 12 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/28992 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm12.html#Gittenberger99 2003-11-27 The Wakeup Problem in Synchronous Broadcast Systems. 207-222 2001 14 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/37602 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm14.html#GasieniecPP01 2003-11-27 On Convex Subsets in Tournaments. 63-70 1996 9 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/25123 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm9.html#HaglinW96 2003-11-27 Perfect Graphs and Orthogonally Convex Covers. 371-392 1989 2 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm2.html#MotwaniRS89 2003-11-27 The Union of Matroids and the Rigidity of Frameworks. 237-255 1988 1 SIAM J. Discrete Math. 2 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm1.html#Whiteley88 2003-11-27 Stirling Numbers for Complex Arguments. 73-82 1997 10 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/28432 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#RichmondM97 2003-11-27 Polyhedral Properties of Clutter Amalgam. 139-151 1993 6 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm6.html#NobiliS93 2003-11-27 Motion Planning, Two-Directional Point Representations, and Ordered Sets. 151-163 1991 4 SIAM J. Discrete Math. 2 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm4.html#Al-ThukairPRU91 2003-11-27 The Number of Irreducible Polynomials and Lyndon Words with Given Trace. 240-245 2001 14 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/36805 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm14.html#RuskeyMS01 2003-11-27 Constrained Edge-Splitting Problems. 88-102 2003 17 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/36448 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm17.html#Jordan03 2003-11-27 Implicit Representation of Graphs. 596-603 1992 5 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm5.html#KannanNR92 2003-11-27 Asymptotic Analysis of some Network Reliability Models. 14-21 1988 1 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm1.html#Bienstock88 2003-11-27 Canonical Encoders for Sliding Block Decoders. 555-605 1995 8 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/24431 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm8.html#AshleyM95 2003-11-27 ₂k-Linear and Quaternary Codes. 103-113 2003 17 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/39721 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm17.html#Tapia-RecillasV03 2003-11-27 A Note on Planar Graphs and Circle Orders. 448-451 1991 4 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm4.html#Scheinerman91 2003-11-27 Generalized Chromatic Numbers of Random Graphs. 74-80 1992 5 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm5.html#Scheinerman92 2003-11-27 <i>^N</i>. 377-379 1992 5 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm5.html#BenjaminJ92 2003-11-27 On Coset Weight Distributions of the 3-Error-Correcting BCH-Codes. 128-145 1997 10 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/29443 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#CharpinZ97 2003-11-27 The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees. 450-465 1990 3 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm3.html#Aldous90 2003-11-27 <i>st</i>-Numberings. 268-279 2000 13 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/33329 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm13.html#AnnexsteinB00 2003-11-27 On Solving Rational Congruences. 73-90 1989 2 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm2.html#Jeaschke89 2003-11-27 The Obnoxious Center Problem on a Tree. 498-509 2001 14 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/34096 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm14.html#BurkardDLR01 2003-11-27 Quick Gossiping by Conference Calls. 109-120 1988 1 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm1.html#Seress88 2003-11-27 Node-Packing Problems with Integer Rounding Properties. 407-412 1989 2 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm2.html#TipnisT89 2005-07-29 An Extremal Problem on Sparse 0-1 Matrices. 17-27 1991 4 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm4.html#BienstockG91 2003-11-27 Subset-Restricted Interchange for Dynamic Min-Max Scheduling Problems. 419-435 2000 13 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/34341 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm13.html#SteinerS00 2003-11-27 Load Balancing in Quorum Systems. 223-245 1997 10 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/26030 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#HolzmanMP97 2003-11-27 Computing Edge-Connectivity in Multigraphs and Capacitated Graphs. 54-66 1992 5 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm5.html#NagamochiI92 2003-11-27 Sliceable Floorplanning by Graph Dualization. 258-280 1995 8 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/26670 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm8.html#YeapS95 2004-09-28 Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications. 562-575 2002 15 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/38790 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm15.html#SteelS02 2005-06-06 <i>S</i>-Series. 253-274 1991 4 SIAM J. Discrete Math. 2 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm4.html#RemmelY91 2003-11-27 Randomness in Private Computations. 647-661 1997 10 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/30613 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#KushilevitzM97 2003-11-27 A Randomness-Rounds Tradeoff in Private Computation. 61-80 1998 11 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/27634 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm11.html#KushilevitzR98 2003-11-27 Polynomial Bound for a Chip Firing Game on Graphs. 397-398 1988 1 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm1.html#Tardos88 2003-11-27 Sorting by Transpositions. 224-240 1998 11 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/28280 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm11.html#BafnaP98 2003-11-27 Almost Safe Gossiping in Bounded Degree Networks. 338-344 1992 5 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm5.html#DiksP92 2003-11-27 Counting Claw-Free Cubic Graphs. 65-73 2002 16 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/27477 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm16.html#PalmerRR02 2003-11-27 An Optimal Acceptance Policy for an Urn Scheme. 183-195 1998 11 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/28214 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm11.html#ChenZOS98 2003-11-27 Competition Graphs of Strongly Connected and Hamiltonian Digraphs. 179-185 1995 8 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/19723 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm8.html#FraughnaughLMMP95 2003-11-27 ₄. 511-516 2003 16 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/41734 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm16.html#GijswijtS03 2006-05-23 Maximal Chains and Antichains in Boolean Lattices. 197-205 1990 3 SIAM J. Discrete Math. 2 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm3.html#DuffusSW90 2003-11-27 On Approximating the Achromatic Number. 408-422 2001 14 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/37957 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm14.html#KortsarzK01 2003-11-27 Approximation Algorithms for Minimum-Time Broadcast. 401-427 1995 8 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/24592 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm8.html#KortsarzP95 2003-11-27 Universal Graphs for Bounded-Degree Trees and Planar Graphs. 145-155 1989 2 SIAM J. Discrete Math. 2 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm2.html#BhattCLR89 2003-11-27 Salvage-Embeddings of Complete Trees. 617-637 1995 8 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/24127 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm8.html#BhattCLR95 2003-11-27 Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs. 433-445 2001 14 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/30499 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm14.html#Daneshgar01 2003-11-27 Projections of Binary Linear Codes onto Larger Fields. 591-603 2003 16 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/40436 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm16.html#KimMP03 2003-11-27 Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs. 344-358 1994 7 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/18266 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm7.html#BarahonaM94 2003-11-27 Analysis of an Infinite Product Algorithm. 1-15 1989 2 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm2.html#AlloucheHS89 2003-11-27 _nand Related Graphs. 499-506 1995 8 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/24282 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm8.html#WhittleseyGM95 2006-03-08 On Restricted Two-Factors. 472-484 1988 1 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm1.html#HellKKK88 2003-11-27 ⁹₉₆₃Revisited. 670-677 1995 8 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/25094 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm8.html#BokowskiS95 2003-11-27 Medians and Majorities in Semimodular Lattices. 266-276 1990 3 SIAM J. Discrete Math. 2 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm3.html#Leclerc90 2003-11-27 <i>k</i>-of-Each Problem. 18-29 1997 10 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/26855 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#Linusson97 2003-11-27 Minimum Edge Dominating Sets. 375-387 1993 6 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm6.html#HortonK93 2003-11-27 Bounding the Size of Planar Intertwines. 337-358 1997 10 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/23993 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#GuptaI97 2003-11-27 Approximate Core Allocation for Binpacking Games. 387-399 1998 11 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/30807 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm11.html#FaigleK98 2003-11-27 A Mathematical Model for Periodic Scheduling Problems. 550-581 1989 2 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm2.html#SerafiniU89 2003-11-27 Embedding de Bruijn and Schuffle-Exchange Graphs in Five Pages. 642-654 1993 6 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm6.html#Obrenic93 2003-11-27 Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs. 505-514 1997 10 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/25981 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#BaiouM97 2003-11-27 Reserving Resilient Capacity in a Network. 524-539 2001 14 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/36818 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm14.html#BrightwellOS01 2003-11-27 On the Interplay Between Interval Dimension and Dimension. 32-40 1994 7 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/21885 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm7.html#FelsnerHM94 2003-11-27 Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes. 317-328 2002 15 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/31118 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm15.html#AshirS02 2003-11-27 Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups. 157-167 1998 11 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/28645 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm11.html#FiducciaFZ98 2003-11-27 Chip-Firing Games on Mutating Graphs. 118-128 1996 9 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/24028 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm9.html#Eriksson96 2003-11-27 Interactive Communication of Balanced Distributions and of Correlated Files. 548-564 1993 6 SIAM J. Discrete Math. 4 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm6.html#Orlitsky93 2003-11-27 Gaussian Elimination with Pivoting is P-Complete. 413-423 1989 2 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm2.html#Vavasis89 2003-11-27 Some New Aspects of the Coupon Collector's Problem. 1-17 2003 17 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/40307 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm17.html#MyersW03 2003-11-27 The Graphs with All Subgraphs T-Perfect. 524-545 1998 11 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/30636 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm11.html#GerardsS98 2003-11-27 The Private Neighbor Cube. 41-47 1994 7 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/19902 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm7.html#FellowsFHJ94 2003-11-27 The Weighted Sparsity Problem: Complexity and Algorithms. 57-69 1993 6 SIAM J. Discrete Math. 1 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm6.html#McCormickC93 2003-11-27 Median Graphs and Triangle-Free Graphs. 111-118 1999 12 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/32349 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm12.html#ImrichKM99 2003-11-27 Approximating Bandwidth by Mixing Layouts of Interval Graphs. 435-449 2002 15 SIAM J. Discrete Math. 4 http://epubs.siam.org/sam-bin/dbq/article/35962 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm15.html#KratschS02 2003-11-27 Domination on Cocomparability Graphs. 400-417 1993 6 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm6.html#KratschS93 2003-11-27 Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs. 283-288 2002 15 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/35113 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm15.html#Rizzi02 2003-11-27 <i>K</i>-Center Problem. 403-418 2000 13 SIAM J. Discrete Math. 3 http://epubs.siam.org/sam-bin/dbq/article/32977 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm13.html#KhullerS00 2003-11-27 Certain Occupancy Numbers via an Algorithm for Computing Their Ratios. 360-371 1988 1 SIAM J. Discrete Math. 3 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm1.html#LangenhopW88 2003-11-27 Determining When the Absolute State Complexity of a Hermitian Code Achieves Its DLP Bound. 14-40 2001 15 SIAM J. Discrete Math. 1 http://epubs.siam.org/sam-bin/dbq/article/37643 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm15.html#BlackmoreN01 2003-11-27 On the Dimension of the Hull. 282-293 1997 10 SIAM J. Discrete Math. 2 http://epubs.siam.org/sam-bin/dbq/article/29402 http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm10.html#Sendrier97 2003-11-27 Improved Space for Bounded-Space, On-Line Bin-Packing. 575-581 1993 6 SIAM J. Discrete Math.