Bonnet, Édouard; Foucaud, Florent; Lehtilä, Tuomo; Parreau, Aline Neighbourhood complexity of graphs of bounded twin-width. (English) Zbl 1525.05179 Eur. J. Comb. 115, Article ID 103772, 8 p. (2024). MSC: 05C85 05C48 05C30 05C69 68R10 PDFBibTeX XMLCite \textit{É. Bonnet} et al., Eur. J. Comb. 115, Article ID 103772, 8 p. (2024; Zbl 1525.05179) Full Text: DOI arXiv
Nakano, Shin-Ichi Family trees for enumeration. (English) Zbl 1526.05068 Int. J. Found. Comput. Sci. 34, No. 7, 715-736 (2023). MSC: 05C30 05C85 05C10 05C35 68R10 68W05 PDFBibTeX XMLCite \textit{S.-I. Nakano}, Int. J. Found. Comput. Sci. 34, No. 7, 715--736 (2023; Zbl 1526.05068) Full Text: DOI
Jenssen, Matthew; Perkins, Will; Potukuchi, Aditya Approximately counting independent sets in bipartite graphs via graph containers. (English) Zbl 1522.05210 Random Struct. Algorithms 63, No. 1, 215-241 (2023). MSC: 05C30 05C69 68R10 PDFBibTeX XMLCite \textit{M. Jenssen} et al., Random Struct. Algorithms 63, No. 1, 215--241 (2023; Zbl 1522.05210) Full Text: DOI arXiv
Luo, Zuwen; Xu, Kexiang Extremal problems for connected set enumeration. (English) Zbl 1521.05071 Discrete Appl. Math. 340, 41-52 (2023). MSC: 05C30 05C35 05C10 05C40 68R10 PDFBibTeX XMLCite \textit{Z. Luo} and \textit{K. Xu}, Discrete Appl. Math. 340, 41--52 (2023; Zbl 1521.05071) Full Text: DOI
Lichev, Lyuben; Mitsche, Dieter On the minimum bisection of random 3-regular graphs. (English) Zbl 1517.05160 Electron. J. Comb. 30, No. 2, Research Paper P2.40, 58 p. (2023). MSC: 05C80 68R10 05D40 05C30 05C35 PDFBibTeX XMLCite \textit{L. Lichev} and \textit{D. Mitsche}, Electron. J. Comb. 30, No. 2, Research Paper P2.40, 58 p. (2023; Zbl 1517.05160) Full Text: DOI arXiv
Wang, Xiang Reconstruction of permutations distorted by single Kendall \(\tau\)-errors. (English) Zbl 1518.94025 Cryptogr. Commun. 15, No. 1, 131-144 (2023). MSC: 94A15 68P30 68R10 05A15 94B35 PDFBibTeX XMLCite \textit{X. Wang}, Cryptogr. Commun. 15, No. 1, 131--144 (2023; Zbl 1518.94025) Full Text: DOI
Haraguchi, Kazuya; Nagamochi, Hiroshi Polynomial-delay enumeration algorithms in set systems. (English) Zbl 1512.68180 Theor. Comput. Sci. 963, Article ID 113963, 10 p. (2023). MSC: 68R05 68W40 PDFBibTeX XMLCite \textit{K. Haraguchi} and \textit{H. Nagamochi}, Theor. Comput. Sci. 963, Article ID 113963, 10 p. (2023; Zbl 1512.68180) Full Text: DOI arXiv
Fusy, Éric; Narmanli, Erkan; Schaeffer, Gilles Enumeration of corner polyhedra and 3-connected Schnyder labelings. (English) Zbl 1517.51011 Electron. J. Comb. 30, No. 2, Research Paper P2.17, 33 p. (2023). MSC: 51M20 05A15 05A16 68U05 PDFBibTeX XMLCite \textit{É. Fusy} et al., Electron. J. Comb. 30, No. 2, Research Paper P2.17, 33 p. (2023; Zbl 1517.51011) Full Text: DOI arXiv
Singhal, Mihir Unimodality of a refinement of Lassalle’s sequence. (English) Zbl 1514.05008 Discrete Math. 346, No. 7, Article ID 113317, 7 p. (2023). MSC: 05A05 05A15 68R10 PDFBibTeX XMLCite \textit{M. Singhal}, Discrete Math. 346, No. 7, Article ID 113317, 7 p. (2023; Zbl 1514.05008) Full Text: DOI arXiv
Baril, Jean-Luc; Kirgizov, Sergey; Maréchal, Rémi; Vajnovszki, Vincent Enumeration of Dyck paths with air pockets. (English) Zbl 1509.05017 J. Integer Seq. 26, No. 3, Article 23.3.2, 23 p. (2023). MSC: 05A15 05A16 05A19 68R05 PDFBibTeX XMLCite \textit{J.-L. Baril} et al., J. Integer Seq. 26, No. 3, Article 23.3.2, 23 p. (2023; Zbl 1509.05017) Full Text: arXiv Link
Patel, Viresh; Regts, Guus Approximate counting using Taylor’s theorem: a survey. (English) Zbl 1512.68245 Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 138, 50-70 (2022). MSC: 68R10 05C30 05C31 05C85 PDFBibTeX XMLCite \textit{V. Patel} and \textit{G. Regts}, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 138, 50--70 (2022; Zbl 1512.68245) Full Text: arXiv Link
Fusy, Éric; Narmanli, Erkan; Schaeffer, Gilles Enumeration of corner polyhedra and 3-connected Schnyder labelings. (English) Zbl 1515.52007 Sémin. Lothar. Comb. 86B, Article 75, 12 p. (2022). MSC: 52B05 05C10 05A15 68U05 PDFBibTeX XMLCite \textit{É. Fusy} et al., Sémin. Lothar. Comb. 86B, Article 75, 12 p. (2022; Zbl 1515.52007) Full Text: Link
Bendkowski, Maciej; Bodini, Olivier; Dovgal, Sergey Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers. (English) Zbl 1512.68178 Comb. Probab. Comput. 31, No. 5, 765-811 (2022). MSC: 68R05 05A15 68Q87 90C25 PDFBibTeX XMLCite \textit{M. Bendkowski} et al., Comb. Probab. Comput. 31, No. 5, 765--811 (2022; Zbl 1512.68178) Full Text: DOI arXiv
Kauers, Manuel; Koutschan, Christoph; Spahn, George How does the gerrymander sequence continue? (English) Zbl 1506.05013 J. Integer Seq. 25, No. 9, Article 22.9.7, 13 p. (2022). MSC: 05A15 05B50 68W30 33F10 PDFBibTeX XMLCite \textit{M. Kauers} et al., J. Integer Seq. 25, No. 9, Article 22.9.7, 13 p. (2022; Zbl 1506.05013) Full Text: arXiv Link
Claesson, Anders From Hertzsprung’s problem to pattern-rewriting systems. (English) Zbl 1504.05008 Algebr. Comb. 5, No. 6, 1257-1277 (2022). MSC: 05A05 05A15 68R05 68R15 68Q42 PDFBibTeX XMLCite \textit{A. Claesson}, Algebr. Comb. 5, No. 6, 1257--1277 (2022; Zbl 1504.05008) Full Text: DOI arXiv
Yamaguchi, Junpei; Shimizu, Toshiya; Furukawa, Kazuyoshi; Ohori, Ryuichi; Shimoyama, Takeshi; Mandal, Avradip; Montgomery, Hart; Roy, Arnab; Ohwa, Takuya Annealing-based algorithm for solving CVP and SVP. (English) Zbl 1507.90195 J. Oper. Res. Soc. Japan 65, No. 3, 121-137 (2022). MSC: 90C59 90C29 PDFBibTeX XMLCite \textit{J. Yamaguchi} et al., J. Oper. Res. Soc. Japan 65, No. 3, 121--137 (2022; Zbl 1507.90195)
Conte, Alessio; Grossi, Roberto; Marino, Andrea; Uno, Takeaki; Versari, Luca Proximity search for maximal subgraph enumeration. (English) Zbl 1503.05061 SIAM J. Comput. 51, No. 5, 1580-1625 (2022). MSC: 05C30 05C85 68R10 PDFBibTeX XMLCite \textit{A. Conte} et al., SIAM J. Comput. 51, No. 5, 1580--1625 (2022; Zbl 1503.05061) Full Text: DOI arXiv
Felsner, Stefan; Hoffmann, Michael; Knorr, Kristin; Kynčl, Jan; Parada, Irene On the maximum number of crossings in star-simple drawings of \(K_n\) with no empty lens. (English) Zbl 1498.05076 J. Graph Algorithms Appl. 26, No. 3, 381-399 (2022). MSC: 05C10 05C30 05C62 68R10 PDFBibTeX XMLCite \textit{S. Felsner} et al., J. Graph Algorithms Appl. 26, No. 3, 381--399 (2022; Zbl 1498.05076) Full Text: DOI
Conway, Andrew R.; Conway, Miles; Price, Andrew Elvey; Guttmann, Anthony J. Pattern-avoiding ascent sequences of length 3. (English) Zbl 1502.05017 Electron. J. Comb. 29, No. 4, Research Paper P4.25, 32 p. (2022). MSC: 05A18 05A05 05A15 68R10 68P10 11B83 90C39 PDFBibTeX XMLCite \textit{A. R. Conway} et al., Electron. J. Comb. 29, No. 4, Research Paper P4.25, 32 p. (2022; Zbl 1502.05017) Full Text: DOI arXiv
Esmaeeli, Fahimeh; Mirzavaziri, Kamyar; Mirzavaziri, Madjid Divisor topologies and their enumeration. (English) Zbl 1508.54001 J. Algebr. Syst. 10, No. 1, 111-119 (2022). Reviewer: Thomas Richmond (Bowling Green) MSC: 54A10 05A15 11Y50 PDFBibTeX XMLCite \textit{F. Esmaeeli} et al., J. Algebr. Syst. 10, No. 1, 111--119 (2022; Zbl 1508.54001) Full Text: DOI
Baryshnikov, Yuliy; Melczer, Stephen; Pemantle, Robin Stationary points at infinity for analytic combinatorics. (English) Zbl 1500.05008 Found. Comput. Math. 22, No. 5, 1631-1664 (2022). MSC: 05A16 32Q55 14F45 57Q99 PDFBibTeX XMLCite \textit{Y. Baryshnikov} et al., Found. Comput. Math. 22, No. 5, 1631--1664 (2022; Zbl 1500.05008) Full Text: DOI arXiv
He, Xiaoyu; Nie, Jiaxi; Spiro, Sam Maximal independent sets in clique-free graphs. (English) Zbl 1504.05140 Eur. J. Comb. 106, Article ID 103575, 14 p. (2022). MSC: 05C30 05C69 05C35 68R10 PDFBibTeX XMLCite \textit{X. He} et al., Eur. J. Comb. 106, Article ID 103575, 14 p. (2022; Zbl 1504.05140) Full Text: DOI arXiv
Sun, Daoqiang; Li, Long; Liu, Kai; Wang, Hua; Yang, Yu Enumeration of subtrees of planar two-tree networks. (English) Zbl 1510.05121 Appl. Math. Comput. 434, Article ID 127404, 13 p. (2022). MSC: 05C30 05C85 68R10 PDFBibTeX XMLCite \textit{D. Sun} et al., Appl. Math. Comput. 434, Article ID 127404, 13 p. (2022; Zbl 1510.05121) Full Text: DOI
Heuberger, Clemens; Krenn, Daniel; Lipnik, Gabriel F. Asymptotic analysis of \(q\)-recursive sequences. (English) Zbl 1523.11009 Algorithmica 84, No. 9, 2480-2532 (2022). Reviewer: Wolfgang Steiner (Paris) MSC: 11A63 05A16 11B37 30B50 68Q45 68R05 68R15 PDFBibTeX XMLCite \textit{C. Heuberger} et al., Algorithmica 84, No. 9, 2480--2532 (2022; Zbl 1523.11009) Full Text: DOI arXiv
Doberkat, Ernst-Erich Generating functions explained in an understandable way. (Erzeugende Funktionen verständlich erklärt.) (German) Zbl 1492.05001 Essentials. Berlin: Springer Spektrum (ISBN 978-3-662-65162-9/pbk; 978-3-662-65163-6/ebook). xvii, 70 p. (2022). MSC: 05-01 05A15 68R05 00A06 PDFBibTeX XMLCite \textit{E.-E. Doberkat}, Erzeugende Funktionen verständlich erklärt. Berlin: Springer Spektrum (2022; Zbl 1492.05001) Full Text: DOI
Dörfler, Julian; Roth, Marc; Schmitt, Johannes; Wellnitz, Philip Counting induced subgraphs: an algebraic approach to #W[1]-hardness. (English) Zbl 1518.68259 Algorithmica 84, No. 2, 379-404 (2022). MSC: 68R10 05C30 05C60 68Q17 68Q27 PDFBibTeX XMLCite \textit{J. Dörfler} et al., Algorithmica 84, No. 2, 379--404 (2022; Zbl 1518.68259) Full Text: DOI
Li, Xiao-Chen; Hao, Rong-Xia The vertex Turán density in 3-ary \(n\)-cubes. (English) Zbl 1483.05083 Discrete Appl. Math. 311, 129-141 (2022). MSC: 05C30 05C82 68M10 PDFBibTeX XMLCite \textit{X.-C. Li} and \textit{R.-X. Hao}, Discrete Appl. Math. 311, 129--141 (2022; Zbl 1483.05083) Full Text: DOI
Lin, Jing; Zeng, Qinghou Maximum bipartite subgraphs in graphs without short cycles. (English) Zbl 1483.05085 Discrete Appl. Math. 311, 18-25 (2022). MSC: 05C35 05C30 05C38 68R10 PDFBibTeX XMLCite \textit{J. Lin} and \textit{Q. Zeng}, Discrete Appl. Math. 311, 18--25 (2022; Zbl 1483.05085) Full Text: DOI
Conte, Alessio; Tomita, Etsuji On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms. (English) Zbl 1515.68233 Theor. Comput. Sci. 899, 1-24 (2022). MSC: 68R10 05C30 05C69 05C85 68Q27 PDFBibTeX XMLCite \textit{A. Conte} and \textit{E. Tomita}, Theor. Comput. Sci. 899, 1--24 (2022; Zbl 1515.68233) Full Text: DOI
Matolcsi, Dávid; Nagy, Zoltán Lóránt Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees. (English) Zbl 1479.05158 Discrete Appl. Math. 307, 115-124 (2022). MSC: 05C30 05C35 05C05 05C10 68R10 PDFBibTeX XMLCite \textit{D. Matolcsi} and \textit{Z. L. Nagy}, Discrete Appl. Math. 307, 115--124 (2022; Zbl 1479.05158) Full Text: DOI arXiv
Bläsius, Thomas; Friedrich, Tobias; Lischeid, Julius; Meeks, Kitty; Schirneck, Martin Efficiently enumerating hitting sets of hypergraphs arising in data profiling. (English) Zbl 1478.68219 J. Comput. Syst. Sci. 124, 192-213 (2022). MSC: 68R10 05C30 05C65 05C85 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{T. Bläsius} et al., J. Comput. Syst. Sci. 124, 192--213 (2022; Zbl 1478.68219) Full Text: DOI Link
Golovach, Petr A.; Komusiewicz, Christian; Kratsch, Dieter; Le, Van Bang Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. (English) Zbl 1479.68002 J. Comput. Syst. Sci. 123, 76-102 (2022). Reviewer: Arne Meier (Hannover) MSC: 68Q27 05C70 05C85 68R05 68R10 68W05 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., J. Comput. Syst. Sci. 123, 76--102 (2022; Zbl 1479.68002) Full Text: DOI arXiv
Bostan, Alin; Kauers, Manuel; Verron, Thibaut The generating function of Kreweras walks with interacting boundaries is not algebraic. (English. French summary) Zbl 1505.05009 Sémin. Lothar. Comb. 85B, Article 78, 12 p. (2021). MSC: 05A15 33C05 PDFBibTeX XMLCite \textit{A. Bostan} et al., Sémin. Lothar. Comb. 85B, Article 78, 12 p. (2021; Zbl 1505.05009) Full Text: arXiv Link
Göbel, Andreas; Lagodzinski, J. A. Gregor; Seidel, Karen Counting homomorphisms to trees modulo a prime. (English) Zbl 1495.68175 ACM Trans. Comput. Theory 13, No. 3, Paper No. 19, 33 p. (2021). MSC: 68R10 05C30 05C60 68Q25 PDFBibTeX XMLCite \textit{A. Göbel} et al., ACM Trans. Comput. Theory 13, No. 3, Paper No. 19, 33 p. (2021; Zbl 1495.68175) Full Text: DOI
Baharev, Ali; Schichl, Hermann; Neumaier, Arnold; Achterberg, Tobias An exact method for the minimum feedback arc set problem. (English) Zbl 1499.68247 ACM J. Exp. Algorithm. 26, Paper No. 1.4, 28 p. (2021). MSC: 68R10 05C30 05C38 05C85 90C35 PDFBibTeX XMLCite \textit{A. Baharev} et al., ACM J. Exp. Algorithm. 26, Paper No. 1.4, 28 p. (2021; Zbl 1499.68247) Full Text: DOI
Rizzi, Romeo; Tomescu, Alexandru I. Random generation of essential directed acyclic graphs. (English) Zbl 1492.05057 Rend. Ist. Mat. Univ. Trieste 53, Paper No. 22, 8 p. (2021). MSC: 05C20 05C30 68R10 05C80 62F15 PDFBibTeX XMLCite \textit{R. Rizzi} and \textit{A. I. Tomescu}, Rend. Ist. Mat. Univ. Trieste 53, Paper No. 22, 8 p. (2021; Zbl 1492.05057) Full Text: DOI
Saračević, Muzafer; Pepić, Selver; Novalić, Fadil 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). MSC: 68P25 05A15 68M25 94A60 PDFBibTeX XMLCite \textit{M. Saračević} et al., De Gruyter Ser. Appl. Math. Eng. Inf. Sci. 6, 51--65 (2021; Zbl 1528.68102) Full Text: DOI
Sanli, Utkum; Paikray, Susanta Kumar; Cangul, Ismail Naci 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). MSC: 05C31 05C10 05C30 68R10 PDFBibTeX XMLCite \textit{U. Sanli} et al., Adv. Intell. Syst. Comput. 1356, 89--98 (2021; Zbl 1482.05166) Full Text: DOI
Bhattacharya, Anup; Bishnu, Arijit; Ghosh, Arijit; Mishra, Gopinath On triangle estimation using tripartite independent set queries. (English) Zbl 1508.68259 Theory Comput. Syst. 65, No. 8, 1165-1192 (2021). MSC: 68R10 05C30 05C69 05C85 68Q25 68W25 PDFBibTeX XMLCite \textit{A. Bhattacharya} et al., Theory Comput. Syst. 65, No. 8, 1165--1192 (2021; Zbl 1508.68259) Full Text: DOI arXiv Link
Zamaraeva, Elena; Žunić, Joviša Asymptotics of the number of 2-threshold functions. (English) Zbl 1518.68414 Inf. Comput. 281, Article ID 104742, 23 p. (2021). MSC: 68U05 05A16 PDFBibTeX XMLCite \textit{E. Zamaraeva} and \textit{J. Žunić}, Inf. Comput. 281, Article ID 104742, 23 p. (2021; Zbl 1518.68414) Full Text: DOI arXiv
Cameron, Kathie A parity theorem about trees with specified degrees. (English) Zbl 1475.05100 Discrete Appl. Math. 305, 48-55 (2021). MSC: 05C45 05C05 05C30 68R10 PDFBibTeX XMLCite \textit{K. Cameron}, Discrete Appl. Math. 305, 48--55 (2021; Zbl 1475.05100) Full Text: DOI
Cai, Jin-Yi; Govorov, Artem The complexity of counting edge colorings for simple graphs. (English) Zbl 1514.68205 Theor. Comput. Sci. 889, 14-24 (2021). MSC: 68R10 05C15 05C30 68Q17 PDFBibTeX XMLCite \textit{J.-Y. Cai} and \textit{A. Govorov}, Theor. Comput. Sci. 889, 14--24 (2021; Zbl 1514.68205) Full Text: DOI arXiv
Banković, Milan; Marić, Filip Faradžev Read-type enumeration of non-isomorphic CC systems. (English) Zbl 1522.68629 Comput. Geom. 97, Article ID 101770, 17 p. (2021). MSC: 68U05 52C10 68V05 PDFBibTeX XMLCite \textit{M. Banković} and \textit{F. Marić}, Comput. Geom. 97, Article ID 101770, 17 p. (2021; Zbl 1522.68629) Full Text: DOI
Yamanaka, Katsuhisa; Avis, David; Horiyama, Takashi; Okamoto, Yoshio; Uehara, Ryuhei; Yamauchi, Tanami Algorithmic enumeration of surrounding polygons. (English) Zbl 1523.68136 Discrete Appl. Math. 303, 305-313 (2021). MSC: 68U05 05A15 68R05 68W05 PDFBibTeX XMLCite \textit{K. Yamanaka} et al., Discrete Appl. Math. 303, 305--313 (2021; Zbl 1523.68136) Full Text: DOI
Lo, On-Hei S.; Schmidt, Jens M.; Thorup, Mikkel Compact cactus representations of all non-trivial min-cuts. (English) Zbl 1472.05085 Discrete Appl. Math. 303, 296-304 (2021). MSC: 05C40 05C85 68R10 68W40 90C35 90C60 PDFBibTeX XMLCite \textit{O.-H. S. Lo} et al., Discrete Appl. Math. 303, 296--304 (2021; Zbl 1472.05085) Full Text: DOI arXiv
Hermelin, Danny; Manoussakis, George Efficient enumeration of maximal induced bicliques. (English) Zbl 1472.05071 Discrete Appl. Math. 303, 253-261 (2021). MSC: 05C30 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{D. Hermelin} and \textit{G. Manoussakis}, Discrete Appl. Math. 303, 253--261 (2021; Zbl 1472.05071) Full Text: DOI
Conte, Alessio; Kanté, Mamadou Moustapha; Uno, Takeaki; Wasa, Kunihiro Maximal strongly connected cliques in directed graphs: algorithms and bounds. (English) Zbl 1472.05061 Discrete Appl. Math. 303, 237-252 (2021). MSC: 05C20 05C30 05C82 05C69 68R10 PDFBibTeX XMLCite \textit{A. Conte} et al., Discrete Appl. Math. 303, 237--252 (2021; Zbl 1472.05061) Full Text: DOI
Carmeli, Nofar; Kenig, Batya; Kimelfeld, Benny; Kröll, Markus Efficiently enumerating minimal triangulations. (English) Zbl 1472.05070 Discrete Appl. Math. 303, 216-236 (2021). MSC: 05C30 05C70 68R10 68Q25 PDFBibTeX XMLCite \textit{N. Carmeli} et al., Discrete Appl. Math. 303, 216--236 (2021; Zbl 1472.05070) Full Text: DOI
Capelli, Florent; Strozecki, Yann Enumerating models of DNF faster: breaking the dependency on the formula size. (English) Zbl 1523.68036 Discrete Appl. Math. 303, 203-215 (2021). MSC: 68Q25 03B70 05A15 68R05 68W05 68W40 PDFBibTeX XMLCite \textit{F. Capelli} and \textit{Y. Strozecki}, Discrete Appl. Math. 303, 203--215 (2021; Zbl 1523.68036) Full Text: DOI arXiv
Koana, Tomohiro; Nichterlein, André Detecting and enumerating small induced subgraphs in \(c\)-closed graphs. (English) Zbl 1469.05077 Discrete Appl. Math. 302, 198-207 (2021). MSC: 05C30 05C60 05C90 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{T. Koana} and \textit{A. Nichterlein}, Discrete Appl. Math. 302, 198--207 (2021; Zbl 1469.05077) Full Text: DOI arXiv
Bressan, Marco Faster algorithms for counting subgraphs in sparse graphs. (English) Zbl 1515.68228 Algorithmica 83, No. 8, 2578-2605 (2021). MSC: 68R10 05C30 05C42 05C60 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Bressan}, Algorithmica 83, No. 8, 2578--2605 (2021; Zbl 1515.68228) Full Text: DOI arXiv
Barcucci, Elena; Bernini, Antonio; Pinzani, Renzo Exhaustive generation of some lattice paths and their prefixes. (English) Zbl 1517.68264 Theor. Comput. Sci. 878-879, 47-52 (2021). MSC: 68R05 05A15 68W05 68W40 PDFBibTeX XMLCite \textit{E. Barcucci} et al., Theor. Comput. Sci. 878--879, 47--52 (2021; Zbl 1517.68264) Full Text: DOI
Eğecioğlu, Ömer; Saygı, Elif; Saygı, Zülfükar The number of short cycles in Fibonacci cubes. (English) Zbl 1482.05158 Theor. Comput. Sci. 871, 134-146 (2021). MSC: 05C30 05C38 05C82 68M10 68R10 PDFBibTeX XMLCite \textit{Ö. Eğecioğlu} et al., Theor. Comput. Sci. 871, 134--146 (2021; Zbl 1482.05158) Full Text: DOI
Defrain, Oscar; Nourine, Lhouari; Uno, Takeaki On the dualization in distributive lattices and related problems. (English) Zbl 1516.68040 Discrete Appl. Math. 300, 85-96 (2021). MSC: 68Q25 05C65 05C69 06A06 06D05 68R10 PDFBibTeX XMLCite \textit{O. Defrain} et al., Discrete Appl. Math. 300, 85--96 (2021; Zbl 1516.68040) Full Text: DOI arXiv
Bérczi, Kristóf; Boros, Endre; Čepek, Ondřej; Elbassioni, Khaled; Kučera, Petr; Makino, Kazuhisa Generating clause sequences of a CNF formula. (English) Zbl 1476.68186 Theor. Comput. Sci. 856, 68-74 (2021). MSC: 68R05 68Q25 68R07 PDFBibTeX XMLCite \textit{K. Bérczi} et al., Theor. Comput. Sci. 856, 68--74 (2021; Zbl 1476.68186) Full Text: DOI arXiv
Bright, Curtis; Kotsireas, Ilias; Heinle, Albert; Ganesh, Vijay Complex Golay pairs up to length 28: a search via computer algebra and programmatic SAT. (English) Zbl 1468.68276 J. Symb. Comput. 102, 153-172 (2021). MSC: 68V05 05A15 11B83 68R07 68W30 94A55 PDFBibTeX XMLCite \textit{C. Bright} et al., J. Symb. Comput. 102, 153--172 (2021; Zbl 1468.68276) Full Text: DOI arXiv
Nakahata, Yu; Nishino, Masaaki; Kawahara, Jun; Minato, Shin-Ichi 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). MSC: 68R10 05C30 05C85 68P05 68W05 PDFBibTeX XMLCite \textit{Y. Nakahata} et al., LIPIcs -- Leibniz Int. Proc. Inform. 160, Article 9, 14 p. (2020; Zbl 1515.68251) Full Text: DOI
Efthymiou, Charilaos Deterministic counting of graph colourings using sequences of subgraphs. (English) Zbl 1504.68163 Comb. Probab. Comput. 29, No. 4, 555-586 (2020). MSC: 68R10 05C15 05C30 05C80 05C85 68Q87 68W25 68W40 PDFBibTeX XMLCite \textit{C. Efthymiou}, Comb. Probab. Comput. 29, No. 4, 555--586 (2020; Zbl 1504.68163) Full Text: DOI
Runge, Vincent Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? (English) Zbl 1462.52032 J. Optim. Theory Appl. 187, No. 2, 431-447 (2020). MSC: 52C17 90C26 68U05 62L10 PDFBibTeX XMLCite \textit{V. Runge}, J. Optim. Theory Appl. 187, No. 2, 431--447 (2020; Zbl 1462.52032) Full Text: DOI arXiv
Bonamy, Marthe; Defrain, Oscar; Heinrich, Marc; Pilipczuk, Michał; Raymond, Jean-Florent Enumerating minimal dominating sets in \(K_t\)-free graphs and variants. (English) Zbl 1484.68153 ACM Trans. Algorithms 16, No. 3, Article No. 39, 23 p. (2020). MSC: 68R10 05C30 05C69 68W40 PDFBibTeX XMLCite \textit{M. Bonamy} et al., ACM Trans. Algorithms 16, No. 3, Article No. 39, 23 p. (2020; Zbl 1484.68153) Full Text: DOI arXiv
Pudwell, Lara From permutation patterns to the periodic table. (English) Zbl 1458.05008 Notices Am. Math. Soc. 67, No. 7, 994-1001 (2020). MSC: 05A05 05A15 68R10 92E10 PDFBibTeX XMLCite \textit{L. Pudwell}, Notices Am. Math. Soc. 67, No. 7, 994--1001 (2020; Zbl 1458.05008) Full Text: DOI
Gao, Liqing; Wang, Jian Decycling \(d\)-ary \(n\)-dimensional cubes. (English) Zbl 1452.05088 Util. Math. 114, 127-136 (2020). MSC: 05C30 05C60 68R10 PDFBibTeX XMLCite \textit{L. Gao} and \textit{J. Wang}, Util. Math. 114, 127--136 (2020; Zbl 1452.05088)
Pilz, Alexander; Welzl, Emo; Wettstein, Manuel From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices. (English) Zbl 1450.05016 Discrete Comput. Geom. 64, No. 3, 1067-1097 (2020). MSC: 05C10 05C62 05C30 52C99 68U05 68Q25 PDFBibTeX XMLCite \textit{A. Pilz} et al., Discrete Comput. Geom. 64, No. 3, 1067--1097 (2020; Zbl 1450.05016) Full Text: DOI arXiv Link
Nagy, Benedek On the number of shortest paths by neighborhood sequences on the square grid. (English) Zbl 1463.68137 Miskolc Math. Notes 21, No. 1, 287-301 (2020). MSC: 68U05 05C30 52C45 68R10 PDFBibTeX XMLCite \textit{B. Nagy}, Miskolc Math. Notes 21, No. 1, 287--301 (2020; Zbl 1463.68137) Full Text: DOI
Scheucher, Manfred; Schrezenmaier, Hendrik; Steiner, Raphael A note on universal point sets for planar graphs. (English) Zbl 1447.05065 J. Graph Algorithms Appl. 24, No. 3, 247-267 (2020). MSC: 05C10 05C30 05C85 68R10 PDFBibTeX XMLCite \textit{M. Scheucher} et al., J. Graph Algorithms Appl. 24, No. 3, 247--267 (2020; Zbl 1447.05065) Full Text: DOI arXiv
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő Note on the bisection width of cubic graphs. (English) Zbl 1447.05109 Discrete Appl. Math. 285, 434-442 (2020). MSC: 05C30 05C82 68R10 68M10 PDFBibTeX XMLCite \textit{A. S. Jobson} et al., Discrete Appl. Math. 285, 434--442 (2020; Zbl 1447.05109) Full Text: DOI
Pach, János; Tóth, Géza A crossing lemma for multigraphs. (English) Zbl 1446.05026 Discrete Comput. Geom. 63, No. 4, 918-933 (2020). Reviewer: Juan José Montellano Ballesteros (Coyoacán) MSC: 05C10 05C35 05C30 68R10 PDFBibTeX XMLCite \textit{J. Pach} and \textit{G. Tóth}, Discrete Comput. Geom. 63, No. 4, 918--933 (2020; Zbl 1446.05026) Full Text: DOI Link
Holt, Derek; Royle, Gordon A census of small transitive groups and vertex-transitive graphs. (English) Zbl 1528.20004 J. Symb. Comput. 101, 51-60 (2020). MSC: 20B20 05C25 05E18 20-08 PDFBibTeX XMLCite \textit{D. Holt} and \textit{G. Royle}, J. Symb. Comput. 101, 51--60 (2020; Zbl 1528.20004) Full Text: DOI arXiv Link
Bacher, Axel; Kauers, Manuel; Yatchak, Rika 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 \textit{A. Bacher} et al., in: 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). 95--106 (2020; Zbl 1440.05017) Full Text: arXiv Link
Chern, Shane; Li, Zhitai Linked partition ideals and kanade-Russell conjectures. (English) Zbl 1440.05021 Discrete Math. 343, No. 7, Article ID 111876, 23 p. (2020). MSC: 05A15 05A17 11P81 PDFBibTeX XMLCite \textit{S. Chern} and \textit{Z. Li}, Discrete Math. 343, No. 7, Article ID 111876, 23 p. (2020; Zbl 1440.05021) Full Text: DOI arXiv
Hu, Zhiquan; Sun, Pei Spanning 5-ended trees in \(K_{1,5}\)-free graphs. (English) Zbl 1437.05062 Bull. Malays. Math. Sci. Soc. (2) 43, No. 3, 2565-2586 (2020). MSC: 05C10 05C30 68R10 PDFBibTeX XMLCite \textit{Z. Hu} and \textit{P. Sun}, Bull. Malays. Math. Sci. Soc. (2) 43, No. 3, 2565--2586 (2020; Zbl 1437.05062) Full Text: DOI
Conte, Alessio; Grossi, Roberto; Marino, Andrea; Versari, Luca Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs. (English) Zbl 1433.68287 Algorithmica 82, No. 6, 1547-1573 (2020). MSC: 68R10 05C30 05C69 05C85 68W40 PDFBibTeX XMLCite \textit{A. Conte} et al., Algorithmica 82, No. 6, 1547--1573 (2020; Zbl 1433.68287) Full Text: DOI
Elbassioni, Khaled; Makino, Kazuhisa Enumerating vertices of covering polyhedra with totally unimodular constraint matrices. (English) Zbl 1432.68324 SIAM J. Discrete Math. 34, No. 1, 843-864 (2020). MSC: 68R05 05C65 52B05 52B55 68R10 68U05 68W40 PDFBibTeX XMLCite \textit{K. Elbassioni} and \textit{K. Makino}, SIAM J. Discrete Math. 34, No. 1, 843--864 (2020; Zbl 1432.68324) Full Text: DOI
Defrain, Oscar; Nourine, Lhouari Dualization in lattices given by implicational bases. (English) Zbl 1435.68116 Theor. Comput. Sci. 814, 169-176 (2020). MSC: 68Q25 03G10 06B05 06D05 06D50 68R05 PDFBibTeX XMLCite \textit{O. Defrain} and \textit{L. Nourine}, Theor. Comput. Sci. 814, 169--176 (2020; Zbl 1435.68116) Full Text: DOI arXiv
Fowler, Patrick W.; Gauci, John Baptist; Goedgebeur, Jan; Pisanski, Tomaž; Sciriha, Irene Existence of regular nut graphs for degree at most 11. (English) Zbl 1433.05153 Discuss. Math., Graph Theory 40, No. 2, 533-557 (2020). MSC: 05C30 05C50 05C75 05C90 68R10 PDFBibTeX XMLCite \textit{P. W. Fowler} et al., Discuss. Math., Graph Theory 40, No. 2, 533--557 (2020; Zbl 1433.05153) Full Text: DOI arXiv
Heuberger, Clemens; Krenn, Daniel Asymptotic analysis of regular sequences. (English) Zbl 1476.11018 Algorithmica 82, No. 3, 429-508 (2020). Reviewer: Jean-Paul Allouche (Paris) MSC: 11A63 05A16 68Q45 68R05 PDFBibTeX XMLCite \textit{C. Heuberger} and \textit{D. Krenn}, Algorithmica 82, No. 3, 429--508 (2020; Zbl 1476.11018) Full Text: DOI arXiv
Bressan, Marco 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). MSC: 68R10 05C30 05C42 05C60 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Bressan}, LIPIcs -- Leibniz Int. Proc. Inform. 148, Article 6, 15 p. (2019; Zbl 1515.68229) Full Text: DOI
Dörfler, Julian; Roth, Marc; Schmitt, Johannes; Wellnitz, Philip 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). MSC: 68R10 05C30 05C60 68Q17 68Q27 PDFBibTeX XMLCite \textit{J. Dörfler} et al., LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 26, 14 p. (2019; Zbl 1518.68260) Full Text: DOI arXiv
Linker, Sven; Sevegnani, Michele Target counting with Presburger constraints and its application in sensor networks. (English) Zbl 1472.68015 Proc. R. Soc. Lond., A, Math. Phys. Eng. Sci. 475, No. 2231, Article ID 20190278, 24 p. (2019). MSC: 68M18 60C05 68R05 PDFBibTeX XMLCite \textit{S. Linker} and \textit{M. Sevegnani}, Proc. R. Soc. Lond., A, Math. Phys. Eng. Sci. 475, No. 2231, Article ID 20190278, 24 p. (2019; Zbl 1472.68015) Full Text: DOI
Chang, Yi-Jun; Saranurak, Thatchaphol 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 \textit{Y.-J. Chang} and \textit{T. Saranurak}, in: 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; Zbl 1464.68439) Full Text: DOI arXiv
Komusiewicz, Christian; Sommer, Frank 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). MSC: 68R10 05C30 05C85 68W40 PDFBibTeX XMLCite \textit{C. Komusiewicz} and \textit{F. Sommer}, Lect. Notes Comput. Sci. 11376, 272--284 (2019; Zbl 1445.68168) Full Text: DOI
Defrain, Oscar; Nourine, Lhouari 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). MSC: 68Q25 03G10 06B05 06D05 06D50 68R05 PDFBibTeX XMLCite \textit{O. Defrain} and \textit{L. Nourine}, Lect. Notes Comput. Sci. 11511, 89--98 (2019; Zbl 1435.68115) Full Text: DOI arXiv
Conte, Alessio; Uno, Takeaki 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). MSC: 68R10 05C30 05C85 68W40 PDFBibTeX XMLCite \textit{A. Conte} and \textit{T. Uno}, in: 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; Zbl 1433.68288) Full Text: DOI Link
Gupta, Anupam; Lee, Euiwoong; Li, Jason 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). MSC: 05C85 05C30 05C35 68R10 68W40 PDFBibTeX XMLCite \textit{A. Gupta} et al., in: 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; Zbl 1437.05222) Full Text: DOI arXiv
Strozecki, Yann Enumeration complexity. (English) Zbl 1428.68227 Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 129, 22-53 (2019). MSC: 68Rxx 05A15 68Q25 PDFBibTeX XMLCite \textit{Y. Strozecki}, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 129, 22--53 (2019; Zbl 1428.68227) Full Text: Link
Blanco, Saúl A.; Buehrle, Charles; Patidar, Akshay. On the number of pancake stacks requiring four flips to be sorted. (English) Zbl 1437.05016 Discrete Math. Theor. Comput. Sci. 21, No. 2, Paper No. 3, 27 p. (2019). Reviewer: Stephan Wagner (Uppsala) MSC: 05A15 05A05 05C25 05C38 68R10 PDFBibTeX XMLCite \textit{S. A. Blanco} et al., Discrete Math. Theor. Comput. Sci. 21, No. 2, Paper No. 3, 27 p. (2019; Zbl 1437.05016) Full Text: arXiv Link
Consoli, Sergio; Korst, Jan; Geleijnse, Gijs; Pauws, Steffen An exact algorithm for the minimum quartet tree cost problem. (English) Zbl 1428.90142 4OR 17, No. 4, 401-425 (2019). MSC: 90C27 05A05 05A15 62H30 68R10 05C30 92E10 PDFBibTeX XMLCite \textit{S. Consoli} et al., 4OR 17, No. 4, 401--425 (2019; Zbl 1428.90142) Full Text: DOI
Rudi, Ali Gholami Succinct enumeration of distant vertex pairs. (English) Zbl 1427.05076 Discrete Math. Algorithms Appl. 11, No. 6, Article ID 1950076, 7 p. (2019). MSC: 05C12 05C85 05C30 68P05 68R10 PDFBibTeX XMLCite \textit{A. G. Rudi}, Discrete Math. Algorithms Appl. 11, No. 6, Article ID 1950076, 7 p. (2019; Zbl 1427.05076) Full Text: DOI
Huemer, Clemens; Pilz, Alexander; Silveira, Rodrigo I. A new lower bound on the maximum number of plane graphs using production matrices. (English) Zbl 1425.05035 Comput. Geom. 84, 36-49 (2019). MSC: 05C10 05C30 05B25 68U05 PDFBibTeX XMLCite \textit{C. Huemer} et al., Comput. Geom. 84, 36--49 (2019; Zbl 1425.05035) Full Text: DOI arXiv
Banderier, Cyril; Krattenthaler, Christian; Krinik, Alan; Kruchinin, Dmitry; Kruchinin, Vladimir; Nguyen, David; Wallner, Michael 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). MSC: 05A15 05A10 05A16 05A19 PDFBibTeX XMLCite \textit{C. Banderier} et al., Dev. Math. 58, 78--118 (2019; Zbl 1422.05007) Full Text: DOI arXiv
Mutzel, Petra; Oettershagen, Lutz 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). MSC: 68R10 05C22 05C30 05C38 68Q25 PDFBibTeX XMLCite \textit{P. Mutzel} and \textit{L. Oettershagen}, Lect. Notes Comput. Sci. 11436, 518--535 (2019; Zbl 1527.68166) Full Text: DOI arXiv
Loehr, Nicholas A. Successor algorithms via counting arguments. (English) Zbl 1422.05013 Bull. Inst. Comb. Appl. 86, 101-122 (2019). MSC: 05A15 68R05 PDFBibTeX XMLCite \textit{N. A. Loehr}, Bull. Inst. Comb. Appl. 86, 101--122 (2019; Zbl 1422.05013)
Bläsius, Thomas; Friedrich, Tobias; Lischeid, Julius; Meeks, Kitty; Schirneck, Martin 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). MSC: 68R10 05C30 05C65 68P15 68Q17 68W40 PDFBibTeX XMLCite \textit{T. Bläsius} et al., in: 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; Zbl 1430.68178) Full Text: DOI arXiv
Amano, Kazuyuki; Haruyama, Yoshinobu On the number of p4-tilings by an \(n\)-omino. (English) Zbl 1457.68274 Int. J. Comput. Geom. Appl. 29, No. 1, 3-19 (2019). MSC: 68U05 05A15 05B45 05B50 52C20 PDFBibTeX XMLCite \textit{K. Amano} and \textit{Y. Haruyama}, Int. J. Comput. Geom. Appl. 29, No. 1, 3--19 (2019; Zbl 1457.68274) Full Text: DOI
Zolotykh, Nikolai Yu.; Bastrakov, Sergei I. Two variations of graph test in double description method. (English) Zbl 1463.68138 Comput. Appl. Math. 38, No. 3, Paper No. 100, 9 p. (2019). MSC: 68U05 05C90 52B05 52B55 PDFBibTeX XMLCite \textit{N. Yu. Zolotykh} and \textit{S. I. Bastrakov}, Comput. Appl. Math. 38, No. 3, Paper No. 100, 9 p. (2019; Zbl 1463.68138) Full Text: DOI
Curticapean, Radu; Dell, Holger; Roth, Marc Counting edge-injective homomorphisms and matchings on restricted graph classes. (English) Zbl 1429.68080 Theory Comput. Syst. 63, No. 5, 987-1026 (2019). MSC: 68Q25 05C30 05C60 05C70 68Q17 68R10 PDFBibTeX XMLCite \textit{R. Curticapean} et al., Theory Comput. Syst. 63, No. 5, 987--1026 (2019; Zbl 1429.68080) Full Text: DOI Link
Ma, Shi-Mei; Ma, Jun; Yeh, Yeong-Nan \(\gamma\)-positivity and partial \(\gamma\)-positivity of descent-type polynomials. (English) Zbl 1446.05004 J. Comb. Theory, Ser. A 167, 257-293 (2019). Reviewer: David Grabiner (Columbia) MSC: 05A05 05A15 05E05 11B68 11B73 11B83 68Q45 68R10 PDFBibTeX XMLCite \textit{S.-M. Ma} et al., J. Comb. Theory, Ser. A 167, 257--293 (2019; Zbl 1446.05004) Full Text: DOI arXiv
Goedgebeur, Jan; Máčajová, Edita; Škoviera, Martin Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. (English) Zbl 1416.05104 Ars Math. Contemp. 16, No. 2, 277-298 (2019). MSC: 05C15 05C21 05C30 05C40 05C75 68R10 PDFBibTeX XMLCite \textit{J. Goedgebeur} et al., Ars Math. Contemp. 16, No. 2, 277--298 (2019; Zbl 1416.05104) Full Text: DOI arXiv
Claesson, Anders; Guðmundsson, Bjarki Ágúst Enumerating permutations sortable by \(k\) passes through a pop-stack. (English) Zbl 1415.05012 Adv. Appl. Math. 108, 79-96 (2019). MSC: 05A15 05A05 68Q45 68Q70 68P10 68R05 PDFBibTeX XMLCite \textit{A. Claesson} and \textit{B. Á. Guðmundsson}, Adv. Appl. Math. 108, 79--96 (2019; Zbl 1415.05012) Full Text: DOI arXiv
Bentert, Matthias; Fluschnik, Till; Nichterlein, André; Niedermeier, Rolf Parameterized aspects of triangle enumeration. (English) Zbl 1430.68176 J. Comput. Syst. Sci. 103, 61-77 (2019). MSC: 68R10 05C30 05C85 68Q17 68Q27 PDFBibTeX XMLCite \textit{M. Bentert} et al., J. Comput. Syst. Sci. 103, 61--77 (2019; Zbl 1430.68176) Full Text: DOI arXiv