SIAM Journal on Discrete Mathematics, Volume 25

Volume 25, Number 1, 2011

• Mourad Baïou, Francisco Barahona, José R. Correa:
  On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms. 1-20
  
• György Dósa, Leah Epstein:
  Preemptive Online Scheduling with Reordering. 21-49
  
• Alina Ostafe, Igor Shparlinski:
  Pseudorandomness and Dynamics of Fermat Quotients. 50-71
  
• Christine T. Cheng, Anhua Lin:
  Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings. 72-94
  
• Markus Chimani:
  Facets in the Crossing Number Polytope. 95-111
  
• Stefan Felsner, Mareike Massow:
  Linear Extension Diameter of Downset Lattices of Two-Dimensional Posets. 112-129
  
• Dimitris Magos, Ioannis Mourtos:
  On the Facial Structure of the Alldifferent System. 130-158
  
• Brendon Stanton:
  Improved Bounds for r-Identifying Codes of the Hex Grid. 159-169
  
• Ararat Harutyunyan, Bojan Mohar:
  Gallai's Theorem for List Coloring of Digraphs. 170-180
  
• Michael Elkin, Shay Solomon:
  Narrow-Shallow-Low-Light Trees with and without Steiner Points. 181-210
  
• Seth Pettie:
  Origins of Nonlinearity in Davenport-Schinzel Sequences. 211-233
  
• Omid Amini, Simon Griffiths, Florian Huc:
  Subgraphs of Weakly Quasi-Random Oriented Graphs. 234-259
  
• Serguei Norine:
  Turán Graphs and the Number of Colorings. 260-266
  
• Mark Ramras, Elizabeth Donovan:
  The Automorphism Group of a Johnson Graph. 267-270
  
• Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam:
  An Obstacle to a Decomposition Theorem for Near-Regular Matroids. 271-279
  
• Jack E. Graver, Gerald T. Cargo:
  When Does a Curve Bound a Distorted Disk? 280-305
  
• Feodor F. Dragan, Martín Matamala:
  Navigating in a Graph by Aid of Its Spanning Tree Metric. 306-332
  
• Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès:
  Cop and Robber Games When the Robber Can Hide and Ride. 333-359
  
• Federico Ardila, Matthias Beck, Serkan Hosten, Julian Pfeifle, Kim Seashore:
  Root Polytopes and Growth Series of Root Lattices. 360-378
  
• Diego A. Morán R., Santanu S. Dey:
  On Maximal S-Free Convex Sets. 379-393
  
• Xiaodong Xu, Zehui Shao, Stanislaw P. Radziszowski:
  More Constructive Lower Bounds on Classical Ramsey Numbers. 394-400
  
• Rok Erman, Frédéric Havet, Bernard Lidický, Ondrej Pangrác:
  5-Coloring Graphs with 4 Crossings. 401-422
  
• Omer Angel, Alexander E. Holroyd:
  Rotor Walks on General Trees. 423-446
  
• Jang Soo Kim:
  Front Representation of Set Partitions. 447-461
  

Volume 25, Number 2, 2011

• Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller:
  Acyclic Edge-Coloring of Planar Graphs. 463-478
  
• Emilio Di Giacomo, Francesco Giordano, Giuseppe Liotta:
  Upward Topological Book Embeddings of DAGs. 479-489
  
• Cynthia Loten, Claude Tardif:
  Near-Unanimity Polymorphisms on Structures with Finite Duality. 490-496
  
• David Richerby, Dimitrios M. Thilikos:
  Searching for a Visible, Lazy Fugitive. 497-513
  
• Ross J. Kang, Jean-Sébastien Sereni, Matej Stehlík:
  Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring. 514-533
  
• Michel Mollard:
  On Vertex Partitions of Hypercubes by Isometric Trees. 534-538
  
• A. M. Hamel, R. C. King:
  Bijective Proof of a Symplectic Dual Pair Identity. 539-560
  
• Shaofan Wang, Renhong Wang, Dehui Kong, Baocai Yin:
  Estimate of The Bézout Number For Linear Piecewise Algebraic Curves Over Arbitrary Triangulations. 561-582
  
• Jiong Guo, Rolf Niedermeier, Ondrej Suchý:
  Parameterized Complexity of Arc-Weighted Directed Steiner Problems. 583-599
  
• Jean-Claude Bermond, Y. M. Chee, Nathann Cohen, X. Zhang:
  The α-Arboricity of Complete Uniform Hypergraphs. 600-610
  
• Zhao Zhang, Hao Li:
  Eulerian Subgraphs Containing Given Vertices. 611-621
  
• Shalom Eliahou, Jorge L. Ramírez Alfonsín:
  Two-Generator Numerical Semigroups and Fermat and Mersenne Numbers. 622-630
  
• Noga Alon, Dániel Marx:
  Sparse Balanced Partitions and the Complexity of Subgraph Problems. 631-644
  
• Birgit van Dalen:
  Boundary Length of Reconstructions in Discrete Tomography. 645-659
  
• Yufei Zhao:
  The Bipartite Swapping Trick on Graph Homomorphisms. 660-680
  
• Le Anh Vinh:
  The Erdös-Falconer Distance Problem on the Unit Sphere in Vector Spaces Over Finite Fields. 681-684
  
• Evan Borenstein, Ernie Croot:
  On a Certain Generalization of the Balog-Szemerédi-Gowers Theorem. 685-694
  
• László A. Végh:
  Augmenting Undirected Node-Connectivity by One. 695-718
  
• Shira Zerbib:
  On the Zone Complexity of a Vertex. 719-730
  
• Marco Di Summa, Laurence A. Wolsey:
  Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges. 731-732
  
• Marc Mézard, Prasad Tetali:
  Special Section on Constraint Satisfaction Problems and Message Passing Algorithms. 733-735
  
• Uriel Feige, Abraham D. Flaxman, Dan Vilenchik:
  On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas. 736-749
  
• Lenka Zdeborová, Florent Krzakala:
  Quiet Planting in the Locked Constraint Satisfaction Problems. 750-770
  
• Andrea Montanari, Ricardo Restrepo, Prasad Tetali:
  Reconstruction and Clustering in Random Constraint Satisfaction Problems. 771-808
  
• Nayantara Bhatnagar, Juan Carlos Vera, Eric Vigoda, Dror Weitz:
  Reconstruction for Colorings on Trees. 809-826
  
• Brendan Lucier, Michael Molloy:
  The Glauber Dynamics for Colorings of Bounded Degree Trees. 827-853
  
• Nayantara Bhatnagar, Elitza N. Maneva:
  A Computational Method for Bounding the Probability of Reconstruction on Trees. 854-871
  
• Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch:
  Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. 872-893
  
• David Galvin, Fabio Martinelli, Kavita Ramanan, Prasad Tetali:
  The Multistate Hard Core Model on a Regular Tree. 894-915
  
• Manuel Bodirsky, Daniel Král':
  Limit Behavior of Locally Consistent Constraint Satisfaction Problems. 916-933
  
• Steven Jaslar, Sekhar Tatikonda:
  Maximum Weight Partial Colorings on Sparse Random Graphs. 934-955
  
• Shrinivas Kudekar, Nicolas Macris:
  Decay of Correlations for Sparse Graph Error Correcting Codes. 956-988
  
• Mohsen Bayati, Christian Borgs, Jennifer T. Chayes, Riccardo Zecchina:
  Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions. 989-1011
  
• Venkat Chandrasekaran, Misha Chertkov, David Gamarnik, Devavrat Shah, Jinwoo Shin:
  Counting Independent Sets Using the Bethe Approximation. 1012-1034
  

Volume 25, Number 3, 2011

• Yijin Zhang, Kenneth W. Shum, Wing Shing Wong:
  Strongly Conflict-Avoiding Codes. 1035-1053
  
• Joshua N. Cooper, Stephen Fenner, Semmy Purewal:
  Monochromatic Boxes in Colored Grids. 1054-1068
  
• Tomás Kaiser, Ondrej Rucký, Riste Skrekovski:
  Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable. 1069-1088
  
• MohammadAli Safari, Mohammad R. Salavatipour:
  A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs. 1089-1102
  
• F. M. Dong, Bill Jackson:
  A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs. 1103-1118
  
• Hiroshi Hirai:
  Folder Complexes and Multiflow Combinatorial Dualities. 1119-1143
  
• Fumei Lam, Dan Gusfield, Srinath Sridhar:
  Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters. 1144-1175
  
• Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov:
  On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs. 1176-1193
  
• Daniel Stefankovic, Eric Vigoda:
  Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species. 1194-1211
  
• Viktor Harangi:
  Acute Sets In Euclidean Spaces. 1212-1229
  
• Leah Epstein, Asaf Levin, Rob van Stee:
  Max-min Online Allocations with a Reordering Buffer. 1230-1250
  
• Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev:
  Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. 1251-1265
  
• Jovisa D. Zunic:
  Note on the Number of Two-Dimensional Threshold Functions. 1266-1268
  
• Ross Churchley, Jing Huang:
  Line-Polar Graphs: Characterization and Recognition. 1269-1284
  
• Liangpan Li, Oliver Roche-Newton:
  An improved sum-product estimate for general finite fields. 1285-1296
  
• Andrew Berget, Sen-Peng Eu, Victor Reiner:
  Constructions for Cyclic Sieving Phenomena. 1297-1314
  
• Laura Chávez-Lomelí, Luis A. Goddyn, Winfried Hochstättler:
  Balancing Covectors. 1315-1318
  
• Maciej Kalkowski, Michal Karonski, Florian Pfender:
  A New Upper Bound for the Irregularity Strength of Graphs. 1319-1321
  
• Ken-ichi Kawarabayashi, Yusuke Kobayashi:
  An Improved Algorithm for the Half-Disjoint Paths Problem. 1322-1330
  
• Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
  Approximating Width Parameters of Hypergraphs with Excluded Minors. 1331-1348
  
• Joshua A. Taylor, Franz S. Hover:
  Laplacians for flow networks. 1349-1364
  
• Mira Gonen, Dana Ron, Yuval Shavitt:
  Counting Stars and Other Small Subgraphs in Sublinear-Time. 1365-1411
  
• Chase Albert, Chi-Kwong Li, Gilbert Strang, Gexin Yu:
  Permutations as Product of Parallel Transpositions. 1412-1417
  
• Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos:
  Cutwidth of Split Graphs and Threshold Graphs. 1418-1437
  
• Alex Scott, Benny Sudakov:
  A Bound for the Cops and Robbers Problem. 1438-1442
  
• Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé:
  The Domination Number of Grids. 1443-1453
  
• Frantisek Kardos, Daniel Král', Jan Volec:
  Fractional colorings of cubic graphs with large girth. 1454-1476
  

Volume 25, Number 4, 2011

• Andrzej Czygrinow, Louis DeBiasio:
  A Note on Bipartite Graph Tiling. 1477-1489
  
• Xavier Muñoz, Zhentao Li, Ignasi Sau:
  Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs. 1490-1505
  
• Megan Owen:
  Computing Geodesic Distances in Tree Space. 1506-1529
  
• William Y. C. Chen, Neil J. Y. Fan, Jeffrey Y. T. Jia:
  Labeled Ballot Paths and the Springer Numbers. 1530-1546
  
• Fei Gao, Gennian Ge:
  A Complete Generalization of Clatworthy Group Divisible Designs. 1547-1561
  
• Ronitt Rubinfeld, Asaf Shapira:
  Sublinear Time Algorithms. 1562-1588
  
• Peter Gritzmann, Barbara Langfeld, Markus Wiegelmann:
  Uniqueness in Discrete Tomography: Three Remarks and a Corollary. 1589-1599
  
• Sergio Cabello, Éric Colin de Verdière, Francis Lazarus:
  Finding Cycles with Topological Properties in Embedded Graphs. 1600-1614
  
• Michael Drmota, Éric Fusy, Mihyun Kang, Veronika Kraus, Juanjo Rué:
  Asymptotic Study of Subcritical Graph Classes. 1615-1651
  
• Paul Bonsma, Florian Zickfeld:
  A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs. 1652-1666
  
• Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover:
  Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing. 1667-1686
  
• Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran:
  Boxicity and Poset Dimension. 1687-1698
  
• Hiroshi Nozaki, Sho Suda:
  Bounds on s-Distance Sets with Strength t. 1699-1713
  
• Geir Agnarsson, Jill Bigley Dunham:
  A Note on the Maximum Number of Edges of Nonflowerable Coin Graphs. 1714-1721
  
• Sagi Snir, Raphael Yuster:
  A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs. 1722-1736
  
• Tomás Kaiser, Matej Stehlík, Riste Skrekovski:
  On the 2-Resonance of Fullerenes. 1737-1745
  
• Zdenek Dvorak, Bernard Lidický, Riste Skrekovski:
  Graphs with Two Crossings Are 5-Choosable. 1746-1753
  
• Richard P. Anstee, J. Blackman, Hangjun Yang:
  Perfect Matchings in Grid Graphs after Vertex Deletions. 1754-1767
  
• Jonathan Browder:
  Face Numbers of Certain Cohen-Macaulay Flag Complexes. 1768-1777
  
• Rudolf Ahlswede, Harout K. Aydinian:
  On Security of Statistical Databases. 1778-1791
  
• Nicholas J. A. Harvey, Tamás Király, Lap Chi Lau:
  On Disjoint Common Bases in Two Matroids. 1792-1803
  
• Tomás Kaiser, Mickaël Montassier, André Raspaud:
  Covering a Graph by Forests and a Matching. 1804-1811
  
• Todd Cochrane, Sergei Konyagin:
  Proof of the Goresky Klapper Conjecture on Decimations of L-sequences. 1812-1831
  
• Antonio Blanca, Anant P. Godbole:
  On Universal Cycles for new Classes of Combinatorial Structures. 1832-1842
  
• Tewodros Amdeberhan, Mahir Bilen Can, Victor H. Moll:
  Broken Bracelets, Molien Series, Paraffin Wax, and an Elliptic Curve of Conductor 48. 1843-1859
  
• Natalie Arkus, Vinothan N. Manoharan, Michael P. Brenner:
  Deriving Finite Sphere Packings. 1860-1901
  
• Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
  Blocks and Cut Vertices of the Buneman Graph. 1902-1919
  

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