PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "van Bevern, René"

Author of the publication

copydeleteadd this publication to your clipboard
Network-Based Vertex Dissolution.

, , , , , and . SIAM J. Discrete Math., 29 (2): 888-914 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Moritz René Schäfer University of Stuttgart

Jan Vanvinkenroye University of Stuttgart

Öffnung der Blackbox Hochschullehre durch kollaborative Autoethnografie, , , , , , , , , and 5 other author(s). Ethnografie der Hochschule : zur Erforschung universitärer Praxis, chapter 5, transcript, Bielefeld, (2022)

Rene Cutura University of Stuttgart

Metaphorical Visualization : Mapping Data to Familiar Concepts, , , , and . CHI EA '22 : Extended Abstracts of the 2022 CHI Conference on Human Factors in Computing Systems, page 10. New York, Association for Computing Machinery, (2022)

Dr. -Ing. Rene Laufer University of Stuttgart

Rene Rehwagen University of Stuttgart

 

Other publications of authors with the same name

Network-Based Vertex Dissolution., , , , , and . SIAM J. Discrete Math., 29 (2): 888-914 (2015)Parameterized complexity of machine scheduling: 15 open problems., and . CoRR, (2017)A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack., , and . CoRR, (2015)A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack., , and . J. Scheduling, 20 (3): 255-265 (2017)Interval Scheduling and Colorful Independent Sets., , , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 247-256. Springer, (2012)A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems., , , and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 445-456. Springer, (2013)On the Parameterized Complexity of Computing Graph Bisections., , , and . WG, volume 8165 of Lecture Notes in Computer Science, page 76-87. Springer, (2013)Measuring Indifference: Unit Interval Vertex Deletion., , , and . WG, volume 6410 of Lecture Notes in Computer Science, page 232-243. (2010)On (1+) -approximate Data Reduction for the Rural Postman Problem., , and . MOTOR, volume 11548 of Lecture Notes in Computer Science, page 279-294. Springer, (2019)Towards Optimal and Expressive Kernelization for d-Hitting Set.. COCOON, volume 7434 of Lecture Notes in Computer Science, page 121-132. Springer, (2012)