Finding optimal solutions for covering and matching problems

[1]  Michael R. Fellows,et al.  An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem , 2005, COCOON.

[2]  Vijay V. Vazirani,et al.  NP-Completeness of Some Generalizations of the Maximum Matching Problem , 1982, Inf. Process. Lett..

[3]  Ge Xia,et al.  Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size , 2005, SIAM J. Comput..

[4]  Anders Yeo,et al.  Kernel bounds for disjoint cycles and disjoint paths , 2009, Theor. Comput. Sci..

[5]  Sven Rahmann,et al.  Exact and heuristic algorithms for weighted cluster editing. , 2007, Computational systems bioinformatics. Computational Systems Bioinformatics Conference.

[6]  Adam Krawczyk,et al.  The Complexity of Finding a Second Hmiltonian Cycle in Cubic Graphs , 1999, J. Comput. Syst. Sci..

[7]  Stephen B. Seidman,et al.  A graph‐theoretic generalization of the clique concept* , 1978 .

[8]  Lukasz Kowalik,et al.  Improved Induced Matchings in Sparse Graphs , 2009, IWPEC.

[9]  Rolf Niedermeier,et al.  Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation , 2005, Theory of Computing Systems.

[10]  Rolf Niedermeier,et al.  A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems , 2011, TOCT.

[11]  Michael R. Fellows,et al.  Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps , 2004, WG.

[12]  Jiong Guo.  A more effective linear kernelization for cluster editing , 2009, Theor. Comput. Sci..

[13]  Christian Komusiewicz,et al.  On Generating Triangle-Free Graphs , 2009, Electron. Notes Discret. Math..

[14]  Fenghui Zhang,et al.  Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms , 2009 .

[15]  Henning Fernau,et al.  2 Contents , 1996 .

[16]  Rolf Niedermeier,et al.  Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization , 2006, J. Comput. Syst. Sci..

[17]  Alberto Caprara,et al.  Packing triangles in bounded degree graphs , 2002, Inf. Process. Lett..

[18]  Ness B. Shroff,et al.  On the Complexity of Scheduling in Wireless Networks , 2006, MobiCom '06.

[19]  Martin Charles Golumbic,et al.  Irredundancy in Circular Arc Graphs , 1993, Discret. Appl. Math..

[20]  Bruce A. Reed,et al.  Finding odd cycle transversals , 2004, Oper. Res. Lett..

[21]  Paul D. Seymour,et al.  Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.

[22]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[23]  Hannes Moser,et al.  A Problem Kernelization for Graph Packing , 2009, SOFSEM.

[24]  Hans L. Bodlaender,et al.  On Disjoint Cycles , 1991, Int. J. Found. Comput. Sci..

[25]  Robert E. Tarjan,et al.  Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..

[26]  Saket Saurabh,et al.  Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles , 2008, Algorithmica.

[27]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[28]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[29]  Toshihiro Fujito,et al.  Approximating Node-Deletion Problems for Matroidal Properties , 1999, J. Algorithms.

[30]  Henning Fernau,et al.  A parameterized perspective on packing paths of length two , 2009, J. Comb. Optim..

[31]  Vincenzo Bonifaci,et al.  The complexity of uniform Nash equilibria and related regular subgraph problems , 2008, Theor. Comput. Sci..

[32]  Falk Hüffner,et al.  Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und ExperimenteAlgorithms and Experiments for Parameterized Approaches to Hard Graph Problems , 2009, it Inf. Technol..

[33]  Dieter Rautenbach,et al.  Some results on graphs without long induced paths , 2003, Inf. Process. Lett..

[34]  Hans L. Bodlaender,et al.  A Cubic Kernel for Feedback Vertex Set , 2007, STACS.

[35]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[36]  Ness B. Shroff,et al.  Maximum weighted matching with interference constraints , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[37]  Jou-Ming Chang,et al.  Induced matchings in asteroidal triple-free graphs , 2003, Discret. Appl. Math..

[38]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[39]  Magnus Wahlström,et al.  A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams , 2009, IWPEC.

[40]  Christian Sloper,et al.  Looking at the stars , 2004, Theor. Comput. Sci..

[41]  Yefim Dinitz,et al.  Dinitz' Algorithm: The Original Version and Even's Version , 2006, Essays in Memory of Shimon Even.

[42]  Saket Saurabh,et al.  Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set , 2002, ISAAC.

[43]  Christian Komusiewicz,et al.  Fixed-Parameter Algorithms for Cluster Vertex Deletion , 2010, Theory of Computing Systems.

[44]  Christian Komusiewicz,et al.  Isolation concepts for clique enumeration: Comparison and computational experiments , 2009, Theor. Comput. Sci..

[45]  Kathie Cameron,et al.  Independent packings in structured graphs , 2006, Math. Program..

[46]  Hannes Moser,et al.  The Parameterized Complexity of the Induced Matching Problem in Planar Graphs , 2007, FAW.

[47]  Michael R. Fellows,et al.  Crown Structures for Vertex Cover Kernelization , 2007, Theory of Computing Systems.

[48]  Reuven Bar-Yehuda,et al.  Randomized Algorithms for the Loop Cutset Problem , 2000, J. Artif. Intell. Res..

[49]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[50]  Michael A. Langston,et al.  Computational, Integrative, and Comparative Methods for the Elucidation of Genetic Coexpression Networks , 2005, Journal of biomedicine & biotechnology.

[51]  Dimitrios M. Thilikos,et al.  Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems , 2008, Algorithmica.

[52]  Miroslav Chlebík,et al.  Complexity of approximating bounded variants of optimization problems , 2006, Theor. Comput. Sci..

[53]  René van Bevern,et al.  Kernelization Through Tidying A Case Study Based on s-Plex Cluster Vertex Deletion , 2009 .

[54]  Christian Komusiewicz,et al.  A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing , 2009, AAIM.

[55]  Rolf Niedermeier,et al.  Algorithms and Experiments for Clique Relaxations-Finding Maximum s-Plexes , 2009, SEA.

[56]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[57]  Udi Rotics,et al.  Finding Maximum Induced Matchings in Subclasses of Claw-Free and P5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size , 2003, Algorithmica.

[58]  Rolf Niedermeier,et al.  Linear Problem Kernels for NP-Hard Problems on Planar Graphs , 2007, ICALP.

[59]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[60]  Peter Shaw,et al.  Packing Edge Disjoint Triangles: A Parameterized View , 2004, IWPEC.

[61]  Michael R. Fellows,et al.  Efficient Parameterized Preprocessing for Cluster Editing , 2007, FCT.

[62]  Jérôme Monnot,et al.  Approximation Results for the Weighted P4 Partition Problems , 2005, FCT.

[63]  Jianer Chen,et al.  An Improved Parameterized Algorithm for a Generalized Matching Problem , 2008, TAMC.

[64]  M. Weigt,et al.  Sudden emergence of q-regular subgraphs in random graphs , 2006, cond-mat/0603819.

[65]  Rolf Niedermeier,et al.  Fixed-parameter tractability results for feedback set problems in tournaments , 2010, J. Discrete Algorithms.

[66]  Kathie Cameron,et al.  The graphs with maximum induced matching and maximum matching the same size , 2005, Discret. Math..

[67]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[68]  Hannes Moser,et al.  The parameterized complexity of the induced matching problem , 2009, Discret. Appl. Math..

[69]  Rolf Niedermeier,et al.  An efficient fixed-parameter algorithm for 3-Hitting Set , 2003, J. Discrete Algorithms.

[70]  Mark Gerstein,et al.  Predicting interactions in protein networks by completing defective cliques , 2006, Bioinform..

[71]  Aravind Srinivasan,et al.  Provable Algorithms for Joint Optimization of Transport , Routing and MAC layers in Wireless Ad Hoc Networks , 2007 .

[72]  Rolf Niedermeier,et al.  Exact Algorithms for Generalizations of Vertex Cover , 2005 .

[73]  Kathie Cameron.  Brambles and independent packings in chordal graphs , 2009, Discret. Math..

[74]  Vadim V. Lozin,et al.  Maximum k-regular induced subgraphs , 2007, J. Comb. Optim..

[75]  Nick Roussopoulos,et al.  A MAX{m, n} Algorithm for Determining the Graph H from Its Line Graph C , 1973, Inf. Process. Lett..

[76]  Jianer Chen,et al.  On Parameterized Intractability: Hardness and Completeness , 2008, Comput. J..

[77]  Saket Saurabh,et al.  A linear kernel for planar connected dominating set , 2011, Theor. Comput. Sci..

[78]  F. Bruce Shepherd,et al.  Bipartite Domination and Simultaneous Matroid Covers , 2003, SIAM J. Discret. Math..

[79]  Bin Wu,et al.  A Parallel Algorithm for Enumerating All the Maximal k -Plexes , 2007, PAKDD Workshops.

[80]  Christian Komusiewicz,et al.  Isolation concepts for efficiently enumerating dense subgraphs , 2009, Theor. Comput. Sci..

[81]  Hans L. Bodlaender,et al.  Treewidth: Characterizations, Applications, and Computations , 2006, WG.

[82]  Sergiy Butenko,et al.  Novel Approaches for Analyzing Biological Networks , 2005, J. Comb. Optim..

[83]  Rolf Niedermeier,et al.  Iterative Compression for Exactly Solving NP-Hard Minimization Problems , 2009, Algorithmics of Large and Complex Networks.

[84]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[85]  Dror Rawitz,et al.  An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications , 2010, SIAM J. Discret. Math..

[86]  Rolf Niedermeier,et al.  Separator-based data reduction for signed graph balancing , 2010, J. Comb. Optim..

[87]  Falk Hüffner,et al.  Algorithm Engineering for Optimal Graph Bipartization , 2005, J. Graph Algorithms Appl..

[88]  Zhi-Zhong Chen,et al.  An improved randomized approximation algorithm for maximum triangle packing , 2009, Discret. Appl. Math..

[89]  Patric R. J. Östergård,et al.  A fast algorithm for the maximum clique problem , 2002, Discret. Appl. Math..

[90]  C. Pandu Rangan,et al.  The Vertex-Disjoint Triangles Problem , 1998, WG.

[91]  Derek G. Corneil,et al.  The complexity of regular subgraph recognition , 1990, Discret. Appl. Math..

[92]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[93]  Allen R. Hanson,et al.  Maximum-weight bipartite matching technique and its application in image feature matching , 1996, Other Conferences.

[94]  Madhav V. Marathe,et al.  The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks , 2004, IEEE Journal on Selected Areas in Communications.

[95]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[96]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[97]  Toshihiro Fujito,et al.  A unified approximation algorithm problems ” , 1998 .

[98]  Stefan Szeider,et al.  Parameterized Graph Editing with Chosen Vertex Degrees , 2008, COCOA.

[99]  Stefan Szeider,et al.  The Parameterized Complexity of Regular Subgraph Problems and Generalizations , 2008, CATS.

[100]  Henning Fernau,et al.  Kernels: Annotated, Proper and Induced , 2006, IWPEC.

[101]  Sebastian Böcker,et al.  Going weighted: Parameterized algorithms for cluster editing , 2009, Theor. Comput. Sci..

[102]  Sebastian Böcker,et al.  Exact Algorithms for Cluster Editing: Evaluation and Experiments , 2008, Algorithmica.

[103]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..

[104]  Illya V. Hicks,et al.  Combinatorial algorithms for the maximum k-plex problem , 2012, J. Comb. Optim..

[105]  Christos H. Papadimitriou,et al.  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..

[106]  C. Lee Giles,et al.  Efficient identification of Web communities , 2000, KDD '00.

[107]  Jianer Chen,et al.  Improved algorithms for feedback vertex set problems , 2008, J. Comput. Syst. Sci..

[108]  Dániel Marx,et al.  Parameterized graph cleaning problems , 2009, Discret. Appl. Math..

[109]  Saket Saurabh,et al.  Simpler Parameterized Algorithm for OCT , 2009, IWOCA.

[110]  Mihalis Yannakakis,et al.  Edge-Deletion Problems , 1981, SIAM J. Comput..

[111]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[112]  Moshe Lewenstein,et al.  Tighter Approximations for Maximum Induced Matchings in Regular Graphs , 2005, WAOA.

[113]  Michael R. Fellows,et al.  FPT is P-Time Extremal Structure I , 2005, ACiD.

[114]  Ge Xia,et al.  On the induced matching problem , 2011, J. Comput. Syst. Sci..

[115]  Rolf Niedermeier,et al.  Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.

[116]  Iain A. Stewart.  On locating cubic subgraphs in bounded-degree connected bipartite graphs , 1997, Discret. Math..

[117]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[118]  Hannes Moser,et al.  Parameterized complexity of finding regular induced subgraphs , 2009, J. Discrete Algorithms.

[119]  Rolf Niedermeier,et al.  Polynomial-time data reduction for dominating set , 2002, JACM.

[120]  Rudolf Fleischer,et al.  Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem , 2009, ESA.

[121]  Dimitrios M. Thilikos,et al.  Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover , 2001, WADS.

[122]  Adrian Kosowski,et al.  Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph , 2008, Graphs Comb..

[123]  Mihalis Yannakakis,et al.  Node-Deletion Problems on Bipartite Graphs , 1981, SIAM J. Comput..

[124]  Daniel Lokshtanov,et al.  Wheel-Free Deletion Is W[2]-Hard , 2008, IWPEC.

[125]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[126]  C. Reidys.  Distance-2-Matchings of Random Graphs , 2004 .

[127]  Zbigniew Lonc,et al.  Edge decompositions into two kinds of graphs , 2009, Discret. Math..

[128]  Lance Fortnow,et al.  Infeasibility of instance compression and succinct PCPs for NP , 2011, J. Comput. Syst. Sci..

[129]  Stéphan Thomassé.  A quadratic kernel for feedback vertex set , 2009, SODA.

[130]  Dániel Marx,et al.  Obtaining a Planar Graph by Vertex Deletion , 2007, Algorithmica.

[131]  Sandra Sudarsky,et al.  Massive Quasi-Clique Detection , 2002, LATIN.

[132]  Ming-Yang Kao,et al.  On approximating four covering and packing problems , 2009, J. Comput. Syst. Sci..

[133]  Panos M. Pardalos,et al.  Mining market data: A network approach , 2006, Comput. Oper. Res..

[134]  Russell Schwartz,et al.  SNPs Problems, Complexity, and Algorithms , 2001, ESA.

[135]  Magnus Wahlström,et al.  Algorithms, measures and upper bounds for satisfiability and related problems , 2007 .

[136]  Fedor V. Fomin,et al.  Iterative compression and exact algorithms , 2010, Theor. Comput. Sci..

[137]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[138]  Iain A. Stewart.  Deciding whether a planar graph has a cubic subgraph is NP-complete , 1994, Discret. Math..

[139]  Aravind Srinivasan,et al.  End-to-end packet-scheduling in wireless ad-hoc networks , 2004, SODA '04.

[140]  Dimitrios M. Thilikos,et al.  Fast FPT-Algorithms for Cleaning Grids , 2006, STACS.

[141]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[142]  D. Segev,et al.  Kidney paired donation and optimizing the use of live donor organs. , 2005, JAMA.

[143]  Rolf Niedermeier,et al.  A general method to speed up fixed-parameter-tractable algorithms , 2000, Inf. Process. Lett..

[144]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[145]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 1999, J. Algorithms.

[146]  Iain A. Stewart.  On the fixed-parameter tractability of parameterized model-checking problems , 2008, Inf. Process. Lett..

[147]  Michael R. Fellows,et al.  Threshold Dominating Sets and an Improved Characterization of W[2] , 1998, Theor. Comput. Sci..

[148]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

[149]  Ioannis Koutis,et al.  Faster Algebraic Algorithms for Path and Packing Problems , 2008, ICALP.

[150]  Venkatesh Raman,et al.  Parameterized complexity of finding subgraphs with hereditary properties , 2000, Theor. Comput. Sci..

[151]  Kathie Cameron,et al.  Induced Matchings in Intersection Graphs , 2000, Electron. Notes Discret. Math..

[152]  Rolf Niedermeier,et al.  Improved Tree Decomposition Based Algorithms for Domination-like Problems , 2002, LATIN.

[153]  Hannes Moser,et al.  Feedback arc set in bipartite tournaments is NP-complete , 2007, Inf. Process. Lett..

[154]  Faisal N. Abu-Khzam,et al.  Scalable Parallel Algorithms for FPT Problems , 2006, Algorithmica.

[155]  Miroslav Chlebík,et al.  Crown reductions for the Minimum Weighted Vertex Cover problem , 2008, Discret. Appl. Math..

[156]  Kazuyuki Aihara,et al.  A large-scale study of link spam detection by graph algorithms , 2007, AIRWeb '07.

[157]  Miroslav Chlebík,et al.  Approximation Hardness of Dominating Set Problems , 2004, ESA.

[158]  Arie M. C. A. Koster,et al.  Combinatorial Optimization on Graphs of Bounded Treewidth , 2008, Comput. J..

[159]  Samir Khuller.  The vertex cover problem , 2002 .

[160]  Arie M. C. A. Koster,et al.  Frequency assignment : models and algorithms , 1999 .

[161]  Vadim V. Lozin.  On maximum induced matchings in bipartite graphs , 2002, Inf. Process. Lett..

[162]  Gerd Finke,et al.  Approximability results for the maximum and minimum maximal induced matching problems , 2008, Discret. Optim..

[163]  Sergiy Butenko,et al.  Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem , 2011, Oper. Res..

[164]  B. Lewis,et al.  Transmission network analysis in tuberculosis contact investigations. , 2007, The Journal of infectious diseases.

[165]  Faisal N. Abu-Khzam,et al.  A Quadratic Kernel for 3-Set Packing , 2009, TAMC.

[166]  Saket Saurabh,et al.  Faster algorithms for feedback vertex set , 2005, Electron. Notes Discret. Math..

[167]  Vadim V. Lozin,et al.  On computing the dissociation number and the induced matching number of bipartite graphs , 2004, Ars Comb..

[168]  Saket Saurabh,et al.  The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number , 2007, ISAAC.

[169]  Michael R. Fellows,et al.  The complexity of irredundant sets parameterized by size , 2000, Discret. Appl. Math..

[170]  Barry O'Sullivan,et al.  Almost 2-SAT is Fixed-Parameter Tractable , 2008, J. Comput. Syst. Sci..

[171]  Saket Saurabh,et al.  Incompressibility through Colors and IDs , 2009, ICALP.

[172]  Iain A. Stewart.  Finding Regular Subgraphs in Both Arbitrary and Planar Graphs , 1996, Discret. Appl. Math..

[173]  Jayme Luiz Szwarcfiter,et al.  Applying Modular Decomposition to Parameterized Cluster Editing Problems , 2008, Theory of Computing Systems.

[174]  Michael R. Fellows,et al.  On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..

[175]  Faisal N. Abu-Khzam,et al.  A kernelization algorithm for d-Hitting Set , 2010, J. Comput. Syst. Sci..

[176]  Viggo Kann,et al.  Maximum Bounded H-Matching is MAX SNP-Complete , 1994, Inf. Process. Lett..

[177]  Zsolt Tuza,et al.  Induced matchings in bipartite graphs , 1989, Discret. Math..

[178]  Dimitrios M. Thilikos,et al.  (Meta) Kernelization , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[179]  Moshe Lewenstein,et al.  New results on induced matchings , 2000, Discret. Appl. Math..

[180]  Barry O'Sullivan,et al.  A fixed-parameter algorithm for the directed feedback vertex set problem , 2008, JACM.

[181]  Alexander Schrijver,et al.  On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..

[182]  David Manlove,et al.  On the approximability of the maximum induced matching problem , 2005, J. Discrete Algorithms.

[183]  Juraj Hromkovic,et al.  On the Hardness of Reoptimization , 2008, SOFSEM.

[184]  Domingos Moreira Cardoso,et al.  Spectral upper bounds on the size of k-regular induced subgraphs , 2009, Electron. Notes Discret. Math..

[185]  Amnon Barak,et al.  A new approach for approximating node deletion problems , 2003, Inf. Process. Lett..

[186]  Rolf Niedermeier,et al.  Techniques for Practical Fixed-Parameter Algorithms , 2007, Comput. J..

[187]  F. Makedon,et al.  A bipartite graph matching framework for finding correspondences between structural elements in two proteins , 2004, The 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[188]  Michael R. Fellows,et al.  Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.

[189]  Laura A. Sanchis,et al.  Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem , 1996, INFORMS J. Comput..

[190]  Rolf Niedermeier,et al.  Invitation to data reduction and problem kernelization , 2007, SIGA.

[191]  Michael R. Fellows,et al.  The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel , 2006, IWPEC.

[192]  Wilbert E. Wilhelm,et al.  Clique-detection models in computational biochemistry and genomics , 2006, Eur. J. Oper. Res..

[193]  Hannes Moser,et al.  The Parameterized Complexity of the Unique Coverage Problem , 2007, ISAAC.

[194]  Dimitrios M. Thilikos,et al.  Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up , 2004, ICALP.

[195]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[196]  Carsten Lund,et al.  The Approximation of Maximum Subgraph Problems , 1993, ICALP.

[197]  Panos M. Pardalos,et al.  Statistical analysis of financial networks , 2005, Comput. Stat. Data Anal..

[198]  Robert W. Williams,et al.  Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function , 2005, Nature Genetics.

[199]  Jiong Guo,et al.  Algorithm design techniques for parameterized graph modification problems , 2006, Ausgezeichnete Informatikdissertationen.

[200]  Stephen A. Cook,et al.  Problems Complete for Deterministic Logarithmic Space , 1987, J. Algorithms.

[201]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[202]  Yun Zhang,et al.  The Cluster Editing Problem: Implementations and Experiments , 2006, IWPEC.

[203]  Rolf Niedermeier,et al.  Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems , 2004, Algorithmica.

[204]  Michael D. Plummer,et al.  Graph factors and factorization: 1985-2003: A survey , 2007, Discret. Math..

[205]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[206]  Saket Saurabh,et al.  Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems , 2006, FSTTCS.

[207]  Kathie Cameron,et al.  Finding a maximum induced matching in weakly chordal graphs , 2003, Discret. Math..

[208]  Michael J. Pelsmajer,et al.  Parameterized Algorithms for Feedback Vertex Set , 2004, IWPEC.

[209]  Oscar Moreno,et al.  Three-regular Subgraphs of Four-regular Graphs' , 1998, Eur. J. Comb..

[210]  Angelika Steger,et al.  On induced matchings , 1993, Discret. Math..

[211]  Michael R. Fellows,et al.  Finding k Disjoint Triangles in an Arbitrary Graph , 2004, WG.

[212]  Richard C. Brewster,et al.  Oriented star packings , 2008, J. Comb. Theory, Ser. B.

[213]  David G. Kirkpatrick,et al.  On the completeness of a generalized matching problem , 1978, STOC.

[214]  Ge Xia,et al.  Improved Parameterized Upper Bounds for Vertex Cover , 2006, MFCS.

[215]  Zdenek Ryjácek,et al.  Claw-free graphs - A survey , 1997, Discret. Math..

[216]  Michele Zito.  Induced Matchings in Regular Graphs and Trees , 1999, WG.

[217]  Francine Berman,et al.  Generalized Planar Matching , 1990, J. Algorithms.

[218]  D. West.  Introduction to Graph Theory , 1995 .

[219]  Yoshiko Wakabayashi,et al.  Packing triangles in low degree graphs and indifference graphs , 2008, Discret. Math..

[220]  Richard E. Korf,et al.  Additive Pattern Database Heuristics , 2004, J. Artif. Intell. Res..

[221]  Kazuo Iwama,et al.  Enumeration of isolated cliques and pseudo-cliques , 2009, TALG.

[222]  Raphael Yuster,et al.  Combinatorial and computational aspects of graph packing and graph decomposition , 2007, Comput. Sci. Rev..

[223]  Refael Hassin,et al.  An Approximation Algorithm for Maximum Packing of 3-Edge Paths , 1997, Inf. Process. Lett..

[224]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[225]  Leizhen Cai,et al.  Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..

[226]  Dániel Marx.  Chordal Deletion is Fixed-Parameter Tractable , 2008, Algorithmica.

[227]  Jianxin Wang,et al.  Improved Deterministic Algorithms for Weighted Matching and Packing Problems , 2009, TAMC.

[228]  Noga Alon,et al.  Finding and counting given length cycles , 1997, Algorithmica.

[229]  Liming Cai,et al.  Advice Classes of Parameterized Tractability , 1997, Ann. Pure Appl. Log..