Browsing by Author Heggernes, P.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Jump to: Α Β Γ Δ Ε Ζ Η Θ Ι Κ Λ Μ Ν Ξ Ο Π Ρ Σ Τ Υ Φ Χ Ψ Ω
or enter first few letters:  
View Option
Showing results 1 to 10 of 10
TitleAuthor(s)Issue date
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphsHeggernes, P.; Meister, D.; Papadopoulos, C.24-Nov-2015
Clustering with partial informationPapadopoulos, C.; Bodlaender, H.; Fellows, M.; Heggernes, P.; Mancini, F.; Rosamond, F.24-Nov-2015
A Complete Characterisation of the Linear Clique-Width of Path PowersPapadopoulos, C.; Heggernes, P.; Meister, D.24-Nov-2015
Cutwidth of Split Graphs and Threshold GraphsHeggernes, P.; Lokshtanov, D.; Mihai, R.; Papadopoulos, C.24-Nov-2015
Graphs of linear clique-width at most 3Papadopoulos, C.; Heggernes, P.; Meister, D.24-Nov-2015
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability CompletionsPapadopoulos, C.; Heggernes, P.; Mancini, F.24-Nov-2015
Minimal comparability completions of arbitrary graphsPapadopoulos, C.; Heggernes, P.; Mancini, F.24-Nov-2015
A new representation of properinterval graphs with an application to clique-widthPapadopoulos, C.; Heggernes, P.; Meister, D.24-Nov-2015
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletionsPapadopoulos, C.; Heggernes, P.24-Nov-2015
Strongly chordal and chordal bipartite graphs are sandwich monotoneHeggernes, P.; Mancini, F.; Papadopoulos, C.; Sritharan, R.24-Nov-2015