Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Bernardo Subercaseaux

Bernardo Subercaseaux

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Complexity×1Combinatorics×1

Frequent co-authors

Marcelo Arenas1×
María Alejandra Schild1×

Research Timeline

2026
On the Complexity of Counting Orderings in Graphs

This paper shows #P-completeness for several graph counting problems using a new technique.

Highlighted terms show continued research focus across papers

Papers

cs.CCmath.COTheoreticalRecentJun 28, 2026

On the Complexity of Counting Orderings in Graphs

Marcelo Arenas, María Alejandra Schild, Bernardo Subercaseaux

This paper shows #P-completeness for several graph counting problems using a new technique.

View →