共 50 条
[43]
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds
[J].
PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA,
2022,
:431-458
[44]
Ehrenfeucht-Fraisse goes elementarily automatic for structures of bounded degree
[J].
29TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, (STACS 2012),
2012, 14
:242-253
[45]
Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs
[J].
2011 IEEE 26TH ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC),
2011,
:34-44
[46]
Location of zeros for the partition function of the Ising model on bounded degree graphs
[J].
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES,
2020, 101 (02)
:765-785
[48]
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
[J].
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011,
2011, 6648
:483-494
[50]
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
[J].
FRONTIERS IN ALGORITHMICS, PROCEEDINGS,
2009, 5598
:153-162