h1

001018371 001__ 1018371
001018371 005__ 20250919063617.0
001018371 0247_ $$2ISBN$$a978-3-031-82696-2
001018371 0247_ $$2ISBN$$a978-3-031-82696-2; 978-3-031-82697-9
001018371 0247_ $$2ISBN$$a978-3-031-82697-9
001018371 0247_ $$2ISSN$$a0302-9743
001018371 0247_ $$2ISSN$$a1611-3349
001018371 0247_ $$2SCOPUS$$aSCOPUS:2-s2.0-86000445299
001018371 0247_ $$2WOS$$aWOS:001534173900004
001018371 0247_ $$2doi$$a10.1007/978-3-031-82697-9_2
001018371 037__ $$aRWTH-CONV-254850
001018371 041__ $$aEnglish
001018371 1001_ $$0P:(DE-82)IDM00584$$aFuchs, Janosch$$b0$$urwth
001018371 1112_ $$a50. International Conference on Current Trends in Theory and Practice of Computer Science$$cBratislava$$d2025-01-20 - 2025-01-23$$gSOFSEM 2025$$wSlovakia
001018371 245__ $$aThe Complexity of Graph Exploration Games$$honline, print
001018371 260__ $$bSpringer$$c2025
001018371 29510 $$aSOFSEM 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 / Rastislav Královič ·Věra Kůrková Editors
001018371 300__ $$a17-30
001018371 3367_ $$033$$2EndNote$$aConference Paper
001018371 3367_ $$0PUB:(DE-HGF)7$$2PUB:(DE-HGF)$$aContribution to a book
001018371 3367_ $$0PUB:(DE-HGF)8$$2PUB:(DE-HGF)$$aContribution to a conference proceedings$$bcontrib$$mcontrib$$s123456789_1111
001018371 3367_ $$2BibTeX$$aINPROCEEDINGS
001018371 3367_ $$2DRIVER$$aconferenceObject
001018371 3367_ $$2DataCite$$aOutput Types/Conference Paper
001018371 3367_ $$2ORCID$$aCONFERENCE_PAPER
001018371 4900_ $$aLecture Notes in Computer Science$$v15539
001018371 536__ $$0G:(GEPRIS)282652900$$aGRK 2236 - GRK 2236: Unsicherheit und Randomisierung in Algorithmen, Verifikation und Logik. (282652900)$$c282652900$$x0
001018371 591__ $$aGermany
001018371 7001_ $$0P:(DE-82)IDM05251$$aGrüne, Christoph Manfred$$b1$$eCorresponding author$$urwth
001018371 7001_ $$0P:(DE-82)IDM06613$$aJanßen, Tom Nicolas Oltmann$$b2$$urwth
001018371 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM00584$$aRWTH Aachen$$b0$$kRWTH
001018371 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM05251$$aRWTH Aachen$$b1$$kRWTH
001018371 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM06613$$aRWTH Aachen$$b2$$kRWTH
001018371 9141_ $$y2025
001018371 9151_ $$0StatID:(DE-HGF)0031$$2StatID$$aPeer reviewed article$$x0
001018371 9201_ $$0I:(DE-82)121110_20140620$$k121110$$lLehrstuhl für Algorithmen und Komplexität (Informatik 1)$$x0
001018371 9201_ $$0I:(DE-82)120000_20140620$$k120000$$lFachgruppe Informatik$$x1
001018371 9201_ $$0I:(DE-82)022000_20140101$$k022000$$lIT Center$$x2
001018371 9201_ $$0I:(DE-82)080060_20170720$$k080060$$lGraduiertenkolleg UnRAVeL$$x3
001018371 961__ $$c2025-09-15T14:33:14.127$$x2025-09-15T14:33:14.127$$z2025-09-15T14:33:14.127
001018371 970__ $$aDBLP:conf/sofsem/FuchsGJ25-RWTHp
001018371 980__ $$aI:(DE-82)022000_20140101
001018371 980__ $$aI:(DE-82)080060_20170720
001018371 980__ $$aI:(DE-82)120000_20140620
001018371 980__ $$aI:(DE-82)121110_20140620
001018371 980__ $$aUNRESTRICTED
001018371 980__ $$aVDBINPRINT
001018371 980__ $$acontb
001018371 980__ $$acontrib