8 papers
Reconstructing Historical Manuscripts through MSI: The Potential of Contrast in Assessing Image Quality and Legibility
Anna Breger
Digital restoration of historical manuscript images aims to improve readability while preserving the authenticity of cultural heritage documents. However, evaluating quality of res…
Induced packing treewidth
Amir Nikabadi, PaweÅ RzÄ Å¼ewski
In this paper, we introduce a framework that aims to unify classes defined by forbidden induced subgraphs or induced minors with classes defined by the existence of certain structu…
Equitable coloring of large bipartite graphs
Amir Nikabadi
For a graph , the \emph{equitable chromatic number} of , denoted by , is the smallest integer such that admits a proper -coloring whose color classes diff…
Counting equitable -colorings in graphs of bounded clique-width
Holger Dell, Thore Husfeldt, Amir Nikabadi
For a graph , a proper -coloring of is \emph{equitable} if the sizes of any two color classes differ by at most one. The \textsc{Equitable -Coloring} problem asks, for…
Clique-width and induced topological minors
PaweÅ RafaÅ BieliÅski, Jadwiga Czyżewska, Martin MilaniÄ +2
A is a chordless path on four vertices. A diamond is a graph obtained from a clique of size four by removing one edge of the clique. A paw is a graph obtained from a clique o…
The Gallai Vertex Problem is -Complete
Amir Nikabadi, Eva Rotenberg, Lasse Wulf
When a graph admits a vertex that is contained in all its longest paths, we call a Gallai vertex. These are named after Gallai, who in 1966 asked the question if it is…