The following pages link to Charis Papadopoulos (Q266931):
Displaying 50 items.
- Clique-width of path powers (Q266933) (← links)
- On the performance of the first-fit coloring algorithm on permutation graphs (Q294842) (← links)
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs (Q415287) (← links)
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- A simple linear-time recognition algorithm for weakly quasi-threshold graphs (Q659727) (← links)
- The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs (Q704836) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs (Q868040) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs (Q1025922) (← links)
- Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
- Cluster deletion on interval graphs and split related graphs (Q2037103) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
- Clustering with partial information (Q2268879) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- A characterisation of clique-width through nested partitions (Q2348055) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← links)
- Minimal comparability completions of arbitrary graphs (Q2476257) (← links)
- A new representation of proper interval graphs with an application to clique-width (Q2839207) (← links)
- (Q3073568) (← links)
- Counting Spanning Trees in Graphs Using Modular Decomposition (Q3078398) (← links)
- (Q3154670) (← links)
- Cutwidth of Split Graphs and Threshold Graphs (Q3225130) (← links)
- Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820) (← links)
- Graphs of Linear Clique-Width at Most 3 (Q3502658) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs (Q3522962) (← links)
- Clustering with Partial Information (Q3599122) (← links)
- Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions (Q3608865) (← links)
- A Complete Characterisation of the Linear Clique-Width of Path Powers (Q3630209) (← links)
- (Q5009483) (← links)
- (Q5092370) (← links)
- (Q5116487) (← links)
- (Q5136273) (← links)
- Enumerating Minimal Subset Feedback Vertex Sets (Q5199260) (← links)
- Drawing graphs using modular decomposition (Q5301424) (← links)
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs (Q5302057) (← links)
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)
- (Q5387677) (← links)
- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions (Q5459137) (← links)
- (Q5708545) (← links)
- Graph Drawing (Q5897643) (← links)
- Strong triadic closure in cographs and graphs of low maximum degree (Q5915633) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
