Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Giménez, Omer
Hliněný, Petr
and
Noy, Marc
2005.
Graph-Theoretic Concepts in Computer Science.
Vol. 3787,
Issue. ,
p.
59.
Giménez, Omer
Hliněný, Petr
and
Noy, Marc
2006.
Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width.
SIAM Journal on Discrete Mathematics,
Vol. 20,
Issue. 4,
p.
932.
Bläser, Markus
and
Dell, Holger
2007.
Automata, Languages and Programming.
Vol. 4596,
Issue. ,
p.
801.
Felsner, Stefan
and
Knauer, Kolja
2011.
Distributive lattices, polyhedra, and generalized flows.
European Journal of Combinatorics,
Vol. 32,
Issue. 1,
p.
45.
Bläser, Markus
Dell, Holger
and
Fouz, Mahmoud
2012.
Complexity and Approximability of the Cover Polynomial.
computational complexity,
Vol. 21,
Issue. 3,
p.
359.
Guo, Heng
and
He, Kun
2020.
Tight bounds for popping algorithms.
Random Structures & Algorithms,
Vol. 57,
Issue. 2,
p.
371.
Arenas, Marcelo
Barceló, Pablo
and
Monet, Mikaël
2021.
The Complexity of Counting Problems Over Incomplete Databases.
ACM Transactions on Computational Logic,
Vol. 22,
Issue. 4,
p.
1.
Guo, Heng
and
Jerrum, Mark
2021.
Approximately counting bases of bicircular matroids.
Combinatorics, Probability and Computing,
Vol. 30,
Issue. 1,
p.
124.
Fomin, Fedor V.
Golovach, Petr A.
Panolan, Fahad
Philip, Geevarghese
and
Saurabh, Saket
2024.
Diverse collections in matroids and graphs.
Mathematical Programming,
Vol. 204,
Issue. 1-2,
p.
415.
Chan, Swee Hong
and
Pak, Igor
2024.
Computational complexity of counting coincidences.
Theoretical Computer Science,
Vol. 1015,
Issue. ,
p.
114776.
Pak, Igor
2024.
Open Problems in Algebraic Combinatorics.
Vol. 110,
Issue. ,
p.
191.