SIAM Journal on Discrete Mathematics, Volume 23

Volume 23, Number 1, 2008

• Stephen Graves, Tomaz Pisanski, Mark E. Watkins:
  Growth of Edge-Homogeneous Tessellations. 1-18
  
• Giacomo Como, Fabio Fagnani:
  Average Spectra and Minimum Distances of Low-Density Parity-Check Codes over Abelian Groups. 19-53
  
• Jian-Liang Wu:
  The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic. 54-58
  
• Pascale Charpin, Tor Helleseth, Victor Zinoviev:
  On Cosets of Weight 4 of BCH(2^m, 8), m Even, and Exponential Sums. 59-78
  
• Simon Litsyn, Alexander Shpunt:
  On the Distribution of Boolean Function Nonlinearity. 79-95
  
• Ken-ichi Kawarabayashi, Raiji Mukae, Atsuhiro Nakamoto:
  K₆-Minors in Triangulations on the Klein Bottle. 96-108
  
• Charles J. Colbourn, Hung-Lin Fu, Gennian Ge, Alan C. H. Ling, Hui-Chuan Lu:
  Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven. 109-122
  
• Alex Iosevich, Doowon Koh:
  The Erdös--Falconer Distance Problem, Exponential Sums, and Fourier Analytic Approach to Incidence Theorems in Vector Spaces over Finite Fields. 123-135
  
• Santosh N. Kabadi, J. Yan, Donglei Du, K. P. K. Nair:
  Integer Exact Network Synthesis Problem. 136-154
  
• Jacob Fox, Benny Sudakov:
  Ramsey-Type Problem for an Almost Monochromatic K₄. 155-162
  
• Chandra Chekuri, F. Bruce Shepherd:
  Approximate Integer Decompositions for Undirected Network Design Problems. 163-177
  
• Hamed Hatami, Avner Magen, Evangelos Markakis:
  Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l₁ Embeddability of Negative Type Metrics. 178-194
  
• Raphael Yuster:
  Disjoint Color-Avoiding Triangles. 195-204
  
• Baogang Xu:
  On (3, 1)^*-Coloring of Plane Graphs. 205-220
  
• María Jose Chávez, Gasper Fijavz, Alberto Márquez, Atsuhiro Nakamoto, Esperanza Suárez:
  Geometric Realization of Möbius Triangulations. 221-232
  
• Noga Alon, Pawel Pralat, Nicholas C. Wormald:
  Cleaning Regular Graphs with Brushes. 233-250
  
• Asaf Levin:
  Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. 251-264
  

Volume 23, Number 1, 2009

• D. Benko, C. Ernst, Dominic Lanphier:
  Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs. 265-277
  
• Noga Alon, Asaf Shapira, Uri Stav:
  Can a Graph Have Distinct Regular Partitions? 278-287
  
• Michael Behrisch, Anusch Taraz, Michael Ueckerdt:
  Coloring Random Intersection Graphs and Complex Networks. 288-299
  
• Andrew Beveridge:
  Centers for Random Walks on Trees. 300-318
  
• Mario Marietti:
  A Combinatorial Characterization of Coxeter Groups. 319-332
  
• Petri Rosendahl:
  On Cusick's Method and Value Sets of Certain Polynomials over Finite Fields. 333-343
  
• Zdenek Dvorak, Stanislav Jendrol, Daniel Král, Gyula Pap:
  Matchings and Nonrainbow Colorings. 344-348
  
• David Richerby, Dimitrios M. Thilikos:
  Graph Searching in a Crime Wave. 349-368
  
• Timothy Y. Chow:
  Reduction of Rota's Basis Conjecture to a Problem on Three Bases. 369-371
  
• Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický:
  6-Critical Graphs on the Klein Bottle. 372-383
  
• Ivan Soprunov, Jenya Soprunova:
  Toric Surface Codes and Minkowski Length of Polygons. 384-400
  
• Miklós Bóna:
  Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley. 401-406
  
• Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
  A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms. 407-427
  
• Anne Berry, Richard Krueger, Geneviève Simonet:
  Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings. 428-446
  
• Nachum Dershowitz, Shmuel Zaks:
  More Patterns in Trees: Up and Down, Young and Old, Odd and Even. 447-465
  
• Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh:
  Spanning Directed Trees with Many Leaves. 466-476
  
• Zdenek Dvorak, Riste Skrekovski:
  k-Chromatic Number of Graphs on Surfaces. 477-486
  
• Khaled M. Elbassioni:
  Algorithms for Dualization over Products of Partially Ordered Sets. 487-510
  
• Jakub Przybylo:
  Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs. 511-516
  
• Michael Ferrara, John R. Schmitt:
  A General Lower Bound for Potentially H-Graphic Sequences. 517-526
  
• L. Wyatt Alverson II, Robert G. Donnelly, Scott J. Lewis, Marti McClard, Robert Pervine, Robert A. Proctor, N. J. Wildberger:
  Distributive Lattices Defined for Representations of Rank Two Semisimple Lie Algebras. 527-559
  

Volume 23, Number 2, 2009

• Denis S. Krotov, Vladimir N. Potapov:
  n-Ary Quasigroups of Order 4. 561-570
  
• Víctor Blanco, Justo Puerto:
  Partial Gröbner Bases for Multiobjective Integer Linear Optimization. 571-595
  
• Carl Bracken, Eimear Byrne, Nadya Markin, Gary McGuire:
  Fourier Spectra of Binomial APN Functions. 596-608
  
• Chuangyin Dang:
  An Arbitrary Starting Homotopy-Like Simplicial Algorithm for Computing an Integer Point in a Class of Polytopes. 609-633
  
• Airat Bekmetjev, Charles A. Cusack:
  Pebbling Algorithms in Diameter Two Graphs. 634-646
  
• Satoru Iwata, Mizuyo Takamatsu:
  Computing the Degrees of All Cofactors in Mixed Polynomial Matrices. 647-660
  
• Guo-Niu Han:
  Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees. 661-664
  
• Mourad Baïou, Francisco Barahona:
  On the Integrality of Some Facility Location Polytopes. 665-679
  
• Morten Hegner Nielsen, Ortrud R. Oellermann:
  Steiner Trees and Convex Geometries. 680-693
  
• Sanming Zhou:
  A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks. 694-714
  
• Naftali Sommer, Meir Feder, Ofir Shalvi:
  Finding the Closest Lattice Point by Iterative Slicing. 715-731
  
• Hiêp Hàn, Yury Person, Mathias Schacht:
  On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree. 732-748
  
• Yezhou Wu, Wenan Zang, Cun-Quan Zhang:
  A Characterization of Almost CIS Graphs. 749-753
  
• Joseph Brennan, Guantao Chen:
  Toric Geometry of Series-Parallel Graphs. 754-764
  
• Sergi Elizalde:
  The Number of Permutations Realized By a Shift. 765-786
  
• Svetlana Poznanovic, Catherine H. Yan:
  Crossings and Nestings of Two Edges in Set Partitions. 787-804
  
• Tian Tian, Wen-Feng Qi:
  Autocorrelation and Distinctness of Decimations of l-Sequences. 805-821
  
• Leah Epstein, Thomas Erlebach, Asaf Levin:
  Online Capacitated Interval Coloring. 822-841
  
• Jean Bourgain, Todd Cochrane, Jennifer Paulhus, Christopher Pinner:
  Decimations of l-Sequences and Permutations of Even Residues mod p. 842-857
  
• Mariko Sakashita, Kazuhisa Makino, Hiroshi Nagamochi, Satoru Fujishige:
  Minimum Transversals in Posimodular Systems. 858-871
  
• Daniel W. Cranston, Douglas B. West:
  Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable. 872-881
  
• J. A. Bondy, X. Buchwalder, F. Mercier:
  Lexicographic Products and a Conjecture of Hahn and Jackson. 882-887
  
• Yi Zhao:
  Bipartite Graph Tiling. 888-900
  
• József Balogh, Ryan Martin:
  On Avoider-Enforcer Games. 901-908
  
• Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider:
  Clique-Width is NP-Complete. 909-939
  
• Gennian Ge, Ying Miao, Xiande Zhang:
  On Block Sequences of Steiner Quadruple Systems with Error Correcting Consecutive Unions. 940-958
  
• Ioannis Caragiannis:
  Wavelength Management in WDM Rings to Maximize the Number of Connections. 959-978
  
• Nicolas Lichiardopol, Attila Pór, Jean-Sébastien Sereni:
  A Step toward the Bermond--Thomassen Conjecture about Disjoint Cycles in Digraphs. 979-992
  
• Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg Pikhurko:
  Memoryless Rules for Achlioptas Processes. 993-1008
  
• Jay Schweig:
  A Convex-Ear Decomposition for Rank-Selected Subposets of Supersolvable Lattices. 1009-1022
  
• Dong Ye, Zhongbin Qi, Heping Zhang:
  On k-Resonant Fullerene Graphs. 1023-1044
  
• Rucong Zhang, Gennian Ge, Alan C. H. Ling, Hung-Lin Fu, Yukiyasu Mutoh:
  The Existence of r^×4 Grid-Block Designs with r=3, 4. 1045-1062
  
• Jozef Miskuf, Riste Skrekovski, Martin Tancer:
  Backbone Colorings and Generalized Mycielski Graphs. 1063-1070
  
• Peter Hamburger, Attila Pór, Matt Walsh:
  Kneser Representations of Graphs. 1071-1081
  
• Thomas Britz, G. Royle, Keisuke Shiromoto:
  Designs from Matroids. 1082-1099
  
• Jirí Fink:
  Connectivity of Matching Graph of Hypercube. 1100-1109
  
• Yair Bartal, Leonard J. Schulman:
  Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics. 1110-1115
  

Volume 23, Number 3, 2009

• Jason Morton, Lior Pachter, Anne Shiu, Bernd Sturmfels, Oliver Wienand:
  Convex Rank Tests and Semigraphoids. 1117-1134
  
• Benjamin McClosky, Illya V. Hicks:
  The Co-2-plex Polytope and Integral Systems. 1135-1148
  
• Graham Brightwell, Peter Winkler:
  Submodular Percolation. 1149-1178
  
• Babak Farzad:
  Planar Graphs without 7-Cycles Are 4-Choosable. 1179-1199
  
• A. K. Lal, B. Bhattacharjya:
  Breaking the Symmetries of the Book Graph and the Generalized Petersen Graph. 1200-1216
  
• A. J. Wolfe, Alan C. H. Ling, Jeffrey H. Dinitz:
  The Existence of N₂ Resolvable Latin Squares. 1217-1237
  
• Genghua Fan, Naidan Ji:
  Relative Length of Longest Paths and Cycles in 2-Connected Graphs. 1238-1248
  
• William Y. C. Chen, Jiuqiang Liu, Larry X. W. Wang:
  Families of Sets with Intersecting Clusters. 1249-1260
  
• Eyjolfur Ingi Asgeirsson, Cliff Stein:
  Divide-and-Conquer Approximation Algorithm for Vertex Cover. 1261-1280
  
• Alberto Del Pia, Giacomo Zambelli:
  Half-Integral Vertex Covers on Bipartite Bidirected Graphs: Total Dual Integrality and Cut-Rank. 1281-1296
  
• Nicola Apollonio, András Sebö:
  Minconvex Factors of Prescribed Size in Graphs. 1297-1310
  
• Omid Amini, Florian Huc, Stéphane Pérennes:
  On the Path-Width of Planar Graphs. 1311-1316
  
• Michael J. Pelsmajer, Marcus Schaefer, Despina Stasi:
  Strong Hanani--Tutte on the Projective Plane. 1317-1323
  
• Linyuan Lu, Yi Zhao:
  An Exact Result for Hypergraphs and Upper Bounds for the Tur[a-acute]n Density of K^r_r+1. 1324-1334
  
• Daniela Kühn, Deryk Osthus, Andrew Treglown:
  An Ore-type Theorem for Perfect Packings in Graphs. 1335-1355
  
• Kevin P. Costello, Van H. Vu:
  Concentration of Random Determinants and Permanent Estimators. 1356-1371
  
• Rok Erman, Suzana Jurecic, Daniel Král, Kris Stopar, Nik Stopar:
  Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs. 1372-1381
  
• Ashkan Aazami, Kael Stilp:
  Approximation Algorithms and Hardness for Domination with Propagation. 1382-1399
  
• Ning Chen:
  On the Approximability of Influence in Social Networks. 1400-1415
  
• Sergei L. Bezrukov, Uwe Leck:
  A Simple Proof of the Karakhanyan--Riordan Theorem on the Even Discrete Torus. 1416-1421
  
• Warwick de Launey, David A. Levin:
  (1, -1)-Matrices with Near-Extremal Properties. 1422-1440
  
• Dawn Curtis, Taylor Hines, Glenn Hurlbert, Tatiana Moyer:
  Near-Universal Cycles for Subsets Exist. 1441-1449
  
• Bridget Eileen Tenner:
  Optimizing Linear Extensions. 1450-1454
  
• Jennifer Vandenbussche, Douglas B. West, Gexin Yu:
  On the Pagenumber of k-Trees. 1455-1464
  
• Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz:
  A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs. 1465-1483
  
• Pierre Fouilhoux, Martine Labbé, Ali Ridha Mahjoub, Hande Yaman:
  Generating Facets for the Independence System Polytope. 1484-1506
  
• Akiko Manada, Navin Kashyap:
  A Comparative Study of Periods in a Periodic-Finite-Type Shift. 1507-1524
  
• Eric Bach:
  Improved Asymptotic Formulas for Counting Correlation Immune Boolean Functions. 1525-1538
  
• Jennifer Vandenbussche, Douglas B. West:
  Matching Extendability in Hypercubes. 1539-1547
  
• Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu:
  The Two-Coloring Number and Degenerate Colorings of Planar Graphs. 1548-1560
  
• Dávid Kunszenti-Kovács:
  Network Perturbations and Asymptotic Periodicity of Recurrent Flows in Infinite Networks. 1561-1574
  
• Erin W. Chambers, William B. Kinnersley, Noah Prince, Douglas B. West:
  Extremal Problems for Roman Domination. 1575-1586
  
• Guillaume Chapuy, Michel Marcus, Gilles Schaeffer:
  A Bijection for Rooted Maps on Orientable Surfaces. 1587-1611
  
• Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener:
  On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. 1612-1645
  
• Wai Hong Chan, Peter Che Bor Lam, Wai Chee Shiu:
  Edge-Face Total Chromatic Number of Halin Graphs. 1646-1654
  

Volume 23, Number 4, 2009

• Imre Bárány, Attila Pór, Pavel Valtr:
  Paths with No Small Angles. 1655-1666
  
• Jon Lee, Shmuel Onn, Robert Weismantel:
  Approximate Nonlinear Optimization over Weighted Independence Systems. 1667-1681
  
• Amin Coja-Oghlan, André Lanka:
  Finding Planted Partitions in Random Graphs with General Degree Distributions. 1682-1714
  
• Bin Fu, Ming-Yang Kao, Lusheng Wang:
  Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences. 1715-1737
  
• Colin Cooper, Alan M. Frieze, Tomasz Radzik:
  Multiple Random Walks in Random Regular Graphs. 1738-1761
  
• Hamed Hatami, Xuding Zhu:
  The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three. 1762-1775
  
• Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens:
  Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms. 1776-1799
  
• George B. Mertzios, Ignasi Sau, Shmuel Zaks:
  A New Intersection Model and Improved Algorithms for Tolerance Graphs. 1800-1813
  
• Leizhen Cai, Weifan Wang:
  The Surviving Rate of a Graph for the Firefighter Problem. 1814-1826
  
• Yuval Emek, David Peleg:
  A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs. 1827-1841
  
• Walter Didimo, Francesco Giordano, Giuseppe Liotta:
  Upward Spirality and Upward Planarity Testing. 1842-1899
  
• Ágnes Tóth:
  The Ultimate Categorical Independence Ratio of Complete Multipartite Graphs. 1900-1904
  
• Derek G. Corneil, Stephan Olariu, Lorna Stewart:
  The LBFS Structure and Recognition of Interval Graphs. 1905-1953
  
• David Conlon:
  On-line Ramsey Numbers. 1954-1963
  
• Nikolaos Fountoulakis, Anna Huber:
  Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading. 1964-1991
  

Volume 23, Number 4, 2010

• Bartlomiej Bosek, Tomasz Krawczyk, Edward Szczypka:
  First-Fit Algorithm for the On-Line Chain Partitioning Problem. 1992-1999
  
• Amin Coja-Oghlan, Colin Cooper, Alan M. Frieze:
  An Efficient Sparse Regularity Concept. 2000-2034
  
• Daniel K. Benvenuti, Abraham P. Punnen:
  SC-Hamiltonicity and Its Linkages with Strong Hamiltonicity of a Graph. 2035-2041
  
• Ghidewon Abay-Asmerom, Richard Hammack, Craig E. Larson, Dewey T. Taylor:
  Direct Product Factorization of Bipartite Graphs with Bipartition-reversing Involutions. 2042-2052
  
• Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko:
  Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints. 2053-2078
  
• Hsueh-I Lu:
  Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees. 2079-2092
  
• Igor Shparlinski:
  On the Distribution of Orbits of PGL_2(q) in F_qⁿ and the Klapper Conjecture. 2093-2099
  
• Sun-Yuan Hsieh, Chia-Wei Lee:
  Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model. 2100-2119
  
• Lara Dolecek, Venkat Anantharam:
  Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods. 2120-2146
  
• Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Birgit Vogtenhuber:
  Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons. 2147-2155
  
• Chính T. Hoàng:
  On the Complexity of Finding a Sun in a Graph. 2156-2162
  
• Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
  On the Hull Number of Triangle-Free Graphs. 2163-2172
  

Last update Thu May 23 19:26:50 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page