Volume 18, Number 1, 2004

• 
  Bikash Kumar Dey, B. Sundar Rajan: Codes Closed under Arbitrary Abelian Group of Permutations. 1-18
• 
  Ching-Chi Lin, Hsueh-I Lu, I-Fan Sun: Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer. 19-29
• 
  Venkatesan Guruswami, Sanjeev Khanna: On the Hardness of 4-Coloring a 3-Colorable Graph. 30-40
• 
  Harold N. Gabow: An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph. 41-70
• 
  C. Robert Miers, Frank Ruskey: Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings. 71-82
• 
  Lap Chi Lau, Derek G. Corneil: Recognizing Powers of Proper Interval, Split, and Chordal Graph. 83-102
• 
  Frank H. Lutz: Small Examples of Nonconstructible Simplicial Balls and Spheres. 103-109
• 
  Akshay-Kumar Katta, Jay Sethuraman: A Note on Bandits with a Twist. 110-113
• 
  Lars Engebretsen: The Nonapproximability of Non-Boolean Predicates. 114-129
• 
  Mark Goresky, Andrew Klapper, Ram Murty, Igor Shparlinski: On Decimations of l-Sequences. 130-140
• 
  Gabriel A. Schachtel: Exact Word-Run Statistics in Random Orderings. 141-158
• 
  Jurriaan Hage, Tero Harju: A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs. 159-176
• 
  L. Sunil Chandran, L. Shankar Ram: On the Number of Minimum Cuts in a Graph. 177-194
• 
  Vadim V. Lozin, Dieter Rautenbach: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. 195-206
• 
  Alexander A. Ageev, Yinyu Ye, Jiawei Zhang: Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. 207-217

Volume 18, Number 2, 2004

• 
  Uriel Feige: Approximating Maximum Clique by Removing Subgraphs. 219-225
• 
  Celina M. Herrera de Figueiredo, Frédéric Maffray: Optimizing Bull-Free Perfect Graphs. 226-240
• 
  Todd G. Will, Heather Hulett: Parsimonious Multigraphs. 241-245
• 
  Franco Saliola, Walter Whiteley: Constraining Plane Configurations in CAD: Circles, Lines, and Angles in the Plane. 246-271
• 
  Sarnath Ramnath: Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering. 272-286
• 
  David Huygens, Ali Ridha Mahjoub, Pierre Pesneau: Two Edge-Disjoint Hop-Constrained Paths and Polyhedra. 287-312
• 
  Xiang-dong Hou: A Note on the Proof of Niho's Conjecture. 313-319
• 
  Chi-Jen Lu: Deterministic Hypergraph Coloring and Its Applications. 320-331
• 
  Dariusz R. Kowalski, Andrzej Pelc: Faster Deterministic Broadcasting in Ad Hoc Radio Networks. 332-346
• 
  Yossi Azar, Leah Epstein: On-Line Load Balancing of Temporary Tasks on Identical Machines. 347-352
• 
  Guantao Chen, George Davis, Frank J. Hall, Zhongshan Li, Kinnari Patel, Michael Stewart: An Interlacing Result on Normalized Laplacians. 353-361
• 
  Zvi Galil, Jong Geun Park, Kunsoo Park: Three-Dimensional Periodicity and Its Application to Pattern Matching. 362-381
• 
  Patric R. J. Östergård, Alexander Vardy: Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces. 382-387
• 
  Martín Cera, Ana Diánez, Alberto Márquez: Extremal Graphs without Topological Complete Subgraphs. 388-396
• 
  Christos A. Athanasiadis, Victor Reiner: Noncrossing Partitions for the Group D_n. 397-417
• 
  Pawel Hitczenko, Carla D. Savage: On the Multiplicity of Parts in a Random Composition of a Large Integer. 418-435

Volume 18, Number 3, 2004

• 
  Matthew K. Franklin, Moti Yung: Secure Hypergraphs: Privacy from Partial Broadcast. 437-450
• 
  Daniel Král: Coloring Powers of Chordal Graphs. 451-461
• 
  Yi-Wu Chang, Joan P. Hutchinson, Michael S. Jacobson, Jenö Lehel, Douglas B. West: The Bar Visibility Number of a Graph. 462-471
• 
  Michelle R. DeDeo, Elinor Velasquez: The Radon Transform on _n^{k ast}. 472-478
• 
  Ken-ichi Kawarabayashi, Chris Stephens, Xiaoya Zha: Orientable and Nonorientable Genera for Some Complete Tripartite Graphs. 479-487
• 
  Hadas Shachnai, Aravind Srinivasan: Finding Large Independent Sets in Graphs and Hypergraphs. 488-500
• 
  Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos: Bidimensional Parameters and Local Treewidth. 501-511
• 
  Frank Kwang-Ming Hwang, Uriel G. Rothblum: Partition-Optimization with Schur Convex Sum Objective Functions. 512-524
• 
  Marek Janata: Matroids Induced by Packing Subgraphs. 525-541
• 
  Michael O. Albertson, Alexandr V. Kostochka, Douglas B. West: Precoloring Extensions of Brooks' Theorem. 542-553
• 
  Pavol Hell, Jing Huang: Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs. 554-570
• 
  Chính T. Hoàng, Bruce A. Reed: On the Co-P₃-Structure of Perfect Graphs. 571-576
• 
  Gregory M. Constantine: Edge-Disjoint Isomorphic Multicolored Trees and Cycles in Complete Graphs. 577-580
• 
  Balázs Fleiner: Detachment of Vertices of Graphs Preserving Edge-Connectivity. 581-591
• 
  Maxim Vsemirnov: Automorphisms of Projective Spaces and Min-Wise Independent Sets of Permutations. 592-607
• 
  Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin: A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem. 608-625
• 
  Paul F. Dietz, Joel I. Seiferas, Ju Zhang: A Tight Lower Bound for Online Monotonic List Labeling. 626-637
• 
  James F. Geelen, Petr Hlinený, Geoffrey P. Whittle: Bridging Separations in Matroids. 638-646
• 
  Ed Swartz: Lower Bounds for h-Vectors ofk-CM, Independence, and Broken Circuit Complexes. 647-661

Volume 18, Number 4, 2005

• 
  Gennian Ge, Ying Miao, Lihua Wang: Combinatorial Constructions for Optimal Splitting Authentication Codes. 663-678
• 
  Jeannette C. M. Janssen, Tania E. Wentzell, Shannon L. Fitzpatrick: Lower Bounds from Tile Covers for the Channel Assignment Problem. 679-696
• 
  Noga Alon, Vera Asodi: Learning a Hidden Subgraph. 697-712
• 
  Peter Keevash, Benny Sudakov: Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices. 713-727
• 
  Colin Cooper, Alan M. Frieze: The Cover Time of Random Regular Graphs. 728-740
• 
  Wensong Chu, Charles J. Colbourn, Solomon W. Golomb: A Recursive Construction For Regular Difference Triangle Sets. 741-748
• 
  S. Muñoz: On Identifying Maximal Covers. 749-768
• 
  Iris Gaber: Minimal-Time k-Line Broadcasting. 769-777
• 
  Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Blaz Zmazek: Hypercubes As Direct Products. 778-786
• 
  Seth Sullivant: Small Contingency Tables with Large Gaps. 787-793
• 
  Joseph Callaghan, John J. Chew III, Stephen M. Tanny: On the Behavior of a Family of Meta-Fibonacci Sequences. 794-824
• 
  Tero Laihonen: On Optimal Edge-Robust and Vertex-Robust (1, leql)-Identifying Codes. 825-834
• 
  Katharina T. Huber, Vincent Moulton, Michael Anthony Steel: Four Characters Suffice to Convexly Define a Phylogenetic Tree. 835-843
• 
  Yael Ben-Haim, Tuvi Etzion: On the Optimality of Coloring with a Lattice. 844-878

last updated on Sat May 18 06:35:49 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page