◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Andrej Sajenko

6 papers hereh-index 588 citations14 works total

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

author position
  • last author6

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

fields
  • cs.DS5
  • cs.CC1

identity via Semantic Scholar / OpenAlex

activity
20182020
most citedLinear-Time In-Place DFS and BFS on the Word RAM

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

collaborators
Showing 2020Show all

2 papers · 1 filter

cs.DS2020

Space-Efficient Graph Kernelizations

Frank Kammer, Andrej Sajenko

Let n be the size of a parameterized problem and k the parameter. We present kernels for Feedback Vertex Set, Path Contraction and Cluster Editing/Deletion whose sizes are all…

cs.DS2020

Sorting and Ranking of Self-Delimiting Numbers with Applications to Outerplanar Graph Isomorphism

Frank Kammer, Johannes Meintrup, Andrej Sajenko

Assume that an N-bit sequence S of k numbers encoded as Elias gamma codes is given as input. We present space-efficient algorithms for sorting, dense ranking and competitive…

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