default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBogdan Alecu
Person information
- affiliation: University of Leeds, UK
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Tara Abrishami, Bogdan Alecu
, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs. Comb. 44(5): 921-948 (2024)- [j12]Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs. J. Comb. Theory B 164: 443-472 (2024) - [j11]Bogdan Alecu, Vadim V. Lozin, Dmitriy S. Malyshev:
Critical properties of bipartite permutation graphs. J. Graph Theory 105(1): 34-60 (2024) - [j10]Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl, Kristina Vuskovic:
Induced subgraphs and tree decompositions V. one neighbor in a hole. J. Graph Theory 105(4): 542-561 (2024) - [j9]Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev:
The Treewidth and Pathwidth of Graph Unions. SIAM J. Discret. Math. 38(1): 261-276 (2024) - [i4]Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev:
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. CoRR abs/2402.12559 (2024) - 2023
- [j8]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev:
Combinatorics and Algorithms for Quasi-Chain Graphs. Algorithmica 85(3): 642-664 (2023) - [j7]Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Victor Zamaraev:
Graph parameters, implicit representations and factorial properties. Discret. Math. 346(10): 113573 (2023) - [i3]Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev:
Graph parameters, implicit representations and factorial properties. CoRR abs/2303.04453 (2023) - 2022
- [j6]Bogdan Alecu, Vadim V. Lozin, Dominique de Werra:
The micro-world of cographs. Discret. Appl. Math. 312: 3-14 (2022) - [j5]Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim V. Lozin, Vincent Vatter, Victor Zamaraev:
Letter Graphs and Geometric Grid Classes of Permutations. SIAM J. Discret. Math. 36(4): 2774-2797 (2022) - [c6]Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev:
Graph Parameters, Implicit Representations and Factorial Properties. IWOCA 2022: 60-72 - [i2]Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev:
The treewidth and pathwidth of graph unions. CoRR abs/2202.07752 (2022) - 2021
- [j4]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev:
Graph classes with linear Ramsey numbers. Discret. Math. 344(4): 112307 (2021) - [j3]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin:
Graph functionality. J. Comb. Theory B 147: 139-158 (2021) - [c5]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Dmitriy S. Malyshev:
Combinatorics and Algorithms for Quasi-chain Graphs. IWOCA 2021: 49-62 - 2020
- [j2]Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev:
Letter graphs and geometric grid classes of permutations: Characterization and recognition. Discret. Appl. Math. 283: 482-494 (2020) - [j1]Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev:
Between clique-width and linear clique-width of bipartite graphs. Discret. Math. 343(8): 111926 (2020) - [c4]Bogdan Alecu, Vadim V. Lozin, Dominique de Werra:
The Micro-world of Cographs. IWOCA 2020: 30-42
2010 – 2019
- 2019
- [c3]Bogdan Alecu, Aistis Atminas, Vadim V. Lozin:
Graph Functionality. WG 2019: 135-147 - 2018
- [c2]Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev:
Linear Clique-Width of Bi-complement Reducible Graphs. IWOCA 2018: 14-25 - [i1]Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev:
Letter graphs and geometric grid classes of permutations: characterization and recognition. CoRR abs/1804.11217 (2018) - 2017
- [c1]Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev, Dominique de Werra:
Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition. IWOCA 2017: 195-205
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 00:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
