000914797 000__ 04125cam\a2200517Ii\4500
000914797 001__ 914797
000914797 005__ 20230306150543.0
000914797 006__ m\\\\\o\\d\\\\\\\\
000914797 007__ cr\cn\nnnunnun
000914797 008__ 190925s2019\\\\sz\a\\\\o\\\\\101\0\eng\d
000914797 020__ $$a9783030307868$$q(electronic book)
000914797 020__ $$a3030307867$$q(electronic book)
000914797 020__ $$z9783030307851
000914797 0247_ $$a10.1007/978-3-030-30786-8$$2doi
000914797 035__ $$aSP(OCoLC)on1120874862
000914797 035__ $$aSP(OCoLC)1120874862
000914797 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDX$$dUKMGB$$dEBLCP
000914797 049__ $$aISEA
000914797 050_4 $$aQA166
000914797 08204 $$a004.01/51$$223
000914797 1112_ $$aInternational Workshop WG$$n(45th :$$d2019 :$$cNuria Valley, Spain)
000914797 24510 $$aGraph-theoretic concepts in computer science :$$b45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers /$$cIgnasi Sau, Dimitrios M. Thilikos (eds.).
000914797 2463_ $$aWG 2019
000914797 264_1 $$aCham, Switzerland :$$bSpringer,$$c2019.
000914797 300__ $$a1 online resource (xxi, 394 pages) :$$billustrations.
000914797 336__ $$atext$$btxt$$2rdacontent
000914797 337__ $$acomputer$$bc$$2rdamedia
000914797 338__ $$aonline resource$$bcr$$2rdacarrier
000914797 4901_ $$aLecture notes in computer science;$$v11789
000914797 4901_ $$aAdvanced research in computing and software science
000914797 4901_ $$aLNCS sublibrary. SL 1, Theoretical computer science and general issues
000914797 500__ $$aIncludes author index.
000914797 5050_ $$aLogic and Random Graphs.- Unavoidability and universality of digraphs.- Parameterized algorithms for geometric graphs via decomposition theorems.- Subexponential algorithms for variants of homomorphism problem in string graphs.- The 4-Steiner Root Problem.- Hamiltonicity below Dirac's condition.- Maximum Independent Sets in Subcubic Graphs: New Results.- Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs.- Local approximation of the Maximum Cut in regular graphs.- Fixed-parameter tractability of counting small minimum (S,T)-cuts.- Fast Breadth-First Search in Still Less Space.- A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion.- Flip distances between graph orientations.- Graph functionality.- On Happy Colorings, Cuts, and Structural Parameterizations.- Shortest Reconfiguration of Matchings.- Travelling on Graphs with Small Highway Dimension.- The Power of Cut-Based Parameters for Computing Edge Disjoint Paths.- Geometric Representations of Dichotomous Ordinal Data.- Linear MIM-width of Trees.- Approximating Minimum Dominating Set on String graphs.- Classified Rank-Maximal Matchings and Popular Matchings -- Algorithms and Hardness.- Maximum Matchings and Minimum Blocking Sets in Theta-6 Graphs.- A polynomial-time algorithm for the independent set problem in $\{P-#x10;,C-4,C-6\}$-free graphs.- Independent Set Reconfiguration Parameterized by Modular-Width.- Counting independent sets in graphs with bounded bipartite pathwidth.- Intersection Graphs of Non-Crossing Paths.- Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs.- Color Refinement, Homomorphisms, and Hypergraphs.- 3-colorable planar graphs have an intersection segment representation using 3 slopes.- The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms.- Minimal separators in graph classes defined by small forbidden induced subgraphs.
000914797 506__ $$aAccess limited to authorized users.
000914797 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed September 25, 2019).
000914797 650_0 $$aGraph theory$$xData processing$$vCongresses.
000914797 650_0 $$aComputer science$$xMathematics$$vCongresses.
000914797 7001_ $$aSau, Ignasi,$$eeditor.
000914797 7001_ $$aThilikos, Dimitrios M.,$$eeditor.
000914797 830_0 $$aLecture notes in computer science ;$$v11789.
000914797 830_0 $$aLecture notes in computer science.$$pAdvanced research in computing and software science.
000914797 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
000914797 852__ $$bebk
000914797 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-030-30786-8$$zOnline Access$$91397441.1
000914797 909CO $$ooai:library.usi.edu:914797$$pGLOBAL_SET
000914797 980__ $$aEBOOK
000914797 980__ $$aBIB
000914797 982__ $$aEbook
000914797 983__ $$aOnline
000914797 994__ $$a92$$bISE