Vladimir E. Alekseev

From MaRDI portal
Revision as of 02:27, 10 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Vladimir E. Alekseev to Vladimir E. Alekseev: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:705490

Available identifiers

zbMath Open alekseev.vladimir-eMaRDI QIDQ705490

List of research outcomes





PublicationDate of PublicationType
Graph parameters, implicit representations and factorial properties2023-07-19Paper
Graph parameters, implicit representations and factorial properties2022-08-30Paper
New Cases of the Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Paths2018-11-21Paper
Independent sets in graphs without subtrees with many leaves2016-08-12Paper
König graphs for 3-paths and 3-cycles2016-04-07Paper
https://portal.mardi4nfdi.de/entity/Q52637772015-07-17Paper
https://portal.mardi4nfdi.de/entity/Q31151922012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152062012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152862012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31156272012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156722012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31157092012-02-10Paper
The Maximum Independent Set Problem in Planar Graphs2009-02-03Paper
An upper bound for the number of maximal independent sets in a graph2008-02-08Paper
NP-hard graph problems and boundary classes of graphs2008-01-07Paper
https://portal.mardi4nfdi.de/entity/Q46676042005-04-20Paper
Augmenting graphs for independent sets2005-01-31Paper
Boundary classes of graphs for the dominating set problem2004-08-19Paper
On easy and hard hereditary classes of graphs with respect to the independent set problem2003-12-04Paper
Independent sets of maximum weight in (\(p,q\))-colorable graphs.2003-05-25Paper
On the entropy of hereditary classes of coloured graphs2001-08-02Paper
On orthogonal representations of graphs2001-06-04Paper
https://portal.mardi4nfdi.de/entity/Q45288252001-02-12Paper
Polynomial algorithm for finding the largest independent sets in graphs without forks2000-01-31Paper
Local transformations of graphs preserving independence number1999-05-11Paper
https://portal.mardi4nfdi.de/entity/Q43694781998-01-05Paper
https://portal.mardi4nfdi.de/entity/Q42721171995-01-09Paper
On the entropy values of hereditary classes of graphs1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q33625471992-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36718831982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51849411981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38933271979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39372941979-01-01Paper
On the number o f Steiner triple systems1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40415861974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56845501973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56157241969-01-01Paper
On the Skolem method for the construction of cyclic systems of Steiner triples1967-01-01Paper

Research outcomes over time

This page was built for person: Vladimir E. Alekseev