Fetching the paper…
Reading the bibliography…
Let U be a universe on n elements, let k be a positive integer, and let F be a family of (implicitly defined) subsets of U.
The design and analysis of factorial experiments
F. Yates · 1937
Earlier work this paper cites.
Characterizations of derived graphs
Lowell W. Beineke · 1970
Earlier work this paper cites.
Set-packing problem and threshold graphs
V. Chvátal and P. L. Hammer · 1973
Earlier work this paper cites.
Split graphs
Stephan Földes and Peter L. Hammer · 1977
Earlier work this paper cites.
Trivially perfect graphs
Martin C. Golumbic · 1978
Earlier work this paper cites.
Complement reducible graphs
D. G. Corneil, H. Lerchs, and L. Stewart Burlingham · 1981
Earlier work this paper cites.
On generating all maximal independent sets
David S. Johnson, Mihalis Yannakakis, and Christos H. Papadimitriou · 1988
Earlier work this paper cites.
A quantum algorithm for finding the minimum
Christoph Dürr and Peter Høyer · 1996
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996
Earlier work this paper cites.
Tight bounds on quantum searching
Michel Boyer, Gilles Brassard, Peter Høyer, and Alain Tapp · 1998
Cited alongside, same era.
Enumerating maximal independent sets with applications to graph colouring
Jesper Makholm Byskov · 2004
Cited alongside, same era.
Inclusion–exclusion algorithms for counting set partitions
Andreas Björklund and Thore Husfeldt · 2006
Cited alongside, same era.
An O ∗ ( 2 n ) O^{*}(2^{n}) algorithm for graph coloring and other partitioning problems via inclusion–exclusion
Mikko Koivisto · 2006
Cited alongside, same era.
Fourier meets möbius: fast subset convolution
Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto · 2007
Cited alongside, same era.
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, and Alexey A. Stepanov · 2008
Exact Exponential Algorithms
Fedor V. Fomin and Dieter Kratsch · 2010
Later among the works it cites.
Covering and packing in linear space
Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto · 2011
Later among the works it cites.
Maximum r-regular induced subgraph problem: Fast exponential algorithms and combinatorial bounds
Sushmita Gupta, Venkatesh Raman, and Saket Saurabh · 2012
Later among the works it cites.
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
Andris Ambainis and Martins Kokainis · 2017
Later among the works it cites.
Exact algorithms via multivariate subroutines
Serge Gaspers and Edward J. Lee · 2017
Later among the works it cites.
Quantum speedups for exponential-time dynamic programming algorithms
Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, and Jevgenijs Vihrovs · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Solving NP-complete problems with quantum search
Martin Fürer · 2008
Cited alongside, same era.
Set partitioning via inclusion-exclusion
Andreas Björklund, Thore Husfeldt, and Mikko Koivisto · 2009
Cited alongside, same era.
Later among the works it cites.
Exact algorithms via monotone local search
Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, and Saket Saurabh · 2019
Later among the works it cites.
Exponential-time quantum algorithms for graph coloring problems
Kazuya Shimizu and Ryuhei Mori · 2022
Later among the works it cites.