2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Society For Industrial And Applied Mathematics

9781611972542, 9781611973037

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximating Fault-Tolerant Domination in General Graphs

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973037.4 ◽

2013 ◽

Cited By ~ 3

Author(s):

Klaus-Tycho Foerster

Keyword(s):

Fault Tolerant ◽

General Graphs

Download Full-text

On Delta-Method of Moments and Probabilistic Sums

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973037.11 ◽

2013 ◽

Cited By ~ 3

Author(s):

Jacek Cichoń ◽

Zbigniew Gołębiewski ◽

Marcin Kardas ◽

Marek Klonowski

Keyword(s):

Method Of Moments ◽

Delta Method

Download Full-text

Bootstrap Percolation on Random Geometric Graphs (Extended Abstract)

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973037.3 ◽

2013 ◽

Cited By ~ 2

Author(s):

Milan Bradonjić ◽

Iraj Saniee

Keyword(s):

Bootstrap Percolation ◽

Geometric Graphs ◽

Random Geometric Graphs

Download Full-text

The Number of Ways to Assemble a Graph

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973037.2 ◽

2013 ◽

Author(s):

Miklós Bóna ◽

Andrew Vince

Download Full-text

Exact-size Sampling for Motzkin Trees in Linear Time via Boltzmann Samplers and Holonomic Specification

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973037.7 ◽

2013 ◽

Cited By ~ 3

Author(s):

A. Bacher ◽

O. Bodini ◽

A. Jacquot

Keyword(s):

Linear Time ◽

Exact Size

Download Full-text

Analysis of Parameters of Trees Corresponding to Huffman Codes and Sums of Unit Fractions

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973037.5 ◽

2013 ◽

Author(s):

Clemens Heuberger ◽

Daniel Krenn ◽

Stephan Wagner

Keyword(s):

Huffman Codes ◽

Unit Fractions

Download Full-text

Approximate Counting of Matchings in Sparse Uniform Hypergraphs

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973037.9 ◽

2013 ◽

Cited By ~ 1

Author(s):

Marek Karpinski ◽

Andrzej Rucinski ◽

Edyta Szymanska

Keyword(s):

Approximate Counting ◽

Uniform Hypergraphs

Download Full-text

When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973037.10 ◽

2013 ◽

Cited By ~ 1

Author(s):

Jérémie du Boisberranger ◽

Danièle Gardy ◽

Xavier Lorca ◽

Charlotte Truchet

Keyword(s):

Probabilistic Analysis

Download Full-text

Extremal Parameters in Sub-Critical Graph Classes

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973037.1 ◽

2013 ◽

Cited By ~ 2

Author(s):

Michael Drmota ◽

Marc Noy

Keyword(s):

Critical Graph ◽

Graph Classes

Download Full-text

The Variance of the Number of 2-Protected Nodes in a Trie

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611973037.6 ◽

2013 ◽

Cited By ~ 1

Author(s):

Jeffrey Gaither ◽

Mark Daniel Ward

Download Full-text

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Society For Industrial And Applied Mathematics

Approximating Fault-Tolerant Domination in General Graphs

On Delta-Method of Moments and Probabilistic Sums

Bootstrap Percolation on Random Geometric Graphs (Extended Abstract)

The Number of Ways to Assemble a Graph

Exact-size Sampling for Motzkin Trees in Linear Time via Boltzmann Samplers and Holonomic Specification

Analysis of Parameters of Trees Corresponding to Huffman Codes and Sums of Unit Fractions

Approximate Counting of Matchings in Sparse Uniform Hypergraphs

When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent

Extremal Parameters in Sub-Critical Graph Classes

The Variance of the Number of 2-Protected Nodes in a Trie

2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
Latest Publications