Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers
暂无分享,去创建一个
[1] Michael R. Fellows,et al. Crown Structures for Vertex Cover Kernelization , 2007, Theory of Computing Systems.
[2] Frank Harary,et al. A simple algorithm to detect balance in signed graphs , 1980, Math. Soc. Sci..
[3] Thomas Zaslavsky. Signed graphs , 1982, Discret. Appl. Math..
[4] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[5] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .
[6] Barry O'Sullivan,et al. Almost 2-SAT is Fixed-Parameter Tractable , 2008, J. Comput. Syst. Sci..
[7] Nalan Gülpinar,et al. Detecting Embedded Networks in LP Using GUB Structures and Independent Set Algorithms , 2000, Comput. Optim. Appl..
[8] Vangelis Th. Paschos. A (Delta/2)-Approximation Algorithm for the Maximum Independent Set Problem , 1992, Inf. Process. Lett..
[9] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[10] Faisal N. Abu-Khzam,et al. Scalable Parallel Algorithms for FPT Problems , 2006, Algorithmica.
[11] Robert E. Bixby,et al. Converting Linear Programs to Network Problems , 1980, Math. Oper. Res..
[12] John J. Bartholdi,et al. A good submatrix is hard to find , 1982, Oper. Res. Lett..
[13] Ge Xia,et al. Simplicity is Beauty: Improved Upper Bounds for Vertex Cover , 2005 .
[14] Rolf Niedermeier,et al. Optimal Edge Deletions for Signed Graph Balancing , 2007, WEA.
[15] Eduardo D. Sontag,et al. Algorithmic and complexity results for decompositions of biological networks into monotone subsystems , 2007, Biosyst..
[16] Gerald G. Brown,et al. Automatic identification of embedded network rows in large-scale optimization models , 1984, Math. Program..
[17] R. Fourer,et al. Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics , 1988 .
[18] Bruce A. Reed,et al. Finding odd cycle transversals , 2004, Oper. Res. Lett..
[19] I. Heller,et al. 14 . An Extension of a Theorem of Dantzig’s , 1957 .
[20] Michael Kaufmann,et al. Computation of Renameable Horn Backdoors , 2008, SAT.
[21] Barrie M. Baker,et al. A heuristic for finding embedded network structure in mathematical programmes , 1993 .
[22] Falk Hüffner,et al. Algorithm Engineering for Optimal Graph Bipartization , 2005, J. Graph Algorithms Appl..
[23] Nalan Gülpinar,et al. Extracting pure network submatrices in linear programs using signed graphs , 2004, Discret. Appl. Math..