Victor Zamaraev

From MaRDI portal
Person:402474

Available identifiers

zbMath Open zamaraev.victor-aMaRDI QIDQ402474

List of research outcomes

PublicationDate of PublicationType
Sharp Thresholds in Random Simple Temporal Graphs2024-04-04Paper
Union-closed sets and Horn Boolean functions2024-01-29Paper
The Treewidth and Pathwidth of Graph Unions2024-01-23Paper
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal2024-01-23Paper
Functionality of box intersection graphs2024-01-19Paper
Graphs with minimum fractional domatic number2024-01-02Paper
Randomized communication and implicit graph representations2023-12-08Paper
Graph parameters, implicit representations and factorial properties2023-07-19Paper
Computing maximum matchings in temporal graphs2023-07-10Paper
Succinct permutation graphs2023-02-16Paper
Computing maximum matchings in temporal graphs.2023-02-07Paper
On Boolean threshold functions with minimum specification number2022-12-08Paper
Letter Graphs and Geometric Grid Classes of Permutations2022-11-15Paper
Graph parameters, implicit representations and factorial properties2022-08-30Paper
How fast can we reach a target vertex in stochastic temporal graphs2022-07-21Paper
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50924192022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50891922022-07-18Paper
Distributed minimum vertex coloring and maximum independent set in chordal graphs2022-06-13Paper
Optimal Adjacency Labels for Subgraphs of Cartesian Products2022-06-06Paper
Giant Components in Random Temporal Graphs2022-05-30Paper
https://portal.mardi4nfdi.de/entity/Q50051662021-08-04Paper
Temporal Vertex Cover with a Sliding Time Window2021-07-28Paper
Sliding window temporal graph coloring2021-06-30Paper
Deleting edges to restrict the size of an epidemic in temporal networks2021-04-14Paper
Graph classes with linear Ramsey numbers2021-03-25Paper
How fast can we reach a target vertex in stochastic temporal graphs?2020-09-07Paper
Letter graphs and geometric grid classes of permutations: characterization and recognition2020-06-29Paper
Clique-Width for Graph Classes Closed under Complementation2020-06-09Paper
Between clique-width and linear clique-width of bipartite graphs2020-06-08Paper
https://portal.mardi4nfdi.de/entity/Q51112902020-05-26Paper
Independent domination versus weighted independent domination2020-02-11Paper
Temporal vertex cover with a sliding time window2019-11-29Paper
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal2019-10-11Paper
Brief Announcement2019-09-19Paper
Specifying a positive threshold function via extremal points2019-01-10Paper
Network Structures Uncertainty for Different Markets2018-12-20Paper
Linear read-once and related Boolean functions2018-10-26Paper
Measures of uncertainty in market network analysis2018-09-20Paper
Infinitely many minimal classes of graphs of unbounded clique-width2018-09-17Paper
Linear clique-width of bi-complement reducible graphs2018-09-06Paper
Linear Ramsey numbers2018-09-06Paper
Upper domination: towards a dichotomy through boundary properties2018-07-26Paper
On forbidden induced subgraphs for unit disk graphs2018-07-26Paper
Dominating induced matchings in graphs containing no long claw2018-07-13Paper
Letter graphs and geometric grid classes of permutations: characterization and recognition2018-06-15Paper
Well-quasi-ordering versus clique-width2018-04-18Paper
The structure and the number of \(P_7\)-free bipartite graphs2018-01-18Paper
New results on weighted independent domination2018-01-04Paper
More results on weighted independent domination2017-10-17Paper
The structure and the number of \(P_7\)-free bipartite graphs2017-08-31Paper
Well-quasi-ordering Does Not Imply Bounded Clique-width2016-10-21Paper
A Boundary Property for Upper Domination2016-09-29Paper
Combinatorics and algorithms for augmenting graphs2016-07-28Paper
Market Graph and Markowitz Model2015-10-05Paper
https://portal.mardi4nfdi.de/entity/Q52638382015-07-17Paper
Boundary Properties of Factorial Classes of Graphs2015-03-24Paper
A tolerance-based heuristic approach for the weighted independent set problem2015-02-16Paper
Implicit representations and factorial properties of graphs2014-11-20Paper
Corrigendum to ``Locally bounded coverings and factorial properties of graphs2014-08-28Paper
Almost all factorial subclasses of quasi-line graphs with respect to one forbidden subgraph2012-09-05Paper
On factorial properties of chordal bipartite graphs2012-08-10Paper
Locally bounded coverings and factorial properties of graphs2012-05-04Paper
On estimation of the number of graphs in some hereditary classes2012-03-23Paper
A note on the speed of hereditary graph properties2011-10-18Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Victor Zamaraev