19 citations · 63 across the 12 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2019
Circle Graph Isomorphism in Almost Linear Time
Vít Kalisz, Pavel Klavík, Peter Zeman
Circle graphs are intersection graphs of chords of a circle. In this paper, we present a new algorithm for the circle graph isomorphism problem running in time whe…
cs.DS2012★ 6 cited
Extending partial representations of function graphs and permutation graphs
Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk +1
Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0,1] and are known to be exactly the complements of comparability gra…
cs.DS2012
MSOL Restricted Contractibility to Planar Graphs
James Abello, Pavel Klavík, Jan Kratochvíl +1
We study the computational complexity of graph planarization via edge contraction. The problem CONTRACT asks whether there exists a set of at most edges that when contracte…