ERD

Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Simple and tight complexity lower bounds for solving Rabin games

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Sparse Graphs of Twin-width 2 Have Bounded Tree-width

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Parameterized Complexity of Directed Traveling Salesman Problem

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Minor Containment and Disjoint Paths in Almost-Linear Time

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Ar...

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Embedding Planar Graphs into Graphs of Treewidth O (log3 n )

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Fully dynamic approximation schemes on planar and apex-minor-free graphs

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Max Weight Independent Set in Sparse Graphs with No Long Claws

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

3D-grids are not transducible from planar graphs

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Dynamic treewidth

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Parameterized Dynamic Data Structure for Split Completion

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Cliquewidth and Dimension

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Box-Reachability in Vector Addition Systems

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Odd Cycle Transversal on P 5 -free Graphs in Polynomial Time

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a plana...

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Sparse Induced Subgraphs in P₇-Free Graphs of Bounded Clique Number

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Flip-width: Cops and Robber on dense graphs

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded cli...

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Sparse induced subgraphs in P6-free graphs

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

First-Order Model Checking on Monadically Stable Graph Classes

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

On classes of bounded tree rank, their interpretations, and efficient sparsification

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Tabular Intermediate Logics Comparison

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Positionality in Σ^0_2 and a Completeness Result

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

A parameterized approximation scheme for the 2D-Knapsack problem with wide items

Project: BOBR

Updated at: 01-01-2026

Show more information

Project acronym BOBR

Resources

Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata

Simple and tight complexity lower bounds for solving Rabin games

Sparse Graphs of Twin-width 2 Have Bounded Tree-width

Parameterized Complexity of Directed Traveling Salesman Problem

Minor Containment and Disjoint Paths in Almost-Linear Time

Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Ar...

Embedding Planar Graphs into Graphs of Treewidth <i>O</i> (log<sup>3</sup> <i>n</i> )

Fully dynamic approximation schemes on planar and apex-minor-free graphs

Max Weight Independent Set in Sparse Graphs with No Long Claws

3D-grids are not transducible from planar graphs

Dynamic treewidth

Parameterized Dynamic Data Structure for Split Completion

List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs

Cliquewidth and Dimension

Box-Reachability in Vector Addition Systems

Odd Cycle Transversal on <i>P</i> <sub>5</sub> -free Graphs in Polynomial Time

A polynomial-time OPT<sup>ɛ</sup>-approximation algorithm for maximum independent set of connected subgraphs in a plana...

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Sparse Induced Subgraphs in P₇-Free Graphs of Bounded Clique Number

Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane

Flip-width: Cops and Robber on dense graphs

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded cli...

Sparse induced subgraphs in <i>P</i><sub>6</sub>-free graphs

First-Order Model Checking on Monadically Stable Graph Classes

On classes of bounded tree rank, their interpretations, and efficient sparsification

Graphs with No Long Claws: An Improved Bound for the Analog of the Gyárfás' Path Argument

Tabular Intermediate Logics Comparison

Positionality in Σ^0_2 and a Completeness Result

A parameterized approximation scheme for the 2D-Knapsack problem with wide items