activity
20162022
most citedFeferman-Vaught Decompositions for Prefix Classes of First Order Logic

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2019

Exact Crossing Number Parameterized by Vertex Cover

Petr Hliněný, Abhisekh Sankaran

We prove that the exact crossing number of a graph can be efficiently computed for simple graphs having bounded vertex cover. In more precise words, Crossing Number is in FPT when…