Ian P. Gent

activity

19932026

most citedBackbone Fragility and the Local Search Cost Peak

79 citations · 114 across the 23 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2018★ 2 cited

Solving computational problems in the theory of word-representable graphs

Özgür Akgün, Ian P. Gent, Sergey Kitaev +1

A simple graph $G = (V, E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ iff $x y \in E$ . Word-representable gra…

math.CO2014★ 4 cited

S-crucial and bicrucial permutations with respect to squares

Ian Gent, Sergey Kitaev, Alexander Konovalov +2

A permutation is square-free if it does not contain two consecutive factors of length two or more that are order-isomorphic. A permutation is bicrucial with respect to squares if i…