Ondra Suchý

Ondra Suchý

Ceské vysoké ucení technické v Praze

H-index: 18

Europe-Czech Republic

About Ondra Suchý

Ondra Suchý, With an exceptional h-index of 18 and a recent h-index of 12 (since 2020), a distinguished researcher at Ceské vysoké ucení technické v Praze, specializes in the field of Theoretical Computer Science, Graph Algorithms, Classical and Parameterized Complexity.

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

On kernels for d-path vertex cover

Treewidth is NP-Complete on Cubic Graphs (and related results)

Treewidth Is NP-Complete on Cubic Graphs

Polynomial kernels for tracking shortest paths

Hedonic diversity games: A complexity picture with more than two colors

Maximizing Social Welfare in Score-Based Social Distance Games

Generating Faster Algorithms for d-Path Vertex Cover

Waypoint routing on bounded treewidth graphs

Ondra Suchý Information

University

Position

Assistant Professor of Theoretical Computer Science

Citations(all)

690

Citations(since 2020)

356

Cited By

491

hIndex(all)

18

hIndex(since 2020)

12

i10Index(all)

26

i10Index(since 2020)

18

Email

University Profile Page

Ceské vysoké ucení technické v Praze

Google Scholar

View Google Scholar Profile

Ondra Suchý Skills & Research Interests

Theoretical Computer Science

Graph Algorithms

Classical and Parameterized Complexity

Top articles of Ondra Suchý

Title

Journal

Author(s)

Publication Date

On kernels for d-path vertex cover

Journal of Computer and System Sciences

Radovan Červený

Pratibha Choudhary

Ondřej Suchý

2024/3/27

Treewidth is NP-Complete on Cubic Graphs (and related results)

arXiv preprint arXiv:2301.10031

Hans L Bodlaender

Édouard Bonnet

Lars Jaffke

Dušan Knop

Paloma T Lima

...

2023/1/24

Treewidth Is NP-Complete on Cubic Graphs

S Ordyniak

H Bodlaender

É Bonnet

Dušan Knop

M Milanic

...

2023/8/5

Polynomial kernels for tracking shortest paths

Information Processing Letters

Václav Blažej

Pratibha Choudhary

Dušan Knop

Jan Matyáš Křišťan

Ondřej Suchý

...

2023/1/1

Hedonic diversity games: A complexity picture with more than two colors

Proceedings of the AAAI Conference on Artificial Intelligence

Robert Ganian

Thekla Hamm

Dušan Knop

Šimon Schierreich

Ondřej Suchý

2022/6/28

Maximizing Social Welfare in Score-Based Social Distance Games

arXiv preprint arXiv:2312.07632

Robert Ganian

Thekla Hamm

Dušan Knop

Sanjukta Roy

Šimon Schierreich

...

2023/12/12

Generating Faster Algorithms for d-Path Vertex Cover

Radovan Červený

Ondřej Suchý

2023/6/28

Waypoint routing on bounded treewidth graphs

Information Processing Letters

Šimon Schierreich

Ondřej Suchý

2022/1/1

On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations

Václav Blažej

Pratibha Choudhary

Dušan Knop

Šimon Schierreich

Ondřej Suchý

...

2022/9/1

Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract)

Proceedings of the AAAI Conference on Artificial Intelligence

Dušan Knop

Šimon Schierreich

Ondřej Suchý

2022/6/28

Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set

Discrete Optimization

Václav Blažej

Pratibha Choudhary

Dušan Knop

Jan Matyáš Křišťan

Ondřej Suchý

...

2023/2/1

Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters

Martin Kučera

Ondřej Suchý

2021/7/5

See List of Professors in Ondra Suchý University(Ceské vysoké ucení technické v Praze)

Co-Authors

H-index: 52
Daniel Lokshtanov

Daniel Lokshtanov

University of California, Santa Barbara

H-index: 45
Jan Kratochvil

Jan Kratochvil

Univerzita Karlova

H-index: 30
Stefan Kratsch

Stefan Kratsch

Humboldt-Universität zu Berlin

H-index: 29
Christian Komusiewicz

Christian Komusiewicz

Philipps-Universität Marburg

H-index: 26
George B. Mertzios

George B. Mertzios

Durham University

H-index: 25
Robert Bredereck

Robert Bredereck

Humboldt-Universität zu Berlin

academic-engine