◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Grzegorz Matecki

5 papers hereh-index 6122 citations21 works total

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

author position
  • middle author3
  • last author2

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

fields
  • cs.DS2
  • math.CO2
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20072014
most citedAdditive colorings of planar graphs

12 citations · 12 across the 4 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2014

A lazy approach to on-line bipartite matching

Jakub Kozik, Grzegorz Matecki

We present a new approach, called a lazy matching, to the problem of on-line matching on bipartite graphs. Imagine that one side of a graph is given and the vertices of the other s…

cs.DS2014

An easy subexponential bound for online chain partitioning

Bartłomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk +2

Bosek and Krawczyk exhibited an online algorithm for partitioning an online poset of width w into w14lgw chains. We improve this to w6.5lgw+7 with a simpler 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.