output
20112025
most citedOn the asymptotic and practical complexity of solving bivariate systems over the reals

77 citations

researchers with a paper here
collaborating institutions
Showing math.COShow all

2 papers · 1 filter

math.CO2014

Contraction Obstructions for Connected Graph Searching

Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos +1

We consider the connected variant of the classic mixed search game where, in each search step, cleaned edges form a connected subgraph. We consider graph classes with bounded conne…

math.CO2011★ 1 cited

Asymptotic Enumeration of Non-crossing Partitions on Surfaces

Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos

We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface and introduce the number of non-crossin…