◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Piotr Micek

Jagiellonian University

56 papers hereh-index 181.7k citations194 works total

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

author position
  • first author4
  • middle author41
  • last author9

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

fields
  • math.CO46
  • cs.CG4
  • cs.DM4
  • cs.DS2
affiliations
  • Jagiellonian University
Homepage

identity via Semantic Scholar / OpenAlex

activity
20072023
most citedPlanar graphs have bounded queue-number

73 citations · 427 across the 49 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2020★ 30 cited

Adjacency Labelling for Planar Graphs (and Beyond)

Vida Dujmović, Louis Esperet, Gwenaël Joret +3

We show that there exists an adjacency labelling scheme for planar graphs where each vertex of an n-vertex planar graph G is assigned a (1+o(1))log2​n-bit label and the lab…

cs.DS2015

An on-line competitive algorithm for coloring bipartite graphs without long induced paths

Piotr Micek, Veit Wiechert

The existence of an on-line competitive algorithm for coloring bipartite graphs remains a tantalizing open problem. So far there are only partial positive results for bipartite gra…

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