default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDANALCO 2013: New Orleans, Louisiana, USA
- Markus E. Nebel, Wojciech Szpankowski:
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013, New Orleans, Louisiana, USA, January 6, 2013. SIAM 2013, ISBN 978-1-61197-254-2
Session 1
- Michael Drmota, Marc Noy:
Extremal Parameters in Sub-Critical Graph Classes. 1-7 - Miklós Bóna
, Andrew Vince:
The number of ways to assemble a graph. 8-17 - Milan Bradonjic, Iraj Saniee:
Bootstrap Percolation on Random Geometric Graphs. 18-24 - Klaus-Tycho Förster:
Approximating Fault-Tolerant Domination in General Graphs. 25-32
Session 2
- Clemens Heuberger, Daniel Krenn, Stephan G. Wagner:
Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions. 33-42 - Jeffrey Gaither, Mark Daniel Ward:
The Variance of the Number of 2-Protected Nodes in a Trie. 43-51 - Axel Bacher, Olivier Bodini, Alice Jacquot:
Exact-size Sampling for Motzkin Trees in Linear Time via Boltzmann Samplers and Holonomic Specification. 52-61 - Hosam M. Mahmoud:
Perpetuities in fair leader election algorithms. 62-71
Session 3
- Edyta Szymanska, Marek Karpinski, Andrzej Rucinski:
Approximate Counting of Matchings in Sparse Uniform Hypergraphs. 72-79 - Jérémie Du Boisberranger, Danièle Gardy, Xavier Lorca, Charlotte Truchet:
When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent. 80-90 - Jacek Cichon, Zbigniew Golebiewski, Marcin Kardas, Marek Klonowski:
On Delta-Method of Moments and Probabilistic Sums. 91-98 - Sandra R. Kingan:
Unlabeled equivalence for matroids representable over finite fields. 99-106
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-27 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
