Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms and Complexity [[electronic resource] ] : 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings / / edited by Pinar Heggernes
| Algorithms and Complexity [[electronic resource] ] : 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings / / edited by Pinar Heggernes |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XIII, 378 p. 274 illus., 33 illus. in color.) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer arithmetic and logic units Discrete Mathematics in Computer Science Data Science Arithmetic and Logic Structures |
| ISBN | 3-030-17402-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Quadratic Vertex Kernel for Split Vertex Deletion -- The temporal explorer who returns to the base -- Minimum Convex Partition of Point Sets -- Parameterized Complexity of Safe Set -- Parameterized Complexity of Diameter -- Fixed-parameter algorithms for maximum-profit facility location under matroid constraints -- Project Games -- Subgraph Isomorphism on Graph Classes that Exclude a Substructure -- Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors -- k-cuts on a path -- Extension of vertex cover and independent set in some classes of graphs -- On Hedonic Games with Common Ranking Property -- Complexity of scheduling for DARP with soft ride times -- Vertex Deletion on Split Graphs: Beyond 4-Hitting Set -- Fair Hitting Sequence problem: scheduling activities with varied frequency requirements -- Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability -- Searching by heterogeneous agents -- Finding a Mediocre Player -- Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation -- The Parameterized Position Heap of a Trie -- Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set -- Shortest Reconfiguration Sequence for Sliding Tokens on Spiders -- Turing Tumble is P(SPACE)-Complete -- Linear-Time In-Place DFS and BFS on the Word RAM -- A Faster Algorithm for the Strongly Stable b-Matching Problem -- Eternal Domination in Grids -- On the Necessary Memory to Compute the Plurality in Multi-Agent Systems -- Complexity of Vertex Switching on Edge-Bicolored Graphs -- Independent lazy better-response dynamics on network games -- Subset Feedback Vertex Set in Chordal and Split Graphs. |
| Record Nr. | UNISA-996466184803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Complexity : 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings / / edited by Pinar Heggernes
| Algorithms and Complexity : 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings / / edited by Pinar Heggernes |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XIII, 378 p. 274 illus., 33 illus. in color.) |
| Disciplina |
511.8
518.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer arithmetic and logic units Discrete Mathematics in Computer Science Data Science Arithmetic and Logic Structures |
| ISBN | 3-030-17402-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Quadratic Vertex Kernel for Split Vertex Deletion -- The temporal explorer who returns to the base -- Minimum Convex Partition of Point Sets -- Parameterized Complexity of Safe Set -- Parameterized Complexity of Diameter -- Fixed-parameter algorithms for maximum-profit facility location under matroid constraints -- Project Games -- Subgraph Isomorphism on Graph Classes that Exclude a Substructure -- Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors -- k-cuts on a path -- Extension of vertex cover and independent set in some classes of graphs -- On Hedonic Games with Common Ranking Property -- Complexity of scheduling for DARP with soft ride times -- Vertex Deletion on Split Graphs: Beyond 4-Hitting Set -- Fair Hitting Sequence problem: scheduling activities with varied frequency requirements -- Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability -- Searching by heterogeneous agents -- Finding a Mediocre Player -- Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation -- The Parameterized Position Heap of a Trie -- Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set -- Shortest Reconfiguration Sequence for Sliding Tokens on Spiders -- Turing Tumble is P(SPACE)-Complete -- Linear-Time In-Place DFS and BFS on the Word RAM -- A Faster Algorithm for the Strongly Stable b-Matching Problem -- Eternal Domination in Grids -- On the Necessary Memory to Compute the Plurality in Multi-Agent Systems -- Complexity of Vertex Switching on Edge-Bicolored Graphs -- Independent lazy better-response dynamics on network games -- Subset Feedback Vertex Set in Chordal and Split Graphs. |
| Record Nr. | UNINA-9910337837603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers / / edited by Pinar Heggernes
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers / / edited by Pinar Heggernes |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (X, 307 p. 51 illus.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Computer graphics Geometry Discrete Mathematics in Computer Science Data Science Computer Graphics |
| ISBN | 3-662-53536-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sequences of radius "k" for complete bipartite graphs -- Approximate Association via Dissociation -- Geodetic convexity parameters for graphs with few short induced paths -- Weighted Ecient Domination for P5-Free and for P6-Free Graphs -- Saving colors and Max Coloring: some xed-parameter tractability results -- Finding Two Edge-Disjoint Paths with Length Constraints -- Packing and covering immersion models of planar subcubic graphs -- The maximum weight stable set problem in (P 6, bull)-free graphs -- Parameterized Power Vertex Cover -- Exhaustive generation of k-critical H-free graphs -- Induced separation dimension -- Tight Bounds for Gomory-Hu-like Cut Counting -- Eccentricity Approximating Trees: Extended Abstract -- Drawing Planar Graphs with Prescribed Face Areas -- Vertex Cover Structural Parameterization Revisited -- Distance-d Independent Set and other problems in graphs with "few" minimal separators -- Parameterized complexity of the MINCCA problem on graphs of bounded decomposability -- On edge intersection graphs of paths with 2 bends -- Almost Induced Matching: Linear Kernels and Parameterized Algorithms -- Parameterized vertex deletion problems for hereditary graph classes with a block property -- Harmonious Coloring: Parameterized Algorithms and Upper bounds -- On Directed Steiner Trees with Multiple Roots -- A Faster Parameterized Algorithm for Group Feedback Edge Set -- Sequence Hypergraphs -- On subgraphs of bounded degeneracy in hypergraphs. |
| Record Nr. | UNISA-996465412303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers / / edited by Pinar Heggernes
| Graph-Theoretic Concepts in Computer Science : 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers / / edited by Pinar Heggernes |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (X, 307 p. 51 illus.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Computer graphics Geometry Discrete Mathematics in Computer Science Data Science Computer Graphics |
| ISBN | 3-662-53536-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sequences of radius "k" for complete bipartite graphs -- Approximate Association via Dissociation -- Geodetic convexity parameters for graphs with few short induced paths -- Weighted Ecient Domination for P5-Free and for P6-Free Graphs -- Saving colors and Max Coloring: some xed-parameter tractability results -- Finding Two Edge-Disjoint Paths with Length Constraints -- Packing and covering immersion models of planar subcubic graphs -- The maximum weight stable set problem in (P 6, bull)-free graphs -- Parameterized Power Vertex Cover -- Exhaustive generation of k-critical H-free graphs -- Induced separation dimension -- Tight Bounds for Gomory-Hu-like Cut Counting -- Eccentricity Approximating Trees: Extended Abstract -- Drawing Planar Graphs with Prescribed Face Areas -- Vertex Cover Structural Parameterization Revisited -- Distance-d Independent Set and other problems in graphs with "few" minimal separators -- Parameterized complexity of the MINCCA problem on graphs of bounded decomposability -- On edge intersection graphs of paths with 2 bends -- Almost Induced Matching: Linear Kernels and Parameterized Algorithms -- Parameterized vertex deletion problems for hereditary graph classes with a block property -- Harmonious Coloring: Parameterized Algorithms and Upper bounds -- On Directed Steiner Trees with Multiple Roots -- A Faster Parameterized Algorithm for Group Feedback Edge Set -- Sequence Hypergraphs -- On subgraphs of bounded degeneracy in hypergraphs. |
| Record Nr. | UNINA-9910484262003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Parameterized and Exact Computation [[electronic resource] ] : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers / / edited by Marek Cygan, Pinar Heggernes
| Parameterized and Exact Computation [[electronic resource] ] : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers / / edited by Marek Cygan, Pinar Heggernes |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (IX, 343 p. 37 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Discrete mathematics Computer Science Discrete Mathematics in Computer Science Mathematical Applications in Computer Science |
| ISBN | 3-319-13524-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Fixed-parameter tractability results -- Parameterized complexity theory -- Relationship between parameterized complexity and traditional complexity classifications.-Applications of parameterized and exact exponential-time computation.- Implementation issues of parameterized and exact exponential-time algorithms. |
| Record Nr. | UNISA-996211265403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parameterized and Exact Computation : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers / / edited by Marek Cygan, Pinar Heggernes
| Parameterized and Exact Computation : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers / / edited by Marek Cygan, Pinar Heggernes |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (IX, 343 p. 37 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Discrete mathematics Computer Science Discrete Mathematics in Computer Science Mathematical Applications in Computer Science |
| ISBN | 3-319-13524-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Fixed-parameter tractability results -- Parameterized complexity theory -- Relationship between parameterized complexity and traditional complexity classifications.-Applications of parameterized and exact exponential-time computation.- Implementation issues of parameterized and exact exponential-time algorithms. |
| Record Nr. | UNINA-9910484513403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||