Invitation to algorithmic uses of inclusion-exclusion

Authors:
Thore Husfeldt
Affiliations:
IT University of Copenhagen, Denmark and Lund University, Sweden
Venue:
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Year:
2011

Citing 12
Cited 1

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Dynamic Programming Treatment of the Travelling Salesman Problem

Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
A generating function approach to the Traveling Salesman Problem

ACM '77 Proceedings of the 1977 annual conference
Fourier meets möbius: fast subset convolution

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings

Algorithmica - Parameterized and Exact Algorithms
Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Set Partitioning via Inclusion-Exclusion

SIAM Journal on Computing
Trimmed Moebius Inversion and Graphs of Bounded Degree

Theory of Computing Systems - Special Title: Symposium on Theoretical Aspects of Computer Science; Guest Editors: Susanne Albers, Pascal Weil
Evaluation of permanents in rings and semirings

Information Processing Letters
Covering and packing in linear space

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Exact Exponential Algorithms

Exact Exponential Algorithms

Exact exponential algorithms

Communications of the ACM

Quantified Score

Hi-index	0.02

Visualization

Abstract

I give an introduction to algorithmic uses of the principle of inclusion-exclusion. The presentation is intended to be be concrete and accessible, at the expense of generality and comprehensiveness.