◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Axenovich

74 papers hereh-index 201.3k citations138 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • first author69
  • middle author2
  • last author1

Across the 74 of 74 papers where every author was matched, so the position is known.

fields
  • math.CO73
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20062026
most citedOn the editing distance of graphs

33 citations · 164 across the 61 of their papers we have counts for

collaborators
Showing 2012Show all

3 papers · 1 filter

math.CO2012★ 1 cited

A regularity lemma and twins in words

Maria Axenovich, Yury Person, Svetlana Puzynina

For a word S, let f(S) be the largest integer m such that there are two disjoints identical (scattered) subwords of length m. Let $f(n, Σ) = \min \{f(S): S \text{is of leng…

math.CO2012★ 3 cited

On homometric sets in graphs

Maria Axenovich, Lale Özkahya

For a vertex set S⊆V(G) in a graph G, the {\em distance multiset}, D(S), is the multiset of pairwise distances between vertices of S in G. Two vertex sets are ca…

cs.DM2012

Fork-forests in bi-colored complete bipartite graphs

Maria Axenovich, Marcus Krug, Georg Osang +1

Motivated by the problem in [6], which studies the relative efficiency of propositional proof systems, 2-edge colorings of complete bipartite graphs are investigated. It is shown t…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.