Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Victor Petrovich Il'ev - MaRDI portal

Victor Petrovich Il'ev

From MaRDI portal
(Redirected from Person:226472)
Person:446172

Available identifiers

zbMath Open ilev.victor-petrovichMaRDI QIDQ446172

List of research outcomes





PublicationDate of PublicationType
On cluster editing problem with clusters of small sizes2024-08-16Paper
Bounds for the clustering complexity in a graph clustering problem with clusters of bounded size2024-02-01Paper
https://portal.mardi4nfdi.de/entity/Q60817222023-10-05Paper
$2$-Approximation algorithms for two graph clustering problems2022-07-15Paper
ALGORITHMS FOR SOLVING SYSTEMS OF EQUATIONS OVER VARIOUS CLASSES OF FINITE GRAPHS2021-10-08Paper
An Approximation Algorithm for a Semi-supervised Graph Clustering Problem2021-02-25Paper
On a semi-superwized graph clustering problem2021-02-17Paper
APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM2021-02-17Paper
https://portal.mardi4nfdi.de/entity/Q51504252021-02-15Paper
A CHARACTERIZATION OF MATROIDS IN TERMS OF SURFACES2021-02-15Paper
On axiomatizability of the class of finitary matroids and decidability of their universal theory2020-11-24Paper
A 2-approximation algorithm for the graph 2-clustering problem2020-05-19Paper
Approximation algorithms for graph approximation problems2018-10-24Paper
Short Survey on Graph Correlation Clustering with Minimization Criteria2018-02-13Paper
Approximate solution of the \(p\)-median minimization problem2017-04-05Paper
Graph clustering with a constraint on cluster sizes2017-02-09Paper
On the problem of maximizing a modular function in the geometric lattice2014-03-12Paper
Minimizing modular and supermodular functions on \(L\)-matroids2012-09-05Paper
Problems on independence systems solvable by the greedy algorithm2012-03-23Paper
https://portal.mardi4nfdi.de/entity/Q31152482012-02-20Paper
Computational complexity of the graph approximation problem2012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156772012-02-10Paper
Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid2006-03-16Paper
https://portal.mardi4nfdi.de/entity/Q46754642005-05-04Paper
https://portal.mardi4nfdi.de/entity/Q44461692004-01-26Paper
Hereditary systems and greedy-type algorithms.2003-12-04Paper
An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function.2002-10-15Paper
https://portal.mardi4nfdi.de/entity/Q42508602001-02-09Paper
https://portal.mardi4nfdi.de/entity/Q42681431999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q48889341997-04-08Paper
https://portal.mardi4nfdi.de/entity/Q37441751985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36841321984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47428181982-01-01Paper

Research outcomes over time

This page was built for person: Victor Petrovich Il'ev