◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Michał Pilipczuk

173 papers hereh-index 386.8k citations265 works total

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

author position
  • sole author4
  • first author14
  • middle author100
  • last author53

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

fields
  • cs.DS89
  • math.CO28
  • cs.DM19
  • cs.LO17
  • cs.CC8
  • cs.FL7
same name
  • Michał Pilipczuk — 5 papers

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102026
most citedLower bounds for approximation schemes for Closest String

16 citations · 188 across the 122 of their papers we have counts for

collaborators
Showing 2013 · cs.DMShow all

1 paper · 2 filters

cs.DM2013

The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable

Marek Cygan, Dániel Marx, Marcin Pilipczuk +1

Given a graph G and k pairs of vertices (s_1,t_1), ..., (s_k,t_k), the k-Vertex-Disjoint Paths problem asks for pairwise vertex-disjoint paths P_1, ..., P_k such that P_i goes from…

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