V. V. Lepin

Available identifiers

zbMath Open lepin.v-vMaRDI QIDQ2906900

List of research outcomes

Publication	Date of Publication	Type
Minimization of the diameters of edges in the packing of a hypergraph into a \(d\)-dimensional lattice	2025-01-17	Paper
A linear algorithm for determining the minimum-weight vertex cover of a \(k\)-terminal recursively generated hypergraph	2025-01-17	Paper
https://portal.mardi4nfdi.de/entity/Q5869351	2022-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q5869336	2022-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q5225203	2019-07-19	Paper
https://portal.mardi4nfdi.de/entity/Q4961733	2018-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q4691777	2018-10-24	Paper
https://portal.mardi4nfdi.de/entity/Q4691855	2018-10-24	Paper
https://portal.mardi4nfdi.de/entity/Q4691844	2018-10-24	Paper
https://portal.mardi4nfdi.de/entity/Q4691789	2018-10-24	Paper
https://portal.mardi4nfdi.de/entity/Q4691867	2018-10-24	Paper
https://portal.mardi4nfdi.de/entity/Q4691905	2018-10-24	Paper
https://portal.mardi4nfdi.de/entity/Q4691914	2018-10-24	Paper
https://portal.mardi4nfdi.de/entity/Q5275503	2017-07-14	Paper
https://portal.mardi4nfdi.de/entity/Q3450144	2015-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q3144471	2012-12-08	Paper
Algorithms for finding biclique covers of graphs with bounded pathwidth	2012-09-05	Paper
https://portal.mardi4nfdi.de/entity/Q3082074	2011-03-09	Paper
https://portal.mardi4nfdi.de/entity/Q3082076	2011-03-09	Paper
https://portal.mardi4nfdi.de/entity/Q3059592	2010-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q3059622	2010-11-25	Paper
A linear algorithm for computing the multiclique cover number of a series-parallel graph	2010-01-07	Paper
https://portal.mardi4nfdi.de/entity/Q3655448	2010-01-07	Paper
Capacity complexity of the accessibility problem for frontally bounded digraphs	2009-12-11	Paper
An algorithm for finding the independence number of a recursively generated hypergraph	2009-04-14	Paper
https://portal.mardi4nfdi.de/entity/Q3620683	2009-04-14	Paper
The tree profile problem and optimal edge labeling.	2009-03-29	Paper
A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree	2007-05-29	Paper
https://portal.mardi4nfdi.de/entity/Q4821267	2004-10-11	Paper
https://portal.mardi4nfdi.de/entity/Q4821198	2004-10-11	Paper
https://portal.mardi4nfdi.de/entity/Q4468767	2004-06-11	Paper
https://portal.mardi4nfdi.de/entity/Q3125666	1997-05-04	Paper
https://portal.mardi4nfdi.de/entity/Q4840973	1995-12-13	Paper
https://portal.mardi4nfdi.de/entity/Q3699701	1985-01-01	Paper

Research outcomes over time

This page was built for person: V. V. Lepin