Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Torgny Andersson
Robert J. Zomer
Antonis Papachristodoulou
Scott A. Starks
Gollamudi, S.
Hikaru Fujisaki
Michael Terry
Zhihao Li
Radu Timofte
Tatsunori Obara
Home
/
Author
/
VICTOR ZAMARAEV
Author Info
Open Visualization
Name
Affiliation
Papers
VICTOR ZAMARAEV
University of Nizhny Novgorod and Higher School of Economics, Nizhny Novgorod, Russia
27
Collaborators
Citations
PageRank
38
18
9.64
Referers
Referees
References
42
296
196
Search Limit
100
296
Publications (27 rows)
Collaborators (38 rows)
Referers (42 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Independent domination versus weighted independent domination.
0
0.34
2020
Between clique-width and linear clique-width of bipartite graphs
0
0.34
2020
Letter graphs and geometric grid classes of permutations: characterization and recognition
0
0.34
2020
Clique-Width for Graph Classes Closed under Complementation.
0
0.34
2020
Computing Maximum Matchings in Temporal Graphs
0
0.34
2019
How fast can we reach a target vertex in stochastic temporal graphs?
0
0.34
2019
Linear read-once and related Boolean functions.
0
0.34
2018
Brief Announcement: Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs.
0
0.34
2018
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal.
0
0.34
2018
Infinitely many minimal classes of graphs of unbounded clique-width.
0
0.34
2018
On Forbidden Induced Subgraphs for Unit Disk Graphs.
0
0.34
2018
Temporal Vertex Cover with a Sliding Time Window.
1
0.35
2018
Upper Domination: towards a dichotomy through boundary properties.
0
0.34
2018
Well-quasi-ordering versus clique-width
0
0.34
2018
Sliding Window Temporal Graph Coloring.
1
0.35
2018
The structure and the number of P7-free bipartite graphs.
0
0.34
2017
Clique-Width for Graph Classes Closed under Complementation.
0
0.34
2017
Specifying a positive threshold function via extremal points.
1
0.37
2017
More results on weighted independent domination.
0
0.34
2017
New Results On Weighted Independent Domination
0
0.34
2017
A Boundary Property For Upper Domination
4
0.46
2016
Independent Domination versus Weighted Independent Domination.
0
0.34
2016
Corrigendum to "Locally bounded coverings and factorial properties of graphs" [European J. Combin. 33(2012) 534-543].
0
0.34
2014
Combinatorics and algorithms for augmenting graphs.
2
0.40
2014
Locally bounded coverings and factorial properties of graphs
4
0.45
2012
On factorial properties of chordal bipartite graphs.
3
0.43
2012
A Note on the Speed of Hereditary Graph Properties.
2
0.39
2011
1
