Volume 20, Number 1, 2006

• 
  Andrzej Czygrinow, Glenn Hurlbert: Girth, Pebbling, and Grid Thresholds. 1-10
• 
  Michael Joswig, Marc E. Pfetsch: Computing Optimal Morse Matchings. 11-25
• 
  Volkan Isler, Sampath Kannan, Sanjeev Khanna: Randomized Pursuit-Evasion with Local Visibility. 26-41
• 
  Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, Giacomo Zambelli: Odd Hole Recognition in Graphs of Bounded Clique Size. 42-48
• 
  Maria Axenovich: Avoiding Patterns in Matrices Via a Small Number of Changes. 49-54
• 
  Zdenek Dvorak, Riste Skrekovski: A Theorem About a Contractible and Light Edge. 55-61
• 
  Daniela Kühn, Deryk Osthus: Improved Bounds for Topological Cliques in Graphs of Large Girth. 62-78
• 
  Wakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson: Optimum Secret Sharing Scheme Secure against Cheating. 79-95
• 
  Yusheng Li, Wenan Zang: Differential Methods for Finding Independent Sets in Hypergraphs. 96-104
• 
  Derek G. Corneil, Ekkehard Köhler: Linear Orderings of Subfamilies of AT-Free Graphs. 105-118
• 
  Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Embedding k-Outerplanar Graphs into l ₁. 119-136
• 
  Noga Alon: Ranking Tournaments. 137-142
• 
  Nicholas Pippenger: The Linking Probability of Deep Spider-Web Networks. 143-159
• 
  Michael Dinitz: Full Rank Tilings of Finite Abelian Groups. 160-170
• 
  Paolo Dulio, Richard J. Gardner, Carla Peri: Discrete Point X-rays. 171-188
• 
  Etienne de Klerk, John Maharry, Dmitrii V. Pasechnik, R. Bruce Richter, Gelasio Salazar: Improved Bounds for the Crossing Numbers of K_{m, n} and K_n. 189-202
• 
  János Körner, Claudia Malvenuto: Pairwise colliding permutations and the capacity of infinite graphs. 203-212
• 
  Kazuo Murota: M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem. 213-226
• 
  Andreas Alpers, Peter Gritzmann: On Stability, Error Correction, and Noise Compensation in Discrete Tomography. 227-239
• 
  Feodor F. Dragan, Chenyu Yan, Irina Lomonosov: Collective tree spanners of graphs. 241-260
• 
  Chandra Chekuri, Sudipto Guha, Joseph Naor: The Steiner k-Cut Problem. 261-271

Volume 20, Number 2, 2006

• 
  Daniela Kühn, Deryk Osthus: Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs. 273-286
• 
  Hong-Bin Chen, Frank K. Hwang: On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out. 287-290
• 
  Tomás Feder: A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings. 291-301
• 
  Jerrold R. Griggs, Xiaohua Teresa Jin: Real Number Graph Labellings with Distance Conditions. 302-327
• 
  Paul W. Goldberg: A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment. 328-343
• 
  Drago Bokal, Gasper Fijavz, Bojan Mohar: The Minor Crossing Number. 344-356
• 
  Erik D. Demaine, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos: The Bidimensional Theory of Bounded-Genus Graphs. 357-371
• 
  Tomás Feder, Daniel K. Ford: Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection. 372-394
• 
  Fan R. K. Chung, Linyuan Lu: The Volume of the Giant Component of a Random Graph with Given Expected Degrees. 395-411
• 
  Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick: On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. 412-427
• 
  Peter C. Fishburn, Fred S. Roberts: Full Color Theorems for L(2, 1)-Colorings. 428-443
• 
  Hristo Djidjev: A Linear-Time Algorithm for Finding a Maximal Planar Subgraph. 444-462
• 
  Don Coppersmith, Michael Elkin: Sparse Sourcewise and Pairwise Distance Preservers. 463-501
• 
  Maik Weinard, Georg Schnitger: On the Greedy Superstring Conjecture. 502-522
• 
  Shlomo Hoory, Stefan Szeider: A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable. 523-528
• 
  Landon Rabern: On Graph Associations. 529-535
• 
  Daniel Král, Riste Skrekovski, Martin Tancer: Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings. 536-543

Volume 20, Number 3, 2006

• 
  Klaus Jansen, Lorant Porkolab: On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes. 545-563
• 
  Saieed Akbari, A. Alipour, Hung-Lin Fu, Yuan-Hsun Lo: Multicolored Parallelisms of Isomorphic Spanning Trees. 564-567
• 
  Hong Xu, Wen-Feng Qi: Autocorrelations of Maximum Period FCSR Sequences. 568-577
• 
  Jim Geelen, Xiangqian Zhou: A Splitter Theorem for Internally 4-Connected Binary Matroids. 578-587
• 
  Jim Geelen, Bert Gerards, Geoff Whittle: Matroid $T$-Connectivity. 588-596
• 
  Ion Gorgos, Chính T. Hoàng, Vitaly I. Voloshin: A Note on Quasi-triangulated Graphs. 597-602
• 
  Jun Ma, Liqun Pu, Hao Shen: Cycle Decompositions of K_n,n-I. 603-609
• 
  Dan Romik: Shortest Paths in the Tower of Hanoi Graph and Finite Automata. 610-622
• 
  József Solymosi: Dense Arrangements are Locally Very Dense. I. 623-627
• 
  Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee: Comparing Partial Rankings. 628-648
• 
  Emanuele Munarini: A Combinatorial Interpretation of the Chebyshev Polynomials. 649-655
• 
  Kangmin Fan, Simon J. Puglisi, William F. Smyth, Andrew Turpin: A New Periodicity Lemma. 656-668
• 
  Atif A. Abueida, R. Sritharan: Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes. 669-681
• 
  Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson: Cycle Extendability of Hamiltonian Interval Graphs. 682-689
• 
  Daniel Král: The Channel Assignment Problem with Variable Weights. 690-704
• 
  Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka: Compact Routing with Name Independence. 705-726
• 
  Irit Gat-Viks, Richard M. Karp, Ron Shamir, Roded Sharan: Reconstructing Chain Functions in Genetic Networks. 727-740
• 
  Maria Axenovich, Ryan Martin: On the Strong Chromatic Number of Graphs. 741-747
• 
  Sofia Kovaleva, Frits C. R. Spieksma: Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems. 748-768
• 
  Kevin Milans, Bryan Clark: The Complexity of Graph Pebbling. 769-798
• 
  Feng Ming Dong, Khee Meng Koh: On Graphs Having No Chromatic Zeros in (1, 2). 799-810

Volume 20, Number 4, 2006

• 
  Manuel E. Lladser: Uniform Formulae for Coefficients of Meromorphic Functions in Two Variables. Part I. 811-828
• 
  Ronald J. Gould, Alexandr V. Kostochka, Gexin Yu: On Minimum Degree Implying That a Graph is H-Linked. 829-840
• 
  Anxiao Jiang, Matthew Cook, Jehoshua Bruck: Optimal Interleaving on Tori. 841-879
• 
  Alpár Jüttner: On Budgeted Optimization Problems. 880-892
• 
  Samuel Fiorini: 0, 1/2-Cuts and the Linear Ordering Problem: Surfaces That Define Facets. 893-912
• 
  Claudio Gentile, Paolo Ventura, Robert Weismantel: Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets. 913-919
• 
  Sándor Szabó: Factoring Finite Abelian Groups by Subsets with Maximal Span. 920-931
• 
  Omer Giménez, Petr Hlinený, Marc Noy: Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. 932-946
• 
  Edgar Martínez-Moro, Ignacio F. Rúa: Multivariable Codes Over Finite Chain Rings: Serial Codes. 947-959
• 
  Martin Klazar: On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings. 960-976
• 
  Santosh N. Kabadi, Abraham P. Punnen: On cost matrices with two and three distinct values of Hamiltonian paths and cycles. 977-998
• 
  John Little, Hal Schenck: Toric Surface Codes and Minkowski Sums. 999-1014
• 
  Leah Epstein: Online Bin Packing with Cardinality Constraints. 1015-1030
• 
  Peter Keevash, Dhruv Mubayi, Richard M. Wilson: Set Systems with No Singleton Intersection. 1031-1041
• 
  Jim Geelen, Peter J. Humphries: Rota's Basis Conjecture for Paving Matroids. 1042-1045
• 
  Carles Padró, Ignacio Gracia: Representing Small Identically Self-Dual Matroids by Self-Dual Codes. 1046-1055
• 
  Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich: Higher-Dimensional Packing with Order Constraints. 1056-1078

last updated on Mon May 20 03:34:05 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page