Browse by People


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


Spirakis, Paul ORCID: 0000-0001-5396-3749, deligkas, argyrios, George Mertzios, and Zamaraev, Viktor
(2023) Approximate and randomized algorithms for computing a second Hamiltonian cycle. Algorithmica: an international journal in computer science.


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). p. 111926.


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). pp. 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. In: STACS.


Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor ORCID: 0000-0001-5755-4141 and Zschoche, Philipp
(2023) Computing maximum matchings in temporal graphs. Journal of Computer and System Sciences, 137. pp. 1-19.


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. pp. 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. pp. 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). pp. 18-39.


Deligkas, Argyrios, Mertzios, George B, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2020) Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. Leibniz International Proceedings in Informatics, LIPIcs, 170.


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. In: The 33rd International Workshop on Combinatorial Algorithms (IWOCA), 2022-6-7 - 2022-6-9, Trier, Germany.


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). p. 112307.


Gadouleau, Maximilien, Harms, Nathaniel, Mertzios, George B and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2024) Graphs with minimum fractional domatic number. Discrete Applied Mathematics, 343. pp. 140-148.


Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2019) How fast can we reach a target vertex in stochastic temporal graphs? Leibniz International Proceedings in Informatics, LIPIcs, 132. 131:1-131:1.


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. pp. 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. p. 105914.


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. p. 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. pp. 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. pp. 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. pp. 63-74.


Lozin, Vadim, Zamaraev, Viktor ORCID: 0000-0001-5755-4141, Zamaraeva, Elena and Zolotykh, Nikolai Yu
(2022) On Boolean threshold functions with minimum specification number. INFORMATION AND COMPUTATION, 289. p. 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 (1). pp. 57-97.


Esperet, Louis, Harms, Nathaniel and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2022) Optimal Adjacency Labels for Subgraphs of Cartesian Products. .


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.


Harms, Nathaniel, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Zamaraev, Viktor
(2021) Randomized Communication and the Implicit Graph Conjecture. CoRR, abs/21.


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 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2022) Sharp Thresholds in Random Simple Temporal Graphs. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022-2-7 - 2022-2-10.


Casteigts, Arnaud, Raskin, Michael, Renken, Malte and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2023) Sharp Thresholds in Random Simple Temporal Graphs. SIAM Journal on Computing.


Casteigts, Arnaud, Raskin, Michael, Renken, Malte and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2021) Sharp Thresholds in Random Simple Temporal Graphs. .


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. pp. 97-115.


Bonnet, Édouard, Duron, Julien, Sylvester, John ORCID: 0000-0002-6543-2934, Zamaraev, Viktor and Zhukovskii, Maksim
(2023) Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. In: ACM-SIAM Symposium on Discrete Algorithms (SODA24).


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]


Tsakalidis, Konstantinos ORCID: 0000-0001-6470-9332, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2023) Succinct Permutation Graphs. Algorithmica, 85 (2). pp. 509-543.


Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2018) Temporal Vertex Cover with a Sliding Time Window. In: International; Colloquium on Automata , Languages and Programming (ICALP), 2018-7-9 - 2018-7-13, Prague.


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. pp. 108-123.


Alecu, Bogdan, Lozin, Vadim V, Quiroz, Daniel A ORCID: 0000-0002-2479-0508, Rabinovich, Roman, Razgon, Igor and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2024) The Treewidth and Pathwidth of Graph Unions. SIAM Journal on Discrete Mathematics, 38 (1). pp. 261-276.


Lozin, Vadim and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2024) Union-closed sets and Horn Boolean functions. Journal of Combinatorial Theory, Series A, 202. p. 105818.


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). pp. 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. pp. 1-18.


Lozin, Vadim and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2017) The structure and the number of <i>P</i><sub>7</sub>-free bipartite graphs. EUROPEAN JOURNAL OF COMBINATORICS, 65. pp. 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 Wed Jan 24 16:06:53 2024 GMT.