2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO)

Each link below is to a PDF of the paper as it was submitted. Papers are listed in program order. ISBN: 978-0-898719-33-8

Preface

1          On the Search Path Length of Random Binary Skip Graphs
            Philippe Duchon and Hubert Larchevêque

9          Phases in the Mixing of Gases via the Ehrenfest Urn Model
            Srinivasan Balaji and Hosam M. Mahmoud

18        Bivariate Asymptotics for Striped Plane Partitions
            Daniel Panario, Bruce Richmond, and Benjamin Young

27        The Subset Partial Order: Computing and Combinatorics
            Amr Elmasry

34        Fast Algorithm for Optimal Compression of Graphs
            Yongwook Choi

47        Newton Iteration: From Numerics to Combinatorics, and Back
            Bruno Salvy

48        Stochastic Flips on Two-letter Words
            Olivier Bodini, Thomas Fernique, and Damien Regnault

56        Data Center Scheduling, Generalized Flows, and Submodularity
            Lisa Fleischer

66        Preference-constrained Oriented Matching
            Lisa Fleischer and Zoya Svitkina

74        Averaging Techniques for Competitive Auctions
            Takayuki Ichiba and Kazuo Iwama

82        On Two Distributions of Subgroups of Free Groups
            Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, and Pascal Weil

90        Enumerating and Generating Labeled k-degenerate Graphs
            Reinhard Bauer, Marcus Krug, and Dorothea Wagner

99        The Connectivity-Profile of Random Increasing k-trees
            Alexis Darrasse, Hsien-Kuei Hwang, Olivier Bodini, and Michéle Soria

Renew SIAM · Contact Us · Site Map · Join SIAM · My Account