001453632 000__ 06009cam\a2200625\i\4500
001453632 001__ 1453632
001453632 003__ OCoLC
001453632 005__ 20230314003437.0
001453632 006__ m\\\\\o\\d\\\\\\\\
001453632 007__ cr\cn\nnnunnun
001453632 008__ 230101s2023\\\\sz\a\\\\o\\\\\101\0\eng\d
001453632 019__ $$a1356008143
001453632 020__ $$a9783031231018$$q(electronic bk.)
001453632 020__ $$a3031231015$$q(electronic bk.)
001453632 020__ $$z9783031231001
001453632 020__ $$z3031231007
001453632 0247_ $$a10.1007/978-3-031-23101-8$$2doi
001453632 035__ $$aSP(OCoLC)1355865778
001453632 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dEBLCP$$dOCLCQ$$dUKAHL
001453632 049__ $$aISEA
001453632 050_4 $$aQA75.5
001453632 08204 $$a004$$223/eng/20230105
001453632 1112_ $$aSOFSEM (Conference)$$n(48th :$$d2023 :$$cNový Smokovec, Slovakia)
001453632 24510 $$aSOFSEM 2023 :$$btheory and practice of computer science : 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-19, 2023, proceedings /$$cLeszek Gąsieniec (ed.).
001453632 264_1 $$aCham :$$bSpringer,$$c[2023]
001453632 264_4 $$c©2023
001453632 300__ $$a1 online resource (xi, 402 pages) :$$billustrations (chiefly color).
001453632 336__ $$atext$$btxt$$2rdacontent
001453632 337__ $$acomputer$$bc$$2rdamedia
001453632 338__ $$aonline resource$$bcr$$2rdacarrier
001453632 4901_ $$aLecture notes in computer science. Advanced research in computing and software science ;$$v13878
001453632 500__ $$aSelected conference papers.
001453632 500__ $$aIncludes author index.
001453632 5050_ $$aIntro -- Preface -- Organization -- Contents -- Graphs Problems and Optimisation -- The Complexity of Finding Tangles -- 1 Introduction -- 2 Exact Algorithms -- 3 Complexity -- 4 Counterexample to Conjecture 1 -- References -- A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs -- 1 Introduction -- 1.1 Previous Work on Maximum Cliques in Random Intersection Graphs -- 2 Our Contribution -- 3 Definitions, Notation and Useful Results -- 3.1 Range of Values for m,n,p -- 4 The Spectral Algorithm -- 4.1 Running Time of Our Algorithm -- 5 Experimental Evaluation
001453632 5058_ $$a6 Conclusions -- 7 Appendix -- 7.1 Greedy-Clique Algorithm -- 7.2 Mono-Clique Algorithm -- 7.3 Maximum-Clique Algorithm -- References -- Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 Max-Bisection: From O(2t n3) to O(2tn2) -- 5 Our Framework -- 6 Conclusion -- References -- More Effort Towards Multiagent Knapsack -- 1 Introduction -- 2 Hardness of Median-UK -- 3 Algorithms for Special Cases -- 3.1 When = 1: Diverse Knapsack -- 4 Conclusion -- References -- Graph Drawing and Visualization
001453632 5058_ $$aDominance Drawings for DAGs with Bounded Modular Width -- 1 Introduction -- 2 Preliminaries -- 3 The Compaction Lemma -- 4 Minimizing the Number of Fips -- 5 Minimizing the Number of Dimensions -- 6 Concluding Remarks -- References -- Morphing Planar Graph Drawings Through 3D -- 1 Introduction -- 2 An Upper Bound -- 2.1 3D Morph Operations -- 2.2 3D Morphs for Biconnected Planar Graphs -- 2.3 3D Morphs for General Planar Graphs -- 3 Discussion: Lower Bounds -- 4 Open Problems -- References -- Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees -- 1 Introduction
001453632 5058_ $$a2 Drawing Style -- 3 NP-Hardness -- 4 Planar Instances -- 5 Algorithms -- References -- Parameterized Approaches to Orthogonal Compaction -- 1 Introduction -- 2 Basic Definitions -- 3 Number of Kitty Corners: An FPT Algorithm -- 4 A Polynomial Kernel for Cycle Graphs -- 5 Maximum Face Degree: Parameterized Hardness -- 6 Height of the Representation: An XP Algorithm -- 7 Open Problems -- References -- NP-Hardness and Fixed Parameter Tractability -- Hardness of Bounding Influence via Graph Modification -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 3.1 Graph Theoretic Terminology
001453632 5058_ $$a3.2 Centrality Measures -- 4 Bounding the Influence of Vertex Centrality Scores -- References -- Heuristics for Opinion Diffusion via Local Elections -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Work -- 2 Formal Model -- 2.1 Opinion Graphs -- 2.2 Campaigning and Bribery -- 2.3 Diffusion Processes via Local Elections -- 2.4 Election Results via Global Voting Rules -- 2.5 Optimization Goals -- 3 Computing Optimal Bribery Schemes -- 3.1 Heuristic Methods -- 4 Simulations -- 4.1 Experimental Design -- 4.2 Results -- 5 Outlook -- References
001453632 506__ $$aAccess limited to authorized users.
001453632 520__ $$aThis book constitutes the conference proceedings of the 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, held in Novy Smokovec, Slovakia, during January 1518, 2023. The 22 full papers presented together with 2 best papers and 2 best students papers in this book were carefully reviewed and selected from 43 submissions. This workshop focuses on graphs problems and optimization; graph drawing and visualization; NP-hardness and fixed parameter tractability; communication and temporal graphs; complexity and learning; and robots and strings. .
001453632 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed January 5, 2023).
001453632 650_0 $$aComputer science$$vCongresses.
001453632 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001453632 655_7 $$aConference papers and proceedings.$$2lcgft
001453632 655_0 $$aElectronic books.
001453632 7001_ $$aGąsieniec, Leszek,$$eeditor.$$1https://isni.org/isni/0000000379023143
001453632 77608 $$iPrint version: $$z3031231007$$z9783031231001$$w(OCoLC)1351464188
001453632 830_0 $$aLecture notes in computer science ;$$v13878.
001453632 830_0 $$aLecture notes in computer science.$$pAdvanced research in computing and software science.
001453632 852__ $$bebk
001453632 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-23101-8$$zOnline Access$$91397441.1
001453632 909CO $$ooai:library.usi.edu:1453632$$pGLOBAL_SET
001453632 980__ $$aBIB
001453632 980__ $$aEBOOK
001453632 982__ $$aEbook
001453632 983__ $$aOnline
001453632 994__ $$a92$$bISE