Nantilus
Parameterized and exact computation : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, revised selected papers
This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Symposium on Parameterized and Exact Computation, IPEC 2013, in Sophia Antipolis, France, in September 2013. The 29 revised full papers presented were carefully reviewed and selected from 58 submission...
Enregistré dans:
| Auteurs principaux : | , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Parameterized and exact computation : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, revised selected papers / edited by Gregory Gutin, Stefan Szeider. |
| Publié : |
Cham :
Springer International Publishing
, [20..] Cham : Springer Nature |
| Collection : | Theoretical computer science and general issues (Online) ; 8246 |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Note sur l'URL : | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex |
| Condition d'utilisation et de reproduction : | Conditions particulières de réutilisation pour les bénéficiaires des licences nationales : https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 |
| Sujets : | |
| Documents associés : | Autre format:
Parameterized and Exact Computation Autre format: Parameterized and Exact Computation |
| LEADER | 05768clm a2200697 4500 | ||
|---|---|---|---|
| 001 | PPN176108726 | ||
| 003 | http://www.sudoc.fr/176108726 | ||
| 005 | 20241001155500.0 | ||
| 010 | |a 978-3-319-03898-8 | ||
| 017 | 7 | 0 | |a 10.1007/978-3-319-03898-8 |2 DOI |
| 035 | |a (OCoLC)870330088 | ||
| 035 | |a Springer978-3-319-03898-8 | ||
| 035 | |a SPRINGER_EBOOKS_LN_PLURI_10.1007/978-3-319-03898-8 | ||
| 035 | |a Springer-11645-978-3-319-03898-8 | ||
| 100 | |a 20140205f20 u |0frey0103 ba | ||
| 101 | 0 | |a eng |2 639-2 | |
| 102 | |a CH | ||
| 135 | |a dr||||||||||| | ||
| 181 | |6 z01 |c txt |2 rdacontent | ||
| 181 | 1 | |6 z01 |a i# |b xxxe## | |
| 182 | |6 z01 |c c |2 rdamedia | ||
| 182 | 1 | |6 z01 |a b | |
| 183 | |6 z01 |a ceb |2 RDAfrCarrier | ||
| 200 | 1 | |a Parameterized and exact computation |e 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, revised selected papers |f edited by Gregory Gutin, Stefan Szeider. | |
| 214 | 0 | |a Cham |c Springer International Publishing | |
| 214 | 2 | |a Cham |c Springer Nature |d [20..] | |
| 225 | 0 | |a Theoretical Computer Science and General Issues |x 2512-2029 |v 8246 | |
| 330 | |a This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Symposium on Parameterized and Exact Computation, IPEC 2013, in Sophia Antipolis, France, in September 2013. The 29 revised full papers presented were carefully reviewed and selected from 58 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, and implementation issues of parameterized and exact algorithms. | ||
| 359 | 1 | |a Exact Complexity and Satisfiability.- The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups.- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.- Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem -- The Fine Details of Fast Dynamic Programming over Tree Decompositions.- On Subexponential and FPT-Time Inapproximability.- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization.- Chain Minors Are FPT.- Incompressibility of H-Free Edge Modification.- Contracting Few Edges to Remove Forbidden Induced Subgraphs.- Fixed-Parameter and Approximation Algorithms: A New Look.- Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs.- Computing Tree-Depth Faster Than 2n.- Faster Exact Algorithms for Some Terminal Set Problems.- Parameterized Algorithms for Modular-Width.- A Faster FPT Algorithm for Bipartite Contraction.- On the Ordered List Subgraph Embedding Problems.- A Completeness Theory for Polynomial (Turing) Kernelization.- On Sparsification for Computing Treewidth.- The Jump Number Problem: Exact and Parameterized.- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.- Hardness of r-dominating set on Graphs of Diameter (r + 1).- Amalgam Width of Matroids.- On the Parameterized Complexity of Reconfiguration Problems.- FPT Algorithms for Consecutive Ones Submatrix Problems.- Upper Bounds on Boolean-Width with Applications to Exact Algorithms.- Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.- Completeness Results for Parameterized Space Classes.- Treewidth and Pure Nash Equilibria -- Algorithms for k-Internal Out-Branching. | |
| 371 | 0 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | |
| 371 | 0 | |a Accès soumis à abonnement pour tout autre établissement | |
| 371 | 1 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales |c https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | |
| 410 | | | |0 200114832 |t Theoretical computer science and general issues (Online) |x 2512-2029 |v 8246 | |
| 452 | | | |t Parameterized and Exact Computation |b Texte imprimé |y 9783319038971 | |
| 452 | | | |t Parameterized and Exact Computation |b Texte imprimé |y 9783319038995 | |
| 610 | 1 | |a Computer Science | |
| 610 | 2 | |a Algorithm Analysis and Problem Complexity | |
| 610 | 2 | |a Numeric Computing | |
| 610 | 2 | |a Data Structures | |
| 610 | 2 | |a Math Applications in Computer Science | |
| 610 | 2 | |a Algorithms | |
| 610 | 2 | |a Discrete Mathematics in Computer Science | |
| 610 | 2 | |a Numerical Analysis | |
| 610 | 2 | |a Data Science | |
| 610 | 2 | |a Mathematical Applications in Computer Science | |
| 615 | |a @Computer Science |n 11645 |2 Springer | ||
| 676 | |a 005.1 |v 23 | ||
| 680 | |a QA76.9.A43 | ||
| 701 | 1 | |a Gutin |b Gregory |4 651 | |
| 701 | 1 | |a Szeider |b Stefan |4 651 | |
| 801 | 3 | |a FR |b Abes |c 20231126 |g AFNOR | |
| 801 | 1 | |a DE |b Springer |c 20230412 |g AACR2 | |
| 856 | 4 | |u https://doi.org/10.1007/978-3-319-03898-8 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://doi.org/10.1007/978-3-319-03898-8 |z Accès sur la plateforme de l'éditeur (Springer) | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-96Z5S4TQ-K |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 441099901:830849513 |u https://budistant.univ-nantes.fr/login?url=https://doi.org/10.1007/978-3-319-03898-8 | |
| 915 | |5 441099901:830849513 |b SPRING13-00067 | ||
| 930 | |5 441099901:830849513 |b 441099901 |j g | ||
| 991 | |5 441099901:830849513 |a Exemplaire créé en masse par ITEM le 30-09-2024 16:08 | ||
| 997 | |a NUM |b SPRING13-00067 |d NUMpivo |e EM |s d | ||
| 998 | |a 979094 | ||