SOFSEM 2023 : theory 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 / Leszek Gąsieniec (ed.).

This 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 pa...

Full description

Saved in:
Bibliographic Details
Corporate Author: SOFSEM (Conference) Nový Smokovec, Slovakia)
Other Authors: Gąsieniec, Leszek (Editor)
Format: Ebook
Language:English
Published: Cham : Springer, [2023]
Series:Lecture notes in computer science ; 13878.
Lecture notes in computer science. Advanced research in computing and software science.
Subjects:
Online Access:Springer eBooks

MARC

LEADER 00000czm a2200000 i 4500
005 20230412155843.0
006 m o d
007 cr cnu000|uu||
008 230101s2023 sz a o 101 0 eng d
011 |a Z3950 Search: @or @attr 1=7 "9783031231001" @attr 1=7 "9783031231018" 
011 |a Z3950 Record: 0 of 8 
020 |a 3031231007  |q Internet 
020 |a 9783031231001  |q Internet 
020 |a 3031231015  |q Internet 
020 |a 9783031231018  |q Internet 
035 |a (OCoLC)1355865778 
035 |a (EDS)EDS102108972 
040 |a YDX  |b eng  |e rda  |c YDX  |d GW5XE  |d EBLCP  |d OCLCQ  |d Z5A 
050 4 |a QA75.5 
082 0 4 |a 004 
099 |a 004 SOF 
111 2 |a SOFSEM (Conference)  |n (48th :  |d 2023 :  |c Nový Smokovec, Slovakia) 
245 1 0 |a SOFSEM 2023 :  |b theory 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 /  |c Leszek Gąsieniec (ed.). 
246 3 |a SOFSEM twenty twenty three 
264 1 |a Cham :  |b Springer,  |c [2023] 
264 4 |c ©2023 
300 |a 1 online resource (xi, 402 pages) :  |b illustrations (chiefly colour). 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Lecture notes in computer science. Advanced research in computing and software science ;  |v 13878 
500 |a Selected conference papers. 
500 |a Includes author index. 
505 0 |a Intro -- 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 -- 
505 8 |a 6 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 -- 
505 8 |a Dominance 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 -- 
505 8 |a 2 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 -- 
505 8 |a 3.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. 
520 |a This 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. . 
588 0 |a Online resource; title from PDF title page (SpringerLink, viewed January 5, 2023). 
650 0 |a Computer science  |v Congresses.  |9 557580 
655 7 |a Conference papers and proceedings.  |2 lcgft  |9 370308 
700 1 |a Gąsieniec, Leszek,  |e editor.  |9 1115077 
776 0 8 |c Original  |z 3031231007  |z 9783031231001  |w (OCoLC)1351464188 
776 1 8 |w (OCoLC)1356008143 
830 0 |a Lecture notes in computer science ;  |v 13878.  |9 291610 
830 0 |a Lecture notes in computer science.  |p Advanced research in computing and software science.  |9 291613 
856 4 0 |u https://ezproxy.aut.ac.nz/login?url=https://link.springer.com/10.1007/978-3-031-23101-8  |z Springer eBooks  |x TEMPORARY ERM URL 
942 |c EB  |n 0 
999 |c 1793431  |d 1793431 
Availability
Requests
Request this item Request this AUT item so you can pick it up when you're at the library.
Interlibrary Loan With Interlibrary Loan you can request the item from another library. It's a free service.