×

Found 9 Documents (Results 1–9)

The parameterized complexity of guarding almost convex polygons. (English) Zbl 07760132

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 3, 16 p. (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Going far from degeneracy. (English) Zbl 07525484

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 47, 14 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number. (English) Zbl 1528.68311

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 35, 19 p. (2018).
MSC:  68R10 05C20 68Q27
PDFBibTeX XMLCite
Full Text: DOI

Reducing CMSO model checking to highly connected graphs. (English) Zbl 1499.68203

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 135, 14 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

Year of Publication

all top 3

Main Field