research
∙
12/11/2022
Beyond circular-arc graphs – recognizing lollipop graphs and medusa graphs
In 1992 Biró, Hujter and Tuza introduced, for every fixed connected grap...
share
research
∙
06/27/2022
Recognition and Isomorphism of Proper U-graphs in FPT-time
An H-graph is an intersection graph of connected subgraphs of a suitable...
research
∙
08/30/2021
Extending Partial Representations of Circular-Arc Graphs
The partial representation extension problem generalizes the recognition...
research
∙
07/22/2021
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable
It is known that testing isomorphism of chordal graphs is as hard as the...
research
∙
08/04/2020
Automorphism groups of maps in linear time
By a map we mean a 2-cell decomposition of a closed compact surface, i.e...
research
∙
08/24/2019
Circle Graph Isomorphism in Almost Linear Time
Circle graphs are intersection graphs of chords of a circle. In this pap...
research
∙
08/17/2019
Discrete and Fast Fourier Transform Made Clear
Fast Fourier transform was included in the Top 10 Algorithms of 20th Cen...
research
∙
03/26/2019