×

Found 30 Documents (Results 1–30)

Testing small set expansion in general graphs. (English) Zbl 1355.68289

Mayr, Ernst W. (ed.) et al., 32nd international symposium on theoretical aspects of computer science, STACS’15, Garching, Germany, March 4–7, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-78-1). LIPIcs – Leibniz International Proceedings in Informatics 30, 622-635 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Improved approximation algorithms for the maximum happy vertices and edges problems. (English) Zbl 1386.68225

Xu, Dachuan (ed.) et al., Computing and combinatorics. 21st international conference, COCOON 2015, Beijing, China, August 4–6, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-21397-2/pbk; 978-3-319-21398-9/ebook). Lecture Notes in Computer Science 9198, 159-170 (2015).
PDFBibTeX XMLCite
Full Text: DOI

A roadmap for TAMC. (English) Zbl 1405.68118

Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 11th annual conference, TAMC 2014, Chennai, India, April 11–13, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-06088-0/pbk). Lecture Notes in Computer Science 8402, 1-6 (2014).
MSC:  68Q05 68-02 68-03
PDFBibTeX XMLCite
Full Text: DOI

Theory and applications of models of computation. 11th annual conference, TAMC 2014, Chennai, India, April 11–13, 2014. Proceedings. (English) Zbl 1284.68014

Lecture Notes in Computer Science 8402. Berlin: Springer (ISBN 978-3-319-06088-0/pbk). xiii, 423 p. (2014).
MSC:  68-06 68Q05 00B25
PDFBibTeX XMLCite
Full Text: DOI

Detecting and characterizing small dense bipartite-like subgraphs by the bipartiteness ratio measure. (English) Zbl 1406.68086

Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16–18, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-45029-7/pbk). Lecture Notes in Computer Science 8283, 655-665 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Theory and applications of models of computation. 9th annual conference, TAMC 2012, Beijing, China, May 16–21, 2012. Proceedings. (English) Zbl 1241.68003

Lecture Notes in Computer Science 7287. Berlin: Springer (ISBN 978-3-642-29951-3/pbk). xv, 622 p. (2012).
MSC:  68-06 68Q05 00B25
PDFBibTeX XMLCite
Full Text: DOI

Characterizations of locally testable linear- and affine-invariant families. (English) Zbl 1286.68492

Fu, Bin (ed.) et al., Computing and combinatorics. 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14–16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22684-7/pbk). Lecture Notes in Computer Science 6842, 467-478 (2011).
MSC:  68W20 94C10
PDFBibTeX XMLCite
Full Text: DOI

The complexity and approximability of minimum contamination problems. (English) Zbl 1331.68093

Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 298-307 (2011).
MSC:  68Q17 68W25 92D30
PDFBibTeX XMLCite
Full Text: DOI

Unbalanced graph partitioning. (English) Zbl 1310.68244

Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju Island, Korea, December 15–17, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-17516-9/pbk). Lecture Notes in Computer Science 6506, 218-229 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Theory and applications of models of computation. 7th annual conference, TAMC 2010, Prague, Czech Republic, June 7–11, 2010. Proceedings. (English) Zbl 1189.68012

Lecture Notes in Computer Science 6108. Berlin: Springer (ISBN 978-3-642-13561-3/pbk). xiv, 480 p. (2010).
MSC:  68-06 68Q05 00B25
PDFBibTeX XMLCite
Full Text: DOI

Separating NE from some nonuniform nondeterministic complexity classes. (English) Zbl 1248.68204

Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 486-495 (2009).
MSC:  68Q15 68Q17
PDFBibTeX XMLCite
Full Text: DOI

A theory for Valiant’s matchcircuits (Extended abstract). (English) Zbl 1259.68062

Albers, Susanne (ed.) et al., STACS 2008. 25th international symposium on theoretical aspects of computer science, Bordeaux, France, February 21–23, 2008. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-06-4). LIPIcs – Leibniz International Proceedings in Informatics 1, 491-205, electronic only (2008).
MSC:  68Q05 68Q12
PDFBibTeX XMLCite
Full Text: DOI Link

Derandomizing graph tests for homomorphism. (English) Zbl 1139.68393

Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 5th international conference, TAMC 2008, Xi’an, China, April 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79227-7/pbk). Lecture Notes in Computer Science 4978, 105-115 (2008).
MSC:  68R10 05C25 68W20
PDFBibTeX XMLCite
Full Text: DOI

Theory and applications of models of computation. 5th international conference, TAMC 2008, Xi’an, China, April 25–29, 2008. Proceedings. (English) Zbl 1136.68001

Lecture Notes in Computer Science 4978. Berlin: Springer (ISBN 978-3-540-79227-7/pbk). xii, 598 p. (2008).
MSC:  68-06 68Q05 00B25
PDFBibTeX XMLCite
Full Text: DOI

Theory and applications of models of computation. Third international conference, TAMC 2006, Beijing, China, May 15–20, 2006. Proceedings. (English) Zbl 1102.68004

Lecture Notes in Computer Science 3959. Berlin: Springer (ISBN 3-540-34021-1/pbk). xv, 794 p. (2006).
MSC:  68-06 68Q05 00B25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software