◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Matthias Feldotto

Paderborn University

7 papers hereh-index 7135 citations21 works total

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

author position
  • first author5
  • middle author2

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

fields
  • cs.GT5
  • cs.DC1
  • cs.DS1
affiliations
  • Paderborn University
Homepage

identity via Semantic Scholar / OpenAlex

activity
20142019
most citedComputing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games

11 citations · 33 across the 7 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2017★ 1 cited

A Tight Approximation for Fully Dynamic Bin Packing without Bundling

Björn Feldkord, Matthias Feldotto, Sören Riechers

We consider a variant of the classical Bin Packing Problem, called Fully Dynamic Bin Packing. In this variant, items of a size in (0,1] must be packed in bins of unit size. In ea…

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