default search action
Victor Zamaraev
Viktor Zamaraev
Person information
- affiliation: University of Liverpool, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j40]Argyrios Deligkas
, George B. Mertzios
Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle. Algorithmica 86(9): 2766-2785 (2024) - [j39]Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev
Graphs with minimum fractional domatic number. Discret. Appl. Math. 343: 140-148 (2024) - [j38]Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Eur. J. Comb. 117: 103821 (2024) - [j37]Vadim V. Lozin, Viktor Zamaraev
Union-closed sets and Horn Boolean functions. J. Comb. Theory A 202: 105818 (2024) - [j36]Arnaud Casteigts
Sharp Thresholds in Random Simple Temporal Graphs. SIAM J. Comput. 53(2): 346-388 (2024) - [j35]Édouard Bonnet
Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SIAM J. Comput. 53(5): 1578-1601 (2024) - [j34]Bogdan Alecu
The Treewidth and Pathwidth of Graph Unions. SIAM J. Discret. Math. 38(1): 261-276 (2024) - [j33]Louis Esperet
Optimal Adjacency Labels for Subgraphs of Cartesian Products. SIAM J. Discret. Math. 38(3): 2181-2193 (2024) - [c27]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
Tight Bounds on Adjacency Labels for Monotone Graph Classes. ICALP 2024: 31:1-31:20 - [c26]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
Symmetric-Difference (Degeneracy) and Signed Tree Models. MFCS 2024: 32:1-32:16 - [c25]Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SODA 2024: 1147-1165 - [c24]Nathaniel Harms, Viktor Zamaraev
Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank. SODA 2024: 1810-1833 - [i38]Jonathan Balasingham, Viktor Zamaraev
Accelerating Material Property Prediction using Generically Complete Isometry Invariants. CoRR abs/2401.15089 (2024) - [i37]Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. CoRR abs/2402.12559 (2024) - [i36]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev:
Symmetric-Difference (Degeneracy) and Signed Tree Models. CoRR abs/2405.09011 (2024) - [i35]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev:
Adjacency Labeling Schemes for Small Classes. CoRR abs/2409.04821 (2024) - 2023
- [j32]Konstantinos Tsakalidis
Succinct Permutation Graphs. Algorithmica 85(2): 509-543 (2023) - [j31]Bogdan Alecu
Graph parameters, implicit representations and factorial properties. Discret. Math. 346(10): 113573 (2023) - [j30]George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev
Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137: 1-19 (2023) - [c23]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric
Giant Components in Random Temporal Graphs. APPROX/RANDOM 2023: 29:1-29:17 - [c22]Louis Esperet, Nathaniel Harms, Viktor Zamaraev
Optimal Adjacency Labels for Subgraphs of Cartesian Products. ICALP 2023: 57:1-57:11 - [i34]Clément Dallard
Functionality of box intersection graphs. CoRR abs/2301.09493 (2023) - [i33]Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev
Graphs with minimum fractional domatic number. CoRR abs/2302.11668 (2023) - [i32]Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Graph parameters, implicit representations and factorial properties. CoRR abs/2303.04453 (2023) - [i31]Nathaniel Harms, Viktor Zamaraev:
Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank. CoRR abs/2307.04441 (2023) - [i30]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Small But Unwieldy. CoRR abs/2307.11225 (2023) - [i29]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Tight bounds on adjacency labels for monotone graph classes. CoRR abs/2310.20522 (2023) - 2022
- [j29]Vadim V. Lozin, Viktor Zamaraev
On Boolean threshold functions with minimum specification number. Inf. Comput. 289(Part): 104926 (2022) - [j28]Bogdan Alecu
Letter Graphs and Geometric Grid Classes of Permutations. SIAM J. Discret. Math. 36(4): 2774-2797 (2022) - [j27]Christian Konrad, Viktor Zamaraev
Distributed minimum vertex coloring and maximum independent set in chordal graphs. Theor. Comput. Sci. 922: 486-502 (2022) - [c21]Bogdan Alecu
Graph Parameters, Implicit Representations and Factorial Properties. IWOCA 2022: 60-72 - [c20]Duncan Adamson
Faster Exploration of Some Temporal Graphs. SAND 2022: 5:1-5:10 - [c19]Nathaniel Harms, Sebastian Wild
Randomized communication and implicit graph representations. STOC 2022: 1220-1233 - [i28]Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev
The treewidth and pathwidth of graph unions. CoRR abs/2202.07752 (2022) - [i27]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric
Giant Components in Random Temporal Graphs. CoRR abs/2205.14888 (2022) - [i26]Louis Esperet, Nathaniel Harms, Viktor Zamaraev
Optimal Adjacency Labels for Subgraphs of Cartesian Products. CoRR abs/2206.02872 (2022) - [i25]Jonathan Balasingham, Viktor Zamaraev
Compact Graph Representation of molecular crystals using Point-wise Distance Distributions. CoRR abs/2212.11246 (2022) - 2021
- [j26]Bogdan Alecu
Graph classes with linear Ramsey numbers. Discret. Math. 344(4): 112307 (2021) - [j25]Jessica A. Enright, Kitty Meeks, George B. Mertzios
Deleting edges to restrict the size of an epidemic in temporal networks. J. Comput. Syst. Sci. 119: 60-77 (2021) - [j24]George B. Mertzios
Sliding window temporal graph coloring. J. Comput. Syst. Sci. 120: 97-115 (2021) - [c18]Arnaud Casteigts, Michael Raskin, Malte Renken
Sharp Thresholds in Random Simple Temporal Graphs. FOCS 2021: 319-326 - [i24]Christian Konrad, Peter Robinson, Viktor Zamaraev:
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication. CoRR abs/2103.07027 (2021) - [i23]Nathaniel Harms, Sebastian Wild
Randomized Communication and the Implicit Graph Conjecture. CoRR abs/2111.03639 (2021) - 2020
- [j23]Bogdan Alecu
Letter graphs and geometric grid classes of permutations: Characterization and recognition. Discret. Appl. Math. 283: 482-494 (2020) - [j22]Bogdan Alecu
Between clique-width and linear clique-width of bipartite graphs. Discret. Math. 343(8): 111926 (2020) - [j21]Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
Independent domination versus weighted independent domination. Inf. Process. Lett. 156: 105914 (2020) - [j20]Eleni C. Akrida
Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. 107: 108-123 (2020) - [j19]Eleni C. Akrida
How fast can we reach a target vertex in stochastic temporal graphs? J. Comput. Syst. Sci. 114: 65-83 (2020) - [j18]Alexandre Blanché
Clique-Width for Graph Classes Closed under Complementation. SIAM J. Discret. Math. 34(2): 1107-1147 (2020) - [c17]Argyrios Deligkas
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. MFCS 2020: 27:1-27:13 - [c16]George B. Mertzios
Computing Maximum Matchings in Temporal Graphs. STACS 2020: 27:1-27:14 - [i22]Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. CoRR abs/2004.06036 (2020) - [i21]Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Matching in Stochastically Evolving Graphs. CoRR abs/2005.08263 (2020) - [i20]Konstantinos Tsakalidis, Sebastian Wild
Succinct Permutation Graphs. CoRR abs/2010.04108 (2020) - [i19]Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev
Sharp Thresholds in Random Simple Temporal Graphs. CoRR abs/2011.03738 (2020)
2010 – 2019
- 2019
- [c15]George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Sliding Window Temporal Graph Coloring. AAAI 2019: 7667-7674 - [c14]Eleni C. Akrida
How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? ICALP 2019: 131:1-131:14 - [c13]Christian Konrad, Viktor Zamaraev
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. MFCS 2019: 21:1-21:15 - [c12]Jessica A. Enright
Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks. MFCS 2019: 57:1-57:15 - [i18]Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev
How fast can we reach a target vertex in stochastic temporal graphs? CoRR abs/1903.03636 (2019) - [i17]George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev
Computing Maximum Matchings in Temporal Graphs. CoRR abs/1905.05304 (2019) - [i16]Maximilien Gadouleau, George B. Mertzios, Viktor Zamaraev
Linear Programming complementation and its application to fractional graph theory. CoRR abs/1907.12775 (2019) - [i15]Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. CoRR abs/1910.05254 (2019) - 2018
- [j17]Hassan AbouEisha
Upper Domination: Towards a Dichotomy Through Boundary Properties. Algorithmica 80(10): 2799-2817 (2018) - [j16]Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin
Infinitely many minimal classes of graphs of unbounded clique-width. Discret. Appl. Math. 248: 145-152 (2018) - [j15]Vadim V. Lozin, Igor Razgon, Viktor Zamaraev
Linear read-once and related Boolean functions. Discret. Appl. Math. 250: 16-27 (2018) - [j14]Aistis Atminas, Viktor Zamaraev
On Forbidden Induced Subgraphs for Unit Disk Graphs. Discret. Comput. Geom. 60(1): 57-97 (2018) - [j13]Vadim V. Lozin, Igor Razgon, Viktor Zamaraev
Well-quasi-ordering versus clique-width. J. Comb. Theory B 130: 1-18 (2018) - [j12]Alain Hertz
Dominating induced matchings in graphs containing no long claw. J. Graph Theory 88(1): 18-39 (2018) - [c11]Eleni C. Akrida
Temporal Vertex Cover with a Sliding Time Window. ICALP 2018: 148:1-148:14 - [c10]Bogdan Alecu
Linear Clique-Width of Bi-complement Reducible Graphs. IWOCA 2018: 14-25 - [c9]Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Linear Ramsey Numbers. IWOCA 2018: 26-38 - [c8]Konrad K. Dabrowski, Matthew Johnson
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. MFCS 2018: 63:1-63:15 - [c7]Christian Konrad, Viktor Zamaraev
Brief Announcement: Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. PODC 2018: 159-161 - [i14]Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Temporal Vertex Cover with a Sliding Time Window. CoRR abs/1802.07103 (2018) - [i13]Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev
Letter graphs and geometric grid classes of permutations: characterization and recognition. CoRR abs/1804.11217 (2018) - [i12]Christian Konrad, Viktor Zamaraev:
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. CoRR abs/1805.04544 (2018) - [i11]Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
Deleting edges to restrict the size of an epidemic in temporal networks. CoRR abs/1805.06836 (2018) - [i10]Vadim V. Lozin, Igor Razgon, Viktor Zamaraev
Linear read-once and related Boolean functions. CoRR abs/1805.10159 (2018) - [i9]George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Sliding Window Temporal Graph Coloring. CoRR abs/1811.04753 (2018) - 2017
- [j11]Vadim V. Lozin
The structure and the number of P7-free bipartite graphs. Eur. J. Comb. 65: 143-153 (2017) - [j10]Vadim V. Lozin
The structure and the number of P7-free bipartite graphs. Electron. Notes Discret. Math. 61: 827-833 (2017) - [j9]Vadim V. Lozin
More results on weighted independent domination. Theor. Comput. Sci. 700: 63-74 (2017) - [c6]Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh:
Specifying a positive threshold function via extremal points. ALT 2017: 208-222 - [c5]Bogdan Alecu
Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition. IWOCA 2017: 195-205 - [c4]Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson
Clique-Width for Graph Classes Closed under Complementation. MFCS 2017: 73:1-73:14 - [c3]Vadim V. Lozin, Dmitriy S. Malyshev
New Results on Weighted Independent Domination. WG 2017: 399-411 - [i8]Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev
Infinitely many minimal classes of graphs of unbounded clique-width. CoRR abs/1701.08857 (2017) - [i7]Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Victor Zamaraev
Clique-Width for Graph Classes Closed under Complementation. CoRR abs/1705.07681 (2017) - [i6]Vadim V. Lozin, Igor Razgon, Victor Zamaraev
Specifying a positive threshold function via extremal points. CoRR abs/1706.01747 (2017) - 2016
- [j8]Konrad Kazimierz Dabrowski, Vadim V. Lozin
Combinatorics and Algorithms for Augmenting Graphs. Graphs Comb. 32(4): 1339-1352 (2016) - [c2]Hassan AbouEisha
A Boundary Property for Upper Domination. IWOCA 2016: 229-240 - [i5]Vadim V. Lozin, Raffaele Mosca, Victor Zamaraev
Independent Domination versus Weighted Independent Domination. CoRR abs/1602.09124 (2016) - [i4]Hassan AbouEisha
Upper Domination: towards a dichotomy through boundary properties. CoRR abs/1609.01510 (2016) - 2015
- [j7]Aistis Atminas, Andrew Collins, Vadim V. Lozin
Implicit representations and factorial properties of graphs. Discret. Math. 338(2): 164-179 (2015) - [j6]Boris I. Goldengorin
A tolerance-based heuristic approach for the weighted independent set problem. J. Comb. Optim. 29(2): 433-450 (2015) - [j5]Vadim V. Lozin
Boundary Properties of Factorial Classes of Graphs. J. Graph Theory 78(3): 207-218 (2015) - [c1]Vadim V. Lozin
Well-quasi-ordering Does Not Imply Bounded Clique-width. WG 2015: 351-359 - [i3]Vadim V. Lozin, Igor Razgon, Victor Zamaraev
Well-quasi-ordering does not imply bounded clique-width. CoRR abs/1503.00571 (2015) - [i2]Alain Hertz, Vadim V. Lozin, Bernard Ries, Victor Zamaraev, Dominique de Werra:
Dominating induced matchings in graphs containing no long claw. CoRR abs/1505.02558 (2015) - 2014
- [j4]Vadim V. Lozin
Corrigendum to "Locally bounded coverings and factorial properties of graphs" [European J. Combin. 33(2012) 534-543]. Eur. J. Comb. 40: 168 (2014) - [i1]Konrad K. Dabrowski, Dominique de Werra, Vadim V. Lozin, Victor Zamaraev
Combinatorics and algorithms for augmenting graphs. CoRR abs/1410.8774 (2014) - 2012
- [j3]Konrad K. Dabrowski
On factorial properties of chordal bipartite graphs. Discret. Math. 312(16): 2457-2465 (2012) - [j2]Vadim V. Lozin
Locally bounded coverings and factorial properties of graphs. Eur. J. Comb. 33(4): 534-543 (2012) - 2011
- [j1]Vadim V. Lozin, Colin Mayhill, Victor Zamaraev
A Note on the Speed of Hereditary Graph Properties. Electron. J. Comb. 18(1) (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: