×

Found 14 Documents (Results 1–14)

Integer programming in parameterized complexity: three miniatures. (English) Zbl 1520.68049

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 21, 16 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Evaluating and tuning \(n\)-fold integer programming. (English) Zbl 1496.90036

D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 103, Article 10, 14 p. (2018).
MSC:  90C10 68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Combinatorial \(n\)-fold integer programming and applications. (English) Zbl 1442.90129

Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 54, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Voting and bribing in single-exponential time. (English) Zbl 1402.68098

Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 46, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity. (English) Zbl 1484.68072

Bodlaender, Hans L. (ed.) et al., Graph-theoretic concepts in computer science. 43rd international workshop, WG 2017, Eindhoven, The Netherlands, June 21–23, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10520, 344-357 (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems (extended abstract). (English) Zbl 1476.68207

Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 67-78 (2016).
MSC:  68R10 05C78 68Q27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Database

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software