29 citations · 212 across the 50 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DS2016★ 2 cited
Anti-Path Cover on Sparse Graph Classes
Pavel Dvořák, Dušan Knop, Tomáš Masařík
We show that it is possible to use Bondy-Chvatal closure to design an FPT algorithm that decides whether or not it is possible to cover vertices of an input graph by at most k vert…
math.CO2016
Triangle-free planar graphs with the smallest independence number
Zdeněk Dvořák, Tomáš Masařík, Jan Musílek +1
Steinberg and Tovey proved that every n-vertex planar triangle-free graph has an independent set of size at least (n+1)/3, and described an infinite class of tight examples. We sho…
math.QA2016★ 2 cited
Quantization of canonical bases and the quantum symplectic double
Dylan G. L. Allegretti
We describe a natural -deformation of Fock and Goncharov's canonical basis for the algebra of regular functions on a cluster variety associated to a quiver of type . We then…