Browse by People


Up a level
Export as [feed] RSS [feed] RSS 2.0 Short Author List
Number of items: 34.


Alecu, Bogdan, Kante, Mamadou Moustapha, Lozin, Vadim and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020) Between clique-width and linear clique-width of bipartite graphs. DISCRETE MATHEMATICS, 343 (8).


Blanché, Alexandre, Dabrowski, Konrad K, Johnson, Matthew, Lozin, Vadim V, Paulusma, Daniël and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020) Clique-Width for Graph Classes Closed under Complementation. SIAM Journal on Discrete Mathematics, 34 (2). 1107 - 1147.


Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor ORCID: 0000-0001-5755-4141 and Zschoche, Philipp
(2020) Computing Maximum Matchings in Temporal Graphs. .


Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor ORCID: 0000-0001-5755-4141 and Zschoche, Philipp
(2020) Computing Maximum Matchings in Temporal Graphs. .


Enright, Jessica, Meeks, Kitty, Mertzios, George B and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2021) Deleting edges to restrict the size of an epidemic in temporal networks. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 119. 60 - 77.


Konrad, Christian and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2018) Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. .


Konrad, Christian and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2022) Distributed minimum vertex coloring and maximum independent set in chordal graphs. Theoretical Computer Science, 922. 486 - 502.


Hertz, Alain, Lozin, Vadim, Ries, Bernard, Zamaraev, Viktor ORCID: 0000-0001-5755-4141 and de Werra, Dominique
(2018) Dominating induced matchings in graphs containing no long claw. JOURNAL OF GRAPH THEORY, 88 (1). 18 - 39.


Deligkas, Argyrios, Mertzios, George B, Spirakis, Paul G and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020) Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle.


Alecu, Bogdan, Alekseev, Vladimir E, Atminas, Aistis, Lozin, Vadim and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2022) Graph Parameters, Implicit Representations and Factorial Properties. .


Alecu, Bogdan, Atminas, Aistis, Lozin, Vadim and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2021) Graph classes with linear Ramsey numbers. Discrete Mathematics, 344 (4).


Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul G and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2019) How fast can we reach a target vertex in stochastic temporal graphs?


Akrida, Eleni C, Mertzios, George B, Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020) How fast can we reach a target vertex in stochastic temporal graphs? Journal of Computer and System Sciences, 114. 65 - 83.


Lozin, Vadim, Malyshev, Dmitriy, Mosca, Raffaele and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020) Independent domination versus weighted independent domination. INFORMATION PROCESSING LETTERS, 156.


Lozin, Vadim V, Malyshev, Dmitriy S, Mosca, Raffaele and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020) Independent domination versus weighted independent domination. Inf. Process. Lett., 156. 105914 - 105914.


Alecu, Bogdan, Ferguson, Robert, Kanté, Mamadou Moustapha, Lozin, Vadim, Vatter, Vincent and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2021) Letter graphs and geometric grid classes of permutations. [Preprint]


Alecu, Bogdan, Lozin, Vadim V, Werra, Dominique de and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020) Letter graphs and geometric grid classes of permutations: Characterization and recognition. Discret. Appl. Math., 283. 482 - 494.


Atminas, Aistis, Lozin, Vadim and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2018) Linear Ramsey Numbers. .


Lozin, Vadim, Razgon, Igor, Zamaraev, Viktor ORCID: 0000-0001-5755-4141, Zamaraeva, Elena and Zolotykh, Nikolai
(2018) Linear read-once and related Boolean functions. DISCRETE APPLIED MATHEMATICS, 250. 16 - 27.


Lozin, Vadim, Malyshev, Dmitriy, Mosca, Raffaele and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2017) More results on weighted independent domination. THEORETICAL COMPUTER SCIENCE, 700. 63 - 74.


Lozin, Vadim, Zamaraev, Viktor, Zamaraeva, Elena and Zolotykh, Nikolai Yu
(2022) On Boolean threshold functions with minimum specification number. Information and Computation. 104926 - 104926.


Atminas, Aistis and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2018) On Forbidden Induced Subgraphs for Unit Disk Graphs. Discrete and Computational Geometry: an international journal of mathematics and computer science, 60. 57 - 97.


Harms, Nathaniel, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2021) Randomized Communication and Implicit Graph Representations. .


Harms, Nathaniel, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2022) Randomized communication and implicit graph representations. In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing.


Konrad, Christian, Robinson, Peter and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2021) Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication. [Preprint]


Casteigts, Arnaud, Raskin, Michael, Renken, Malte, Zamaraev, Viktor ORCID: 0000-0001-5755-4141 and SOC, IEEE COMP
(2022) Sharp Thresholds in Random Simple Temporal Graphs. [Report]


Mertzios, George B, Molter, Hendrik and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2021) Sliding window temporal graph coloring. Journal of Computer and System Sciences, 120. 97 - 115.


Tsakalidis, Konstantinos ORCID: 0000-0001-6470-9332, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020) Succinct Permutation Graphs. [Report]


Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Spirakis, Paul G and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2018) Temporal Vertex Cover with a Sliding Time Window. .


Akrida, E ORCID: 0000-0002-1126-1623, Mertzios, George B, Spirakis, Paul ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020) Temporal Vertex Cover with a Sliding Time Window. Journal of Computer and System Sciences, 107. 108 - 123.


AbouEisha, Hassan, Hussain, Shahid, Lozin, Vadim, Monnot, Jerome, Ries, Bernard and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2018) Upper Domination: Towards a Dichotomy Through Boundary Properties. ALGORITHMICA, 80 (10). 2799 - 2817.


Lozin, Vadim, Razgon, Igor and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2018) Well-quasi-ordering versus clique-width. JOURNAL OF COMBINATORIAL THEORY SERIES B, 130. 1 - 18.


Lozin, Vadim and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2017) The structure and the number of P-7-free bipartite graphs. EUROPEAN JOURNAL OF COMBINATORICS, 65. 143 - 153.


Alecu, Bogdan, Lozin, Vadim, Quiroz, Daniel A, Rabinovich, Roman, Razgon, Igor and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2022) The treewidth and pathwidth of graph unions. [Report]

This list was generated on Sat Aug 6 21:22:39 2022 BST.