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.
Approximation and oline agorithms : 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008, revised papers / / Evripidis Bampis, Martin Skutella, editors
| Approximation and oline agorithms : 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008, revised papers / / Evripidis Bampis, Martin Skutella, editors |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer-Verlag, 2009 |
| Descrizione fisica | 1 online resource (X, 293 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
SkutellaMartin
BampisEvripidis |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Approximation theory
Algorithms |
| ISBN | 3-540-93980-6 |
| Classificazione |
DAT 530f
MAT 410f MAT 652f SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | WAOA 2008 -- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees -- Size Versus Stability in the Marriage Problem -- Degree-Constrained Subgraph Problems: Hardness and Approximation Results -- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines -- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs -- Minimizing Average Flow Time on Unrelated Machines -- Cooperation in Multiorganization Matching -- Randomized Algorithms for Buffer Management with 2-Bounded Delay -- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints -- Malicious Bayesian Congestion Games -- Stackelberg Strategies and Collusion in Network Games with Splittable Flow -- Peak Shaving through Resource Buffering -- On Lagrangian Relaxation and Subset Selection Problems -- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements -- Caching Content under Digital Rights Management -- Reoptimization of Weighted Graph and Covering Problems -- Smoothing Imprecise 1.5D Terrains -- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs -- Dynamic Offline Conflict-Free Coloring for Unit Disks -- Experimental Analysis of Scheduling Algorithms for Aggregated Links -- A Approximation Algorithm for the Minimum Maximal Matching Problem -- On the Maximum Edge Coloring Problem. |
| Record Nr. | UNINA-9910484454403321 |
| Berlin ; ; Heidelberg, : Springer-Verlag, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers / / edited by Evripidis Bampis, Nicole Megow
| Approximation and Online Algorithms [[electronic resource] ] : 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers / / edited by Evripidis Bampis, Nicole Megow |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XII, 253 p. 44 illus., 25 illus. in color.) |
| Disciplina | 518 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Mathematics—Data processing
Computer engineering Computer networks Application software Computer science Computer science—Mathematics Discrete mathematics Computational Mathematics and Numerical Analysis Computer Engineering and Networks Computer and Information Systems Applications Theory of Computation Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation |
| ISBN | 3-030-39479-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph Algorithms -- Inapproximability Results -- Network Design -- Design and Analysis of Approximation and Online Algorithms -- Parameterized Complexity -- Algorithmic Game Theory -- Algorithmic trading -- Competitive analysis -- Computational Advertising -- Computational finance -- Geometric problems -- Mechanism Design. . |
| Record Nr. | UNISA-996418220903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and Online Algorithms : 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers / / edited by Evripidis Bampis, Nicole Megow
| Approximation and Online Algorithms : 17th International Workshop, WAOA 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers / / edited by Evripidis Bampis, Nicole Megow |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XII, 253 p. 44 illus., 25 illus. in color.) |
| Disciplina |
518
005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Mathematics—Data processing
Computer engineering Computer networks Application software Computer science Computer science—Mathematics Discrete mathematics Computational Mathematics and Numerical Analysis Computer Engineering and Networks Computer and Information Systems Applications Theory of Computation Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation |
| ISBN | 3-030-39479-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph Algorithms -- Inapproximability Results -- Network Design -- Design and Analysis of Approximation and Online Algorithms -- Parameterized Complexity -- Algorithmic Game Theory -- Algorithmic trading -- Competitive analysis -- Computational Advertising -- Computational finance -- Geometric problems -- Mechanism Design. . |
| Record Nr. | UNINA-9910484272503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers / / edited by Evripidis Bampis, Ola Svensson
| Approximation and Online Algorithms [[electronic resource] ] : 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers / / edited by Evripidis Bampis, Ola Svensson |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (X, 273 p. 29 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN | 3-319-18263-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Improved Approximations for the Max k-Colored Clustering Problem -- A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line -- Better Algorithms for Online Bin Stretching -- Online Colored Bin Packing -- Improved Bound for Online Square-into-Square Packing -- Improved Approximation Algorithm for Fault-Tolerant Facility Placement -- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem -- Online Multi-Coloring with Advice -- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points -- Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling -- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage -- Linear-Time Approximation Algorithms for Unit Disk Graphs -- The Minimum Feasible Tileset Problem -- Online Ad Assignment with an Ad Exchange -- Minimum Linear Arrangement of Series-Parallel Graphs -- Online Dual Edge Coloring of Paths and Trees -- Online Packet Scheduling Under Adversarial Jamming -- Generalized Hypergraph Matching via Iterated Packing and Local Ratio -- Steiner Trees with Bounded RC-Delay -- Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms -- Routing Under Uncertainty: The a priori Traveling Repairman Problem -- Primal-Dual Algorithms for Precedence Constrained Covering Problems. |
| Record Nr. | UNISA-996207293203316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and Online Algorithms : 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers / / edited by Evripidis Bampis, Ola Svensson
| Approximation and Online Algorithms : 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers / / edited by Evripidis Bampis, Ola Svensson |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (X, 273 p. 29 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN | 3-319-18263-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Improved Approximations for the Max k-Colored Clustering Problem -- A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line -- Better Algorithms for Online Bin Stretching -- Online Colored Bin Packing -- Improved Bound for Online Square-into-Square Packing -- Improved Approximation Algorithm for Fault-Tolerant Facility Placement -- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem -- Online Multi-Coloring with Advice -- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points -- Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling -- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage -- Linear-Time Approximation Algorithms for Unit Disk Graphs -- The Minimum Feasible Tileset Problem -- Online Ad Assignment with an Ad Exchange -- Minimum Linear Arrangement of Series-Parallel Graphs -- Online Dual Edge Coloring of Paths and Trees -- Online Packet Scheduling Under Adversarial Jamming -- Generalized Hypergraph Matching via Iterated Packing and Local Ratio -- Steiner Trees with Bounded RC-Delay -- Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms -- Routing Under Uncertainty: The a priori Traveling Repairman Problem -- Primal-Dual Algorithms for Precedence Constrained Covering Problems. |
| Record Nr. | UNINA-9910485140503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers / / edited by Evripidis Bampis, Klaus Jansen
| Approximation and Online Algorithms [[electronic resource] ] : 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers / / edited by Evripidis Bampis, Klaus Jansen |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (X, 255 p. 23 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer science Application software Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Programming Techniques Theory of Computation Computer and Information Systems Applications Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN |
1-280-38624-X
9786613564160 3-642-12450-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | WAOA 2009 -- On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems -- Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications -- Price Fluctuations: To Buy or to Rent -- Approximation Algorithms for Multiple Strip Packing -- Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window -- Longest Wait First for Broadcast Scheduling [Extended Abstract] -- The Routing Open Shop Problem: New Approximation Algorithms -- On the Price of Stability for Undirected Network Design -- Finding Dense Subgraphs in G(n,1/2) -- Parameterized Analysis of Paging and List Update Algorithms -- Online Scheduling of Bounded Length Jobs to Maximize Throughput -- On the Additive Constant of the k-Server Work Function Algorithm -- A (4?+??)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs -- Guard Games on Graphs: Keep the Intruder Out! -- Between a Rock and a Hard Place: The Two-to-One Assignment Problem -- Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width -- Online Minimization Knapsack Problem -- Optimization Problems in Multiple Subtree Graphs -- Multi-Criteria TSP: Min and Max Combined -- Packet Routing: Complexity and Algorithms -- Minimal Cost Reconfiguration of Data Placement in Storage Area Network -- Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing. |
| Record Nr. | UNISA-996465919903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and online algorithms : 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 : revised papers / / Evripidis Bampis, Klaus Jansen (eds.)
| Approximation and online algorithms : 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 : revised papers / / Evripidis Bampis, Klaus Jansen (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, : Springer-Verlag, 2010 |
| Descrizione fisica | 1 online resource (X, 255 p. 23 illus.) |
| Disciplina | 005.11 |
| Altri autori (Persone) |
BampisEvripidis
JansenKlaus |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Approximation algorithms
Online algorithms |
| ISBN |
1-280-38624-X
9786613564160 3-642-12450-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | WAOA 2009 -- On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems -- Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications -- Price Fluctuations: To Buy or to Rent -- Approximation Algorithms for Multiple Strip Packing -- Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window -- Longest Wait First for Broadcast Scheduling [Extended Abstract] -- The Routing Open Shop Problem: New Approximation Algorithms -- On the Price of Stability for Undirected Network Design -- Finding Dense Subgraphs in G(n,1/2) -- Parameterized Analysis of Paging and List Update Algorithms -- Online Scheduling of Bounded Length Jobs to Maximize Throughput -- On the Additive Constant of the k-Server Work Function Algorithm -- A (4?+??)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs -- Guard Games on Graphs: Keep the Intruder Out! -- Between a Rock and a Hard Place: The Two-to-One Assignment Problem -- Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width -- Online Minimization Knapsack Problem -- Optimization Problems in Multiple Subtree Graphs -- Multi-Criteria TSP: Min and Max Combined -- Packet Routing: Complexity and Algorithms -- Minimal Cost Reconfiguration of Data Placement in Storage Area Network -- Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing. |
| Record Nr. | UNINA-9910484165803321 |
| Berlin, : Springer-Verlag, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008, Revised Papers / / edited by Evripidis Bampis, Martin Skutella
| Approximation and Online Algorithms [[electronic resource] ] : 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008, Revised Papers / / edited by Evripidis Bampis, Martin Skutella |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (X, 293 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer graphics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Computer Graphics Data Science |
| ISBN | 3-540-93980-6 |
| Classificazione |
DAT 530f
MAT 410f MAT 652f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | WAOA 2008 -- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees -- Size Versus Stability in the Marriage Problem -- Degree-Constrained Subgraph Problems: Hardness and Approximation Results -- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines -- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs -- Minimizing Average Flow Time on Unrelated Machines -- Cooperation in Multiorganization Matching -- Randomized Algorithms for Buffer Management with 2-Bounded Delay -- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints -- Malicious Bayesian Congestion Games -- Stackelberg Strategies and Collusion in Network Games with Splittable Flow -- Peak Shaving through Resource Buffering -- On Lagrangian Relaxation and Subset Selection Problems -- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements -- Caching Content under Digital Rights Management -- Reoptimization of Weighted Graph and Covering Problems -- Smoothing Imprecise 1.5D Terrains -- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs -- Dynamic Offline Conflict-Free Coloring for Unit Disks -- Experimental Analysis of Scheduling Algorithms for Aggregated Links -- A Approximation Algorithm for the Minimum Maximal Matching Problem -- On the Maximum Edge Coloring Problem. |
| Record Nr. | UNISA-996466130503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Efficient Approximation and Online Algorithms [[electronic resource] ] : Recent Progress on Classical Combinatorial Optimization Problems and New Applications / / edited by Evripidis Bampis, Klaus Jansen, Claire Kenyon
| Efficient Approximation and Online Algorithms [[electronic resource] ] : Recent Progress on Classical Combinatorial Optimization Problems and New Applications / / edited by Evripidis Bampis, Klaus Jansen, Claire Kenyon |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (VII, 349 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-540-32213-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks -- On Approximation Algorithms for Data Mining Applications -- A Survey of Approximation Results for Local Search Algorithms -- Approximation Algorithms for Path Coloring in Trees -- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow -- Independence and Coloring Problems on Intersection Graphs of Disks -- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications -- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines -- Approximating a Class of Classification Problems -- List Scheduling in Order of ?-Points on a Single Machine -- Approximation Algorithms for the k-Median Problem -- The Lovász-Local-Lemma and Scheduling. |
| Record Nr. | UNISA-996466155203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Efficient approximation and online algorithms : recent progress on classical combinatorial optimization problems and new applications / / Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.)
| Efficient approximation and online algorithms : recent progress on classical combinatorial optimization problems and new applications / / Evripidis Bampis, Klaus Jansen, Claire Kenyon (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | New York, : Springer, 2006 |
| Descrizione fisica | 1 online resource (VII, 349 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
BampisEvripidis
JansenKlaus KenyonClaire |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computer algorithms
Online algorithms Combinatorial optimization - Data processing |
| ISBN | 3-540-32213-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Contributed Talks -- On Approximation Algorithms for Data Mining Applications -- A Survey of Approximation Results for Local Search Algorithms -- Approximation Algorithms for Path Coloring in Trees -- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow -- Independence and Coloring Problems on Intersection Graphs of Disks -- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications -- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines -- Approximating a Class of Classification Problems -- List Scheduling in Order of ?-Points on a Single Machine -- Approximation Algorithms for the k-Median Problem -- The Lovász-Local-Lemma and Scheduling. |
| Record Nr. | UNINA-9910484229603321 |
| New York, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
