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: Choudhary, Pratibha
Subject Terms: Parameterized complexity, Kernelization, d-Hitting Set, d-Path Vertex Cover, Expansion Lemma, Data processing Computer science
File Description: application/pdf
Relation: urn:nbn:de:0030-drops-168279; https://drops.dagstuhl.de/opus/volltexte/2022/16827/
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
Subject Terms: graph algorithms, Hitting Set, iterative compression, parameterized complexity, d-Path Vertex Cover, Data processing Computer science
File Description: application/pdf
Relation: urn:nbn:de:0030-drops-109761; https://drops.dagstuhl.de/opus/volltexte/2019/10976/
Authors: Červený Radovan
Contributors: Suchý Ondřej, Valla Tomáš
Subject Terms: grafové algoritmy,Hitting Set,iterativní komprese,parametrizovaná složitost,d-Path Vertex Cover, graph algorithms,Hitting Set,iterative compression,parameterized complexity,d-Path Vertex Cover
File Description: application/pdf
Relation: KOS-762877627405; http://hdl.handle.net/10467/76249
Availability: http://hdl.handle.net/10467/76249
