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.
Bioinformatics Research and Application [[electronic resource] ] : 7th International Symposium, ISBRA 2011, Changsha, China, May 27-29, 2011, Proceedings / / edited by Jianer Chen, Jianxin Wang, Alexander Zelikovsky
| Bioinformatics Research and Application [[electronic resource] ] : 7th International Symposium, ISBRA 2011, Changsha, China, May 27-29, 2011, Proceedings / / edited by Jianer Chen, Jianxin Wang, Alexander Zelikovsky |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XIV, 454 p. 131 illus., 62 illus. in color.) |
| Disciplina | 570.285 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Bioinformatics
Data mining Application software Algorithms Pattern recognition Bioinformatics Computational biology Computational Biology/Bioinformatics Data Mining and Knowledge Discovery Information Systems Applications (incl. Internet) Algorithm Analysis and Problem Complexity Pattern Recognition Computer Appl. in Life Sciences |
| ISBN | 3-642-21260-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465438703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics [[electronic resource] ] : 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings / / edited by Yixin Cao, Jianer Chen
| Computing and Combinatorics [[electronic resource] ] : 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings / / edited by Yixin Cao, Jianer Chen |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XXI, 693 p. 138 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Social sciences—Data processing Application software Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Application in Social and Behavioral Sciences Computer and Information Systems Applications |
| ISBN | 3-319-62389-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms and Data Structures. - Complexity Theory and Computability. -Algorithmic Game Theory -- Computational Learning Theory -- Cryptography -- Computational Biology -- Computational Geometry and Number Theory -- Graph Theory -- Parallel and Distributed Computing. |
| Record Nr. | UNISA-996466296403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and Combinatorics : 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings / / edited by Yixin Cao, Jianer Chen
| Computing and Combinatorics : 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings / / edited by Yixin Cao, Jianer Chen |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XXI, 693 p. 138 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Social sciences—Data processing Application software Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Application in Social and Behavioral Sciences Computer and Information Systems Applications |
| ISBN | 3-319-62389-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms and Data Structures. - Complexity Theory and Computability. -Algorithmic Game Theory -- Computational Learning Theory -- Cryptography -- Computational Biology -- Computational Geometry and Number Theory -- Graph Theory -- Parallel and Distributed Computing. |
| Record Nr. | UNINA-9910484018103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers in Algorithmics [[electronic resource] ] : 12th International Workshop, FAW 2018, Guangzhou, China, May 8–10, 2018, Proceedings / / edited by Jianer Chen, Pinyan Lu
| Frontiers in Algorithmics [[electronic resource] ] : 12th International Workshop, FAW 2018, Guangzhou, China, May 8–10, 2018, Proceedings / / edited by Jianer Chen, Pinyan Lu |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 316 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence Theory of Computation Data Science Discrete Mathematics in Computer Science Numerical Analysis Artificial Intelligence |
| ISBN | 3-319-78455-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph algorithms -- Parameterized algorithms -- Other algorighms. |
| Record Nr. | UNISA-996466228403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers in Algorithmics : 12th International Workshop, FAW 2018, Guangzhou, China, May 8–10, 2018, Proceedings / / edited by Jianer Chen, Pinyan Lu
| Frontiers in Algorithmics : 12th International Workshop, FAW 2018, Guangzhou, China, May 8–10, 2018, Proceedings / / edited by Jianer Chen, Pinyan Lu |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 316 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence Theory of Computation Data Science Discrete Mathematics in Computer Science Numerical Analysis Artificial Intelligence |
| ISBN | 3-319-78455-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph algorithms -- Parameterized algorithms -- Other algorighms. |
| Record Nr. | UNINA-9910349424303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers in Algorithmics [[electronic resource] ] : 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014, Proceedings / / edited by Jianer Chen, John E. Hopcroft, Jianxin Wang
| Frontiers in Algorithmics [[electronic resource] ] : 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014, Proceedings / / edited by Jianer Chen, John E. Hopcroft, Jianxin Wang |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVIII, 344 p. 107 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Discrete Mathematics in Computer Science |
| ISBN | 3-319-08016-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Research on algorithms -- Discrete structures -- Operations research -- Combinatorial optimization.- Applications. |
| Record Nr. | UNISA-996217777503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers in Algorithmics : 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014, Proceedings / / edited by Jianer Chen, John E. Hopcroft, Jianxin Wang
| Frontiers in Algorithmics : 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014, Proceedings / / edited by Jianer Chen, John E. Hopcroft, Jianxin Wang |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVIII, 344 p. 107 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Discrete Mathematics in Computer Science |
| ISBN | 3-319-08016-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Research on algorithms -- Discrete structures -- Operations research -- Combinatorial optimization.- Applications. |
| Record Nr. | UNINA-9910483147303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Parameterized and Exact Computation [[electronic resource] ] : 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers / / edited by Jianer Chen, Fedor V. Fomin
| Parameterized and Exact Computation [[electronic resource] ] : 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers / / edited by Jianer Chen, Fedor V. Fomin |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (X, 335 p. 26 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Discrete mathematics Computer science—Mathematics Algorithms Programming Techniques Discrete Mathematics Mathematics of Computing Discrete Mathematics in Computer Science |
| ISBN | 3-642-11269-2 |
| Classificazione |
004
DAT 517f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Balanced Hashing, Color Coding and Approximate Counting -- Kernelization: New Upper and Lower Bound Techniques -- A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams -- Planar Capacitated Dominating Set Is W[1]-Hard -- Boolean-Width of Graphs -- The Complexity of Satisfiability of Small Depth Circuits -- On Finding Directed Trees with Many Leaves -- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms -- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover -- What Makes Equitable Connected Partition Easy -- Improved Induced Matchings in Sparse Graphs -- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs -- An Exact Algorithm for the Maximum Leaf Spanning Tree Problem -- An Exponential Time 2-Approximation Algorithm for Bandwidth -- On Digraph Width Measures in Parameterized Algorithmics -- The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension -- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms -- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs -- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds -- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor -- Partitioning into Sets of Bounded Cardinality -- Two Edge Modification Problems without Polynomial Kernels -- On the Directed Degree-Preserving Spanning Tree Problem -- Even Faster Algorithm for Set Splitting! -- Stable Assignment with Couples: Parameterized Complexity and Local Search -- Improved Parameterized Algorithms for the Kemeny Aggregation Problem -- Computing Pathwidth Faster Than 2 n . |
| Record Nr. | UNISA-996465916303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parameterized and Exact Computation [[electronic resource] ] : 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers / / edited by Jianer Chen, Fedor V. Fomin
| Parameterized and Exact Computation [[electronic resource] ] : 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers / / edited by Jianer Chen, Fedor V. Fomin |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (X, 335 p. 26 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Discrete mathematics Computer science—Mathematics Algorithms Programming Techniques Discrete Mathematics Mathematics of Computing Discrete Mathematics in Computer Science |
| ISBN | 3-642-11269-2 |
| Classificazione |
004
DAT 517f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Balanced Hashing, Color Coding and Approximate Counting -- Kernelization: New Upper and Lower Bound Techniques -- A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams -- Planar Capacitated Dominating Set Is W[1]-Hard -- Boolean-Width of Graphs -- The Complexity of Satisfiability of Small Depth Circuits -- On Finding Directed Trees with Many Leaves -- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms -- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover -- What Makes Equitable Connected Partition Easy -- Improved Induced Matchings in Sparse Graphs -- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs -- An Exact Algorithm for the Maximum Leaf Spanning Tree Problem -- An Exponential Time 2-Approximation Algorithm for Bandwidth -- On Digraph Width Measures in Parameterized Algorithmics -- The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension -- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms -- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs -- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds -- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor -- Partitioning into Sets of Bounded Cardinality -- Two Edge Modification Problems without Polynomial Kernels -- On the Directed Degree-Preserving Spanning Tree Problem -- Even Faster Algorithm for Set Splitting! -- Stable Assignment with Couples: Parameterized Complexity and Local Search -- Improved Parameterized Algorithms for the Kemeny Aggregation Problem -- Computing Pathwidth Faster Than 2 n . |
| Record Nr. | UNINA-9910484324703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings / / edited by Jianer Chen, Qilong Feng, Jinhui Xu
| Theory and Applications of Models of Computation [[electronic resource] ] : 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings / / edited by Jianer Chen, Qilong Feng, Jinhui Xu |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XI, 454 p. 240 illus., 33 illus. in color.) |
| Disciplina | 004.0151 |
| 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 |
| ISBN | 3-030-59267-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Semilattices of punctual numberings -- Partial Sums on the Ultra-Wide Word RAM -- Securely Computing the $n$-Variable Equality Function with $2n$ Cards 24 -- Polynomial Kernels for Paw-free Edge Modi cation Problems -- Floorplans with Walls -- A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-Cover Problem -- Sumcheck-Based Delegation of Quantum Computing to Rational Server -- Online Removable Knapsack Problems for Integer-Sized Items -- An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem -- LP-based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors -- A Constant Factor Approximation for Lower-Bounded $k$-Median -- Reverse Mathematics, Projective Modules and Invertible Modules -- Two-Stage Submodular Maximization Problem Beyond Non-Negative and Monotone -- Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications -- On the complexity of acyclic modules in automata networks.-Eternal Connected Vertex Cover Problem -- Parametric Streaming Two-Stage Submodular Maximization -- Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint -- A Novel Initialization Algorithm for Fuzzy C-means Problems -- On the Parameterized Complexity of $d$-Restricted Boolean Net Synthesis -- Approximate #Knapsack Computations to Count Semi-Fair Allocations -- Characterizations and approximability of hard counting classes below #P -- On Existence of Equilibrium Under Social Coalition Structures -- Space Complexity of Streaming Algorithms on Universal Quantum Computers -- On Coresets for Support Vector Machines -- Tractabilities for Tree Assembly Problems -- On Characterization of Petrie Partitionable Plane Graphs -- Disjunctive Propositional Logic and Scott Domains -- Dispersing and Grouping Points on Segments in the Plane -- Synchronizing Words and Monoid Factorization: A Parameterized Perspective -- Hidden Community Detection on Two-layer Stochastic Models: a Theoretical Perspective -- A Primal-Dual Algorithm for Euclidean $k$-Means problem with Penalties -- The Complexity of the Partition Coloring Problem -- FPT Algorithms for Generalized Feedback Vertex Set Problems -- Fixed-order Book Thickness with Respect to Vertex-cover Number: New Observations and Further Analysis -- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles -- On Pure Space vs Catalytic Space. |
| Record Nr. | UNISA-996418311503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
