The following pages link to Pinar Heggernes (Q266929):
Displaying 50 items.
- Clique-width of path powers (Q266933) (← links)
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Graph classes and Ramsey numbers (Q400493) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- Edge search number of cographs (Q415273) (← links)
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs (Q415287) (← links)
- Edge contractions in subclasses of chordal graphs (Q423902) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (Q512562) (← links)
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- Enumerating minimal dominating sets in chordal graphs (Q738877) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Optimal broadcast domination in polynomial time (Q856876) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- The firefighter problem on graph classes (Q899308) (← links)
- Minimal split completions (Q967310) (← links)
- Hardness and approximation of minimum distortion embeddings (Q991793) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072) (← links)
- (Q1589426) (redirect page) (← links)
- A practical algorithm for making filled graphs minimal (Q1589427) (← links)
- Scheduling unit-length jobs with precedence constraints of small height (Q1667212) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Graph searching, elimination trees, and a generalization of bandwidth (Q1763148) (← links)
- Maximum cardinality search for computing minimal triangulations of graphs (Q1882406) (← links)
- Polar permutation graphs are polynomial-time recognisable (Q1933641) (← links)
- Choosability on \(H\)-free graphs (Q1943624) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- Enumeration of minimal connected dominating sets for chordal graphs (Q2174551) (← links)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- Finding connected secluded subgraphs (Q2186823) (← links)
