Bogdan Alecu

According to our database, Bogdan Alecu authored at least 17 papers between 2017 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

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

Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev

Algorithmica, February, 2026

2025

Every Graph is Essential to Large Treewidth.

Bogdan Alecu, Édouard Bonnet, Pedro Bureo Villafana, Nicolas Trotignon

CoRR, February, 2025

2024

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

Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl

Comb., October, 2024

Induced subgraphs and tree decompositions V. one neighbor in a hole.

Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl, Kristina Vuskovic

J. Graph Theory, April, 2024

The Treewidth and Pathwidth of Graph Unions.

Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev

SIAM J. Discret. Math., March, 2024

Critical properties of bipartite permutation graphs.

Bogdan Alecu, Vadim V. Lozin, Dmitriy S. Malyshev

J. Graph Theory, January, 2024

Induced subgraphs and tree decompositions VII. Basic obstructions in <i>H</i>-free graphs.

Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl

J. Comb. Theory B, January, 2024

Tree independence number I. (Even hole, diamond, pyramid)-free graphs.

Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl, Kristina Vuskovic

J. Graph Theory, 2024

2022

Letter Graphs and Geometric Grid Classes of Permutations.

Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim V. Lozin, Vincent Vatter, Victor Zamaraev

SIAM J. Discret. Math., December, 2022

Graph Parameters, Implicit Representations and Factorial Properties.

Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021

Graph classes with linear Ramsey numbers.

Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev

Discret. Math., 2021

Combinatorics and Algorithms for Quasi-chain Graphs.

Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

Between clique-width and linear clique-width of bipartite graphs.

Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev

Discret. Math., 2020

The Micro-world of Cographs.

Bogdan Alecu, Vadim V. Lozin, Dominique de Werra

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019

Graph Functionality.

Bogdan Alecu, Aistis Atminas, Vadim V. Lozin

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

2018

Linear Clique-Width of Bi-complement Reducible Graphs.

Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017

Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition.

Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev, Dominique de Werra

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017