◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Andrei Gagarin

2 papers here

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

author position
  • first author1
  • middle author1

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

fields
  • cs.DM1
  • cs.DS1

identity via Semantic Scholar / OpenAlex

most citedPattern Backtracking Algorithm for the Workflow Satisfiability Problem

5 citations · 6 across the 2 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2014★ 1 cited

Bounds and algorithms for limited packings in graphs

Andrei Gagarin, Vadim Zverovich

We consider (closed neighbourhood) packings and their generalization in graphs called limited packings. A vertex set X in a graph G is a k-limited packing if for any vertex $v\in V…

◍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.