Karl Bringmann

Dikutip oleh

	Semua	Sejak 2020
Kutipan	4496	2711
indeks-h	36	30
indeks-i10	97	78

700

350

175

525

2009201020112012201320142015201620172018201920202021202220232024202515 42 60 57 104 127 205 192 237 316 401 389 486 446 527 695 158

Akses publik

Lihat semua

48 artikel

0 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyEmail yang diverifikasi di hpi.de
Marvin KünnemannKarlsruhe Institute of TechnologyEmail yang diverifikasi di kit.edu
Nick FischerPostdoc, Weizmann Institute of ScienceEmail yang diverifikasi di weizmann.ac.il
Amir AbboudWeizmann Institute of ScienceEmail yang diverifikasi di weizmann.ac.il
Johannes LenglerETH ZürichEmail yang diverifikasi di inf.ethz.ch
André NusserUniversity of CopenhagenEmail yang diverifikasi di mpi-inf.mpg.de
Danny HermelinBen-Gurion University of the NegevEmail yang diverifikasi di bgu.ac.il
Kasper Green LarsenProfessor, Computer Science, Aarhus UniversityEmail yang diverifikasi di cs.au.dk
Arturs BackursMicrosoft ResearchEmail yang diverifikasi di microsoft.com
Pavel KolevPostdoc, University of TübingenEmail yang diverifikasi di uni-tuebingen.de
Eva RotenbergAssociate Professor, DTU Compute, DenmarkEmail yang diverifikasi di dtu.dk
Bhaskar Ray ChaudhuryAssistant Professor at University of Illinois at Urbana ChampaignEmail yang diverifikasi di illinois.edu
Sándor Kisfaludi-BakAalto UniversityEmail yang diverifikasi di aalto.fi
Erik Jan van LeeuwenUtrecht University, The NetherlandsEmail yang diverifikasi di uu.nl
Tomasz KociumakaMax Planck Institute for Informatics, Saarland Informatics CampusEmail yang diverifikasi di mpi-inf.mpg.de
Vasileios NakosRelational AI

Ikuti

Karl Bringmann

Professor in Computer Science, Saarland University

Email yang diverifikasi di cs.uni-saarland.de - Beranda

Algorithms and Complexity


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails K Bringmann 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 661-670, 2014	319	2014
Quadratic conditional lower bounds for string problems and dynamic time warping K Bringmann, M Künnemann 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 79-97, 2015	305	2015
Approximating the volume of unions and intersections of high-dimensional geometric objects K Bringmann, T Friedrich Computational Geometry 43 (6-7), 601-610, 2010	209	2010
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice K Bringmann, T Friedrich Theoretical Computer Science 425, 104-116, 2012	181	2012
Geometric inhomogeneous random graphs K Bringmann, R Keusch, J Lengler Theoretical Computer Science 760, 35-54, 2019	165	2019
A near-linear pseudopolynomial time algorithm for subset sum K Bringmann Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	137	2017
Approximation-guided evolutionary multi-objective optimization K Bringmann, T Friedrich, F Neumann, M Wagner IJCAI Proceedings-International Joint Conference on Artificial Intelligence …, 2011	111	2011
An efficient algorithm for computing hypervolume contributions K Bringmann, T Friedrich Evolutionary Computation 18 (3), 383-402, 2010	109	2010
SETH-based lower bounds for subset sum and bicriteria path A Abboud, K Bringmann, D Hermelin, D Shabtay ACM Transactions on Algorithms (TALG) 18 (1), 1-22, 2022	105	2022
Approximability of the discrete Fréchet distance K Bringmann, W Mulzer Journal of Computational Geometry 7 (2), 46–76-46–76, 2016	101	2016
Approximation quality of the hypervolume indicator K Bringmann, T Friedrich Artificial Intelligence 195, 265-290, 2013	97	2013
Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product K Bringmann, F Grandoni, B Saha, VV Williams SIAM Journal on Computing 48 (2), 481-512, 2019	96	2019
Two-dimensional subset selection for hypervolume and epsilon-indicator K Bringmann, T Friedrich, P Klitzke Proceedings of the 2014 Annual Conference on Genetic and Evolutionary …, 2014	85	2014
Efficient sampling methods for discrete distributions K Bringmann, K Panagiotou Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012	83*	2012
Tree edit distance cannot be computed in strongly subcubic time (unless APSP can) K Bringmann, P Gawrychowski, S Mozes, O Weimann ACM Transactions on Algorithms (TALG) 16 (4), 1-22, 2020	82	2020
Multivariate fine-grained complexity of longest common subsequence K Bringman, M Künnemann Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018	82	2018
A dichotomy for regular expression membership testing K Bringmann, A Grønlund, KG Larsen 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017	69	2017
Average distance in a general class of scale-free networks with underlying geometry K Bringmann, R Keusch, J Lengler arXiv preprint arXiv:1602.05712, 2016	59	2016
A PTAS for ℓ_p-Low Rank Approximation F Ban, V Bhattiprolu, K Bringmann, P Kolev, E Lee, DP Woodruff Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	57	2019
Generic postprocessing via subset selection for hypervolume and epsilon-indicator K Bringmann, T Friedrich, P Klitzke International Conference on Parallel Problem Solving from Nature, 518-527, 2014	57	2014

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama