Skip to main navigation
Skip to search
Skip to main content
Help & FAQ
English
Nederlands
Home
Researchers
Research output
Organisational units
Activities
Projects
Prizes
Press / Media
Facilities / Equipment
Datasets
Courses
Research areas
Student theses
Search by expertise, name or affiliation
Fast polynomial-space algorithms using inclusion-exclusion
J. Nederlof
Research output
:
Contribution to journal
›
Article
›
Academic
›
peer-review
42
Citations (Scopus)
2
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Fast polynomial-space algorithms using inclusion-exclusion'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Inclusion-exclusion
Steiner Tree
Polynomial
Spanning tree
Walk
Spanning Forest
Graph in graph theory
Fixed-parameter Tractability
Number of Components
Exact Algorithms
Perfect Matching
Configuration Space
Notation
Branching
Colouring
Counting
Internal
Polynomial time
Cover
Computing
Term
Integer
Generalization
Engineering & Materials Science
Polynomials
Trees (mathematics)
Coloring