001439836 000__ 04960cam\a2200649\i\4500
001439836 001__ 1439836
001439836 003__ OCoLC
001439836 005__ 20230309004524.0
001439836 006__ m\\\\\o\\d\\\\\\\\
001439836 007__ cr\un\nnnunnun
001439836 008__ 210923s2021\\\\sz\a\\\\o\\\\\101\0\eng\d
001439836 020__ $$a9783030868383$$q(electronic bk.)
001439836 020__ $$a3030868389$$q(electronic bk.)
001439836 020__ $$z9783030868376
001439836 020__ $$z3030868370
001439836 0247_ $$a10.1007/978-3-030-86838-3$$2doi
001439836 035__ $$aSP(OCoLC)1268984006
001439836 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dOCLCO$$dEBLCP$$dOCLCF$$dOCLCO$$dOCLCQ$$dCOM$$dOCLCO$$dSFB$$dOCLCQ
001439836 049__ $$aISEA
001439836 050_4 $$aQA166$$b.I58 2021
001439836 08204 $$a004.01/51$$223
001439836 1112_ $$aInternational Workshop WG$$n(47th :$$d2021 :$$cOnline)
001439836 24510 $$aGraph-theoretic concepts in computer science :$$b47th international workshop, WG 2021, Warsaw, Poland, June 23-25, 2021 : revised selected papers /$$cŁukasz Kowalik, Michał Pilipczuk, Paweł Rzążewski (eds.).
001439836 24630 $$aWG 2021
001439836 264_1 $$aCham :$$bSpringer,$$c[2021]
001439836 264_4 $$c©2021
001439836 300__ $$a1 online resource :$$billustrations (some color)
001439836 336__ $$atext$$btxt$$2rdacontent
001439836 337__ $$acomputer$$bc$$2rdamedia
001439836 338__ $$aonline resource$$bcr$$2rdacarrier
001439836 4901_ $$aLecture notes in computer science ;$$v12911
001439836 4901_ $$aLNCS sublibrary: SL1 - Theoretical computer science and general issues
001439836 500__ $$aInternational conference proceedings.
001439836 500__ $$aIncludes author index.
001439836 5050_ $$aPreprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set -- Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation -- Block Elimination Distance -- On Fair Covering and Hitting Problems -- On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem -- FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More -- Disjoint Stable Matchings in Linear Time -- Complementation in T-perfect Graphs -- On subgraph complementation to H-free graphs -- Odd Cycle Transversal in Mixed Graphs -- Preventing Small $(s, t)$-Cuts by Protecting Edges -- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel -- A heuristic approach to the treedepth decomposition problem for large graphs -- The Perfect Matching Cut Problem Revisited -- The Complexity of Gerrymandering Over Graphs: Paths and Trees -- Feedback Vertex Set on Hamiltonian Graphs -- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality -- The Dynamic Complexity of Acyclic Hypergraph Homomorphisms -- Linearizable special cases of the quadratic shortest path problem -- A Linear-time Parameterized Algorithm for Computing the Width of a DAG -- On Morphing 1-Planar Drawings -- Bears with Hats and Independence Polynomials -- The Largest Connected Subgraph Game -- Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries -- Beyond Helly graphs: the diameter problem on absolute retracts -- Acyclic, Star, and Injective Colouring: Bounding the Diameter -- The Graphs of Stably Matchable Pairs -- On additive spanners in weighted graphs with local error -- Labeling Schemes for Deterministic Radio Multi-Broadcast -- On 3-Coloring of (2P_4, C_5)-Free Graphs.
001439836 506__ $$aAccess limited to authorized users.
001439836 520__ $$aThis book constitutes the proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science which was held during June 23-25, 2021. The conference was planned to take place in Warsaw, Poland, but changed to an online event due to the COVID-19 pandemic. The 30 full papers included in this volume were carefully reviewed and selected from 73 submissions. The conference aims to merge theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science or by extracting new graph-theoretic problems from applications.
001439836 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed September 24, 2021).
001439836 650_0 $$aGraph theory$$xData processing$$vCongresses.
001439836 650_0 $$aComputer science$$xMathematics$$vCongresses.
001439836 650_6 $$aInformatique$$xMathématiques$$vCongrès.
001439836 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001439836 655_7 $$aConference papers and proceedings.$$2lcgft
001439836 655_7 $$aActes de congrès.$$2rvmgf
001439836 655_7 $$aCongressos.$$2thub
001439836 655_0 $$aElectronic books.
001439836 7001_ $$aKowalik, Łukasz,$$eeditor.
001439836 7001_ $$aPilipczuk, Michał,$$eeditor.
001439836 7001_ $$aRz̨ȧzewski, Paweł,$$eeditor.
001439836 830_0 $$aLecture notes in computer science ;$$v12911.
001439836 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
001439836 852__ $$bebk
001439836 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-86838-3$$zOnline Access$$91397441.1
001439836 909CO $$ooai:library.usi.edu:1439836$$pGLOBAL_SET
001439836 980__ $$aBIB
001439836 980__ $$aEBOOK
001439836 982__ $$aEbook
001439836 983__ $$aOnline
001439836 994__ $$a92$$bISE