×

Found 40 Documents (Results 1–40)

Maximizing social welfare in score-based social distance games. (English) Zbl 07810620

Verbrugge, Rineke (ed.), Proceedings of the nineteenth conference on theoretical aspects of rationality and knowledge, TARK, Oxford, United Kingdom, June 28–30, 2023. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 379, 272-286 (2023).
MSC:  03-XX 91-XX
PDFBibTeX XMLCite
Full Text: DOI arXiv

Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts. (English) Zbl 07682404

Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 98-113 (2022).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Extending nearly complete \(1\)-planar drawings in polynomial time. (English) Zbl 07559402

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 31, 16 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Parameterized algorithms for queue layouts. (English) Zbl 07436606

Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 40-54 (2020).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Measuring what matters: a hybrid approach to dynamic programming with treewidth. (English) Zbl 1517.68292

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 42, 15 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Group activity selection with few agent types. (English) Zbl 07525485

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 48, 16 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Parameterized algorithms for book embedding problems. (English) Zbl 1482.68170

Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 365-378 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On structural parameterizations of the bounded-degree vertex deletion problem. (English) Zbl 1487.68177

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 33, 14 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Small resolution proofs for QBF using dependency treewidth. (English) Zbl 1487.68135

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 28, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On structural parameterizations of the edge disjoint paths problem. (English) Zbl 1457.68215

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 36, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Towards a polynomial kernel for directed feedback vertex set. (English) Zbl 1441.68163

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 36, 15 p. (2017).
MSC:  68R10 05C85 68Q27
PDFBibTeX XMLCite
Full Text: DOI

Algorithmic applications of tree-cut width. (English) Zbl 1465.68211

Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24–28, 2015. Proceedings. Part II. Berlin: Springer. Lect. Notes Comput. Sci. 9235, 348-360 (2015).
MSC:  68R10 68Q17 68Q27
PDFBibTeX XMLCite
Full Text: DOI

Twin-cover: beyond vertex cover in parameterized algorithmics. (English) Zbl 1352.68105

Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6–8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 259-271 (2012).
MSC:  68Q25 05C70 05C85
PDFBibTeX XMLCite
Full Text: DOI

On digraph width measures in parameterized algorithmics. (English) Zbl 1273.68276

Chen, Jianer (ed.) et al., Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10–11, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-11268-3/pbk). Lecture Notes in Computer Science 5917, 185-197 (2009).
MSC:  68R10 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software