top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Combinatorial Algorithms [[electronic resource] ] : 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. Revised Selected Papers / / edited by Thierry Lecroq, Laurent Mouchard
Combinatorial Algorithms [[electronic resource] ] : 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. Revised Selected Papers / / edited by Thierry Lecroq, Laurent Mouchard
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XXII, 474 p. 135 illus.)
Disciplina 511.6
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Algorithms
Machine theory
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Discrete Mathematics
Formal Languages and Automata Theory
Data Science
Symbolic and Algebraic Manipulation
ISBN 3-642-45278-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms on graphs -- Algorithms on strings -- Discrete geometry -- Satisfiability.
Record Nr. UNISA-996465340603316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Combinatorial Algorithms [[electronic resource] ] : 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. Revised Selected Papers / / edited by Thierry Lecroq, Laurent Mouchard
Combinatorial Algorithms [[electronic resource] ] : 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. Revised Selected Papers / / edited by Thierry Lecroq, Laurent Mouchard
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XXII, 474 p. 135 illus.)
Disciplina 511.6
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Algorithms
Machine theory
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Discrete Mathematics
Formal Languages and Automata Theory
Data Science
Symbolic and Algebraic Manipulation
ISBN 3-642-45278-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms on graphs -- Algorithms on strings -- Discrete geometry -- Satisfiability.
Record Nr. UNINA-9910484440603321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Combinatorial Algorithms [[electronic resource] ] : 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers / / edited by W. F. Symth, Subramanian Arumugam
Combinatorial Algorithms [[electronic resource] ] : 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers / / edited by W. F. Symth, Subramanian Arumugam
Edizione [1st ed. 2012.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
Descrizione fisica 1 online resource (XII, 303 p. 136 illus.)
Disciplina 511/.6
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Environmental management
Algorithms
Machine theory
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Environmental Management
Formal Languages and Automata Theory
Data Science
Symbolic and Algebraic Manipulation
ISBN 3-642-35926-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Bounds on Quasi-Completeness -- Infinite Random Geometric Graphs from the Hexagonal Metric -- Saving on Phases: Parameterized Approximation for Total Vertex Cover -- On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths -- Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction -- On Some Properties of Doughnut Graphs (Extended Abstract) -- On the Steiner Radial Number of Graphs -- Further Results on the Mycielskian of Graphs -- Approaches and Mathematical Models for Robust Solutions to Optimization Problems with Stochastic Problem Data Instances -- Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter -- Acyclic Coloring with Few Division Vertices -- Degree Associated Edge Reconstruction Number -- Touring Polygons: An Approximation Algorithm -- Super Connectivity of the Generalized Mycielskian of Graphs -- A Graph Radio k-Coloring Algorithm -- Maximum Order of a Planar Oclique Is 15 -- Sufficient Condition for {C4, C2t} - Decomposition of K2m,2n – An Improved Bound -- Incomparability Graphs of Lattices II -- On Antimagic Labeling of Odd Regular Graphs -- A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations -- Deterministic Fuzzy Automata on Fuzzy Regular ω-Languages -- Border Array for Structural Strings -- Computing the Partial Word Avoidability Indices of Ternary Patterns -- Computing a Longest Common Palindromic Subsequence -- Multiset, Set and Numerically Decipherable Codes over Directed Figures -- A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching -- A Catalogue of Algorithms for Building Weak Heaps -- On Counting Range Maxima Points in Plane -- Indexing Highly Repetitive Collections -- Range Extremum Queries -- Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations -- GRP CH Heuristic for Generating Random Simple Polygon.
Record Nr. UNISA-996465973803316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Combinatorial Algorithms [[electronic resource] ] : 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers / / edited by Costas S. Iliopoulos, William F. Smyth
Combinatorial Algorithms [[electronic resource] ] : 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers / / edited by Costas S. Iliopoulos, William F. Smyth
Edizione [1st ed. 2011.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011
Descrizione fisica 1 online resource (XI, 418 p.)
Disciplina 004.0151
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Algorithms
Artificial intelligence—Data processing
Coding theory
Information theory
Discrete Mathematics in Computer Science
Symbolic and Algebraic Manipulation
Data Science
Coding and Information Theory
ISBN 3-642-19222-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996465922103316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Combinatorial Algorithms [[electronic resource] ] : 22th International Workshop, IWOCA 2011, Victoria, Canada, July 20-22, 2011, Revised Selected Papers / / edited by Costas S. Iliopoulos, William F. Smyth
Combinatorial Algorithms [[electronic resource] ] : 22th International Workshop, IWOCA 2011, Victoria, Canada, July 20-22, 2011, Revised Selected Papers / / edited by Costas S. Iliopoulos, William F. Smyth
Edizione [1st ed. 2011.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011
Descrizione fisica 1 online resource (XI, 387 p.)
Disciplina 511.6
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Algorithms
Machine theory
Artificial intelligence—Data processing
Discrete Mathematics in Computer Science
Formal Languages and Automata Theory
Data Science
Symbolic and Algebraic Manipulation
ISBN 3-642-25011-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996465937903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Combinatorial Geometry and Graph Theory [[electronic resource] ] : Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers / / edited by Jin Akiyama, Edy Tri Baskoro, Mikio Kano
Combinatorial Geometry and Graph Theory [[electronic resource] ] : Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers / / edited by Jin Akiyama, Edy Tri Baskoro, Mikio Kano
Edizione [1st ed. 2005.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Descrizione fisica 1 online resource (VIII, 227 p.)
Disciplina 516/.13
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer graphics
Computer science—Mathematics
Discrete mathematics
Algorithms
Artificial intelligence—Data processing
Computer Graphics
Discrete Mathematics in Computer Science
Data Science
ISBN 3-540-30540-8
3-540-24401-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Convex Developments of a Doubly-Covered Square -- Flat 2-Foldings of Convex Polygons -- Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph -- Foldings of Regular Polygons to Convex Polyhedra I: Equilateral Triangles -- Maximum Induced Matchings of Random Regular Graphs -- Antimagic Valuations for the Special Class of Plane Graphs -- A General Framework for Coloring Problems: Old Results, New Results, and Open Problems -- Crossing Numbers and Skewness of Some Generalized Petersen Graphs -- Some Conditions for the Existence of (d,k)-Digraphs -- Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs -- On a Triangle with the Maximum Area in a Planar Point Set -- A Balanced Interval of Two Sets of Points on a Line -- Spanning Trees of Multicoloured Point Sets with Few Intersections -- Regular Factors Containing a Given Hamiltonian Cycle -- Disjoint Edges in Topological Graphs -- The Decycling Number of Cubic Graphs -- Equal Area Polygons in Convex Bodies -- Maximum Order of Planar Digraphs -- (a,d)-Edge-Antimagic Total Labelings of Caterpillars -- An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels -- Constructions for Nonhamiltonian Burkard-Hammer Graphs -- A Characterization of Polygonal Regions Searchable from the Boundary -- ?-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One.
Record Nr. UNISA-996466020703316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Combinatorial Geometry and Graph Theory [[electronic resource] ] : Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers / / edited by Jin Akiyama, Edy Tri Baskoro, Mikio Kano
Combinatorial Geometry and Graph Theory [[electronic resource] ] : Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers / / edited by Jin Akiyama, Edy Tri Baskoro, Mikio Kano
Edizione [1st ed. 2005.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Descrizione fisica 1 online resource (VIII, 227 p.)
Disciplina 516/.13
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer graphics
Computer science—Mathematics
Discrete mathematics
Algorithms
Artificial intelligence—Data processing
Computer Graphics
Discrete Mathematics in Computer Science
Data Science
ISBN 3-540-30540-8
3-540-24401-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Convex Developments of a Doubly-Covered Square -- Flat 2-Foldings of Convex Polygons -- Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph -- Foldings of Regular Polygons to Convex Polyhedra I: Equilateral Triangles -- Maximum Induced Matchings of Random Regular Graphs -- Antimagic Valuations for the Special Class of Plane Graphs -- A General Framework for Coloring Problems: Old Results, New Results, and Open Problems -- Crossing Numbers and Skewness of Some Generalized Petersen Graphs -- Some Conditions for the Existence of (d,k)-Digraphs -- Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs -- On a Triangle with the Maximum Area in a Planar Point Set -- A Balanced Interval of Two Sets of Points on a Line -- Spanning Trees of Multicoloured Point Sets with Few Intersections -- Regular Factors Containing a Given Hamiltonian Cycle -- Disjoint Edges in Topological Graphs -- The Decycling Number of Cubic Graphs -- Equal Area Polygons in Convex Bodies -- Maximum Order of Planar Digraphs -- (a,d)-Edge-Antimagic Total Labelings of Caterpillars -- An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels -- Constructions for Nonhamiltonian Burkard-Hammer Graphs -- A Characterization of Polygonal Regions Searchable from the Boundary -- ?-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One.
Record Nr. UNINA-9910483030203321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Combinatorial Optimization [[electronic resource] ] : 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers / / edited by Mourad Baïou, Bernard Gendron, Oktay Günlük, A. Ridha Mahjoub
Combinatorial Optimization [[electronic resource] ] : 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers / / edited by Mourad Baïou, Bernard Gendron, Oktay Günlük, A. Ridha Mahjoub
Edizione [1st ed. 2020.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Descrizione fisica 1 online resource (XI, 298 p. 111 illus., 8 illus. in color.)
Disciplina 519.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Algorithms
Artificial intelligence—Data processing
Numerical analysis
Artificial intelligence
Discrete Mathematics in Computer Science
Data Science
Numerical Analysis
Artificial Intelligence
ISBN 3-030-53262-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Polyhedral Combinatorics -- Integer Programming -- Scheduling -- Matching -- Network Design -- Heuristics.
Record Nr. UNISA-996418306803316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Combinatorial Optimization [[electronic resource] ] : 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers / / edited by Mourad Baïou, Bernard Gendron, Oktay Günlük, A. Ridha Mahjoub
Combinatorial Optimization [[electronic resource] ] : 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers / / edited by Mourad Baïou, Bernard Gendron, Oktay Günlük, A. Ridha Mahjoub
Edizione [1st ed. 2020.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Descrizione fisica 1 online resource (XI, 298 p. 111 illus., 8 illus. in color.)
Disciplina 519.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Algorithms
Artificial intelligence—Data processing
Numerical analysis
Artificial intelligence
Discrete Mathematics in Computer Science
Data Science
Numerical Analysis
Artificial Intelligence
ISBN 3-030-53262-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Polyhedral Combinatorics -- Integer Programming -- Scheduling -- Matching -- Network Design -- Heuristics.
Record Nr. UNINA-9910413440003321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Combinatorial Optimization [[electronic resource] ] : 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers / / edited by Jon Lee, Giovanni Rinaldi, A. Ridha Mahjoub
Combinatorial Optimization [[electronic resource] ] : 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018, Revised Selected Papers / / edited by Jon Lee, Giovanni Rinaldi, A. Ridha Mahjoub
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (XXI, 430 p. 66 illus.)
Disciplina 519.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Discrete mathematics
Numerical analysis
Algorithms
Artificial intelligence—Data processing
Artificial intelligence
Computer networks
Discrete Mathematics in Computer Science
Numerical Analysis
Data Science
Artificial Intelligence
Computer Communication Networks
ISBN 3-319-96151-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Combinatorial Optimization -- Algorithms and Complexity -- Mathematical programming -- Operations research -- Stochastic optimization -- Multi-objective optimization -- Graphs -- Combinatorics.
Record Nr. UNISA-996466423703316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui