| The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community,with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available. The scope of LNCS, including its subseries LNAI and LNBI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes -proceedings (published in time for the respective conference) -post-proceedings (consisting of thoroughly revised final full papers) -research monographs (which may be based on outstanding PhD work,research projects, technical reports, etc.) |
| Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction Online Problems, Pathwidth, and Persistence Chordless Paths Through Three Vertices Computing Small Search Numbers in Linear Time Bounded Fixed-Parameter Tractability: The Case 2p~ly(k) Refined Memorisation for Vertex Cover Parameterized Graph Separation Problems Parameterized Coloring Problems on Chordal Graphs On Decidability of MSO Theories of Representable Matroids On Miniaturized Problems in Parameterized Complexity Theory Smaller Kernels for Hitting Set Problems of Constant Arity Packing Edge Disjoint Triangles: A Parameterized View Looking at the Stars Moving Policies in Cyclic Assembly-Line Scheduling A Structural View on Parameterizing Problems: Distance from Triviality Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable Simplifying the Weft Hierarchy The Minimum Weight Triangulation Problem with Few Inner Points A Direct Algorithm for the Parameterized Face Cover Problem On Finding Short Resolution Refutations and Small Unsatisfiable Subsets Parameterized Algorithms for Feedback Vertex Set Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk) Practical FPT Implementations and Applications(Invited Talk) Author Index |
内容加载中，请稍后...
商品评论（0条）