Ganian, R., Hamm, T., Knop, D., Roy, S., Schierreich, S., & Suchý, O. (2023). Maximizing Social Welfare in Score-Based Social Distance Games. In R. Verbrugge (Ed.), Proceedings Nineteenth conference on Theoretical Aspects of Rationality
and Knowledge, TARK 2023, Oxford, United Kingdom, 28-30th June 2023 (Vol. 379, pp. 272–286). https://doi.org/10.4204/EPTCS.379.22
Cervený, R., & Suchý, O. (2023). Generating Faster Algorithms for d-Path Vertex Cover. In D. Paulusma & B. Ries (Eds.), Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised
Selected Papers (Vol. 14093, pp. 157–171). Springer. https://doi.org/10.1007/978-3-031-43380-1_12
Bodlaender, H. L., Édouard Bonnet, Jaffke, L., Knop, D., Lima, P. T., Milanic, M., Ordyniak, S., Pandey, S., & Suchý, O. (2023). Treewidth is NP-Complete on Cubic Graphs (and related results). CoRR, abs/2301.10031. https://doi.org/10.48550/ARXIV.2301.10031
Blazej, V., Choudhary, P., Knop, D., Kristan, J. M., Suchý, O., & Valla, T. (2023). Polynomial kernels for tracking shortest paths. Inf. Process. Lett., 179, 106315. https://doi.org/10.1016/J.IPL.2022.106315
Kucera, M., & Suchý, O. (2023). Minimum Eccentricity Shortest Path Problem with Respect to Structural
Parameters. Algorithmica, 85(3), 762–782. https://doi.org/10.1007/S00453-022-01006-X
Ganian, R., Hamm, T., Knop, D., Schierreich, S., & Suchý, O. (2023). Hedonic diversity games: A complexity picture with more than two
colors. Artif. Intell., 325, 104017. https://doi.org/10.1016/J.ARTINT.2023.104017
Blazej, V., Choudhary, P., Knop, D., Kristan, J. M., Suchý, O., & Valla, T. (2023). Constant factor approximation for tracking paths and fault tolerant
feedback vertex set. Discret. Optim., 47, 100756. https://doi.org/10.1016/J.DISOPT.2022.100756
Bodlaender, H. L., Édouard Bonnet, Jaffke, L., Knop, D., Lima, P. T., Milanic, M., Ordyniak, S., Pandey, S., & Suchý, O. (2023). Treewidth Is NP-Complete on Cubic Graphs. In N. Misra & M. Wahlström (Eds.), 18th International Symposium on Parameterized and Exact Computation,
IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Vol. 285, pp. 7:1–7:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.IPEC.2023.7
Ganian, R., Hamm, T., Knop, D., Roy, S., Schierreich, S., & Suchý, O. (2023). Maximizing Social Welfare in Score-Based Social Distance Games. CoRR, abs/2312.07632. https://doi.org/10.48550/ARXIV.2312.07632
2022
Blažej, V., Choudhary, P., Knop, D., Schierreich, Š., Suchý, O., & Valla, T. (2022). On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations. CoRR, abs/2207.01109. https://doi.org/10.48550/arXiv.2207.01109
Blažej, V., Choudhary, P., Knop, D., Křišťan, J. M., Suchý, O., & Valla, T. (2022). Polynomial Kernels for Tracking Shortest Paths. CoRR, abs/2202.11927. https://arxiv.org/abs/2202.11927
Blažej, V., Choudhary, P., Knop, D., Schierreich, Š., Suchý, O., & Valla, T. (2022). On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. In S. Chechik, G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September
5-9, 2022, Berlin/Potsdam, Germany (Vol. 244, pp. 22:1–22:16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.22
Ganian, R., Hamm, T., Knop, D., Schierreich, Š., & Suchý, O. (2022). Hedonic Diversity Games: A Complexity Picture with More than Two
Colors. Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI
2022, Thirty-Fourth Conference on Innovative Applications of Artificial
Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances
in Artificial Intelligence, EAAI 2022 Virtual Event, February 22
- March 1, 2022, 5034–5042. https://ojs.aaai.org/index.php/AAAI/article/view/20435
Schierreich, Š., & Suchý, O. (2022). Waypoint routing on bounded treewidth graphs. Inf. Process. Lett., 173, 106165. https://doi.org/10.1016/j.ipl.2021.106165
Knop, D., Schierreich, Š., & Suchý, O. (2022). Balancing the Spread of Two Opinions in Sparse Social Networks (Student
Abstract). Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI
2022, Thirty-Fourth Conference on Innovative Applications of Artificial
Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances
in Artificial Intelligence, EAAI 2022 Virtual Event, February 22
- March 1, 2022, 12987–12988. https://ojs.aaai.org/index.php/AAAI/article/view/21630
Červený, R., Choudhary, P., & Suchý, O. (2022). On Kernels for d-Path Vertex Cover. In S. Szeider, R. Ganian, & A. Silva (Eds.), 47th International Symposium on Mathematical Foundations of Computer
Science, MFCS 2022, August 22-26, 2022, Vienna, Austria (Vol. 241, pp. 29:1–29:14). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2022.29
Ganian, R., Hamm, T., Knop, D., Schierreich, Š., & Suchý, O. (2022). Hedonic Diversity Games: A Complexity Picture with More than Two
Colors. CoRR, abs/2202.09210. https://arxiv.org/abs/2202.09210
2021
Červený, R., Choudhary, P., & Suchý, O. (2021). On Kernels for d-Path Vertex Cover. CoRR, abs/2107.12245. https://arxiv.org/abs/2107.12245
Knop, D., Schierreich, Š., & Suchý, O. (2021). Balancing the Spread of Two Opinions in Sparse Social Networks. CoRR, abs/2105.10184. https://arxiv.org/abs/2105.10184
Blažej, V., Choudhary, P., Knop, D., Křišťan, J. M., Suchý, O., & Valla, T. (2021). Constant Factor Approximation for Tracking Paths and Fault Tolerant
Feedback Vertex Set. CoRR, abs/2108.01430. https://arxiv.org/abs/2108.01430
Kučera, M., & Suchý, O. (2021). Minimum Eccentricity Shortest Path Problem with Respect to Structural
Parameters. In P. Flocchini & L. Moura (Eds.), Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021,
Ottawa, ON, Canada, July 5-7, 2021, Proceedings (Vol. 12757, pp. 442–455). Springer. https://doi.org/10.1007/978-3-030-79987-8_31
Blažej, V., Choudhary, P., Knop, D., Křišťan, J. M., Suchý, O., & Valla, T. (2021). Constant Factor Approximation for Tracking Paths and Fault Tolerant
Feedback Vertex Set. In J. Könemann & B. Peis (Eds.), Approximation and Online Algorithms - 19th International Workshop,
WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers (Vol. 12982, pp. 23–38). Springer. https://doi.org/10.1007/978-3-030-92702-8_2
Luo, J., Molter, H., & Suchý, O. (2021). A Parameterized Complexity View on Collapsing k-Cores. Theory Comput. Syst., 65(8), 1243–1282. https://doi.org/10.1007/s00224-021-10045-w
Červený, R., & Suchý, O. (2021). Generating faster algorithms for d-Path Vertex Cover. CoRR, abs/2111.05896. https://arxiv.org/abs/2111.05896
2020
Kučera, M., & Suchý, O. (2020). Minimum Eccentricity Shortest Path Problem with Respect to Structural
Parameters. CoRR, abs/2008.07898. https://arxiv.org/abs/2008.07898
Schierreich, Š., & Suchý, O. (2020). Waypoint Routing on Bounded Treewidth Graphs. CoRR, abs/2007.04008. https://arxiv.org/abs/2007.04008
2019
Malík, J., Suchý, O., & Valla, T. (2019). Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism
Problem. CoRR, abs/1908.11248. http://arxiv.org/abs/1908.11248
Červený, R., & Suchý, O. (2019). Faster FPT Algorithm for 5-Path Vertex Cover. CoRR, abs/1906.09213. http://arxiv.org/abs/1906.09213
Malík, J., Suchý, O., & Valla, T. (2019). Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism
Problem. In I. S. Kotsireas, P. M. Pardalos, K. E. Parsopoulos, D. Souravlias, & A. Tsokas (Eds.), Analysis of Experimental Algorithms - Special Event, SEA^2
2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers (Vol. 11544, pp. 283–299). Springer. https://doi.org/10.1007/978-3-030-34029-2_19
Chitnis, R., Feldmann, A. E., & Suchý, O. (2019). A Tight Lower Bound for Planar Steiner Orientation. Algorithmica, 81(8), 3200–3216. https://doi.org/10.1007/s00453-019-00580-x
Červený, R., & Suchý, O. (2019). Faster FPT Algorithm for 5-Path Vertex Cover. In P. Rossmanith, P. Heggernes, & J.-P. Katoen (Eds.), 44th International Symposium on Mathematical Foundations of Computer
Science, MFCS 2019, August 26-30, 2019, Aachen, Germany (Vol. 138, pp. 32:1–32:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2019.32
Eiben, E., Knop, D., Panolan, F., & Suchý, O. (2019). Complexity of the Steiner Network Problem with Respect to the Number
of Terminals. In R. Niedermeier & C. Paul (Eds.), 36th International Symposium on Theoretical Aspects of Computer Science,
STACS 2019, March 13-16, 2019, Berlin, Germany (Vol. 126, pp. 25:1–25:17). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2019.25
2018
Eiben, E., Knop, D., Panolan, F., & Suchý, O. (2018). Complexity of the Steiner Network Problem with Respect to the Number
of Terminals. CoRR, abs/1802.08189. http://arxiv.org/abs/1802.08189
Luo, J., Molter, H., & Suchý, O. (2018). A Parameterized Complexity View on Collapsing k-Cores. In C. Paul & M. Pilipczuk (Eds.), 13th International Symposium on Parameterized and Exact Computation,
IPEC 2018, August 20-24, 2018, Helsinki, Finland (Vol. 115, pp. 7:1–7:14). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2018.7
Luo, J., Molter, H., & Suchý, O. (2018). A Parameterized Complexity View on Collapsing k-Cores. CoRR, abs/1805.12453. http://arxiv.org/abs/1805.12453
van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H., Sorge, M., & Suchý, O. (2018). The parameterized complexity of finding secluded solutions to some
classical optimization problems on graphs. Discret. Optim., 30, 20–50. https://doi.org/10.1016/j.disopt.2018.05.002
Chen, J., Molter, H., Sorge, M., & Suchý, O. (2018). Cluster Editing in Multi-Layer and Temporal Graphs. In W.-L. Hsu, D.-T. Lee, & C.-S. Liao (Eds.), 29th International Symposium on Algorithms and Computation, ISAAC
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan (Vol. 123, pp. 24:1–24:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2018.24
2017
Suchý, O. (2017). Extending the Kernel for Planar Steiner Tree to the Number of Steiner
Vertices. Algorithmica, 79(1), 189–210. https://doi.org/10.1007/s00453-016-0249-1
van Bevern, R., Bredereck, R., Chopin, M., Hartung, S., Hüffner, F., Nichterlein, A., & Suchý, O. (2017). Fixed-parameter algorithms for DAG Partitioning. Discret. Appl. Math., 220, 134–160. https://doi.org/10.1016/j.dam.2016.12.002
van Bevern, R., Niedermeier, R., & Suchý, O. (2017). A parameterized complexity view on non-preemptively scheduling interval-constrained
jobs: few machines, small looseness, and small slack. J. Sched., 20(3), 255–265. https://doi.org/10.1007/s10951-016-0478-9
Jones, M., Lokshtanov, D., Ramanujan, M. S., Saurabh, S., & Suchý, O. (2017). Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. SIAM J. Discret. Math., 31(2), 1294–1327. https://doi.org/10.1137/15M103618X
Blažej, V., Suchý, O., & Valla, T. (2017). A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching. In J. Blömer, I. S. Kotsireas, T. Kutsia, & D. E. Simos (Eds.), Mathematical Aspects of Computer and Information Sciences - 7th International
Conference, MACIS 2017, Vienna, Austria, November 15-17, 2017, Proceedings (Vol. 10693, pp. 333–348). Springer. https://doi.org/10.1007/978-3-319-72453-9_28
Chen, J., Molter, H., Sorge, M., & Suchý, O. (2017). A Parameterized View on Multi-Layer Cluster Editing. CoRR, abs/1709.09100. http://arxiv.org/abs/1709.09100
2016
Giannopoulou, A. C., Lokshtanov, D., Saurabh, S., & Suchý, O. (2016). Tree Deletion Set Has a Polynomial Kernel but No OPT^O(1) Approximation. SIAM J. Discret. Math., 30(3), 1371–1384. https://doi.org/10.1137/15M1038876
van Bevern, R., Bredereck, R., Chopin, M., Hartung, S., Hüffner, F., Nichterlein, A., & Suchý, O. (2016). Fixed-Parameter Algorithms for DAG Partitioning. CoRR, abs/1611.08809. http://arxiv.org/abs/1611.08809
van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H., Sorge, M., & Suchý, O. (2016). Finding Secluded Places of Special Interest in Graphs. CoRR, abs/1606.09000. http://arxiv.org/abs/1606.09000
Suchý, O. (2016). On Directed Steiner Trees with Multiple Roots. CoRR, abs/1604.05103. http://arxiv.org/abs/1604.05103
Blažej, V., Suchý, O., & Valla, T. (2016). A Simpler Bit-parallel Algorithm for Swap Matching. CoRR, abs/1606.04763. http://arxiv.org/abs/1606.04763
Suchý, O. (2016). On Directed Steiner Trees with Multiple Roots. In P. Heggernes (Ed.), Graph-Theoretic Concepts in Computer Science - 42nd International
Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected
Papers (Vol. 9941, pp. 257–268). https://doi.org/10.1007/978-3-662-53536-3_22
van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H., Sorge, M., & Suchý, O. (2016). Finding Secluded Places of Special Interest in Graphs. In J. Guo & D. Hermelin (Eds.), 11th International Symposium on Parameterized and Exact Computation,
IPEC 2016, August 24-26, 2016, Aarhus, Denmark (Vol. 63, pp. 5:1–5:16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2016.5
2015
van Bevern, R., Feldmann, A. E., Sorge, M., & Suchý, O. (2015). On the Parameterized Complexity of Computing Balanced Partitions in
Graphs. Theory Comput. Syst., 57(1), 1–35. https://doi.org/10.1007/s00224-014-9557-5
Hartung, S., Komusiewicz, C., Nichterlein, A., & Suchý, O. (2015). On structural parameterizations for the 2-club problem. Discret. Appl. Math., 185, 79–92. https://doi.org/10.1016/j.dam.2014.11.026
Hartung, S., Nichterlein, A., Niedermeier, R., & Suchý, O. (2015). A refined complexity analysis of degree anonymization in graphs. Inf. Comput., 243, 249–262. https://doi.org/10.1016/j.ic.2014.12.017
van Bevern, R., Niedermeier, R., & Suchý, O. (2015). A parameterized complexity view on non-preemptively scheduling interval-constrained
jobs: few machines, small looseness, and small slack. CoRR, abs/1508.01657. http://arxiv.org/abs/1508.01657
Bredereck, R., Chen, J., Hartung, S., Komusiewicz, C., Niedermeier, R., & Suchý, O. (2015). On explaining integer vectors by few homogeneous segments. J. Comput. Syst. Sci., 81(4), 766–782. https://doi.org/10.1016/j.jcss.2014.12.028
Chen, J., Komusiewicz, C., Niedermeier, R., Sorge, M., Suchý, O., & Weller, M. (2015). Polynomial-Time Data Reduction for the Subset Interconnection Design
Problem. SIAM J. Discret. Math., 29(1), 1–25. https://doi.org/10.1137/140955057
Suchý, O. (2015). Extending the Kernel for Planar Steiner Tree to the Number of Steiner
Vertices. In T. Husfeldt & I. A. Kanj (Eds.), 10th International Symposium on Parameterized and Exact Computation,
IPEC 2015, September 16-18, 2015, Patras, Greece (Vol. 43, pp. 151–162). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2015.151
2014
Bredereck, R., Chen, J., Hartung, S., Kratsch, S., Niedermeier, R., Suchý, O., & Woeginger, G. J. (2014). A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. J. Artif. Intell. Res., 50, 409–446. https://doi.org/10.1613/jair.4285
Mnich, M., Philip, G., Saurabh, S., & Suchý, O. (2014). Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound. J. Comput. Syst. Sci., 80(7), 1384–1403. https://doi.org/10.1016/j.jcss.2014.04.011
Lokshtanov, D., Saurabh, S., & Suchý, O. (2014). Solving Multicut Faster Than 2^n. In A. S. Schulz & D. Wagner (Eds.), Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw,
Poland, September 8-10, 2014. Proceedings (Vol. 8737, pp. 666–676). Springer. https://doi.org/10.1007/978-3-662-44777-2_55
Giannopoulou, A. C., Lokshtanov, D., Saurabh, S., & Suchý, O. (2014). Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation). In V. Raman & S. P. Suresh (Eds.), 34th International Conference on Foundation of Software Technology
and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014,
New Delhi, India (Vol. 29, pp. 85–96). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2014.85
2013
Hartung, S., Komusiewicz, C., Nichterlein, A., & Suchý, O. (2013). On Structural Parameterizations for the 2-Club Problem. CoRR, abs/1305.3735. http://arxiv.org/abs/1305.3735
Hartung, S., Nichterlein, A., Niedermeier, R., & Suchý, O. (2013). A Refined Complexity Analysis of Degree Anonymization in Graphs. In F. V. Fomin, R. Freivalds, M. Z. Kwiatkowska, & D. Peleg (Eds.), Automata, Languages, and Programming - 40th International Colloquium,
ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II (Vol. 7966, pp. 594–606). Springer. https://doi.org/10.1007/978-3-642-39212-2_52
Guo, J., Hartung, S., Niedermeier, R., & Suchý, O. (2013). The Parameterized Complexity of Local Search for TSP, More Refined. Algorithmica, 67(1), 89–110. https://doi.org/10.1007/s00453-012-9685-8
Jones, M., Lokshtanov, D., Ramanujan, M. S., Saurabh, S., & Suchý, O. (2013). Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. In H. L. Bodlaender & G. F. Italiano (Eds.), Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings (Vol. 8125, pp. 671–682). Springer. https://doi.org/10.1007/978-3-642-40450-4_57
Raman, V., Saurabh, S., & Suchý, O. (2013). An FPT Algorithm for Tree Deletion Set. In S. K. Ghosh & T. Tokuyama (Eds.), WALCOM: Algorithms and Computation, 7th International Workshop,
WALCOM 2013, Kharagpur, India, February 14-16, 2013. Proceedings (Vol. 7748, pp. 286–297). Springer. https://doi.org/10.1007/978-3-642-36065-7_27
Giannopoulou, A. C., Lokshtanov, D., Saurabh, S., & Suchý, O. (2013). Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation). CoRR, abs/1309.7891. http://arxiv.org/abs/1309.7891
van Bevern, R., Feldmann, A. E., Sorge, M., & Suchý, O. (2013). On the Parameterized Complexity of Computing Balanced Partitions in
Graphs. CoRR, abs/1312.7014. http://arxiv.org/abs/1312.7014
van Bevern, R., Feldmann, A. E., Sorge, M., & Suchý, O. (2013). On the Parameterized Complexity of Computing Graph Bisections. In A. Brandstädt, K. Jansen, & R. Reischuk (Eds.), Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised
Papers (Vol. 8165, pp. 76–87). Springer. https://doi.org/10.1007/978-3-642-45043-3_8
Chen, J., Komusiewicz, C., Niedermeier, R., Sorge, M., Suchý, O., & Weller, M. (2013). Effective and Efficient Data Reduction for the Subset Interconnection
Design Problem. In L. Cai, S.-W. Cheng, & T. W. Lam (Eds.), Algorithms and Computation - 24th International Symposium, ISAAC
2013, Hong Kong, China, December 16-18, 2013, Proceedings (Vol. 8283, pp. 361–371). Springer. https://doi.org/10.1007/978-3-642-45030-3_34
Bredereck, R., Chen, J., Hartung, S., Komusiewicz, C., Niedermeier, R., & Suchý, O. (2013). On Explaining Integer Vectors by Few Homogenous Segments. In F. Dehne, R. Solis-Oba, & J.-R. Sack (Eds.), Algorithms and Data Structures - 13th International Symposium, WADS
2013, London, ON, Canada, August 12-14, 2013. Proceedings (Vol. 8037, pp. 207–218). Springer. https://doi.org/10.1007/978-3-642-40104-6_18
Bui-Xuan, B.-M., Suchý, O., Telle, J. A., & Vatshelle, M. (2013). Feedback vertex set on graphs of low clique-width. Eur. J. Comb., 34(3), 666–679. https://doi.org/10.1016/j.ejc.2012.07.023
van Bevern, R., Bredereck, R., Chopin, M., Hartung, S., Hüffner, F., Nichterlein, A., & Suchý, O. (2013). Parameterized Complexity of DAG Partitioning. In P. G. Spirakis & M. J. Serna (Eds.), Algorithms and Complexity, 8th International Conference, CIAC 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings (Vol. 7878, pp. 49–60). Springer. https://doi.org/10.1007/978-3-642-38233-8_5
Raman, V., Saurabh, S., & Suchý, O. (2013). An FPT algorithm for Tree Deletion Set. J. Graph Algorithms Appl., 17(6), 615–628. https://doi.org/10.7155/jgaa.00308
2012
Golovach, P. A., Kratochvíl, J., & Suchý, O. (2012). Parameterized complexity of generalized domination problems. Discret. Appl. Math., 160(6), 780–792. https://doi.org/10.1016/j.dam.2010.11.012
Mnich, M., Philip, G., Saurabh, S., & Suchý, O. (2012). Beyond Max-Cut: λ-Extendible Properties Parameterized
Above the Poljak-Turzík Bound. CoRR, abs/1207.5696. http://arxiv.org/abs/1207.5696
Jones, M., Lokshtanov, D., Ramanujan, M. S., Saurabh, S., & Suchý, O. (2012). Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. CoRR, abs/1210.0260. http://arxiv.org/abs/1210.0260
Mnich, M., Philip, G., Saurabh, S., & Suchý, O. (2012). Beyond Max-Cut: λ-Extendible Properties Parameterized Above the
Poljak-Turzík Bound. In D. D’Souza, T. Kavitha, & J. Radhakrishnan (Eds.), IARCS Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012,
Hyderabad, India (Vol. 18, pp. 412–423). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.412
Bredereck, R., Chen, J., Hartung, S., Niedermeier, R., Suchý, O., & Kratsch, S. (2012). A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. In J. Hoffmann & B. Selman (Eds.), Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence,
July 22-26, 2012, Toronto, Ontario, Canada. AAAI Press. http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/5006
2011
Guo, J., Niedermeier, R., & Suchý, O. (2011). Parameterized Complexity of Arc-Weighted Directed Steiner Problems. SIAM J. Discret. Math., 25(2), 583–599. https://doi.org/10.1137/100794560
Guo, J., Hartung, S., Niedermeier, R., & Suchý, O. (2011). The Parameterized Complexity of Local Search for TSP, More Refined. In T. Asano, S.-I. Nakano, Y. Okamoto, & O. Watanabe (Eds.), Algorithms and Computation - 22nd International Symposium, ISAAC
2011, Yokohama, Japan, December 5-8, 2011. Proceedings (Vol. 7074, pp. 614–623). Springer. https://doi.org/10.1007/978-3-642-25591-5_63
Jelínková, E., Suchý, O., Hliněný, P., & Kratochvíl, J. (2011). Parameterized Problems Related to Seidel’s Switching. Discret. Math. Theor. Comput. Sci., 13(2), 19–44. http://dmtcs.episciences.org/542
2009
Jelínková, E., Kára, J., Kratochvíl, J., Pergel, M., Suchý, O., & Vyskočil, T. (2009). Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs. J. Graph Algorithms Appl., 13(3), 379–422. https://doi.org/10.7155/jgaa.00192
Enciso, R., Fellows, M. R., Guo, J., Kanj, I. A., Rosamond, F. A., & Suchý, O. (2009). What Makes Equitable Connected Partition Easy. In J. Chen & F. V. Fomin (Eds.), Parameterized and Exact Computation, 4th International Workshop, IWPEC
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers (Vol. 5917, pp. 122–133). Springer. https://doi.org/10.1007/978-3-642-11269-0_10
Golovach, P. A., Kratochvíl, J., & Suchý, O. (2009). Parameterized Complexity of Generalized Domination Problems. In C. Paul & M. Habib (Eds.), Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers (Vol. 5911, pp. 133–142). https://doi.org/10.1007/978-3-642-11409-0_12
Guo, J., Niedermeier, R., & Suchý, O. (2009). Parameterized Complexity of Arc-Weighted Directed Steiner Problems. In Y. Dong, D.-Z. Du, & O. H. Ibarra (Eds.), Algorithms and Computation, 20th International Symposium, ISAAC
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings (Vol. 5878, pp. 544–553). Springer. https://doi.org/10.1007/978-3-642-10631-6_56
2008
Jelínek, V., Suchý, O., Tesař, M., & Vyskočil, T. (2008). Clustered Planarity: Clusters with Few Outgoing Edges. In I. G. Tollis & M. Patrignani (Eds.), Graph Drawing, 16th International Symposium, GD 2008, Heraklion,
Crete, Greece, September 21-24, 2008. Revised Papers (Vol. 5417, pp. 102–113). Springer. https://doi.org/10.1007/978-3-642-00219-9_11
2007
Jelínková, E., Kára, J., Kratochvíl, J., Pergel, M., Suchý, O., & Vyskočil, T. (2007). Clustered Planarity: Small Clusters in Eulerian Graphs. In S.-H. Hong, T. Nishizeki, & W. Quan (Eds.), Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia,
September 24-26, 2007. Revised Papers (Vol. 4875, pp. 303–314). Springer. https://doi.org/10.1007/978-3-540-77537-9_30