◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Kolman

4 papers hereh-index 15777 citations58 works total

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

author position
  • sole author1
  • first author2
  • middle author1

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

fields
  • cs.DS3
  • cs.CC1

identity via Semantic Scholar / OpenAlex

activity
20152019
most citedExtension Complexity, MSO Logic, and Treewidth

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

collaborators
Showing 2017 · cs.DSShow all

1 paper · 2 filters

cs.DS2017★ 1 cited

On Algorithms for L-bounded Cut Problem

Petr Kolman

Given a graph G=(V,E) with two distinguished vertices s,t∈V and an integer parameter L>0, an {\em L-bounded cut} is a subset F of edges (vertices) such that the every…

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