{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:45:36Z","timestamp":1725500736189},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_23","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T11:36:53Z","timestamp":1358768213000},"page":"245-256","source":"Crossref","is-referenced-by-count":1,"title":["Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems"],"prefix":"10.1007","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[]},{"given":"\u00d6mer","family":"E\u011fecio\u011flu","sequence":"additional","affiliation":[]},{"given":"Leonid","family":"Molokov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-28050-4_8","volume-title":"Parameterized and Exact Computation","author":"P. Damaschke","year":"2012","unstructured":"Damaschke, P.: Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol.\u00a07112, pp. 94\u2013105. Springer, Heidelberg (2012); Extended version to appear in Theor. Comp. Sci."},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-30191-9_7","volume-title":"Bioinformatics Research and Applications","author":"P. Damaschke","year":"2012","unstructured":"Damaschke, P., Molokov, L.: Error Propagation in Sparse Linear Systems with Peptide-Protein Incidence Matrices. In: Bleris, L., M\u0103ndoiu, I., Schwartz, R., Wang, J. (eds.) ISBRA 2012. LNCS, vol.\u00a07292, pp. 72\u201383. Springer, Heidelberg (2012)"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s00224-007-1345-z","volume":"41","author":"F.K. Dehne","year":"2007","unstructured":"Dehne, F.K., Fellows, M.R., Langston, M.A., Rosamond, F.A., Stevens, K.: An O(2\n                    O(k)\n                  n\n                  3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. Theory Comput. Syst.\u00a041, 479\u2013492 (2007)","journal-title":"Theory Comput. Syst."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ipl.2005.08.012","volume":"97","author":"U. Feige","year":"2006","unstructured":"Feige, U., Reichman, D.: On the Hardness of Approximating Max-Satisfy. Info. Proc. Lett.\u00a097, 31\u201335 (2006)","journal-title":"Info. Proc. Lett."},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-11269-0_16","volume-title":"Parameterized and Exact Computation","author":"P. Giannopoulos","year":"2009","unstructured":"Giannopoulos, P., Knauer, C., Rote, G.: The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 198\u2013209. Springer, Heidelberg (2009)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Grossman, J.W., Kulkarni, D.M., Schochetman, I.E.: Algebraic Graph Theory Without Orientation. Lin. Algebra and its Appl. 212\/213, 289\u2013307 (1994)","DOI":"10.1016\/0024-3795(94)90407-3"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1016\/j.jcss.2006.02.001","volume":"72","author":"J. Guo","year":"2006","unstructured":"Guo, J., Gramm, J., H\u00fcffner, F., Niedermeier, R., Wernicke, S.: Compression-Based Fixed-Parameter Algorithms for Feedback Vertex Set and Edge Bipartization. J. Comput. Syst. Sci.\u00a072, 1386\u20131396 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal. In: Rabani, Y. (ed.) SODA 2012, pp. 94\u2013103. SIAM (2012)","DOI":"10.1137\/1.9781611973099.8"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-10217-2_37","volume-title":"Combinatorial Algorithms","author":"D. Lokshtanov","year":"2009","unstructured":"Lokshtanov, D., Saurabh, S., Sikdar, S.: Simpler Parameterized Algorithm for OCT. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 380\u2013384. Springer, Heidelberg (2009)"},{"key":"23_CR10","unstructured":"Narayanaswamy, N.S., Raman, V., Ramanujan, M.S., Saurabh, S.: LP can be a Cure for Parameterized Problems. In: D\u00fcrr, C., Wilke, T. (eds.) STACS 2012. LIPIcs, vol.\u00a014, pp. 338\u2013349 (2012)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Oxley, J.: Matroid Theory, 2nd edn. Oxford Univ. Press (2011)","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1159892.1159898","volume":"2","author":"V. Raman","year":"2006","unstructured":"Raman, V., Saurabh, S., Subramanian, C.R.: Faster Fixed Parameter Tractable Algorithms for Finding Feedback Vertex Sets. ACM Trans. Algor.\u00a02, 403\u2013415 (2006)","journal-title":"ACM Trans. Algor."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B.A. Reed","year":"2004","unstructured":"Reed, B.A., Smith, K., Vetta, A.: Finding Odd Cycle Transversals. Oper. Res. Lett.\u00a032, 299\u2013301 (2004)","journal-title":"Oper. Res. Lett."},{"key":"23_CR14","unstructured":"Tutte, W.T.: On Chain-Groups and the Factors of Graphs. Coll. Math. Societatis J\u00e1nos Bolyai 25 (Algebraic Methods in Graph Theory, Szeged), 793\u2013818 (1978)"},{"key":"23_CR15","unstructured":"Zaslavsky, T.: A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas. Electron. J. Comb., Dynamic Surveys in Combinatorics, no. DS8 (1999)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:34:58Z","timestamp":1620120898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}