×
Compute Distance To:
Author ID: suchy.ondrej Recent zbMATH articles by "Suchý, Ondřej"
Published as: Suchý, Ondřej; Suchy, Ondrej
Documents Indexed: 43 Publications since 2008
Co-Authors: 47 Co-Authors with 41 Joint Publications
1,291 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

37 Publications have been cited 158 times in 138 Documents Cited by Year
Clustered planarity: small clusters in cycles and Eulerian graphs. Zbl 1194.05148
Jelínková, Eva; Kára, Jan; Kratochvíl, Jan; Pergel, Martin; Suchý, Ondřej; Vyskočil, Tomáš
12
2009
What makes equitable connected partition easy. Zbl 1273.68164
Enciso, Rosa; Fellows, Michael R.; Guo, Jiong; Kanj, Iyad; Rosamond, Frances; Suchý, Ondřej
10
2009
A refined complexity analysis of degree anonymization in graphs. Zbl 1327.68134
Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Suchý, Ondřej
10
2015
Parameterized complexity of directed Steiner tree on sparse graphs. Zbl 1371.68114
Jones, Mark; Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Suchý, Ondřej
9
2013
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. Zbl 1376.90028
van Bevern, René; Niedermeier, Rolf; Suchý, Ondřej
9
2017
On the parameterized complexity of computing graph bisections. Zbl 1318.68098
van Bevern, René; Feldmann, Andreas Emil; Sorge, Manuel; Suchý, Ondřej
8
2013
Parameterized complexity of arc-weighted directed Steiner problems. Zbl 1230.05268
Guo, Jiong; Niedermeier, Rolf; Suchý, Ondřej
8
2011
Parameterized complexity of generalized domination problems. Zbl 1241.05108
Golovach, Petr A.; Kratochvíl, Jan; Suchý, Ondřej
7
2012
On structural parameterizations for the 2-club problem. Zbl 1311.05051
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André; Suchý, Ondřej
7
2015
Feedback vertex set on graphs of low clique-width. Zbl 1257.05165
Bui-Xuan, Binh-Minh; Suchý, Ondřej; Telle, Jan Arne; Vatshelle, Martin
7
2013
The parameterized complexity of local search for TSP, more refined. Zbl 1292.68086
Guo, Jiong; Hartung, Sepp; Niedermeier, Rolf; Suchý, Ondřej
6
2013
Polynomial-time data reduction for the subset interconnection design problem. Zbl 1326.05147
Chen, Jiehua; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel; Suchý, Ondřej; Weller, Mathias
6
2015
Clustered planarity: clusters with few outgoing edges. Zbl 1213.68460
Jelínek, Vít; Suchý, Ondřej; Tesař, Marek; Vyskočil, Tomáš
5
2009
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. Zbl 1312.68105
Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket; Suchý, Ondřej
5
2014
Parameterized complexity of directed Steiner tree on sparse graphs. Zbl 1371.68115
Jones, Mark; Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Suchý, Ondřej
5
2017
On the parameterized complexity of computing balanced partitions in graphs. Zbl 1329.68150
van Bevern, René; Feldmann, Andreas Emil; Sorge, Manuel; Suchý, Ondřej
4
2015
Extending the kernel for planar Steiner tree to the number of Steiner vertices. Zbl 1372.68146
Suchý, Ondřej
3
2017
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. Zbl 1354.68130
Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket; Suchý, Ondřej
3
2012
On directed Steiner trees with multiple roots. Zbl 1417.05089
Suchý, Ondřej
3
2016
A multivariate complexity analysis of lobbying in multiple referenda. Zbl 1342.91011
Bredereck, Robert; Chen, Jiehua; Hartung, Sepp; Kratsch, Stefan; Niedermeier, Rolf; Suchý, Ondřej; Woeginger, Gerhard J.
3
2014
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Zbl 1454.90104
van Bevern, René; Fluschnik, Till; Mertzios, George B.; Molter, Hendrik; Sorge, Manuel; Suchý, Ondřej
2
2018
Parameterized complexity of arc-weighted directed Steiner problems. Zbl 1273.68174
Guo, Jiong; Niedermeier, Rolf; Suchý, Ondřej
2
2009
Parameterized complexity of generalized domination problems. Zbl 1273.68171
Golovach, Petr A.; Kratochvíl, Jan; Suchý, Ondřej
2
2010
Fixed-parameter algorithms for DAG partitioning. Zbl 1355.05204
van Bevern, René; Bredereck, Robert; Chopin, Morgan; Hartung, Sepp; Hüffner, Falk; Nichterlein, André; Suchý, Ondřej
2
2017
An FPT algorithm for Tree Deletion Set. Zbl 1276.05118
Raman, Venkatesh; Saurabh, Saket; Suchý, Ondřej
2
2013
Effective and efficient data reduction for the subset interconnection design problem. Zbl 1303.68091
Chen, Jiehua; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel; Suchý, Ondřej; Weller, Mathias
2
2013
Parameterized problems related to Seidel’s switching. Zbl 1283.68164
Jelinkova, Eva; Suchy, Ondrej; Hlineny, Petr; Kratochvil, Jan
2
2011
Parameterized complexity of DAG partitioning. Zbl 1382.68127
van Bevern, René; Bredereck, Robert; Chopin, Morgan; Hartung, Sepp; Hüffner, Falk; Nichterlein, André; Suchý, Ondřej
2
2013
Finding secluded places of special interest in graphs. Zbl 1398.68408
van Bevern, René; Fluschnik, Till; Mertzios, George B.; Molter, Hendrik; Sorge, Manuel; Suchý, Ondřej
2
2017
Clustered planarity: Small clusters in Eulerian graphs. Zbl 1137.68495
Jelínková, Eva; Kára, Jan; Kratochvíl, Jan; Pergel, Martin; Suchý, Ondřej; Vyskočil, Tomáš
2
2008
Tree deletion set has a polynomial kernel (but no \(\mathrm {OPT}^{\mathcal O(1)}\) approximation). Zbl 1360.68510
Giannopoulou, Archontia C.; Lokshtanov, Daniel; Saurabh, Saket; Suchy, Ondrej
2
2014
A tight lower bound for planar Steiner orientation. Zbl 1425.68307
Chitnis, Rajesh; Feldmann, Andreas Emil; Suchý, Ondřej
1
2019
An FPT algorithm for tree deletion set. Zbl 1379.68176
Raman, Venkatesh; Saurabh, Saket; Suchý, Ondřej
1
2013
Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation). Zbl 1341.05239
Giannopoulou, Archontia C.; Lokshtanov, Daniel; Saurabh, Saket; Suchý, Ondřej
1
2016
On explaining integer vectors by few homogeneous segments. Zbl 1320.68098
Bredereck, Robert; Chen, Jiehua; Hartung, Sepp; Komusiewicz, Christian; Niedermeier, Rolf; Suchý, Ondřej
1
2015
The parameterized complexity of local search for TSP, more refined. Zbl 1350.68141
Guo, Jiong; Hartung, Sepp; Niedermeier, Rolf; Suchý, Ondřej
1
2011
Solving multicut faster than \(2^{n }\). Zbl 1425.05154
Lokshtanov, Daniel; Saurabh, Saket; Suchý, Ondřej
1
2014
A tight lower bound for planar Steiner orientation. Zbl 1425.68307
Chitnis, Rajesh; Feldmann, Andreas Emil; Suchý, Ondřej
1
2019
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Zbl 1454.90104
van Bevern, René; Fluschnik, Till; Mertzios, George B.; Molter, Hendrik; Sorge, Manuel; Suchý, Ondřej
2
2018
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. Zbl 1376.90028
van Bevern, René; Niedermeier, Rolf; Suchý, Ondřej
9
2017
Parameterized complexity of directed Steiner tree on sparse graphs. Zbl 1371.68115
Jones, Mark; Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Suchý, Ondřej
5
2017
Extending the kernel for planar Steiner tree to the number of Steiner vertices. Zbl 1372.68146
Suchý, Ondřej
3
2017
Fixed-parameter algorithms for DAG partitioning. Zbl 1355.05204
van Bevern, René; Bredereck, Robert; Chopin, Morgan; Hartung, Sepp; Hüffner, Falk; Nichterlein, André; Suchý, Ondřej
2
2017
Finding secluded places of special interest in graphs. Zbl 1398.68408
van Bevern, René; Fluschnik, Till; Mertzios, George B.; Molter, Hendrik; Sorge, Manuel; Suchý, Ondřej
2
2017
On directed Steiner trees with multiple roots. Zbl 1417.05089
Suchý, Ondřej
3
2016
Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation). Zbl 1341.05239
Giannopoulou, Archontia C.; Lokshtanov, Daniel; Saurabh, Saket; Suchý, Ondřej
1
2016
A refined complexity analysis of degree anonymization in graphs. Zbl 1327.68134
Hartung, Sepp; Nichterlein, André; Niedermeier, Rolf; Suchý, Ondřej
10
2015
On structural parameterizations for the 2-club problem. Zbl 1311.05051
Hartung, Sepp; Komusiewicz, Christian; Nichterlein, André; Suchý, Ondřej
7
2015
Polynomial-time data reduction for the subset interconnection design problem. Zbl 1326.05147
Chen, Jiehua; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel; Suchý, Ondřej; Weller, Mathias
6
2015
On the parameterized complexity of computing balanced partitions in graphs. Zbl 1329.68150
van Bevern, René; Feldmann, Andreas Emil; Sorge, Manuel; Suchý, Ondřej
4
2015
On explaining integer vectors by few homogeneous segments. Zbl 1320.68098
Bredereck, Robert; Chen, Jiehua; Hartung, Sepp; Komusiewicz, Christian; Niedermeier, Rolf; Suchý, Ondřej
1
2015
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. Zbl 1312.68105
Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket; Suchý, Ondřej
5
2014
A multivariate complexity analysis of lobbying in multiple referenda. Zbl 1342.91011
Bredereck, Robert; Chen, Jiehua; Hartung, Sepp; Kratsch, Stefan; Niedermeier, Rolf; Suchý, Ondřej; Woeginger, Gerhard J.
3
2014
Tree deletion set has a polynomial kernel (but no \(\mathrm {OPT}^{\mathcal O(1)}\) approximation). Zbl 1360.68510
Giannopoulou, Archontia C.; Lokshtanov, Daniel; Saurabh, Saket; Suchy, Ondrej
2
2014
Solving multicut faster than \(2^{n }\). Zbl 1425.05154
Lokshtanov, Daniel; Saurabh, Saket; Suchý, Ondřej
1
2014
Parameterized complexity of directed Steiner tree on sparse graphs. Zbl 1371.68114
Jones, Mark; Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Suchý, Ondřej
9
2013
On the parameterized complexity of computing graph bisections. Zbl 1318.68098
van Bevern, René; Feldmann, Andreas Emil; Sorge, Manuel; Suchý, Ondřej
8
2013
Feedback vertex set on graphs of low clique-width. Zbl 1257.05165
Bui-Xuan, Binh-Minh; Suchý, Ondřej; Telle, Jan Arne; Vatshelle, Martin
7
2013
The parameterized complexity of local search for TSP, more refined. Zbl 1292.68086
Guo, Jiong; Hartung, Sepp; Niedermeier, Rolf; Suchý, Ondřej
6
2013
An FPT algorithm for Tree Deletion Set. Zbl 1276.05118
Raman, Venkatesh; Saurabh, Saket; Suchý, Ondřej
2
2013
Effective and efficient data reduction for the subset interconnection design problem. Zbl 1303.68091
Chen, Jiehua; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel; Suchý, Ondřej; Weller, Mathias
2
2013
Parameterized complexity of DAG partitioning. Zbl 1382.68127
van Bevern, René; Bredereck, Robert; Chopin, Morgan; Hartung, Sepp; Hüffner, Falk; Nichterlein, André; Suchý, Ondřej
2
2013
An FPT algorithm for tree deletion set. Zbl 1379.68176
Raman, Venkatesh; Saurabh, Saket; Suchý, Ondřej
1
2013
Parameterized complexity of generalized domination problems. Zbl 1241.05108
Golovach, Petr A.; Kratochvíl, Jan; Suchý, Ondřej
7
2012
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. Zbl 1354.68130
Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket; Suchý, Ondřej
3
2012
Parameterized complexity of arc-weighted directed Steiner problems. Zbl 1230.05268
Guo, Jiong; Niedermeier, Rolf; Suchý, Ondřej
8
2011
Parameterized problems related to Seidel’s switching. Zbl 1283.68164
Jelinkova, Eva; Suchy, Ondrej; Hlineny, Petr; Kratochvil, Jan
2
2011
The parameterized complexity of local search for TSP, more refined. Zbl 1350.68141
Guo, Jiong; Hartung, Sepp; Niedermeier, Rolf; Suchý, Ondřej
1
2011
Parameterized complexity of generalized domination problems. Zbl 1273.68171
Golovach, Petr A.; Kratochvíl, Jan; Suchý, Ondřej
2
2010
Clustered planarity: small clusters in cycles and Eulerian graphs. Zbl 1194.05148
Jelínková, Eva; Kára, Jan; Kratochvíl, Jan; Pergel, Martin; Suchý, Ondřej; Vyskočil, Tomáš
12
2009
What makes equitable connected partition easy. Zbl 1273.68164
Enciso, Rosa; Fellows, Michael R.; Guo, Jiong; Kanj, Iyad; Rosamond, Frances; Suchý, Ondřej
10
2009
Clustered planarity: clusters with few outgoing edges. Zbl 1213.68460
Jelínek, Vít; Suchý, Ondřej; Tesař, Marek; Vyskočil, Tomáš
5
2009
Parameterized complexity of arc-weighted directed Steiner problems. Zbl 1273.68174
Guo, Jiong; Niedermeier, Rolf; Suchý, Ondřej
2
2009
Clustered planarity: Small clusters in Eulerian graphs. Zbl 1137.68495
Jelínková, Eva; Kára, Jan; Kratochvíl, Jan; Pergel, Martin; Suchý, Ondřej; Vyskočil, Tomáš
2
2008
all top 5

Cited by 235 Authors

13 Niedermeier, Rolf
11 Nichterlein, André
9 Saurabh, Saket
9 Suchý, Ondřej
8 Golovach, Petr A.
8 Sorge, Manuel
7 Lokshtanov, Daniel
7 van Bevern, René
6 Hermelin, Danny
6 Komusiewicz, Christian
6 Mnich, Matthias
5 Angelini, Patrizio
5 Bredereck, Robert
5 Feldmann, Andreas Emil
5 Fluschnik, Till
5 Frati, Fabrizio
5 Fulek, Radoslav
5 Gutin, Gregory Z.
4 Da Lozzo, Giordano
4 Fomin, Fedor V.
4 Froese, Vincent
4 Hartung, Sepp
4 Knop, Dušan
4 Masařík, Tomáš
4 Sau, Ignasi
4 Talmon, Nimrod
4 Toufar, Tomáš
3 Bazgan, Cristina
3 Chitnis, Rajesh Hemant
3 Dar, Muhammad Abid
3 Di Battista, Giuseppe
3 Eiben, Eduard
3 Fischer, Andreas M.
3 Koutecký, Martin
3 Kratsch, Stefan
3 Kwon, Ojoung
3 Martinovic, John
3 Mertzios, George B.
3 Molter, Hendrik
3 Ramanujan, M. S.
3 Scheithauer, Guntram
3 Shabtay, Dvir
3 Strømme, Torstein J. F.
3 Telle, Jan Arne
3 Zehavi, Meirav
2 Bonnet, Edouard
2 Chopin, Morgan
2 Crowston, Robert
2 Cygan, Marek
2 Disser, Yann
2 Feng, Qilong
2 Guo, Jiong
2 Hanaka, Tesshu
2 Heggernes, Pinar
2 Jansen, Bart M. P.
2 Kang, Dong Yeap
2 Kanj, Iyad A.
2 Kaufmann, Michael
2 Kobayashi, Yasuaki
2 Kowalik, Łukasz
2 Kratochvíl, Jan
2 Lima, Paloma T.
2 Madathil, Jayakrishnan
2 Manurangsi, Pasin
2 Meeks, Kitty
2 Millani, Marcelo Garlet
2 Montealegre, Pedro
2 Montejano, Luis Pedro
2 Mouawad, Amer E.
2 Ono, Hirotaka
2 Papadopoulos, Charis
2 Pilipczuk, Marcin L.
2 Pinedo, Michael L.
2 Razzazi, Mohammadreza
2 Renjith, Pazhaniappan
2 Roayaei, Mehdy
2 Sadagopan, Narasimhan
2 Sharma, Roohani
2 Siebertz, Sebastian
2 Skerman, Fiona
2 Tzimas, Spyridon
2 Van Leeuwen, Erik Jan
2 Wahlström, Magnus
1 Agrawal, Akanksha
1 Ahadi, Arash
1 An, Zhao
1 Asahiro, Yuichi
1 Baart, Robert
1 Barth, Dominique
1 Barth, Lukas
1 Baumeister, Dorothea
1 Bentert, Matthias
1 Bentz, Cédric
1 Bergougnoux, Benjamin
1 Bessy, Stéphane
1 Biswas, Arindam
1 Bläsius, Thomas
1 Boginski, Vladimir L.
1 Brückner, Guido
1 Byrka, Jarosław
...and 135 more Authors

Citations by Year