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.
SOFSEM 2024: Theory and Practice of Computer Science [[electronic resource] ] : 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19–23, 2024, Proceedings / / edited by Henning Fernau, Serge Gaspers, Ralf Klasing
| SOFSEM 2024: Theory and Practice of Computer Science [[electronic resource] ] : 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19–23, 2024, Proceedings / / edited by Henning Fernau, Serge Gaspers, Ralf Klasing |
| Autore | Fernau Henning |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (513 pages) |
| Disciplina | 004 |
| Altri autori (Persone) |
GaspersSerge
KlasingRalf |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Computer science - Mathematics Discrete mathematics Artificial intelligence Computer networks Theory of Computation Mathematics of Computing Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Artificial Intelligence Computer Communication Networks |
| ISBN | 3-031-52113-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Information Extraction Framework of Document Spanners - A Very Informal Survey -- Generalized Distance Polymatrix Games -- Relaxed agreement forests -- On the Computational Complexity of Generalized Common Shape Puzzles -- Fractional Bamboo Trimming and Distributed Windows Scheduling -- New support size bounds and proximity bounds for integer linear programming -- On the Parameterized Complexity of Minus Domination -- Exact and Parameterized Algorithms for Choosability -- Parameterized Algorithms for Covering by Arithmetic Progressions -- Row-column combination of Dyck words -- Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures -- On the parameterized complexity of the Perfect Phylogeny problem -- Data reduction for directed feedback vertex set on graphs without long induced cycles -- Visualization of Bipartite Graphs in Limited Window Size -- Outerplanar and Forest Storyplans -- The Complexity of Cluster Vertex Splitting and Company -- Morphing Graph Drawings in the Presence of Point Obstacles -- Word-Representable Graphs from a Word’s Perspective -- Removable Online Knapsack with Bounded Size Items -- The Complexity of Online Graph Games -- Faster Winner Determination Algorithms for (Colored) Arc Kayles -- Automata Classes Accepting Languages Whose Commutative Closure is Regular -- Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching -- Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages -- Apportionment with Thresholds: Strategic Campaigns Are Easy in the Top-Choice But Hard in the Second-Chance Mode -- Local Certification of Majority Dynamics -- Complexity of Spherical Equations in Finite Groups -- Positive Characteristic Sets for Relational Pattern Languages -- Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs -- The Weighted HOM-Problem over Fields -- Combinatorics of block-parallel automata networks -- On the piecewise complexity of words and periodic words -- Distance Labeling for Families of Cycles -- On the induced problem for fixed-template CSPs. |
| Record Nr. | UNISA-996587862603316 |
Fernau Henning
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
SOFSEM 2024: Theory and Practice of Computer Science : 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19–23, 2024, Proceedings / / edited by Henning Fernau, Serge Gaspers, Ralf Klasing
| SOFSEM 2024: Theory and Practice of Computer Science : 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19–23, 2024, Proceedings / / edited by Henning Fernau, Serge Gaspers, Ralf Klasing |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (513 pages) |
| Disciplina | 929.605 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Computer science - Mathematics Discrete mathematics Artificial intelligence Computer networks Theory of Computation Mathematics of Computing Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Artificial Intelligence Computer Communication Networks |
| ISBN | 3-031-52113-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Information Extraction Framework of Document Spanners - A Very Informal Survey -- Generalized Distance Polymatrix Games -- Relaxed agreement forests -- On the Computational Complexity of Generalized Common Shape Puzzles -- Fractional Bamboo Trimming and Distributed Windows Scheduling -- New support size bounds and proximity bounds for integer linear programming -- On the Parameterized Complexity of Minus Domination -- Exact and Parameterized Algorithms for Choosability -- Parameterized Algorithms for Covering by Arithmetic Progressions -- Row-column combination of Dyck words -- Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures -- On the parameterized complexity of the Perfect Phylogeny problem -- Data reduction for directed feedback vertex set on graphs without long induced cycles -- Visualization of Bipartite Graphs in Limited Window Size -- Outerplanar and Forest Storyplans -- The Complexity of Cluster Vertex Splitting and Company -- Morphing Graph Drawings in the Presence of Point Obstacles -- Word-Representable Graphs from a Word’s Perspective -- Removable Online Knapsack with Bounded Size Items -- The Complexity of Online Graph Games -- Faster Winner Determination Algorithms for (Colored) Arc Kayles -- Automata Classes Accepting Languages Whose Commutative Closure is Regular -- Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching -- Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages -- Apportionment with Thresholds: Strategic Campaigns Are Easy in the Top-Choice But Hard in the Second-Chance Mode -- Local Certification of Majority Dynamics -- Complexity of Spherical Equations in Finite Groups -- Positive Characteristic Sets for Relational Pattern Languages -- Algorithms and Turing Kernels for Detecting andCounting Small Patterns in Unit Disk Graphs -- The Weighted HOM-Problem over Fields -- Combinatorics of block-parallel automata networks -- On the piecewise complexity of words and periodic words -- Distance Labeling for Families of Cycles -- On the induced problem for fixed-template CSPs. |
| Record Nr. | UNINA-9910835057103321 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Satisfiability Testing – SAT 2017 [[electronic resource] ] : 20th International Conference, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings / / edited by Serge Gaspers, Toby Walsh
| Theory and Applications of Satisfiability Testing – SAT 2017 [[electronic resource] ] : 20th International Conference, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings / / edited by Serge Gaspers, Toby Walsh |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIII, 476 p. 68 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence Software engineering Operating systems (Computers) Computer engineering Computer networks Numerical analysis Theory of Computation Artificial Intelligence Software Engineering Operating Systems Computer Engineering and Networks Numerical Analysis |
| ISBN | 3-319-66263-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466152603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Satisfiability Testing – SAT 2017 : 20th International Conference, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings / / edited by Serge Gaspers, Toby Walsh
| Theory and Applications of Satisfiability Testing – SAT 2017 : 20th International Conference, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings / / edited by Serge Gaspers, Toby Walsh |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIII, 476 p. 68 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence Software engineering Operating systems (Computers) Computer engineering Computer networks Numerical analysis Theory of Computation Artificial Intelligence Software Engineering Operating Systems Computer Engineering and Networks Numerical Analysis |
| ISBN | 3-319-66263-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910484945803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||