default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOndrej Suchý
Person information
- affiliation: Czech Technical University in Prague, Czech Republic
SPARQL queries 
🛈 Please note that only 74% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j28]Radovan Cervený
, Pratibha Choudhary, Ondrej Suchý:
On kernels for d-path vertex cover. J. Comput. Syst. Sci. 144: 103531 (2024)- 2023
- [j27]Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý:
Hedonic diversity games: A complexity picture with more than two colors. Artif. Intell. 325: 104017 (2023) - [j26]Martin Kucera, Ondrej Suchý:
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters. Algorithmica 85(3): 762-782 (2023) - [j25]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Constant factor approximation for tracking paths and fault tolerant feedback vertex set. Discret. Optim. 47: 100756 (2023) - [j24]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Polynomial kernels for tracking shortest paths. Inf. Process. Lett. 179: 106315 (2023) - [c37]Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
Treewidth Is NP-Complete on Cubic Graphs. IPEC 2023: 7:1-7:13 - [c36]Radovan Cervený, Ondrej Suchý:
Generating Faster Algorithms for d-Path Vertex Cover. WG 2023: 157-171 - [c35]Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý:
Maximizing Social Welfare in Score-Based Social Distance Games. TARK 2023: 272-286 - [i26]Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
Treewidth is NP-Complete on Cubic Graphs (and related results). CoRR abs/2301.10031 (2023) - [i25]Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý:
Maximizing Social Welfare in Score-Based Social Distance Games. CoRR abs/2312.07632 (2023) - 2022
- [j23]Simon Schierreich, Ondrej Suchý:
Waypoint routing on bounded treewidth graphs. Inf. Process. Lett. 173: 106165 (2022) - [c34]Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý:
Hedonic Diversity Games: A Complexity Picture with More than Two Colors. AAAI 2022: 5034-5042 - [c33]Dusan Knop, Simon Schierreich, Ondrej Suchý:
Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract). AAAI 2022: 12987-12988 - [c32]Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla:
On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. ESA 2022: 22:1-22:16 - [c31]Ondrej Suchý, Stepán Janous, Jakub Talla, Zdenek Peroutka:
Torque Ripple Reduction of IPMSM Drive with Non-sinusoidal Back-EMF by Predictive Control. ISIE 2022: 1064-1069 - [c30]Radovan Cervený, Pratibha Choudhary, Ondrej Suchý:
On Kernels for d-Path Vertex Cover. MFCS 2022: 29:1-29:14 - [i24]Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý:
Hedonic Diversity Games: A Complexity Picture with More than Two Colors. CoRR abs/2202.09210 (2022) - [i23]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Polynomial Kernels for Tracking Shortest Paths. CoRR abs/2202.11927 (2022) - [i22]Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla:
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations. CoRR abs/2207.01109 (2022) - 2021
- [j22]Junjie Luo, Hendrik Molter, Ondrej Suchý:
A Parameterized Complexity View on Collapsing k-Cores. Theory Comput. Syst. 65(8): 1243-1282 (2021) - [c29]Ondrej Suchý, Stepán Janous, Jakub Talla, Zdenek Peroutka:
Predictive control of PMSM using improved model of the drive. IECON 2021: 1-5 - [c28]Martin Kucera, Ondrej Suchý:
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters. IWOCA 2021: 442-455 - [c27]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. WAOA 2021: 23-38 - [i21]Dusan Knop, Simon Schierreich, Ondrej Suchý:
Balancing the Spread of Two Opinions in Sparse Social Networks. CoRR abs/2105.10184 (2021) - [i20]Radovan Cervený, Pratibha Choudhary, Ondrej Suchý:
On Kernels for d-Path Vertex Cover. CoRR abs/2107.12245 (2021) - [i19]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. CoRR abs/2108.01430 (2021) - [i18]Radovan Cervený, Ondrej Suchý:
Generating faster algorithms for d-Path Vertex Cover. CoRR abs/2111.05896 (2021) - 2020
- [i17]Simon Schierreich, Ondrej Suchý:
Waypoint Routing on Bounded Treewidth Graphs. CoRR abs/2007.04008 (2020) - [i16]Martin Kucera, Ondrej Suchý:
Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters. CoRR abs/2008.07898 (2020)
2010 – 2019
- 2019
- [j21]Rajesh Chitnis, Andreas Emil Feldmann, Ondrej Suchý:
A Tight Lower Bound for Planar Steiner Orientation. Algorithmica 81(8): 3200-3216 (2019) - [c26]Radovan Cervený, Ondrej Suchý:
Faster FPT Algorithm for 5-Path Vertex Cover. MFCS 2019: 32:1-32:13 - [c25]Josef Malík, Ondrej Suchý, Tomás Valla:
Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem. SEA² 2019: 283-299 - [c24]Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý:
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. STACS 2019: 25:1-25:17 - [i15]Radovan Cervený, Ondrej Suchý:
Faster FPT Algorithm for 5-Path Vertex Cover. CoRR abs/1906.09213 (2019) - [i14]Josef Malík, Ondrej Suchý, Tomás Valla:
Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem. CoRR abs/1908.11248 (2019) - 2018
- [j20]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discret. Optim. 30: 20-50 (2018) - [c23]Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Cluster Editing in Multi-Layer and Temporal Graphs. ISAAC 2018: 24:1-24:13 - [c22]Junjie Luo, Hendrik Molter, Ondrej Suchý:
A Parameterized Complexity View on Collapsing k-Cores. IPEC 2018: 7:1-7:14 - [i13]Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý:
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. CoRR abs/1802.08189 (2018) - [i12]Junjie Luo, Hendrik Molter, Ondrej Suchý:
A Parameterized Complexity View on Collapsing k-Cores. CoRR abs/1805.12453 (2018) - 2017
- [j19]Ondrej Suchý:
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices. Algorithmica 79(1): 189-210 (2017) - [j18]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-parameter algorithms for DAG Partitioning. Discret. Appl. Math. 220: 134-160 (2017) - [j17]René van Bevern, Rolf Niedermeier, Ondrej Suchý:
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. J. Sched. 20(3): 255-265 (2017) - [j16]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. SIAM J. Discret. Math. 31(2): 1294-1327 (2017) - [c21]Václav Blazej, Ondrej Suchý, Tomás Valla:
A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching. MACIS 2017: 333-348 - [i11]Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
A Parameterized View on Multi-Layer Cluster Editing. CoRR abs/1709.09100 (2017) - 2016
- [j15]Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý:
Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation. SIAM J. Discret. Math. 30(3): 1371-1384 (2016) - [c20]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. IPEC 2016: 5:1-5:16 - [c19]Ondrej Suchý:
On Directed Steiner Trees with Multiple Roots. WG 2016: 257-268 - [i10]Ondrej Suchý:
On Directed Steiner Trees with Multiple Roots. CoRR abs/1604.05103 (2016) - [i9]Václav Blazej, Ondrej Suchý, Tomás Valla:
A Simpler Bit-parallel Algorithm for Swap Matching. CoRR abs/1606.04763 (2016) - [i8]René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý:
Finding Secluded Places of Special Interest in Graphs. CoRR abs/1606.09000 (2016) - [i7]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-Parameter Algorithms for DAG Partitioning. CoRR abs/1611.08809 (2016) - 2015
- [j14]Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý:
On structural parameterizations for the 2-club problem. Discret. Appl. Math. 185: 79-92 (2015) - [j13]Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý:
A refined complexity analysis of degree anonymization in graphs. Inf. Comput. 243: 249-262 (2015) - [j12]Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý:
On explaining integer vectors by few homogeneous segments. J. Comput. Syst. Sci. 81(4): 766-782 (2015) - [j11]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. Theory Comput. Syst. 57(1): 1-35 (2015) - [j10]Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller:
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. SIAM J. Discret. Math. 29(1): 1-25 (2015) - [c18]Ondrej Suchý:
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices. IPEC 2015: 151-162 - [i6]René van Bevern, Rolf Niedermeier, Ondrej Suchý:
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack. CoRR abs/1508.01657 (2015) - 2014
- [j9]Robert Bredereck, Jiehua Chen, Sepp Hartung, Stefan Kratsch, Rolf Niedermeier, Ondrej Suchý, Gerhard J. Woeginger:
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. J. Artif. Intell. Res. 50: 409-446 (2014) - [j8]Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý:
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound. J. Comput. Syst. Sci. 80(7): 1384-1403 (2014) - [c17]Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý:
Solving Multicut Faster Than 2 n. ESA 2014: 666-676 - [c16]Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý:
Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation). FSTTCS 2014: 85-96 - 2013
- [j7]Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý:
The Parameterized Complexity of Local Search for TSP, More Refined. Algorithmica 67(1): 89-110 (2013) - [j6]Binh-Minh Bui-Xuan, Ondrej Suchý, Jan Arne Telle, Martin Vatshelle:
Feedback vertex set on graphs of low clique-width. Eur. J. Comb. 34(3): 666-679 (2013) - [j5]Venkatesh Raman, Saket Saurabh, Ondrej Suchý:
An FPT algorithm for Tree Deletion Set. J. Graph Algorithms Appl. 17(6): 615-628 (2013) - [c15]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Parameterized Complexity of DAG Partitioning. CIAC 2013: 49-60 - [c14]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. ESA 2013: 671-682 - [c13]Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý:
A Refined Complexity Analysis of Degree Anonymization in Graphs. ICALP (2) 2013: 594-606 - [c12]Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller:
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. ISAAC 2013: 361-371 - [c11]Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý:
On Explaining Integer Vectors by Few Homogenous Segments. WADS 2013: 207-218 - [c10]Venkatesh Raman, Saket Saurabh, Ondrej Suchý:
An FPT Algorithm for Tree Deletion Set. WALCOM 2013: 286-297 - [c9]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Graph Bisections. WG 2013: 76-87 - [i5]Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý:
On Structural Parameterizations for the 2-Club Problem. CoRR abs/1305.3735 (2013) - [i4]Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý:
Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation). CoRR abs/1309.7891 (2013) - [i3]René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondrej Suchý:
On the Parameterized Complexity of Computing Balanced Partitions in Graphs. CoRR abs/1312.7014 (2013) - 2012
- [j4]Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý:
Parameterized complexity of generalized domination problems. Discret. Appl. Math. 160(6): 780-792 (2012) - [c8]Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý, Stefan Kratsch:
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. AAAI 2012: 1292-1298 - [c7]Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý:
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS 2012: 412-423 - [i2]Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý:
Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzík Bound. CoRR abs/1207.5696 (2012) - [i1]Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. CoRR abs/1210.0260 (2012) - 2011
- [j3]Eva Jelínková, Ondrej Suchý, Petr Hlinený, Jan Kratochvíl:
Parameterized Problems Related to Seidel's Switching. Discret. Math. Theor. Comput. Sci. 13(2): 19-44 (2011) - [j2]Jiong Guo, Rolf Niedermeier, Ondrej Suchý:
Parameterized Complexity of Arc-Weighted Directed Steiner Problems. SIAM J. Discret. Math. 25(2): 583-599 (2011) - [c6]Jiong Guo, Sepp Hartung, Rolf Niedermeier, Ondrej Suchý:
The Parameterized Complexity of Local Search for TSP, More Refined. ISAAC 2011: 614-623
2000 – 2009
- 2009
- [j1]Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil:
Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. J. Graph Algorithms Appl. 13(3): 379-422 (2009) - [c5]Jiong Guo, Rolf Niedermeier, Ondrej Suchý:
Parameterized Complexity of Arc-Weighted Directed Steiner Problems. ISAAC 2009: 544-553 - [c4]Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý:
What Makes Equitable Connected Partition Easy. IWPEC 2009: 122-133 - [c3]Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý:
Parameterized Complexity of Generalized Domination Problems. WG 2009: 133-142 - 2008
- [c2]Vít Jelínek, Ondrej Suchý, Marek Tesar, Tomás Vyskocil:
Clustered Planarity: Clusters with Few Outgoing Edges. GD 2008: 102-113 - 2007
- [c1]Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil:
Clustered Planarity: Small Clusters in Eulerian Graphs. GD 2007: 303-314
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
