René van Bevern

René van Bevern

Novosibirsk State University

H-index: 21

Europe-Russia

About René van Bevern

René van Bevern, With an exceptional h-index of 21 and a recent h-index of 16 (since 2020), a distinguished researcher at Novosibirsk State University, specializes in the field of parameterized algorithms, approximation algorithms, randomized algorithms, streaming algorithms, data reduction.

His recent articles reflect a diverse array of research interests and contributions to the field:

Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU

A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number

Polynomial-time data reduction for weighted problems beyond additive goal functions

On data reduction for dynamic vector bin packing

Parameterized algorithms for power-efficiently connecting wireless sensor networks: Theory and experiments

Special Issue on Computer Science Symposium in Russia (2019)

Representative families for matroid intersections, with applications to location, packing, and covering problems

Задачи китайского и деревенского почтальонов

René van Bevern Information

University

Position

___

Citations(all)

1021

Citations(since 2020)

594

Cited By

744

hIndex(all)

21

hIndex(since 2020)

16

i10Index(all)

32

i10Index(since 2020)

26

Email

University Profile Page

Novosibirsk State University

Google Scholar

View Google Scholar Profile

René van Bevern Skills & Research Interests

parameterized algorithms

approximation algorithms

randomized algorithms

streaming algorithms

data reduction

Top articles of René van Bevern

Title

Journal

Author(s)

Publication Date

Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU

Journal of Computer and System Sciences

René van Bevern

Artem M Kirilin

Daniel A Skachkov

Pavel V Smirnov

Oxana Yu Tsidulko

2024/2/1

A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number

Operations Research Letters

René van Bevern

Daniel A Skachkov

2024/1/1

Polynomial-time data reduction for weighted problems beyond additive goal functions

Discrete Applied Mathematics

Matthias Bentert

René van Bevern

Till Fluschnik

André Nichterlein

Rolf Niedermeier

2023/3/31

On data reduction for dynamic vector bin packing

Operations Research Letters

René van Bevern

Andrey Melnikov

Pavel V Smirnov

Oxana Yu Tsidulko

2023/7/1

Parameterized algorithms for power-efficiently connecting wireless sensor networks: Theory and experiments

INFORMS Journal on Computing

Matthias Bentert

René van Bevern

André Nichterlein

Rolf Niedermeier

Pavel V Smirnov

2022/1

Special Issue on Computer Science Symposium in Russia (2019)

Theory of Computing Systems

René van Bevern

Gregory Kucherov

2021/1/14

Representative families for matroid intersections, with applications to location, packing, and covering problems

Discrete Applied Mathematics

René van Bevern

Oxana Yu Tsidulko

Philipp Zschoche

2021/7/31

Задачи китайского и деревенского почтальонов

Рене Андреасович ван Беверн

2021/4/5

The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable

Operations Research Letters

Vsevolod A Afanasev

René van Bevern

Oxana Yu Tsidulko

2021/3/1

Parameterized algorithms and data reduction for the short secluded s‐t‐path problem

Networks

René Van Bevern

Till Fluschnik

Oxana Yu Tsidulko

2020/1

h-Index manipulation by undoing merges

Quantitative Science Studies

René Van Bevern

Christian Komusiewicz

Hendrik Molter

Rolf Niedermeier

Manuel Sorge

...

2020/12/1

On approximate data reduction for the Rural Postman Problem: Theory and experiments

René van Bevern

Till Fluschnik

Oxana Yu Tsidulko

2019/6/12

A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem

Historia Mathematica

René van Bevern

Viktoriia A Slugina

2020/11/1

Optimal-size problem kernels for d-Hitting Set in linear time and space

Information Processing Letters

René van Bevern

Pavel V Smirnov

2020/11/1

See List of Professors in René van Bevern University(Novosibirsk State University)

Co-Authors

H-index: 65
Michael Fellows

Michael Fellows

Universitetet i Bergen

H-index: 29
Christian Komusiewicz

Christian Komusiewicz

Philipps-Universität Marburg

H-index: 25
Robert Bredereck

Robert Bredereck

Humboldt-Universität zu Berlin

H-index: 21
André Nichterlein

André Nichterlein

Technische Universität Berlin

H-index: 18
Jiehua Chen

Jiehua Chen

Technische Universität Wien

H-index: 18
Ondra Suchý

Ondra Suchý

Ceské vysoké ucení technické v Praze

academic-engine