Authors: Bodlaender, Hans L., Bonnet, Édouard, Jaffke, Lars, Knop, Dušan, Lima, Paloma T., Milanič, Martin, Ordyniak, Sebastian, Pandey, Sukanya, Suchý, Ondřej
Subject Terms: Treewidth, cubic graphs, degree, NP-completeness, Theory of computation → Problems, reductions and completeness
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.IPEC.2023; https://dx.doi.org/10.1137/0608024; https://dx.doi.org/10.1137/0607033; https://dx.doi.org/10.1016/S0304-3975(97)00228-4; https://dx.doi.org/10.1016/S0166-218X(97)00031-0; https://dx.doi.org/10.1016/0020-0190(92)90234-M; https://dx.doi.org/10.1016/0304-3975(88)90028-X; https://dx.doi.org/10.1007/BF01215352
Availability: https://doi.org/10.4230/lipics.ipec.2023.710.4230/LIPIcs.IPEC.202310.1137/060802410.1137/060703310.1016/S0304-3975(97)00228-410.1016/S0166-218X(97)00031-010.1016/0020-0190(92)90234-M10.1016/0304-3975(88)90028-X10.1007/BF01215352
Authors: Červený, Radovan, Choudhary, Pratibha, Suchý, Ondřej
Subject Terms: Parameterized complexity, Kernelization, d-Hitting Set, d-Path Vertex Cover, Expansion Lemma, Theory of computation → Graph algorithms analysis, Theory of computation → Fixed parameter tractability
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.MFCS.2022; https://dx.doi.org/10.1016/j.dam.2011.04.008; https://dx.doi.org/10.4230/LIPIcs.MFCS.2019.32; https://dx.doi.org/10.1016/j.dam.2018.05.032; https://dx.doi.org/10.1016/j.tcs.2010.06.026; https://dx.doi.org/10.1007/978-3-319-21275-3; https://dx.doi.org/10.1145/1806689.1806725; https://dx.doi.org/10.4153/CJM-1965-045-4; https://dx.doi.org/10.1007/978-3-662-48054-0_25; https://dx.doi.org/10.1080/00207160903176868; https://dx.doi.org/10.1016/j.tcs.2009.11.012; https://dx.doi.org/10.1137/140997889; https://dx.doi.org/10.1145/2886094; https://dx.doi.org/10.1007/s00778-015-0392-3
Authors: Blažej, Václav, Choudhary, Pratibha, Knop, Dušan, Schierreich, Šimon, Suchý, Ondřej, Valla, Tomáš
Subject Terms: Traveling Salesperson, Subset TSP, Waypoint Routing, Kernelization, Theory of computation → Graph algorithms analysis, Theory of computation → Fixed parameter tractability
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.ESA.2022; https://dx.doi.org/10.1007/s00453-020-00672-z; https://dx.doi.org/10.1515/9781400841103; https://dx.doi.org/10.1109/SFCS.1996.548458; https://dx.doi.org/10.1145/290179.290180; https://dx.doi.org/10.1145/321105.321111; https://dx.doi.org/10.1145/3414845; https://dx.doi.org/10.4230/LIPIcs.ESA.2019.23; https://dx.doi.org/10.1016/j.disopt.2011.05.002; https://dx.doi.org/10.1016/S0166-218X(02)00242-1; https://dx.doi.org/10.1145/3402926; https://dx.doi.org/10.1007/978-3-030-26176-4_10; https://dx.doi.org/10.1007/BF01582008; https://dx.doi.org/10.1287/opre.6.6.791; https://dx.doi.org/10.1007/978-3-319-21275-3; https://dx.doi.org/10.1145/3341730; https://dx.doi.org/10.1007/978-3-662-53622-3
Availability: https://doi.org/10.4230/lipics.esa.2022.2210.4230/LIPIcs.ESA.202210.1007/s00453-020-00672-z10.1515/978140084110310.1109/SFCS.1996.54845810.1145/290179.29018010.1145/321105.32111110.1145/341484510.4230/LIPIcs.ESA.2019.2310.1016/j.disopt.2011.05.00210.1016/S0166-218X(02)00242-110.1145/340292610.1007/978-3-030-26176-4_1010.1007/BF0158200810.1287/opre.6.6.79110.1007/978-3-319-21275-310.1145/334173010.1007/978-3-662-53622-3
Authors: Eiben, Eduard, Knop, Dušan, Panolan, Fahad, Suchý, Ondřej
Subject Terms: Directed Steiner Network, Planar Graphs, Parameterized Algorithms, Bounded Genus, Exponential Time Hypothesis, Mathematics of computing → Graph algorithms, Theory of computation → Parameterized complexity and exact algorithms
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.STACS.2019; https://dx.doi.org/10.1016/0020-0190(89)90039-2; https://dx.doi.org/10.1145/2432622.2432628; https://dx.doi.org/10.1006/jagm.1999.1042; https://dx.doi.org/10.1145/1921659.1921664; https://dx.doi.org/10.4230/LIPIcs.ESA.2018.20; https://dx.doi.org/10.1137/1.9781611973402.129; https://dx.doi.org/10.1145/2925416; https://dx.doi.org/10.1007/s00453-007-9138-y; https://dx.doi.org/10.4230/LIPIcs.ITCS.2018.36; https://dx.doi.org/10.1007/s004530010020; https://dx.doi.org/10.1287/moor.12.4.634; https://dx.doi.org/10.4230/LIPIcs.ICALP.2016.27; https://dx.doi.org/10.1007/978-3-662-47672-7_40; https://dx.doi.org/10.1109/FOCS.2012.62; https://dx.doi.org/10.1007/s00224-007-1324-4
Availability: https://doi.org/10.4230/lipics.stacs.2019.2510.4230/LIPIcs.STACS.201910.1016/0020-0190(89)90039-210.1145/2432622.243262810.1006/jagm.1999.104210.1145/1921659.192166410.4230/LIPIcs.ESA.2018.2010.1137/1.9781611973402.12910.1145/292541610.1007/s00453-007-9138-y10.4230/LIPIcs.ITCS.2018.3610.1007/s00453001002010.1287/moor.12.4.63410.4230/LIPIcs.ICALP.2016.2710.1007/978-3-662-47672-7_4010.1109/FOCS.2012.6210.1007/s00224-007-1324-4
Authors: Červený, Radovan, Suchý, Ondřej
Subject Terms: graph algorithms, Hitting Set, iterative compression, parameterized complexity, d-Path Vertex Cover, Theory of computation → Graph algorithms analysis, Theory of computation → Fixed parameter tractability
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.MFCS.2019; https://dx.doi.org/10.1016/j.dam.2011.04.008; https://dx.doi.org/10.1016/j.tcs.2010.06.026; https://dx.doi.org/10.1007/978-3-319-21275-3; https://dx.doi.org/10.1145/2629620; https://dx.doi.org/10.1007/978-3-662-48054-0_25; https://dx.doi.org/10.1016/j.tcs.2009.11.012; https://dx.doi.org/10.1145/3284176; https://dx.doi.org/10.1007/978-3-642-16533-7; https://dx.doi.org/10.1007/s00778-015-0392-3; https://dx.doi.org/10.1016/j.ipl.2015.12.002; https://dx.doi.org/10.1016/0022-0000(80)90060-4; https://dx.doi.org/10.1007/978-3-642-12368-9_8; https://dx.doi.org/10.1371/journal.pcbi.1005777; https://dx.doi.org/10.1016/j.tcs.2019.03.013; https://dx.doi.org/10.1016/j.ipl.2014.06.018
Availability: https://doi.org/10.4230/lipics.mfcs.2019.3210.4230/LIPIcs.MFCS.201910.1016/j.dam.2011.04.00810.1016/j.tcs.2010.06.02610.1007/978-3-319-21275-310.1145/262962010.1007/978-3-662-48054-0_2510.1016/j.tcs.2009.11.01210.1145/328417610.1007/978-3-642-16533-710.1007/s00778-015-0392-310.1016/j.ipl.2015.12.00210.1016/0022-0000(80)90060-410.1007/978-3-642-12368-9_810.1371/journal.pcbi.100577710.1016/j.tcs.2019.03.01310.1016/j.ipl.2014.06.018
Authors: Luo, Junjie, Molter, Hendrik, Suchý, Ondrej
Subject Terms: r-Degenerate Vertex Deletion, Feedback Vertex Set, Fixed-Parameter Tractability, Kernelization Lower Bounds, Graph Algorithms, Social Network Analysis
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.IPEC.2018; https://dx.doi.org/10.4230/LIPIcs.ICALP.2017.68
Authors: Chen, Jiehua, Molter, Hendrik, Sorge, Manuel, Suchý, Ondrej
Subject Terms: Cluster Editing, Temporal Graphs, Multi-Layer Graphs, Fixed-Parameter Algorithms, Polynomial Kernels, Parameterized Complexity
File Description: application/pdf
Authors: van Bevern, René, Fluschnik, Till, Mertzios, George B., Molter, Hendrik, Sorge, Manuel, Suchý, Ondrej
Subject Terms: Neighborhood, Feedback Vertex Set, Vertex Deletion, Separator, Dominating Set
File Description: application/pdf
Relation: https://dx.doi.org/10.4230/LIPIcs.IPEC.2016; https://dx.doi.org/10.1016/S1571-0661(04)81014-4; https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2015.408; https://dx.doi.org/10.1007/978-3-642-40313-2_38; https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2014.85; https://dx.doi.org/10.1016/j.tcs.2005.10.007; https://dx.doi.org/10.1145/1721837.1721848
Availability: https://doi.org/10.4230/lipics.ipec.2016.510.4230/LIPIcs.IPEC.201610.1016/S1571-0661(04)81014-410.4230/LIPIcs.FSTTCS.2015.40810.1007/978-3-642-40313-2_3810.4230/LIPIcs.FSTTCS.2014.8510.1016/j.tcs.2005.10.00710.1145/1721837.1721848
Subject Terms: Tree Deletion Set, Feedback Vertex Set, Kernelization, Linear Equations
File Description: application/pdf
Subject Terms: Algorithms and data structures, fixed-parameter algorithms, bipartite graphs, above-guarantee parameterization
File Description: application/pdf