René van Bevern

Navedeno

	Vse	Od leta 2020
Navedbe	1123	588
indeks h	21	15
indeks i10	32	24

140

105

20102011201220132014201520162017201820192020202120222023202420257 10 19 35 50 38 67 113 78 104 106 128 130 104 100 20

Javni dostop

Prikaži vse

29 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Rolf NiedermeierTU BerlinPreverjeni e-poštni naslov na tu-berlin.de
Manuel SorgeTU WienPreverjeni e-poštni naslov na ac.tuwien.ac.at
Christian KomusiewiczFriedrich-Schiller-Universität JenaPreverjeni e-poštni naslov na uni-jena.de
Oxana Yu. Tsidulkoresearcher, Sobolev Institute of Mathematics, Novosibirsk State UniversityPreverjeni e-poštni naslov na math.nsc.ru
Mathias WellerLIGM, Paris, FrancePreverjeni e-poštni naslov na u-pem.fr
Robert BredereckTU ClausthalPreverjeni e-poštni naslov na tu-clausthal.de
Till FluschnikHU BerlinPreverjeni e-poštni naslov na hu-berlin.de
Ondra SuchýAssistant Professor of Theoretical Computer Science, Czech Technical UniversityPreverjeni e-poštni naslov na fit.cvut.cz
Gerhard WoegingerProfessor of Computer Science, RWTH AachenPreverjeni e-poštni naslov na cs.rwth-aachen.de
André NichterleinTU BerlinPreverjeni e-poštni naslov na tu-berlin.de
Jiehua ChenTU ViennaPreverjeni e-poštni naslov na tuwien.ac.at
Matthias BentertUiBPreverjeni e-poštni naslov na uib.no
Michael FellowsResearch Professor LAU Beirut and NYC; Emeritus Prof. Univ. Bergen; Adjunct Prof. WSU AustraliaPreverjeni e-poštni naslov na lau.edu.lb
Matthias MnichTU HamburgPreverjeni e-poštni naslov na tuhh.de
Sepp HartungPreverjeni e-poštni naslov na tu-berlin.de
Laurent BulteauCNRS / Université Paris-Est Marne-la-ValléePreverjeni e-poštni naslov na u-pem.fr
Toby WalshProfessor, UNSW and CSIRO Data61Preverjeni e-poštni naslov na cse.unsw.edu.au
Nimrod TalmonBen-Gurion UniversityPreverjeni e-poštni naslov na bgu.ac.il
Hendrik MolterBen-Gurion University of the NegevPreverjeni e-poštni naslov na post.bgu.ac.il
Falk HüffnerTomTomPreverjeni e-poštni naslov na tomtom.com

Spremljaj

René van Bevern

Huawei Technologies Co., Ltd.

Preverjeni e-poštni naslov na huawei.com - Domača stran

approximation algorithms randomized algorithms streaming algorithms scheduling algorithms


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Parameterized complexity of machine scheduling: 15 open problems M Mnich, R van Bevern Computers & Operations Research, 2018	88	2018
Interval scheduling and colorful independent sets R Van Bevern, M Mnich, R Niedermeier, M Weller Journal of Scheduling 18, 449-469, 2015	77	2015
Parameterized algorithmics for finding connected motifs in biological networks N Betzler, R van Bevern, MR Fellows, C Komusiewicz, R Niedermeier Computational Biology and Bioinformatics, IEEE/ACM Transactions on 8 (5 …, 2011	72	2011
A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem R van Bevern, VA Slugina Historia Mathematica 53, 118-127, 2020	60	2020
Approximation and tidying—a problem kernel for s-plex cluster vertex deletion R van Bevern, H Moser, R Niedermeier Algorithmica 62 (3-4), 930-950, 2012	51*	2012
Precedence-constrained scheduling problems parameterized by partial order width R van Bevern, R Bredereck, L Bulteau, C Komusiewicz, N Talmon, ... Discrete Optimization and Operations Research, 105–120, 2016	49	2016
Chapter 2: The Complexity of Arc Routing Problems R van Bevern, R Niedermeier, M Sorge, M Weller Arc Routing: Problems, Methods, and Applications, 19-52, 2015	48	2015
Towards optimal and expressive kernelization for d-hitting set R Van Bevern Algorithmica 70 (1), 129-147, 2014	47	2014
On the parameterized complexity of computing balanced partitions in graphs R Van Bevern, AE Feldmann, M Sorge, O Suchý Theory of Computing Systems 57 (1), 1-35, 2015	41*	2015
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments R van Bevern, C Komusiewicz, M Sorge Networks 70 (3), 262-278, 2017	38	2017
A new view on Rural Postman based on Eulerian Extension and Matching M Sorge, R Van Bevern, R Niedermeier, M Weller Journal of Discrete Algorithms 16, 12-33, 2012	36	2012
Partitioning perfect graphs into stars R Van Bevern, R Bredereck, L Bulteau, J Chen, V Froese, R Niedermeier, ... Journal of Graph Theory 85 (2), 297-335, 2017	35*	2017
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack R van Bevern, R Niedermeier, O Suchý Journal of Scheduling 20 (3), 255–265, 2017	34	2017
From few components to an Eulerian graph by adding arcs M Sorge, R Van Bevern, R Niedermeier, M Weller Graph-Theoretic Concepts in Computer Science: 37th International Workshop …, 2011	31	2011
H-index manipulation by merging articles: Models, theory, and experiments R Van Bevern, C Komusiewicz, R Niedermeier, M Sorge, T Walsh Artificial Intelligence 240, 19-35, 2016	30	2016
Measuring indifference: Unit interval vertex deletion R van Bevern, C Komusiewicz, H Moser, R Niedermeier Graph Theoretic Concepts in Computer Science, 232-243, 2010	30	2010
Parameterizing edge modification problems above lower bounds R van Bevern, V Froese, C Komusiewicz Theory of Computing Systems 62 (3), 739-770, 2018	26	2018
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem R Van Bevern, T Fluschnik, OY Tsidulko Networks 75 (1), 34-63, 2020	24*	2020
Network-based vertex dissolution R Van Bevern, R Bredereck, J Chen, V Froese, R Niedermeier, ... SIAM Journal on Discrete Mathematics 29 (2), 888-914, 2015	23*	2015
Constant-factor approximations for capacitated arc routing without triangle inequality R Van Bevern, S Hartung, A Nichterlein, M Sorge Operations Research Letters 42 (4), 290-292, 2014	22	2014

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji