◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Daniel Lokshtanov

1 paper here

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

author position
  • middle author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.DS1
ORCID 0000-0002-3166-9212

identity via Semantic Scholar / OpenAlex

most citedContracting Graphs to Paths and Trees

3 citations · 3 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2011★ 3 cited

Contracting Graphs to Paths and Trees

Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque +2

Vertex deletion and edge deletion problems play a central role in Parameterized Complexity. Examples include classical problems like Feedback Vertex Set, Odd Cycle Transversal, and…

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