SIAM Journal on Discrete Mathematics, Volume 21

Volume 21, Number 1, 2007

• Oktay Günlük:
  A New Min-Cut Max-Flow Ratio for Multicommodity Flows. 1-15
  
• J. Sawada:
  A Simple Gray Code to List All Minimal Signed Binary Representations. 16-25
  
• Bostjan Bresar, Sandi Klavzar:
  Crossing Graphs as Joins of Graphs and Cartesian Products of Median Graphs. 26-32
  
• Stephan G. Wagner:
  Correlation of Graph-Theoretical Indices. 33-46
  
• S. Barik, S. Pati, B. K. Sarma:
  The Spectrum of the Corona of Two Graphs. 47-56
  
• Josep Díaz, Dieter Mitsche, Xavier Pérez:
  Sharp Threshold for Hamiltonicity of Random Geometric Graphs. 57-65
  
• Noga Alon, Anja Krech, Tibor Szabó:
  Tur[a-acute]n's Theorem in the Hypercube. 66-72
  
• Christian Avart, Vojtech Rödl, Mathias Schacht:
  Every Monotone 3-Graph Property is Testable. 73-92
  
• Richard Cole, Lukasz Kowalik, Riste Skrekovski:
  A Generalization of Kotzig's Theorem and Its Application. 93-106
  
• Yusuke Kobayashi, Kazuo Murota, Kenichiro Tanaka:
  Operations on M-Convex Functions on Jump Systems. 107-129
  
• Anna de Mier:
  A Natural Family of Flag Matroids. 130-140
  
• Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman:
  Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. 141-157
  
• Miroslav Chlebík, Janka Chlebíková:
  The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes. 158-169
  
• Ian D. Gray:
  Vertex-Magic Total Labelings of Regular Graphs. 170-177
  
• Bernd Gärtner, Volker Kaibel:
  Two New Bounds for the Random-Edge Simplex-Algorithm. 178-190
  
• Imre Bárány, Jirí Matousek:
  Quadratically Many Colorful Simplices. 191-198
  
• Ramesh Neelamani, Sanjeeb Dash, Richard G. Baraniuk:
  On Nearly Orthogonal Lattice Bases and Random Lattices. 199-219
  
• Matthias Köppe:
  A Primal Barvinok Algorithm Based on Irrational Decompositions. 220-236
  
• Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
  Adjacent Vertex Distinguishing Edge-Colorings. 237-250
  
• Camino Balbuena, Pedro García-Vázquez:
  On the Minimum Order of Extremal Graphs to have a Prescribed Girth. 251-257
  
• Margit Voigt:
  Precoloring Extension for 2-connected Graphs. 258-263
  
• Maria Axenovich, József Balogh:
  Graphs Having Small Number of Sizes on Induced k-Subgraphs. 264-272
  

Volume 21, Number 2, 2007

• Michele Conforti, Bert Gerards:
  Packing Odd Circuits. 273-302
  
• Tamon Stephen:
  A Majorization Bound for the Eigenvalues of Some Graph Laplacians. 303-312
  
• Giuseppe Paletta, Paolamaria Pietramala:
  A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors. 313-328
  
• Noga Alon, Eyal Lubetzky:
  Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon. 329-348
  
• Márton Makai:
  On Maximum Cost K_{{t, t}}-Free t-Matchings of Bipartite Graphs. 349-360
  
• Guy Kortsarz, Sunil M. Shende:
  An Improved Approximation of the Achromatic Number on Bipartite Graphs. 361-373
  
• Jaroslav Nesetril, Ida Svejdarová:
  Small Diameters of Duals. 374-384
  
• Micha A. Perles, Rom Pinchasi:
  Forbidden k-Sets in the Plane. 385-395
  
• Michele Conforti, Marco Di Summa, Laurence A. Wolsey:
  The Mixing Set with Flows. 396-407
  
• David Kravitz:
  RANDOM 2-SAT Does Not Depend on a Giant. 408-422
  
• José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas, Carlos Seara, David R. Wood:
  On the Metric Dimension of Cartesian Products of Graphs. 423-441
  
• Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
  Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs. 442-460
  
• Matt DeVos, Javad Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr:
  Circular Coloring the Plane. 461-465
  
• Sorin Constantinescu, Lucian Ilie:
  The Lempel--Ziv Complexity of Fixed Points of Morphisms. 466-481
  
• Cor A. J. Hurkens, J. C. M. Keijsper, Leen Stougie:
  Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks. 482-503
  
• Akiyoshi Shioura, Kenichiro Tanaka:
  Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems. 504-522
  
• Stephen G. Hartke, Jennifer Vandenbussche, Paul S. Wenger:
  Further Results on Bar k-Visibility Graphs. 523-531
  
• Ronald L. Graham, Minming Li, Frances F. Yao:
  Optimal Tree Structures for Group Key Management with Batch Updates. 532-547
  
• Rongquan Feng, Jin Ho Kwak, Young Soo Kwon:
  Erratum: Enumerating Typical Circulant Covering Projections onto a Circulant Graph. 548-550
  

Volume 21, Number 3, 2007

• Hande Yaman:
  The Integer Knapsack Cover Polyhedron. 551-572
  
• Anne Berry, Martin Charles Golumbic, Marina Lipshteyn:
  Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. 573-591
  
• Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp:
  Prefix Reversals on Binary and Ternary Strings. 592-611
  
• Joseph Cheriyan, Adrian Vetta:
  Approximation Algorithms for Network Design with Metric Costs. 612-636
  
• Kenneth A. Berman:
  Locating Servers for Reliability and Affine Embeddings. 637-646
  
• A. Vince:
  Discrete Lines and Wandering Paths. 647-661
  
• Denis Cornaz, Ali Ridha Mahjoub:
  The Maximum Induced Bipartite Subgraph Problem with Edge Weights. 662-675
  
• Shakhar Smorodinsky:
  On The Chromatic Number of Geometric Hypergraphs. 676-687
  
• Robert Babilon, Vít Jelínek, Daniel Král, Pavel Valtr:
  Labelings of Graphs with Fixed and Variable Edge-Weights. 688-706
  
• Roel Apfelbaum, Micha Sharir:
  Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes. 707-725
  
• Qi Cheng:
  Constructing Finite Field Extensions with Large Order Elements. 726-730
  
• Jeffrey A. Ryan:
  A Two-Set Problem on Coloring the Integers. 731-736
  
• Gábor Tardos, Géza Tóth:
  Crossing Stars in Topological Graphs. 737-749
  
• Simon Spacapan:
  Optimal Lee-Type Local Structures in Cartesian Products of Cycles and Paths. 750-762
  
• Domingo Gómez, Jaime Gutierrez, Álvar Ibeas:
  Cayley Digraphs of Finite Abelian Groups and Monomial Ideals. 763-784
  
• T. L. Alderson, Keith E. Mellinger:
  Constructions of Optical Orthogonal Codes from Finite Geometry. 785-793
  
• Bruce M. Landman, Aaron Robertson:
  Avoiding Monochromatic Sequences With Special Gaps. 794-801
  
• Jim Geelen, Kerri Webb:
  On Rota's Basis Conjecture. 802-804
  
• Yeow Meng Chee, Alan C. H. Ling:
  On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges. 805-821
  

Volume 21, Number 4, 2007/2008

• Jean-Claude Bermond, Afonso Ferreira, Stéphane Pérennes, Joseph G. Peters:
  Neighborhood Broadcasting in Hypercubes. 823-843
  
• Hong-Jian Lai:
  Mod (2p + 1)-Orientations and $K_1,2p+1-Decompositions. 844-850
  
• Gennian Ge, Alan C. H. Ling:
  On the Existence of K_{5 \setminuse}-Designs with Application to Optical Networks. 851-864
  
• Harald Niederreiter, Ferruh Özbudak:
  Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields. 865-899
  
• Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan:
  The Complexity of the List Partition Problem for Graphs. 900-929
  
• Rajeev Motwani, Assaf Naor, Rina Panigrahy:
  Lower Bounds on Locality Sensitive Hashing. 930-935
  
• Ken Takata:
  A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph. 936-946
  
• Boris Pittel, Larry Shepp, Eugene Veklerov:
  On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem. 947-958
  
• Koji Momihara, Meinard Müller, Junya Satoh, Masakazu Jimbo:
  Constant Weight Conflict-Avoiding Codes. 959-979
  
• Benny Sudakov:
  Ramsey Numbers and the Size of Graphs. 980-986
  
• Robert H. Sloan, Balázs Szörényi, György Turán:
  On k-Term DNF with the Largest Number of Prime Implicants. 987-998
  
• Benjamin Lévêque, Frédéric Maffray:
  Coloring Bull-Free Perfectly Contractile Graphs. 999-1018
  
• Moshe Dror, James B. Orlin:
  Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets. 1019-1034
  
• Peter Dankelmann, Simon Mukwembi, Henda C. Swart:
  Average Distance and Edge-Connectivity II. 1035-1052
  
• Linyuan Lu:
  Explicit Construction of Small Folkman Graphs. 1053-1060
  
• Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi:
  Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. 1061-1070
  
• K. S. Sudeep, Sundar Vishwanathan:
  Matched-Factor $d$-Domatic Coloring of Graphs. 1071-1082
  
• Liqun Pu, Hao Shen, Jun Ma, San Ling:
  Cycle Systems in the Complete Bipartite Graph Plus a One-Factor. 1083-1092
  

Last update Fri May 24 18:00:32 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page