×

Found 418 Documents (Results 1–100)

100
MathJax

Twisted representations of algebra of \(q\)-difference operators, twisted \(q-W\) algebras and conformal blocks. (English) Zbl 1460.17035

MSC:  17B67 17B69 81R10
PDF BibTeX XML Cite
Full Text: DOI arXiv

Partitioning cographs into two forests and one independent set. (English) Zbl 1460.05155

Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 15-27 (2020).
MSC:  05C70 05C75 05C69
PDF BibTeX XML Cite
Full Text: DOI

Degrees and degree sequences of semigraph. (English) Zbl 1460.05036

Sampathkumar, E. (ed.), Semigraphs and their applications. With the cooperation of C. M. Deshpande, B. Y. Bam, L. Pushpalatha and V. Swaminathan. Karnataka: Academy of Discrete Mathematics and Applications. 26-45 (2019).
MSC:  05C07 05C99
PDF BibTeX XML Cite

Solving partition problems almost always requires pushing many vertices around. (English) Zbl 07378721

Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 51, 14 p. (2018).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Graph orientation with splits. (English) Zbl 1403.90627

Lee, Jon (ed.) et al., Combinatorial optimization. 5th international symposium, ISCO 2018, Marrakesh, Morocco, April 11–13, 2018. Revised selected papers. Cham: Springer (ISBN 978-3-319-96150-7/pbk; 978-3-319-96151-4/ebook). Lecture Notes in Computer Science 10856, 52-63 (2018).
MSC:  90C35 90C27
PDF BibTeX XML Cite
Full Text: DOI

Computational complexity relationship between compaction, vertex-compaction, and retraction. (English) Zbl 1410.68180

Brankovic, Ljiljana (ed.) et al., Combinatorial algorithms. 28th international workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17–21, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10765, 154-166 (2018).
MSC:  68Q25 68R10
PDF BibTeX XML Cite
Full Text: DOI

Computational complexity of graph partition under vertex-compaction to an irreflexive hexagon. (English) Zbl 1441.68197

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 69, 14 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI

Integrable probability: stochastic vertex models and symmetric functions. (English) Zbl 1397.82010

Schehr, Grégory (ed.) et al., Stochastic processes and random matrices. Lecture notes of the Les Houches summer school. Volume 104, Les Houches, France, July 6–31, 2015. Oxford: Oxford University Press (ISBN 978-0-19-879731-9/hbk). 26-131 (2017).
PDF BibTeX XML Cite
Full Text: DOI Link

On the parameterized complexity of biclique cover and partition. (English) Zbl 1398.68221

Guo, Jiong (ed.) et al., 11th international symposium on parameterized and exact computation (IPEC 2016), Aarhus, Denmark, August 24–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-023-1). LIPIcs – Leibniz International Proceedings in Informatics 63, Article 11, 13 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI

Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. (English) Zbl 1378.05099

Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 971-977 (2017).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software