The following pages link to Ioan Todinca (Q344838):
Displayed 50 items.
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
- The complexity of the bootstraping percolation and other problems (Q393154) (← links)
- A note on planar graphs with large width parameters and small grid-minors (Q423947) (← links)
- (Q627516) (redirect page) (← links)
- On dissemination thresholds in regular and irregular graph classes (Q627518) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Injective colorings with arithmetic constraints (Q897262) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- Minimal proper interval completions (Q963366) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Minimal interval completion through graph exploration (Q1001896) (← links)
- Approximating the treewidth of AT-free graphs. (Q1408810) (← links)
- Chordal embeddings of planar graphs (Q1417569) (← links)
- On treewidth approximations. (Q1427177) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- Distributed testing of excluded subgraphs (Q1660944) (← links)
- Two rounds are enough for reconstructing any graph (class) in the congested clique model (Q1713905) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- The role of randomness in the broadcast congested clique model (Q2051760) (← links)
- A meta-theorem for distributed certification (Q2097341) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← links)
- The impact of locality on the detection of cycles in the broadcast congested clique model (Q2294684) (← links)
- On distributed Merlin-Arthur decision protocols (Q2303292) (← links)
- Allowing each node to communicate only once in a distributed system: shared whiteboard models (Q2355326) (← links)
- On powers of graphs of bounded NLC-width (clique-width) (Q2383546) (← links)
- Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208) (← links)
- (Circular) backbone colouring: forest backbones in planar graphs (Q2449063) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- (Q2766670) (← links)
- Treewidth and Minimum Fill-in: Grouping the Minimal Separators (Q2784449) (← links)
- (Q2816043) (← links)
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Treewidth and Pathwidth Parameterized by the Vertex Cover Number (Q2842160) (← links)
- Exponential time algorithms for the minimum dominating set problem on some graph classes (Q2930282) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615) (← links)
- Exact Algorithm for the Maximum Induced Planar Subgraph Problem (Q3092237) (← links)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
- Constructing Brambles (Q3182927) (← links)
- On the heapability of finite partial orders (Q3386613) (← links)
- Treewidth of planar graphs: connections with duality (Q3438941) (← links)
- Connected Graph Searching in Outerplanar Graphs (Q3439336) (← links)
- Pathwidth of Circular-Arc Graphs (Q3508573) (← links)
- Minimal Proper Interval Completions (Q3522959) (← links)
- An ${\mathcal{O}}(n^2)$ -time Algorithm for the Minimal Interval Completion Problem (Q3569074) (← links)