Barış Can Esmer

Work Address: Kaiserstraße 170-174, 66386 St. Ingbert (Germany)

My name is Barış Can Esmer. Currently, I am a Ph.D. student at Saarland University (and doctoral researcher at CISPA) advised by Dániel Marx.

Nowadays, my research interests are parameterized complexity, fine-grained lower bounds, and (parameterized) approximation algorithms, though I am interested in theoretical computer science in general.

I received my Master’s degree in Mathematics and Computer Science at Saarland University in 2021, and before that, I completed my undergraduate studies at Boğaziçi University, Turkey, in 2019.

In my spare time, I usually travel, go swimming, hit the gym, (try to) play the oud or play computer games.

News

Jul 1, 2022	Proud winner of the STOC 2022 cartoon caption contest!
May 29, 2022	New website!

Selected Publications

IPEC 2022

Computing Generalized Convolutions Faster Than Brute Force

Esmer, Barış Can, Kulik, Ariel, Marx, Dániel, Schepper, Philipp, and Węgrzycki, Karol

In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022) 2022

arXiv Bib

@inproceedings{esmer_et_al:LIPIcs.IPEC.2022.12,
  author = {Esmer, Bar{\i}\c{s} Can and Kulik, Ariel and Marx, D\'{a}niel and Schepper, Philipp and W\k{e}grzycki, Karol},
  title = {{Computing Generalized Convolutions Faster Than Brute Force}},
  booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
  pages = {12:1--12:22},
  series = {Leibniz International Proceedings in Informatics (LIPIcs)},
  isbn = {978-3-95977-260-0},
  issn = {1868-8969},
  year = {2022},
  volume = {249},
  editor = {Dell, Holger and Nederlof, Jesper},
  publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address = {Dagstuhl, Germany},
  url = {https://drops.dagstuhl.de/opus/volltexte/2022/17368},
  urn = {urn:nbn:de:0030-drops-173685},
  doi = {10.4230/LIPIcs.IPEC.2022.12},
  annote = {Keywords: Generalized Convolution, Fast Fourier Transform, Fast Subset Convolution}
}

ESA 2022

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search

Esmer, Bariş Can, Kulik, Ariel, Marx, Dániel, Neuen, Daniel, and Sharma, Roohani

In 30th Annual European Symposium on Algorithms (ESA 2022) 2022

arXiv Bib

@inproceedings{EsmerESA22,
  address = {Berlin/Potsdam, Germany},
  author = {Esmer, Bari{\c s} Can and Kulik, Ariel and Marx, D{\'a}niel and Neuen, Daniel and Sharma, Roohani},
  booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)},
  doi = {10.4230/LIPIcs.ESA.2022.50},
  editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
  eid = {50},
  isbn = {978-3-95977-247-1},
  issn = {1868-8969},
  language = {eng},
  marginalmark = {$\bullet$},
  pages = {1--19},
  publisher = {Schloss Dagstuhl},
  series = {Leibniz International Proceedings in Informatics},
  title = {Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search},
  url = {urn:nbn:de:0030-drops-169887; https://drops.dagstuhl.de/opus/volltexte/2022/16988/},
  volume = {244},
  year = {2022},
  bdsk-url-1 = {urn:nbn:de:0030-drops-169887;%20https://drops.dagstuhl.de/opus/volltexte/2022/16988/},
  bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.ESA.2022.50}
}