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 for Sensor Systems [[electronic resource] ] : 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers / / edited by Marek Chrobak, Antonio Fernández Anta, Leszek Gąsieniec, Ralf Klasing
| Algorithms for Sensor Systems [[electronic resource] ] : 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers / / edited by Marek Chrobak, Antonio Fernández Anta, Leszek Gąsieniec, Ralf Klasing |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XI, 141 p. 15 illus.) |
| Disciplina | 004.6 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Algorithms
Computers Computer communication systems Computer science—Mathematics Artificial intelligence Data structures (Computer science) Algorithm Analysis and Problem Complexity Computation by Abstract Devices Computer Communication Networks Mathematics of Computing Artificial Intelligence Data Structures |
| ISBN | 3-319-53058-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multi-Message Broadcast in Dynamic Radio Networks -- Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC 16 -- Vertex Coloring with Communication and Local Memory Constraints in Synchronous Broadcast Networks -- A New Kind of Selectors, and Their Applications to Conflict Resolution in Wireless Multi-channels Networks -- The Impact of the Gabriel Sub-graph of the Visibility Graph on the Gathering of Mobile Autonomous Robots -- Search-and-Fetch with One Robot on a Disk -- A 2-Approximation Algorithm for Barrier Coverage by Weighted Non-uniform Sensors on a Line -- Flexible Cell Selection in Cellular Networks -- The Euclidean k-Supplier Problem in IR2. |
| Record Nr. | UNISA-996465751803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms for Sensor Systems : 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers / / edited by Marek Chrobak, Antonio Fernández Anta, Leszek Gąsieniec, Ralf Klasing
| Algorithms for Sensor Systems : 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers / / edited by Marek Chrobak, Antonio Fernández Anta, Leszek Gąsieniec, Ralf Klasing |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XI, 141 p. 15 illus.) |
| Disciplina | 004.6 |
| Collana | Computer Communication Networks and Telecommunications |
| Soggetto topico |
Algorithms
Computers Computer communication systems Computer science—Mathematics Artificial intelligence Data structures (Computer science) Algorithm Analysis and Problem Complexity Computation by Abstract Devices Computer Communication Networks Mathematics of Computing Artificial Intelligence Data Structures |
| ISBN | 3-319-53058-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multi-Message Broadcast in Dynamic Radio Networks -- Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC 16 -- Vertex Coloring with Communication and Local Memory Constraints in Synchronous Broadcast Networks -- A New Kind of Selectors, and Their Applications to Conflict Resolution in Wireless Multi-channels Networks -- The Impact of the Gabriel Sub-graph of the Visibility Graph on the Gathering of Mobile Autonomous Robots -- Search-and-Fetch with One Robot on a Disk -- A 2-Approximation Algorithm for Barrier Coverage by Weighted Non-uniform Sensors on a Line -- Flexible Cell Selection in Cellular Networks -- The Euclidean k-Supplier Problem in IR2. |
| Record Nr. | UNINA-9910484952103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Algorithms [[electronic resource] ] : 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings / / edited by Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik
| Combinatorial Algorithms [[electronic resource] ] : 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings / / edited by Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (438 pages) : illustrations |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Artificial intelligence—Data processing Application software Computer networks Computer graphics Algorithms Discrete Mathematics in Computer Science Data Science Computer and Information Systems Applications Computer Communication Networks Computer Graphics |
| ISBN | 3-030-48966-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Coordinating swarms of objects at extreme dimensions -- A family of tree-based generators for bubbles in directed graphs -- The micro-world of cographs -- Parameterized Complexity of (A,`)-Path Packing -- On Proper Labellings of Graphs with Minimum Label Sum -- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework -- On the Complexity of Stackelberg Matroid Pricing Problems -- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten -- Edge-Disjoint Branchings in Temporal Graphs -- Optimal In-place Algorithms for Basic Graph Problems -- Further Results on Online Node- and Edge-Deletion Problems with Advice -- Fair packing of independent sets -- Polynomial Time Algorithms for Tracking Path Problems -- The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride -- Iterated Type Partitions -- Two Robots Patrolling on a Line: Integer Version and Approximability -- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges -- On the Complexity of Singly Connected Vertex Deletion -- Equitable d-degenerate choosability of graphs -- On the complexity of Broadcast Domination and Multipacking in digraphs -- A Parameterized Perspective on Attacking and Defending Elections -- Skyline Computation with Noisy Comparisons -- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings -- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions -- The Steiner problem for count matroids -- Bounded Degree Group Steiner problems -- Between proper and strong edge-colorings of subcubic graphs -- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination -- Algorithms for Constructing Anonymizing Arrays -- Parameterized algorithms for partial vertex covers in bipartite graphs -- Acyclic Matching in Some Subclasses of Graphs. |
| Record Nr. | UNISA-996418315703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Algorithms : 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings / / edited by Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik
| Combinatorial Algorithms : 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings / / edited by Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (438 pages) : illustrations |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Artificial intelligence—Data processing Application software Computer networks Computer graphics Algorithms Discrete Mathematics in Computer Science Data Science Computer and Information Systems Applications Computer Communication Networks Computer Graphics |
| ISBN | 3-030-48966-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Coordinating swarms of objects at extreme dimensions -- A family of tree-based generators for bubbles in directed graphs -- The micro-world of cographs -- Parameterized Complexity of (A,`)-Path Packing -- On Proper Labellings of Graphs with Minimum Label Sum -- Decremental Optimization of Dominating Sets Under the Reconfiguration Framework -- On the Complexity of Stackelberg Matroid Pricing Problems -- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten -- Edge-Disjoint Branchings in Temporal Graphs -- Optimal In-place Algorithms for Basic Graph Problems -- Further Results on Online Node- and Edge-Deletion Problems with Advice -- Fair packing of independent sets -- Polynomial Time Algorithms for Tracking Path Problems -- The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride -- Iterated Type Partitions -- Two Robots Patrolling on a Line: Integer Version and Approximability -- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges -- On the Complexity of Singly Connected Vertex Deletion -- Equitable d-degenerate choosability of graphs -- On the complexity of Broadcast Domination and Multipacking in digraphs -- A Parameterized Perspective on Attacking and Defending Elections -- Skyline Computation with Noisy Comparisons -- Strongly Stable and Maximum Weakly Stable Noncrossing Matchings -- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions -- The Steiner problem for count matroids -- Bounded Degree Group Steiner problems -- Between proper and strong edge-colorings of subcubic graphs -- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination -- Algorithms for Constructing Anonymizing Arrays -- Parameterized algorithms for partial vertex covers in bipartite graphs -- Acyclic Matching in Some Subclasses of Graphs. |
| Record Nr. | UNINA-9910409665103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Fundamentals of Computation Theory [[electronic resource] ] : 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013, Proceedings / / edited by Leszek Gąsieniec, Frank Wolter
| Fundamentals of Computation Theory [[electronic resource] ] : 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013, Proceedings / / edited by Leszek Gąsieniec, Frank Wolter |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 318 p. 45 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science—Mathematics Discrete mathematics Theory of Computation Discrete Mathematics in Computer Science |
| ISBN | 3-642-40164-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466033203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Fundamentals of Computation Theory : 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013, Proceedings / / edited by Leszek Gąsieniec, Frank Wolter
| Fundamentals of Computation Theory : 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013, Proceedings / / edited by Leszek Gąsieniec, Frank Wolter |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 318 p. 45 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer science—Mathematics Discrete mathematics Theory of Computation Discrete Mathematics in Computer Science |
| ISBN | 3-642-40164-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910483727603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||