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.

Biblioteca

MARC Lista (tabellare)
SOFSEM 2025: Theory and Practice of Computer Science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part I / / edited by Rastislav Královič, Věra Kůrková
SOFSEM 2025: Theory and Practice of Computer Science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part I / / edited by Rastislav Královič, Věra Kůrková
Autore Královič Rastislav
Edizione [1st ed. 2025.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025
Descrizione fisica 1 online resource (736 pages)
Disciplina 004.0151
Altri autori (Persone) KůrkováVěra
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 9783031826702
3031826701
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited talks -- Distributed Computing by Mobile Robots: Exploring the Computational Landscape -- Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs -- Contributed Papers -- Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints -- Online b-Matching with Stochastic Rewards -- Shortest Longest-Path Graph Orientations for Trees -- Parameterized Complexity of Generalizations of Edge Dominating Set -- Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking -- On the Complexity of Minimum Membership Dominating Set -- On the Structural Parameterized Complexity of Defective Coloring -- Dynamic Range Minimum Queries on the Ultra-Wide Word RAM -- Fast Practical Compression of Deterministic Finite Automata -- Orienteering (with Time Windows) on Restricted Graph Classes -- Massively Parallel Maximum Coverage Revisited -- Distance Vector Domination -- Sufficient conditions for polynomial-time detection of induced minors -- Pathways to Tractability for Geometric Thickness -- Minimum Monotone Spanning Trees -- Symvonis and Alexander Wol Representing Hypergraphs by Point-Line Incidences -- Reachability in temporal graphs under perturbation -- On Computational Completeness of Semi-Conditional Matrix Grammars -- Outer-(ap)RAC Graphs -- Forest Covers and Bounded Forest Covers -- Multi-Agent Search-Type Problems on Polygons -- Generation of Cycle Permutation Graphs and Permutation Snarks -- Expected Density of Random Minimizers.
Record Nr. UNINA-9910983495503321
Královič Rastislav  
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
SOFSEM 2025: Theory and Practice of Computer Science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part II / / edited by Rastislav Královič, Věra Kůrková
SOFSEM 2025: Theory and Practice of Computer Science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part II / / edited by Rastislav Královič, Věra Kůrková
Autore Královič Rastislav
Edizione [1st ed. 2025.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025
Descrizione fisica 1 online resource (0 pages)
Disciplina 004.0151
Altri autori (Persone) KůrkováVěra
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 9783031826979
3031826973
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Pumping Problems for Unary Regular Languages -- The Complexity of Graph Exploration Games -- A SUBSET-SUM Characterisation of the A-Hierarchy -- On the periodic decompositions of multidimensional configurations -- Quantum Algorithm for the Multiple String Matching Problem -- Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds -- The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem -- Colorful 3-Rainbow Domination -- The Computational Complexity of Equilibria with Strategic Constraints -- Exact characterizations of non-commutative algebraic complexity without homogeneity -- Roman Hitting Set -- Visual Complexity of Point Set Mappings -- Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees -- Knowledge Neurons in the Knowledge Graph-based Link Prediction Models -- Disjoint covering of bipartite graphs with $s$-clubs -- Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets -- Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs -- DAG Scheduling in the BSP Model -- Incremental computation of the set of period sets -- Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints -- Packed Acyclic Deterministic Finite Automata -- Holey Graphs: Very Large Betti Numbers are Testable -- Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere -- Online Busy Time Scheduling with Untrusted Prediction -- Maximal $\alpha$-gapped Repeats in a Fibonacci String.
Record Nr. UNINA-9910983300903321
Královič Rastislav  
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
SOFSEM 2025: Theory and Practice of Computer Science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part I / / edited by Rastislav Královič, Věra Kůrková
SOFSEM 2025: Theory and Practice of Computer Science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part I / / edited by Rastislav Královič, Věra Kůrková
Autore Královič Rastislav
Edizione [1st ed. 2025.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025
Descrizione fisica 1 online resource (736 pages)
Disciplina 004.0151
Altri autori (Persone) KůrkováVěra
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 9783031826702
3031826701
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited talks -- Distributed Computing by Mobile Robots: Exploring the Computational Landscape -- Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs -- Contributed Papers -- Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints -- Online b-Matching with Stochastic Rewards -- Shortest Longest-Path Graph Orientations for Trees -- Parameterized Complexity of Generalizations of Edge Dominating Set -- Beyond Image-Text Matching: Verb Understanding in Multimodal Transformers Using Guided Masking -- On the Complexity of Minimum Membership Dominating Set -- On the Structural Parameterized Complexity of Defective Coloring -- Dynamic Range Minimum Queries on the Ultra-Wide Word RAM -- Fast Practical Compression of Deterministic Finite Automata -- Orienteering (with Time Windows) on Restricted Graph Classes -- Massively Parallel Maximum Coverage Revisited -- Distance Vector Domination -- Sufficient conditions for polynomial-time detection of induced minors -- Pathways to Tractability for Geometric Thickness -- Minimum Monotone Spanning Trees -- Symvonis and Alexander Wol Representing Hypergraphs by Point-Line Incidences -- Reachability in temporal graphs under perturbation -- On Computational Completeness of Semi-Conditional Matrix Grammars -- Outer-(ap)RAC Graphs -- Forest Covers and Bounded Forest Covers -- Multi-Agent Search-Type Problems on Polygons -- Generation of Cycle Permutation Graphs and Permutation Snarks -- Expected Density of Random Minimizers.
Record Nr. UNISA-996647868403316
Královič Rastislav  
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
SOFSEM 2025: Theory and Practice of Computer Science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part II / / edited by Rastislav Královič, Věra Kůrková
SOFSEM 2025: Theory and Practice of Computer Science : 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part II / / edited by Rastislav Královič, Věra Kůrková
Autore Královič Rastislav
Edizione [1st ed. 2025.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025
Descrizione fisica 1 online resource (0 pages)
Disciplina 004.0151
Altri autori (Persone) KůrkováVěra
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 9783031826979
3031826973
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Pumping Problems for Unary Regular Languages -- The Complexity of Graph Exploration Games -- A SUBSET-SUM Characterisation of the A-Hierarchy -- On the periodic decompositions of multidimensional configurations -- Quantum Algorithm for the Multiple String Matching Problem -- Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds -- The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem -- Colorful 3-Rainbow Domination -- The Computational Complexity of Equilibria with Strategic Constraints -- Exact characterizations of non-commutative algebraic complexity without homogeneity -- Roman Hitting Set -- Visual Complexity of Point Set Mappings -- Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees -- Knowledge Neurons in the Knowledge Graph-based Link Prediction Models -- Disjoint covering of bipartite graphs with $s$-clubs -- Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets -- Minimal Schnyder Woods and Long Induced Paths in 3-Connected Planar Graphs -- DAG Scheduling in the BSP Model -- Incremental computation of the set of period sets -- Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints -- Packed Acyclic Deterministic Finite Automata -- Holey Graphs: Very Large Betti Numbers are Testable -- Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere -- Online Busy Time Scheduling with Untrusted Prediction -- Maximal $\alpha$-gapped Repeats in a Fibonacci String.
Record Nr. UNISA-996647864603316
Královič Rastislav  
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui