vix.ing · top · new · best · stats · spec

Zamaraev, Viktor

  1. Computing Maximum Matchings in Temporal Graphs
    2019/05/13 by George B. Mertzios, Mertzios, George B., Hendrik Molter +7 · 4 citations
    Computer Science · #Caching and Content Delivery #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #Distributed systems and fault tolerance #FOS: Computer and information sciences #Opportunistic and Delay-Tolerant Networks
  2. Deleting edges to restrict the size of an epidemic in temporal networks
    2018/05/17 by Enright, Jessica, Meeks, Kitty, Mertzios, George B. +1 · 4 citations
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  3. Randomized Communication and Implicit Graph Representations
    2021/11/05 by Harms, Nathaniel, Wild, Sebastian, Zamaraev, Viktor · 4 citations
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  4. Sharp Thresholds in Random Simple Temporal Graphs
    2020/11/07 by Casteigts, Arnaud, Raskin, Michael, Renken, Malte +1 · 3 citations
    #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  5. On forbidden induced subgraphs for unit disk graphs
    2016/02/25 by Atminas, Aistis, Zamaraev, Viktor · 2 citations
    #Combinatorics (math.CO) #FOS: Mathematics
  6. Temporal Vertex Cover with a Sliding Time Window
    2018/02/20 by Akrida, Eleni C., Mertzios, George B., Spirakis, Paul G. +1 · 2 citations
    #Computational Complexity (cs.CC) #FOS: Computer and information sciences
  7. Giant Components in Random Temporal Graphs
    2022/05/30 by Ruben Becker, Becker, Ruben, Arnaud Casteigts +11 · 3 citations
    Computer Science · #Opportunistic and Delay-Tolerant Networks
  8. How fast can we reach a target vertex in stochastic temporal graphs?
    2019/03/08 by Akrida, Eleni C., Mertzios, George B., Nikoletseas, Sotiris +3 · 2 citations
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  9. Sliding Window Temporal Graph Coloring
    2018/11/12 by Mertzios, George B., Molter, Hendrik, Zamaraev, Viktor · 2 citations
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  10. Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank
    2023/07/10 by Nathaniel Harms, Harms, Nathaniel, Viktor Zamaraev +1 · 3 citations
    Biochemistry, Genetics and Molecular Biology · Computer Science · #Computational Complexity (cs.CC) #DNA and Biological Computing #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Topological and Geometric Data Analysis
  11. The structure and the number of P7-free bipartite graphs
    2016/07/29 by Lozin, Vadim, Zamaraev, Viktor · 1 citation
    #Combinatorics (math.CO) #FOS: Mathematics
  12. Graphs with minimum fractional domatic number
    2023/02/22 by Gadouleau, Maximilien, Harms, Nathaniel, Mertzios, George B. +1 · 1 citation
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  13. Symmetric-Difference (Degeneracy) and Signed Tree Models
    2024/05/15 by Bonnet, Édouard, Duron, Julien, Sylvester, John +1 · 1 citation
    #05C05 #05C78 #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics