Bogdan Alecu

Orcid: 0000-0002-5515-9145

Affiliations:
  • University of Leeds, UK


According to our database1, Bogdan Alecu authored at least 15 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs.
Comb., October, 2024

Induced subgraphs and tree decompositions V. one neighbor in a hole.
J. Graph Theory, April, 2024

The Treewidth and Pathwidth of Graph Unions.
SIAM J. Discret. Math., March, 2024

Critical properties of bipartite permutation graphs.
J. Graph Theory, January, 2024

Induced subgraphs and tree decompositions VII. Basic obstructions in <i>H</i>-free graphs.
J. Comb. Theory B, January, 2024

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions.
CoRR, 2024

2023
Combinatorics and Algorithms for Quasi-Chain Graphs.
Algorithmica, March, 2023

Graph parameters, implicit representations and factorial properties.
Discret. Math., 2023

2022
Letter Graphs and Geometric Grid Classes of Permutations.
SIAM J. Discret. Math., December, 2022

The micro-world of cographs.
Discret. Appl. Math., 2022

2021
Graph functionality.
J. Comb. Theory B, 2021

Graph classes with linear Ramsey numbers.
Discret. Math., 2021

2020
Between clique-width and linear clique-width of bipartite graphs.
Discret. Math., 2020

Letter graphs and geometric grid classes of permutations: Characterization and recognition.
Discret. Appl. Math., 2020

2018
Linear Clique-Width of Bi-complement Reducible Graphs.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018


  Loading...