×

Found 796 Documents (Results 1–100)

Cryptographic method based on Catalan objects and enumerative chess problem. (English) Zbl 1528.68102

Singh, Rajeev (ed.) et al., Distributed denial of service attacks. Concepts, mathematical and cryptographic solutions. Berlin: De Gruyter. De Gruyter Ser. Appl. Math. Eng. Inf. Sci. 6, 51-65 (2021).
PDFBibTeX XMLCite
Full Text: DOI

New results on chromatic polynomials. (English) Zbl 1482.05166

Paikray, Susanta Kumar (ed.) et al., New trends in applied analysis and computational mathematics. Proceedings of the international conference on advances in mathematics and computing, ICAMC 2020, Odisha, India, February 7–8, 2020. Singapore: Springer. Adv. Intell. Syst. Comput. 1356, 89-98 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Enumerating all subgraphs under given constraints using zero-suppressed sentential decision diagrams. (English) Zbl 1515.68251

Faro, Simone (ed.) et al., 18th international symposium on experimental algorithms, SEA 2020, Catania, Italy, June 16–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 160, Article 9, 14 p. (2020).
PDFBibTeX XMLCite
Full Text: DOI

Continued classification of 3D lattice models in the positive octant. (English. French summary) Zbl 1440.05017

Proceedings of the 28th international conference on formal power series and algebraic combinatorics, FPSAC 2016, Vancouver, Canada, July 4–8, 2016. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Math. Theor. Comput. Sci., Proc., 95-106 (2020).
MSC:  05A15 05-08 60G50
PDFBibTeX XMLCite
Full Text: arXiv Link

Faster subgraph counting in sparse graphs. (English) Zbl 1515.68229

Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 6, 15 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Counting induced subgraphs: an algebraic approach to #W[1]-hardness. (English) Zbl 1518.68260

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 26, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Improved distributed expander decomposition and nearly optimal triangle enumeration. (English) Zbl 1464.68439

Nowak, Thomas (ed.), Proceedings of the 38th ACM symposium on principles of distributed computing, PODC ’19, Toronto, ON, Canada, July 29 – August 2, 2019. New York, NY: Association for Computing Machinery (ACM). 66-73 (2019).
MSC:  68W15 68R10 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Enumerating connected induced subgraphs: improved delay and experimental comparison. (English) Zbl 1445.68168

Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 272-284 (2019).
PDFBibTeX XMLCite
Full Text: DOI

Dualization in lattices given by implicational bases. (English) Zbl 1435.68115

Cristea, Diana (ed.) et al., Formal concept analysis. 15th international conference, ICFCA 2019, Frankfurt, Germany, June 25–28, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11511, 89-98 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

New polynomial delay bounds for maximal subgraph enumeration by proximity search. (English) Zbl 1433.68288

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 1179-1190 (2019).
PDFBibTeX XMLCite
Full Text: DOI Link

The number of minimum \(k\)-cuts: improving the Karger-Stein bound. (English) Zbl 1437.05222

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 229-240 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Explicit formulas for enumeration of lattice paths: basketball and the kernel method. (English) Zbl 1422.05007

Andrews, George E. (ed.) et al., Lattice path combinatorics and applications. Based on the 8th international conference on lattice path combinatorics and applications, California State Polytechnic University, Pomona (Cal Poly Pomona), CA, USA, August 17–20, 2015. Cham: Springer. Dev. Math. 58, 78-118 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the enumeration of bicriteria temporal paths. (English) Zbl 1527.68166

Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 15th annual conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11436, 518-535 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficiently enumerating hitting sets of hypergraphs arising in data profiling. (English) Zbl 1430.68178

Kobourov, Stephen (ed.) et al., Proceedings of the 21st workshop on algorithm engineering and experiments, ALENEX ’19, San Diego, CA, USA, January 7–8, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 130-143 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software