Barış Can Esmer
From MaRDI portal
Person:6185946
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Sampling with a black box: faster parameterized approximation algorithms for vertex deletion problems | 2026-09-10 | Paper |
| Generalized graph packing problems parameterized by treewidth | 2026-08-31 | Paper |
| List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs | 2026-05-26 | Paper |
| Fundamental problems on bounded-treewidth graphs: the real source of hardness | 2026-01-14 | Paper |
| Approximate monotone local search for weighted problems | 2025-09-24 | Paper |
| Computing generalized convolutions faster than brute force | 2025-06-23 | Paper |
| Faster exponential-time approximation algorithms using approximate monotone local search | 2025-06-19 | Paper |
| Optimally repurposing existing algorithms to obtain exponential-time approximations | 2024-11-28 | Paper |
| Computing generalized convolutions faster than brute force Algorithmica | 2024-01-09 | Paper |
Research outcomes over time
This page was built for person: Barış Can Esmer
