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.
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers / / edited by Ignasi Sau, Dimitrios M. Thilikos
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers / / edited by Ignasi Sau, Dimitrios M. Thilikos |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XXI, 394 p. 304 illus., 41 illus. in color.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Mathematics—Data processing
Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Algorithms Computer arithmetic and logic units Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science Data Science Arithmetic and Logic Structures |
| ISBN | 3-030-30786-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Logic and Random Graphs -- Unavoidability and universality of digraphs -- Parameterized algorithms for geometric graphs via decomposition theorems -- Subexponential algorithms for variants of homomorphism problem in string graphs -- The 4-Steiner Root Problem -- Hamiltonicity below Dirac’s condition -- Maximum Independent Sets in Subcubic Graphs: New Results -- Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs -- Local approximation of the Maximum Cut in regular graphs -- Fixed-parameter tractability of counting small minimum (S,T)-cuts -- Fast Breadth-First Search in Still Less Space -- A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion -- Flip distances between graph orientations -- Graph functionality -- On Happy Colorings, Cuts, and Structural Parameterizations -- Shortest Reconfiguration of Matchings -- Travelling on Graphs with Small Highway Dimension -- The Power of Cut-Based Parameters for Computing Edge Disjoint Paths -- Geometric Representations of Dichotomous Ordinal Data -- Linear MIM-width of Trees -- Approximating Minimum Dominating Set on String graphs -- Classified Rank-Maximal Matchings and Popular Matchings -- Algorithms and Hardness -- Maximum Matchings and Minimum Blocking Sets in Theta-6 Graphs -- A polynomial-time algorithm for the independent set problem in $\{P_{10},C_4,C_6\}$-free graphs -- Independent Set Reconfiguration Parameterized by Modular-Width -- Counting independent sets in graphs with bounded bipartite pathwidth -- Intersection Graphs of Non-Crossing Paths -- Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs -- Color Refinement, Homomorphisms, and Hypergraphs -- 3-colorable planar graphs have an intersection segment representation using 3 slopes -- The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms -- Minimal separators in graph classes defined by small forbidden induced subgraphs. |
| Record Nr. | UNISA-996466324803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers / / edited by Ignasi Sau, Dimitrios M. Thilikos
| Graph-Theoretic Concepts in Computer Science : 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers / / edited by Ignasi Sau, Dimitrios M. Thilikos |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XXI, 394 p. 304 illus., 41 illus. in color.) |
| Disciplina |
511.5
004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Mathematics—Data processing
Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Algorithms Computer arithmetic and logic units Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science Data Science Arithmetic and Logic Structures |
| ISBN | 3-030-30786-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Logic and Random Graphs -- Unavoidability and universality of digraphs -- Parameterized algorithms for geometric graphs via decomposition theorems -- Subexponential algorithms for variants of homomorphism problem in string graphs -- The 4-Steiner Root Problem -- Hamiltonicity below Dirac’s condition -- Maximum Independent Sets in Subcubic Graphs: New Results -- Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs -- Local approximation of the Maximum Cut in regular graphs -- Fixed-parameter tractability of counting small minimum (S,T)-cuts -- Fast Breadth-First Search in Still Less Space -- A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion -- Flip distances between graph orientations -- Graph functionality -- On Happy Colorings, Cuts, and Structural Parameterizations -- Shortest Reconfiguration of Matchings -- Travelling on Graphs with Small Highway Dimension -- The Power of Cut-Based Parameters for Computing Edge Disjoint Paths -- Geometric Representations of Dichotomous Ordinal Data -- Linear MIM-width of Trees -- Approximating Minimum Dominating Set on String graphs -- Classified Rank-Maximal Matchings and Popular Matchings -- Algorithms and Hardness -- Maximum Matchings and Minimum Blocking Sets in Theta-6 Graphs -- A polynomial-time algorithm for the independent set problem in $\{P_{10},C_4,C_6\}$-free graphs -- Independent Set Reconfiguration Parameterized by Modular-Width -- Counting independent sets in graphs with bounded bipartite pathwidth -- Intersection Graphs of Non-Crossing Paths -- Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs -- Color Refinement, Homomorphisms, and Hypergraphs -- 3-colorable planar graphs have an intersection segment representation using 3 slopes -- The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms -- Minimal separators in graph classes defined by small forbidden induced subgraphs. |
| Record Nr. | UNINA-9910349281803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010, Revised Papers / / edited by Dimitrios M. Thilikos
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010, Revised Papers / / edited by Dimitrios M. Thilikos |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 338 p. 62 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Geometry Computer networks Artificial intelligence—Data processing Discrete Mathematics in Computer Science Computer Communication Networks Data Science |
| ISBN |
1-280-39030-1
9786613568229 3-642-16926-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Algorithmic Barriers from Phase Transitions in Graphs -- Algorithmic Graph Minors and Bidimensionality -- Regular Talks -- Complexity Results for the Spanning Tree Congestion Problem -- max-cut and Containment Relations in Graphs -- The Longest Path Problem is Polynomial on Cocomparability Graphs -- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds -- On Stable Matchings and Flows -- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs -- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time -- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching -- Efficient Algorithms for Eulerian Extension -- On the Small Cycle Transversal of Planar Graphs -- Milling a Graph with Turn Costs: A Parameterized Complexity Perspective -- Graphs that Admit Right Angle Crossing Drawings -- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs -- On the Boolean-Width of a Graph: Structure and Applications -- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs -- Colouring Vertices of Triangle-Free Graphs -- A Quartic Kernel for Pathwidth-One Vertex Deletion -- Network Exploration by Silent and Oblivious Robots -- Uniform Sampling of Digraphs with a Fixed Degree Sequence -- Measuring Indifference: Unit Interval Vertex Deletion -- Parameterized Complexity of the Arc-Preserving Subsequence Problem -- From Path Graphs to Directed Path Graphs -- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces -- Efficient Broadcasting in Random Power Law Networks -- Graphs with Large Obstacle Numbers -- The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree -- The Number of Bits Needed to Represent a Unit Disk Graph -- Lattices and Maximum Flow Algorithms in Planar Graphs. |
| Record Nr. | UNISA-996465956903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010, Revised Papers / / edited by Dimitrios M. Thilikos
| Graph-Theoretic Concepts in Computer Science : 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010, Revised Papers / / edited by Dimitrios M. Thilikos |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 338 p. 62 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Geometry Computer networks Artificial intelligence—Data processing Discrete Mathematics in Computer Science Computer Communication Networks Data Science |
| ISBN |
1-280-39030-1
9786613568229 3-642-16926-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Algorithmic Barriers from Phase Transitions in Graphs -- Algorithmic Graph Minors and Bidimensionality -- Regular Talks -- Complexity Results for the Spanning Tree Congestion Problem -- max-cut and Containment Relations in Graphs -- The Longest Path Problem is Polynomial on Cocomparability Graphs -- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds -- On Stable Matchings and Flows -- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs -- Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time -- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching -- Efficient Algorithms for Eulerian Extension -- On the Small Cycle Transversal of Planar Graphs -- Milling a Graph with Turn Costs: A Parameterized Complexity Perspective -- Graphs that Admit Right Angle Crossing Drawings -- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs -- On the Boolean-Width of a Graph: Structure and Applications -- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs -- Colouring Vertices of Triangle-Free Graphs -- A Quartic Kernel for Pathwidth-One Vertex Deletion -- Network Exploration by Silent and Oblivious Robots -- Uniform Sampling of Digraphs with a Fixed Degree Sequence -- Measuring Indifference: Unit Interval Vertex Deletion -- Parameterized Complexity of the Arc-Preserving Subsequence Problem -- From Path Graphs to Directed Path Graphs -- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces -- Efficient Broadcasting in Random Power Law Networks -- Graphs with Large Obstacle Numbers -- The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree -- The Number of Bits Needed to Represent a Unit Disk Graph -- Lattices and Maximum Flow Algorithms in Planar Graphs. |
| Record Nr. | UNINA-9910483184303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Parameterized and Exact Computation [[electronic resource] ] : 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings / / edited by Dimitrios M. Thilikos, Gerhard J. Woeginger
| Parameterized and Exact Computation [[electronic resource] ] : 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings / / edited by Dimitrios M. Thilikos, Gerhard J. Woeginger |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (X, 275 p. 14 illus.) |
| Disciplina | 519.5/44 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Numerical Analysis Discrete Mathematics in Computer Science Data Science Mathematical Applications in Computer Science |
| ISBN | 3-642-33293-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
The Path Taken for k-Path / Andreas Björklund -- Randomized Techniques for Parameterized Algorithms / Dániel Marx -- Finding a Maximum Induced Degenerate Subgraph Faster Than 2n / Marcin Pilipczuk and Michał Pilipczuk -- The Exponential Time Hypothesis and the Parameterized Clique Problem / Yijia Chen, Kord Eickmeyer and Jörg Flum -- New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set / Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos and Mingyu Xiao -- A New Algorithm for Parameterized MAX-SAT / Ivan Bliznets and Alexander Golovnev -- Restricted and Swap Common Superstring: A Parameterized View / Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri and Italo Zoppis -- Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging / Łukasz Kowalik -- Some Definitorial Suggestions for Parameterized Proof Complexity / Jörg Flum and Moritz Müller -- An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs / Petr A. Golovach, Pinar Heggernes, Dieter Kratsch and Reza Saei -- Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? / Fedor V. Fomin, Bart M. P. Jansen and Michał Pilipczuk -- A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs / Cédric Bentz --
Instance Compression for the Polynomial Hierarchy and beyond / Chiranjit Chakraborty and Rahul Santhanam -- Polynomial Time and Parameterized Approximation Algorithms for Boxicity / Abhijin Adiga, Jasine Babu and L. Sunil Chandran -- Homomorphic Hashing for Sparse Coefficient Extraction / Petteri Kaski, Mikko Koivisto and Jesper Nederlof -- Fast Monotone Summation over Disjoint Sets / Petteri Kaski, Mikko Koivisto and Janne H. Korhonen -- Weighted Counting of k-Matchings Is #W[1]-Hard / Markus Bläser and Radu Curticapean -- Computing Directed Pathwidth in O(1.89n) Time / Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki and Toshihiro Tano -- MSOL Restricted Contractibility to Planar Graphs / James Abello, Pavel Klavík, Jan Kratochvíl and Tomáš Vyskočil -- On the Space Complexity of Parameterized Problems / Michael Elberfeld, Christoph Stockhusen and Till Tantau -- On Tractable Parameterizations of Graph Isomorphism / Adam Bouland, Anuj Dawar and Eryk Kopczyński -- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs / Sepp Hartung, Christian Komusiewicz and André Nichterlein -- Finding Dense Subgraphs of Sparse Graphs / Christian Komusiewicz and Manuel Sorge -- Enumerating Neighbour and Closest Strings / Naomi Nishimura and Narges Simjour -- An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem / Faisal N. Abu-Khzam and Mazen Bou Khuzam. |
| Record Nr. | UNISA-996466048303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||