×

Found 9 Documents (Results 1–9)

Parameterized complexity of sparse linear complementarity problems. (English) Zbl 1378.68095

Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 355-364 (2015).
MSC:  68Q25 68W05 90C33
PDFBibTeX XMLCite
Full Text: DOI

Sparse linear complementarity problems. (English) Zbl 1382.68125

Spirakis, Paul G. (ed.) et al., Algorithms and complexity. 8th international conference, CIAC 2013, Barcelona, Spain, May 22–24, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38232-1/pbk). Lecture Notes in Computer Science 7878, 358-369 (2013).
MSC:  68Q25 68Q17 90C33
PDFBibTeX XMLCite
Full Text: DOI

Computing knapsack solutions with cardinality robustness. (English) Zbl 1350.68150

Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5–8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 693-702 (2011).
MSC:  68Q25 68Q17 90C27
PDFBibTeX XMLCite
Full Text: DOI

Robust independence systems. (English) Zbl 1333.05304

Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 367-378 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software