Lucke, Felicia; Mann, Felix Reducing graph parameters by contractions and deletions. (English) Zbl 07823160 Algorithmica 86, No. 3, 825-851 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{F. Lucke} and \textit{F. Mann}, Algorithmica 86, No. 3, 825--851 (2024; Zbl 07823160) Full Text: DOI arXiv OA License
Bergé, Pierre; Busson, Anthony; Feghali, Carl; Watrigant, Rémi 1-extendability of independent sets. (English) Zbl 07823157 Algorithmica 86, No. 3, 757-781 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{P. Bergé} et al., Algorithmica 86, No. 3, 757--781 (2024; Zbl 07823157) Full Text: DOI
Focke, Jacob; Roth, Marc Counting small induced subgraphs with hereditary properties. (English) Zbl 07820558 SIAM J. Comput. 53, No. 2, 189-220 (2024). MSC: 68Q17 68Q25 68R10 PDFBibTeX XMLCite \textit{J. Focke} and \textit{M. Roth}, SIAM J. Comput. 53, No. 2, 189--220 (2024; Zbl 07820558) Full Text: DOI
Chalopin, Jérémie; Changat, Manoj; Chepoi, Victor; Jacob, Jeny First-order logic axiomatization of metric graph theory. (English) Zbl 07819255 Theor. Comput. Sci. 993, Article ID 114460, 28 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Chalopin} et al., Theor. Comput. Sci. 993, Article ID 114460, 28 p. (2024; Zbl 07819255) Full Text: DOI arXiv
Chudnovsky, Maria; Pilipczuk, Marcin; Pilipczuk, Michał; Thomassé, Stéphan Quasi-polynomial time approximation schemes for the maximum weight independent set problem in \(H\)-free graphs. (English) Zbl 07810343 SIAM J. Comput. 53, No. 1, 47-86 (2024). MSC: 68R10 05C69 05C85 PDFBibTeX XMLCite \textit{M. Chudnovsky} et al., SIAM J. Comput. 53, No. 1, 47--86 (2024; Zbl 07810343) Full Text: DOI
Ciraulo, Francesco Overlap algebras as almost discrete locales. (English) Zbl 07788993 Log. Methods Comput. Sci. 19, No. 4, Paper No. 21, 12 p. (2023). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{F. Ciraulo}, Log. Methods Comput. Sci. 19, No. 4, Paper No. 21, 12 p. (2023; Zbl 07788993) Full Text: DOI arXiv
Dumitrescu, Adrian; Lingas, Andrzej Finding small complete subgraphs efficiently. (English) Zbl 07781735 Hsieh, Sun-Yuan (ed.) et al., Combinatorial algorithms. 34th international workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13889, 185-196 (2023). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{A. Dumitrescu} and \textit{A. Lingas}, Lect. Notes Comput. Sci. 13889, 185--196 (2023; Zbl 07781735) Full Text: DOI arXiv
Agrawal, Akanksha; Choudhary, Pratibha; Narayanaswamy, N. S.; Nisha, K. K.; Ramamoorthi, Vijayaragunathan Parameterized complexity of minimum membership dominating set. (English) Zbl 07767696 Algorithmica 85, No. 11, 3430-3452 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{A. Agrawal} et al., Algorithmica 85, No. 11, 3430--3452 (2023; Zbl 07767696) Full Text: DOI
Oostveen, Jelle J.; van Leeuwen, Erik Jan Streaming deletion problems Parameterized by vertex cover. (English) Zbl 07755509 Theor. Comput. Sci. 979, Article ID 114178, 25 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. J. Oostveen} and \textit{E. J. van Leeuwen}, Theor. Comput. Sci. 979, Article ID 114178, 25 p. (2023; Zbl 07755509) Full Text: DOI
Bremner, Murray R.; Brox, Jose; Sánchez-Ortega, Juana Higher polynomial identities for mutations of associative algebras. (English) Zbl 07753750 Result. Math. 78, No. 6, Paper No. 237, 16 p. (2023). MSC: 18M70 16R10 16W10 17A30 17A50 17B60 17C65 17D25 68W30 PDFBibTeX XMLCite \textit{M. R. Bremner} et al., Result. Math. 78, No. 6, Paper No. 237, 16 p. (2023; Zbl 07753750) Full Text: DOI arXiv OA License
Gishboliner, Lior; Levanzov, Yevgeny; Shapira, Asaf; Yuster, Raphael Counting homomorphic cycles in degenerate graphs. (English) Zbl 07753153 ACM Trans. Algorithms 19, No. 1, Article No. 2, 22 p. (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{L. Gishboliner} et al., ACM Trans. Algorithms 19, No. 1, Article No. 2, 22 p. (2023; Zbl 07753153) Full Text: DOI arXiv
Asahiro, Yuichi; Eto, Hiroshi; Korenaga, Kana; Lin, Guohui; Miyano, Eiji; Nonoue, Reo Independent set under a change constraint from an initial solution. (English) Zbl 07745697 Mavronicolas, Marios (ed.), Algorithms and complexity. 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13898, 37-51 (2023). MSC: 68Wxx PDFBibTeX XMLCite \textit{Y. Asahiro} et al., Lect. Notes Comput. Sci. 13898, 37--51 (2023; Zbl 07745697) Full Text: DOI
Komarath, Balagopal; Pandey, Anurag; Rahul, C. S. Monotone arithmetic complexity of graph homomorphism polynomials. (English) Zbl 07742464 Algorithmica 85, No. 9, 2554-2579 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{B. Komarath} et al., Algorithmica 85, No. 9, 2554--2579 (2023; Zbl 07742464) Full Text: DOI
Chakraborty, Dibyayan; Gajjar, Kshitij Finding geometric representations of apex graphs is NP-hard. (English) Zbl 07729840 Theor. Comput. Sci. 971, Article ID 114064, 14 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Chakraborty} and \textit{K. Gajjar}, Theor. Comput. Sci. 971, Article ID 114064, 14 p. (2023; Zbl 07729840) Full Text: DOI
Akmal, Shyan; Chen, Lijie; Jin, Ce; Raj, Malvika; Williams, Ryan Improved Merlin-Arthur protocols for central problems in fine-grained complexity. (English) Zbl 07729248 Algorithmica 85, No. 8, 2395-2426 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{S. Akmal} et al., Algorithmica 85, No. 8, 2395--2426 (2023; Zbl 07729248) Full Text: DOI
Barish, Robert D.; Shibuya, Tetsuo Proper colorability of segment intersection graphs. (English) Zbl 07724778 Zhang, Yong (ed.) et al., Computing and combinatorics. 28th international conference, COCOON 2022, Shenzhen, China, October 22–24, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13595, 573-584 (2023). MSC: 68Rxx PDFBibTeX XMLCite \textit{R. D. Barish} and \textit{T. Shibuya}, Lect. Notes Comput. Sci. 13595, 573--584 (2023; Zbl 07724778) Full Text: DOI
Mertzios, George B.; Molter, Hendrik; Niedermeier, Rolf; Zamaraev, Viktor; Zschoche, Philipp Computing maximum matchings in temporal graphs. (English) Zbl 07709772 J. Comput. Syst. Sci. 137, 1-19 (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{G. B. Mertzios} et al., J. Comput. Syst. Sci. 137, 1--19 (2023; Zbl 07709772) Full Text: DOI
Janota, Mikoláš; Morgado, António; Vojtěchovský, Petr Computing generating sets of minimal size in finite algebras. (English) Zbl 1520.20128 J. Symb. Comput. 119, 50-63 (2023). Reviewer: Yuval Filmus (Haifa) MSC: 20N05 68Q25 20-08 68T20 PDFBibTeX XMLCite \textit{M. Janota} et al., J. Symb. Comput. 119, 50--63 (2023; Zbl 1520.20128) Full Text: DOI
Porter, Christopher P. Continuous randomness via transformations of 2-random sequences. (English) Zbl 07687215 Inf. Comput. 292, Article ID 105028, 7 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{C. P. Porter}, Inf. Comput. 292, Article ID 105028, 7 p. (2023; Zbl 07687215) Full Text: DOI
Kowaluk, Mirosław; Lingas, Andrzej Rare siblings speed-up deterministic detection and counting of small pattern graphs. (English) Zbl 07673392 Algorithmica 85, No. 4, 976-991 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{M. Kowaluk} and \textit{A. Lingas}, Algorithmica 85, No. 4, 976--991 (2023; Zbl 07673392) Full Text: DOI
Dvořák, Pavel; Feldmann, Andreas Emil; Rai, Ashutosh; Rzążewski, Paweł Parameterized inapproximability of independent set in \(H\)-free graphs. (English) Zbl 07673389 Algorithmica 85, No. 4, 902-928 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{P. Dvořák} et al., Algorithmica 85, No. 4, 902--928 (2023; Zbl 07673389) Full Text: DOI
Krokhin, Andrei; Opršal, Jakub; Wrochna, Marcin; Živný, Stanislav Topology and adjunction in promise constraint satisfaction. (English) Zbl 07672224 SIAM J. Comput. 52, No. 1, 38-79 (2023). MSC: 68Q17 68Q25 68R05 05C15 PDFBibTeX XMLCite \textit{A. Krokhin} et al., SIAM J. Comput. 52, No. 1, 38--79 (2023; Zbl 07672224) Full Text: DOI arXiv
Araújo, Júlio; Bougeret, Marin; Campos, Victor A.; Sau, Ignasi Parameterized complexity of computing maximum minimal blocking and hitting sets. (English) Zbl 1507.68222 Algorithmica 85, No. 2, 444-491 (2023). MSC: 68R10 05C69 05C70 05C85 68Q27 PDFBibTeX XMLCite \textit{J. Araújo} et al., Algorithmica 85, No. 2, 444--491 (2023; Zbl 1507.68222) Full Text: DOI arXiv
Koenig, Jérémie Grounding game semantics in categorical algebra. (English) Zbl 07804593 Kishida, Kohei (ed.), Proceedings of the fourth international conference on applied category theory 2021, ACT 2021, Cambridge, UK, July 12–16, 2021. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 372, 368-383 (2022). MSC: 68Q55 18C50 68N30 91A80 PDFBibTeX XMLCite \textit{J. Koenig}, Electron. Proc. Theor. Comput. Sci. (EPTCS) 372, 368--383 (2022; Zbl 07804593) Full Text: arXiv Link
Hirschowitz, André; Hirschowitz, Tom; Lafont, Ambroise; Maggesi, Marco Variable binding and substitution for (nameless) dummies. (English) Zbl 07793039 Bouyer, Patricia (ed.) et al., Foundations of software science and computation structures. 25th international conference, FOSSACS 2022, held as part of the European joint conferences on theory and practice of software, ETAPS 2022, Munich, Germany, April 2–7, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13242, 389-408 (2022). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{A. Hirschowitz} et al., Lect. Notes Comput. Sci. 13242, 389--408 (2022; Zbl 07793039) Full Text: DOI arXiv
Mcdermott, Dylan; Uustalu, Tarmo What makes a strong monad? (English) Zbl 07779295 Gibbons, Jeremy (ed.) et al., Proceedings of the ninth workshop on mathematically structured functional programming, MSFP 2022, Munich, Germany, April 2, 2022. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 360, 113-133 (2022). MSC: 68-XX 18-XX PDFBibTeX XMLCite \textit{D. Mcdermott} and \textit{T. Uustalu}, Electron. Proc. Theor. Comput. Sci. (EPTCS) 360, 113--133 (2022; Zbl 07779295) Full Text: arXiv Link
Yang, Zhixuan; Paviotti, Marco; Wu, Nicolas; van den Berg, Birthe; Schrijvers, Tom Structured handling of scoped effects. (English) Zbl 1528.68088 Sergey, Ilya (ed.), Programming languages and systems. 31st European symposium on programming, ESOP 2022, held as part of the European joint conferences on theory and practice of software, ETAPS 2022, Munich, Germany, April 2–7, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13240, 462-491 (2022). MSC: 68N30 18C50 68N18 PDFBibTeX XMLCite \textit{Z. Yang} et al., Lect. Notes Comput. Sci. 13240, 462--491 (2022; Zbl 1528.68088) Full Text: DOI arXiv
Bhore, Sujoy; Klute, Fabian; Oostveen, Jelle J. On streaming algorithms for geometric independent set and clique. (English) Zbl 07717065 Chalermsook, Parinya (ed.) et al., Approximation and online algorithms. 20th international workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13538, 211-224 (2022). MSC: 68W25 68W27 PDFBibTeX XMLCite \textit{S. Bhore} et al., Lect. Notes Comput. Sci. 13538, 211--224 (2022; Zbl 07717065) Full Text: DOI arXiv
Paesani, Giacomo; Paulusma, Daniël; Rzążewski, Paweł Classifying subset feedback vertex set for \(H\)-free graphs. (English) Zbl 07682426 Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 412-424 (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{G. Paesani} et al., Lect. Notes Comput. Sci. 13453, 412--424 (2022; Zbl 07682426) Full Text: DOI arXiv
Bera, Suman K.; Gishboliner, Lior; Levanzov, Yevgeny; Seshadhri, C.; Shapira, Asaf Counting subgraphs in degenerate graphs. (English) Zbl 07679919 J. ACM 69, No. 3, Paper No. 23, 21 p. (2022). MSC: 68-XX PDFBibTeX XMLCite \textit{S. K. Bera} et al., J. ACM 69, No. 3, Paper No. 23, 21 p. (2022; Zbl 07679919) Full Text: DOI arXiv
Draganić, Nemanja; Glock, Stefan; Krivelevich, Michael Short proofs for long induced paths. (English) Zbl 1510.05209 Comb. Probab. Comput. 31, No. 5, 870-878 (2022). MSC: 05C55 05C80 05C38 05D10 05C85 68Q25 PDFBibTeX XMLCite \textit{N. Draganić} et al., Comb. Probab. Comput. 31, No. 5, 870--878 (2022; Zbl 1510.05209) Full Text: DOI arXiv
Keil, J. Mark; Mondal, Debajyoti; Moradi, Ehsan; Nekrich, Yakov Finding a maximum clique in a grounded 1-bend string graph. (English) Zbl 1508.05162 J. Graph Algorithms Appl. 26, No. 4, 553-575 (2022). MSC: 05C85 05C69 68Q17 PDFBibTeX XMLCite \textit{J. M. Keil} et al., J. Graph Algorithms Appl. 26, No. 4, 553--575 (2022; Zbl 1508.05162) Full Text: DOI arXiv
Esposito, Antonio Corbo; Piscitelli, Gianpaolo Pseudo-orthogonality for graph 1-Laplacian eigenvectors and applications to higher Cheeger constants and data clustering. (English) Zbl 1507.68282 Front. Math. China 17, No. 4, 591-623 (2022). MSC: 68T09 05C50 PDFBibTeX XMLCite \textit{A. C. Esposito} and \textit{G. Piscitelli}, Front. Math. China 17, No. 4, 591--623 (2022; Zbl 1507.68282) Full Text: DOI arXiv
Wißmann, Thorsten; Milius, Stefan; Schröder, Lutz Quasilinear-time computation of generic modal witnesses for behavioural inequivalence. (English) Zbl 07639914 Log. Methods Comput. Sci. 18, No. 4, Paper No. 6, 48 p. (2022). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{T. Wißmann} et al., Log. Methods Comput. Sci. 18, No. 4, Paper No. 6, 48 p. (2022; Zbl 07639914) Full Text: DOI arXiv
Hamana, Makoto Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding. (English) Zbl 1506.68044 Math. Struct. Comput. Sci. 32, No. 4, 542-573 (2022). MSC: 68Q42 68Q55 PDFBibTeX XMLCite \textit{M. Hamana}, Math. Struct. Comput. Sci. 32, No. 4, 542--573 (2022; Zbl 1506.68044) Full Text: DOI
Pous, Damien; Rot, Jurriaan; Turkenburg, Ruben Corecursion up-to via causal transformations. (English) Zbl 07628070 Hansen, Helle Hvid (ed.) et al., Coalgebraic methods in computer science. 16th IFIP WG 1.3 international workshop, CMCS 2022, colocated with ETAPS 2022, Munich, Germany, April 2–3, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13225, 133-154 (2022). MSC: 68Q65 PDFBibTeX XMLCite \textit{D. Pous} et al., Lect. Notes Comput. Sci. 13225, 133--154 (2022; Zbl 07628070) Full Text: DOI
He, Xin; Zhang, Huaming; Han, Yijie On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs. (English) Zbl 1517.05141 Math. Struct. Comput. Sci. 32, No. 2, 240-256 (2022). MSC: 05C70 05C10 05C38 68R10 68U10 68P30 PDFBibTeX XMLCite \textit{X. He} et al., Math. Struct. Comput. Sci. 32, No. 2, 240--256 (2022; Zbl 1517.05141) Full Text: DOI
Pudlák, Pavel; Rödl, Vojtěch Extractors for small zero-fixing sources. (English) Zbl 1513.68015 Combinatorica 42, No. 4, 587-616 (2022). Reviewer: Ioan Tomescu (Bucureşti) MSC: 68P30 05D10 68Q87 PDFBibTeX XMLCite \textit{P. Pudlák} and \textit{V. Rödl}, Combinatorica 42, No. 4, 587--616 (2022; Zbl 1513.68015) Full Text: DOI arXiv
de Figueiredo, Celina M. H.; de Melo, Alexsander A.; Sasaki, Diana; Silva, Ana Revising Johnson’s table for the 21st century. (English) Zbl 1502.05184 Discrete Appl. Math. 323, 184-200 (2022). MSC: 05C69 05C05 68Q25 68Q27 PDFBibTeX XMLCite \textit{C. M. H. de Figueiredo} et al., Discrete Appl. Math. 323, 184--200 (2022; Zbl 1502.05184) Full Text: DOI arXiv
Paesani, Giacomo; Paulusma, Daniël; Rzążwski, Paweł Feedback vertex set and even cycle transversal for \(H\)-free graphs: finding large block graphs. (English) Zbl 1498.05275 SIAM J. Discrete Math. 36, No. 4, 2453-2472 (2022). MSC: 05D15 05C85 05C69 05B05 68Q25 PDFBibTeX XMLCite \textit{G. Paesani} et al., SIAM J. Discrete Math. 36, No. 4, 2453--2472 (2022; Zbl 1498.05275) Full Text: DOI arXiv
Wißmann, Thorsten Minimality notions via factorization systems and examples. (English) Zbl 07596579 Log. Methods Comput. Sci. 18, No. 3, Paper No. 31, 26 p. (2022). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{T. Wißmann}, Log. Methods Comput. Sci. 18, No. 3, Paper No. 31, 26 p. (2022; Zbl 07596579) Full Text: DOI arXiv
Nandi, Soumen; Sen, Sagnik; Taruni, S. On relative clique number of triangle-free planar colored mixed graphs. (English) Zbl 07577717 Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 439-450 (2022). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{S. Nandi} et al., Lect. Notes Comput. Sci. 13270, 439--450 (2022; Zbl 07577717) Full Text: DOI
Lucke, Felicia; Mann, Felix Using edge contractions and vertex deletions to reduce the independence number and the clique number. (English) Zbl 07577715 Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 412-424 (2022). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{F. Lucke} and \textit{F. Mann}, Lect. Notes Comput. Sci. 13270, 412--424 (2022; Zbl 07577715) Full Text: DOI arXiv
Bergé, Pierre; Busson, Anthony; Feghali, Carl; Watrigant, Rémi 1-extendability of independent sets. (English) Zbl 07577698 Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 172-185 (2022). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{P. Bergé} et al., Lect. Notes Comput. Sci. 13270, 172--185 (2022; Zbl 07577698) Full Text: DOI arXiv
Bílková, Marta; Dostál, Matěj Moss’ logic for ordered coalgebras. (English) Zbl 07577582 Log. Methods Comput. Sci. 18, No. 3, Paper No. 18, 61 p. (2022). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{M. Bílková} and \textit{M. Dostál}, Log. Methods Comput. Sci. 18, No. 3, Paper No. 18, 61 p. (2022; Zbl 07577582) Full Text: arXiv Link
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani Partitioning \(H\)-free graphs of bounded diameter. (English) Zbl 07575095 Theor. Comput. Sci. 930, 37-52 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{C. Brause} et al., Theor. Comput. Sci. 930, 37--52 (2022; Zbl 07575095) Full Text: DOI arXiv
Pandit, Supantha Covering and packing of triangles intersecting a straight line. (English) Zbl 1496.90080 Discrete Appl. Math. 319, 92-110 (2022). MSC: 90C27 90C35 90C39 68Q25 PDFBibTeX XMLCite \textit{S. Pandit}, Discrete Appl. Math. 319, 92--110 (2022; Zbl 1496.90080) Full Text: DOI
Mosca, Raffaele New results on independent sets in extensions of \(2K_2\)-free graphs. (English) Zbl 1494.05088 Graphs Comb. 38, No. 4, Paper No. 127, 28 p. (2022). MSC: 05C69 05C35 05C75 68Q25 90C39 PDFBibTeX XMLCite \textit{R. Mosca}, Graphs Comb. 38, No. 4, Paper No. 127, 28 p. (2022; Zbl 1494.05088) Full Text: DOI
Strawn, Nate Filament plots for data visualization. (English) Zbl 07557813 Appl. Comput. Harmon. Anal. 60, 205-241 (2022). MSC: 68-XX 65-XX PDFBibTeX XMLCite \textit{N. Strawn}, Appl. Comput. Harmon. Anal. 60, 205--241 (2022; Zbl 07557813) Full Text: DOI arXiv
Chakraborty, Dibyayan; Gajjar, Kshitij Finding geometric representations of apex graphs is NP-hard. (English) Zbl 07556569 Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 161-174 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{D. Chakraborty} and \textit{K. Gajjar}, Lect. Notes Comput. Sci. 13174, 161--174 (2022; Zbl 07556569) Full Text: DOI arXiv
Brešar, Boštjan; Dravec, Tanja; Gorzkowska, Aleksandra; Kleszcz, Elżbieta Graphs with a unique maximum independent set up to automorphisms. (English) Zbl 1490.05198 Discrete Appl. Math. 317, 124-135 (2022). MSC: 05C69 05C35 05C05 05C76 05C85 68Q25 PDFBibTeX XMLCite \textit{B. Brešar} et al., Discrete Appl. Math. 317, 124--135 (2022; Zbl 1490.05198) Full Text: DOI
Brettell, Nick; Johnson, Matthew; Paulusma, Daniël Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs. (English) Zbl 07526471 J. Comput. Syst. Sci. 128, 71-85 (2022). MSC: 68-XX PDFBibTeX XMLCite \textit{N. Brettell} et al., J. Comput. Syst. Sci. 128, 71--85 (2022; Zbl 07526471) Full Text: DOI
Bose, Prosenjit; Carmi, Paz; Keil, J. Mark; Maheshwari, Anil; Mehrabi, Saeed; Mondal, Debajyoti; Smid, Michiel Computing maximum independent set on outerstring graphs and their relatives. (English) Zbl 1486.05222 Comput. Geom. 103, Article ID 101852, 12 p. (2022). MSC: 05C69 05C35 05C62 68Q25 68W05 PDFBibTeX XMLCite \textit{P. Bose} et al., Comput. Geom. 103, Article ID 101852, 12 p. (2022; Zbl 1486.05222) Full Text: DOI arXiv
Hölzl, Rupert; Porter, Christopher P. Degrees of randomized computability. (English) Zbl 1497.03056 Bull. Symb. Log. 28, No. 1, 27-70 (2022). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03D32 03D30 03D28 68Q30 PDFBibTeX XMLCite \textit{R. Hölzl} and \textit{C. P. Porter}, Bull. Symb. Log. 28, No. 1, 27--70 (2022; Zbl 1497.03056) Full Text: DOI arXiv
Bénéteau, Laurine; Chalopin, Jérémie; Chepoi, Victor; Vaxès, Yann Medians in median graphs and their cube complexes in linear time. (English) Zbl 1483.68250 J. Comput. Syst. Sci. 126, 80-105 (2022). MSC: 68R10 05C85 68W40 PDFBibTeX XMLCite \textit{L. Bénéteau} et al., J. Comput. Syst. Sci. 126, 80--105 (2022; Zbl 1483.68250) Full Text: DOI arXiv
Bentert, Matthias; Heeger, Klaus; Knop, Dušan Length-bounded cuts: proper interval graphs and structural parameters. (English) Zbl 1505.68032 J. Comput. Syst. Sci. 126, 21-43 (2022). Reviewer: Vladimír Lacko (Košice) MSC: 68R10 68Q25 68Q27 PDFBibTeX XMLCite \textit{M. Bentert} et al., J. Comput. Syst. Sci. 126, 21--43 (2022; Zbl 1505.68032) Full Text: DOI arXiv
Fürer, Basil; Lochbihler, Andreas; Schneider, Joshua; Traytel, Dmitriy Quotients of bounded natural functors. (English) Zbl 07471712 Log. Methods Comput. Sci. 18, No. 1, Paper No. 23, 28 p. (2022). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{B. Fürer} et al., Log. Methods Comput. Sci. 18, No. 1, Paper No. 23, 28 p. (2022; Zbl 07471712) Full Text: arXiv Link
Gehrke, Mai; Jakl, Tomáš; Reggio, Luca A duality theoretic view on limits of finite structures. (English) Zbl 07471705 Log. Methods Comput. Sci. 18, No. 1, Paper No. 16, 38 p. (2022). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{M. Gehrke} et al., Log. Methods Comput. Sci. 18, No. 1, Paper No. 16, 38 p. (2022; Zbl 07471705) Full Text: arXiv Link
Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël Computing subset transversals in \(H\)-free graphs. (English) Zbl 07458786 Theor. Comput. Sci. 902, 76-92 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{N. Brettell} et al., Theor. Comput. Sci. 902, 76--92 (2022; Zbl 07458786) Full Text: DOI arXiv
Daneshpajouh, Hamid Reza; Meunier, Frédéric; Mizrahi, Guilhem Colorings of complements of line graphs. (English) Zbl 1522.05106 J. Graph Theory 98, No. 2, 216-233 (2021). MSC: 05C15 05C76 68Q17 PDFBibTeX XMLCite \textit{H. R. Daneshpajouh} et al., J. Graph Theory 98, No. 2, 216--233 (2021; Zbl 1522.05106) Full Text: DOI arXiv
Pach, János; Tardos, Gábor; Tóth, Géza Disjointness graphs of segments in the space. (English) Zbl 1510.05083 Comb. Probab. Comput. 30, No. 4, 498-512 (2021). MSC: 05C15 05C62 05C85 68Q17 PDFBibTeX XMLCite \textit{J. Pach} et al., Comb. Probab. Comput. 30, No. 4, 498--512 (2021; Zbl 1510.05083) Full Text: DOI
Eppstein, David; Gupta, Siddharth; Havvaei, Elham Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes. (English) Zbl 07530235 Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 217-229 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Eppstein} et al., Lect. Notes Comput. Sci. 12867, 217--229 (2021; Zbl 07530235) Full Text: DOI arXiv
Bustamante, Luis Henrique; Martins, Ana Teresa Some aspects of the database resilience. (English) Zbl 07500636 Cerone, Antonio (ed.) et al., Theoretical aspects of computing – ICTAC 2021. 18th international colloquium, virtual event, Nur-Sultan, Kazakhstan, September 8–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12819, 39-46 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{L. H. Bustamante} and \textit{A. T. Martins}, Lect. Notes Comput. Sci. 12819, 39--46 (2021; Zbl 07500636) Full Text: DOI
Brettell, Nick; Johnson, Matthew; Paulusma, Daniël Computing weighted subset transversals in \(H\)-free graphs. (English) Zbl 07498680 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 229-242 (2021). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{N. Brettell} et al., Lect. Notes Comput. Sci. 12808, 229--242 (2021; Zbl 07498680) Full Text: DOI
Dallard, Clément; Krbezlija, Mirza; Milanič, Martin Vertex cover at distance on \(H\)-free graphs. (English) Zbl 07495026 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 237-251 (2021). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{C. Dallard} et al., Lect. Notes Comput. Sci. 12757, 237--251 (2021; Zbl 07495026) Full Text: DOI
Pang, Shuo Large clique is hard on average for resolution. (English) Zbl 07493542 Santhanam, Rahul (ed.) et al., Computer science – theory and applications. 16th international computer science symposium in Russia, CSR 2021, Sochi, Russia, June 28 – July 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12730, 361-380 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Pang}, Lect. Notes Comput. Sci. 12730, 361--380 (2021; Zbl 07493542) Full Text: DOI
Greenberg, Noam; Miller, Joseph S.; Nies, André Highness properties close to PA completeness. (English) Zbl 1485.03164 Isr. J. Math. 244, No. 1, 419-465 (2021). Reviewer: Liang Yu (Nanjing) MSC: 03D32 68Q30 PDFBibTeX XMLCite \textit{N. Greenberg} et al., Isr. J. Math. 244, No. 1, 419--465 (2021; Zbl 1485.03164) Full Text: DOI arXiv
Mosca, Raffaele Independent sets in \((P_4+P_4\),triangle)-free graphs. (English) Zbl 1479.05282 Graphs Comb. 37, No. 6, 2173-2189 (2021). MSC: 05C69 68Q17 68R10 05C85 05C35 05C75 PDFBibTeX XMLCite \textit{R. Mosca}, Graphs Comb. 37, No. 6, 2173--2189 (2021; Zbl 1479.05282) Full Text: DOI arXiv
Dalirrooyfard, Mina; Vuong, Thuy Duong; Williams, Virginia Vassilevska Graph pattern detection: hardness for all induced patterns and faster noninduced cycles. (English) Zbl 1478.05145 SIAM J. Comput. 50, No. 5, 1627-1662 (2021). MSC: 05C85 05C38 05C60 05C15 03D15 68T10 68Q25 68R10 PDFBibTeX XMLCite \textit{M. Dalirrooyfard} et al., SIAM J. Comput. 50, No. 5, 1627--1662 (2021; Zbl 1478.05145) Full Text: DOI
Monroe, Laura Binary signed-digit integers and the Stern diatomic sequence. (English) Zbl 1489.11014 Des. Codes Cryptography 89, No. 12, 2653-2662 (2021). Reviewer: Michael Coons (Callaghan) MSC: 11A63 11B83 68R01 PDFBibTeX XMLCite \textit{L. Monroe}, Des. Codes Cryptography 89, No. 12, 2653--2662 (2021; Zbl 1489.11014) Full Text: DOI arXiv
Györfi, László; Weiss, Roi Universal consistency and rates of convergence of multiclass prototype algorithms in metric spaces. (English) Zbl 07415094 J. Mach. Learn. Res. 22, Paper No. 151, 25 p. (2021). MSC: 68T05 PDFBibTeX XMLCite \textit{L. Györfi} and \textit{R. Weiss}, J. Mach. Learn. Res. 22, Paper No. 151, 25 p. (2021; Zbl 07415094) Full Text: arXiv Link
Hanneke, Steve Learning whenever learning is possible: universal learning under general stochastic processes. (English) Zbl 07415073 J. Mach. Learn. Res. 22, Paper No. 130, 116 p. (2021). MSC: 68T05 PDFBibTeX XMLCite \textit{S. Hanneke}, J. Mach. Learn. Res. 22, Paper No. 130, 116 p. (2021; Zbl 07415073) Full Text: arXiv Link
Boix-Adserà, Enric; Brennan, Matthew; Bresler, Guy The average-case complexity of counting cliques in Erdös-Rényi hypergraphs. (English) Zbl 1528.68276 SIAM J. Comput. 50, No. 5, FOCS19-39-FOCS19-80 (2021). MSC: 68R10 05C65 05C80 05C85 68Q25 PDFBibTeX XMLCite \textit{E. Boix-Adserà} et al., SIAM J. Comput. 50, No. 5, FOCS19--39-FOCS19--80 (2021; Zbl 1528.68276) Full Text: DOI arXiv
García Olaverri, Alfredo; Tejel Altarriba, Javier; Pilz, Alexander On plane subgraphs of complete topological drawings. (English) Zbl 1475.05122 Ars Math. Contemp. 20, No. 1, 69-87 (2021). MSC: 05C62 05C10 68Q17 PDFBibTeX XMLCite \textit{A. García Olaverri} et al., Ars Math. Contemp. 20, No. 1, 69--87 (2021; Zbl 1475.05122) Full Text: DOI
Naor, Assaf An average John theorem. (English) Zbl 1481.46016 Geom. Topol. 25, No. 4, 1631-1717 (2021). Reviewer: Mikhail Ostrovskii (New York) MSC: 46B85 30L05 51F30 68R12 PDFBibTeX XMLCite \textit{A. Naor}, Geom. Topol. 25, No. 4, 1631--1717 (2021; Zbl 1481.46016) 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
Rosenthal, Gregory Beating treewidth for average-case subgraph isomorphism. (English) Zbl 1515.68254 Algorithmica 83, No. 8, 2521-2551 (2021). MSC: 68R10 05C60 68Q06 68Q25 68Q27 PDFBibTeX XMLCite \textit{G. Rosenthal}, Algorithmica 83, No. 8, 2521--2551 (2021; Zbl 1515.68254) Full Text: DOI arXiv Link
Brandstädt, Andreas; Mosca, Raffaele Maximum weight independent sets for (\(S_{1,2,4}\), triangle)-free graphs in polynomial time. (English) Zbl 1517.05164 Theor. Comput. Sci. 878-879, 11-25 (2021). MSC: 05C85 05C69 68W40 PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{R. Mosca}, Theor. Comput. Sci. 878--879, 11--25 (2021; Zbl 1517.05164) Full Text: DOI arXiv
Zhukovskii, Maksim E.; Kudryavtsev, Eremei D.; Makarov, Mikhail V.; Shlychkova, Aleksandra S. Logical complexity of induced subgraph isomorphism for certain families of graphs. (English. Russian original) Zbl 1468.05189 Sb. Math. 212, No. 4, 517-530 (2021); translation from Mat. Sb. 212, No. 4, 76-90 (2021). MSC: 05C60 68Q19 68Q17 03C13 PDFBibTeX XMLCite \textit{M. E. Zhukovskii} et al., Sb. Math. 212, No. 4, 517--530 (2021; Zbl 1468.05189); translation from Mat. Sb. 212, No. 4, 76--90 (2021) Full Text: DOI
Amanatidis, Georgios; Fulla, Peter; Markakis, Evangelos; Sornat, Krzysztof Inequity aversion pricing over social networks: approximation algorithms and hardness results. (English) Zbl 1480.91167 Theor. Comput. Sci. 871, 62-78 (2021). MSC: 91D30 91B86 68Q17 68W25 PDFBibTeX XMLCite \textit{G. Amanatidis} et al., Theor. Comput. Sci. 871, 62--78 (2021; Zbl 1480.91167) Full Text: DOI Link
Lindenhovius, Bert; Mislove, Michael; Zamdzhiev, Vladimir LNL-FPC: the linear/non-linear fixpoint calculus. (English) Zbl 07350775 Log. Methods Comput. Sci. 17, No. 2, Paper No. 9, 61 p. (2021). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{B. Lindenhovius} et al., Log. Methods Comput. Sci. 17, No. 2, Paper No. 9, 61 p. (2021; Zbl 07350775) Full Text: arXiv Link
Biedl, Therese; Mehrabi, Saeed On orthogonally guarding orthogonal polygons with bounded treewidth. (English) Zbl 1512.68402 Algorithmica 83, No. 2, 641-666 (2021). MSC: 68U05 68Q17 68Q25 PDFBibTeX XMLCite \textit{T. Biedl} and \textit{S. Mehrabi}, Algorithmica 83, No. 2, 641--666 (2021; Zbl 1512.68402) Full Text: DOI arXiv
Abreu, Alexandre; Cunha, Luís; de Figueiredo, Celina; Kowada, Luis; Marquezino, Franklin; Portugal, Renato; Posner, Daniel A computational complexity comparative study of graph tessellation problems. (English) Zbl 1462.68129 Theor. Comput. Sci. 858, 81-89 (2021). Reviewer: Xueliang Li (Tianjin) MSC: 68R10 05C70 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Abreu} et al., Theor. Comput. Sci. 858, 81--89 (2021; Zbl 1462.68129) Full Text: DOI
Bentert, Matthias; Heeger, Klaus; Knop, Dušan Length-bounded cuts: proper interval graphs and structural parameters. (English) Zbl 07765394 Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 36, 14 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{M. Bentert} et al., LIPIcs -- Leibniz Int. Proc. Inform. 181, Article 36, 14 p. (2020; Zbl 07765394) Full Text: DOI
Chlamtáč, Eden; Kolman, Petr How to cut a ball without separating: improved approximations for length bounded cut. (English) Zbl 07758343 Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 41, 17 p. (2020). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{E. Chlamtáč} and \textit{P. Kolman}, LIPIcs -- Leibniz Int. Proc. Inform. 176, Article 41, 17 p. (2020; Zbl 07758343) Full Text: DOI
Bonnet, Édouard; Thomassé, Stéphan; Tran, Xuan Thang; Watrigant, Rémi An algorithmic weakening of the Erdő’s-Hajnal conjecture. (English) Zbl 07651162 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 23, 18 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{É. Bonnet} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 23, 18 p. (2020; Zbl 07651162) Full Text: DOI arXiv
Fürer, Basil; Lochbihler, Andreas; Schneider, Joshua; Traytel, Dmitriy Quotients of bounded natural functors. (English) Zbl 07614662 Peltier, Nicolas (ed.) et al., Automated reasoning. 10th international joint conference, IJCAR 2020, Paris, France, July 1–4, 2020. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12167, 58-78 (2020). MSC: 68V15 PDFBibTeX XMLCite \textit{B. Fürer} et al., Lect. Notes Comput. Sci. 12167, 58--78 (2020; Zbl 07614662) Full Text: DOI
Jansen, Bart M. P. Crossing paths with Hans Bodlaender: a personal view on cross-composition for sparsification lower bounds. (English) Zbl 07604207 Fomin, Fedor V. (ed.) et al., Treewidth, kernels, and algorithms. Essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 12160, 89-111 (2020). MSC: 68-XX PDFBibTeX XMLCite \textit{B. M. P. Jansen}, Lect. Notes Comput. Sci. 12160, 89--111 (2020; Zbl 07604207) Full Text: DOI
Künnemann, Marvin; Marx, Dániel Finding small satisfying assignments faster than brute force: a fine-grained perspective into Boolean constraint satisfaction. (English) Zbl 07561755 Saraf, Shubhangi (ed.), 35th computational complexity conference, CCC 2020, July 28–31, 2020, Saarbrücken, Germany, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 169, Article 27, 28 p. (2020). MSC: 68Q25 PDFBibTeX XMLCite \textit{M. Künnemann} and \textit{D. Marx}, LIPIcs -- Leibniz Int. Proc. Inform. 169, Article 27, 28 p. (2020; Zbl 07561755) Full Text: DOI arXiv
Zamdzhiev, Vladimir Reflecting algebraically compact functors. (English) Zbl 07453968 Baez, John (ed.) et al., Proceedings of the applied category theory 2019, ACT 2019, University of Oxford, UK, July 15–19, 2019. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 323, 15-23 (2020). MSC: 68-XX 18-XX PDFBibTeX XMLCite \textit{V. Zamdzhiev}, Electron. Proc. Theor. Comput. Sci. (EPTCS) 323, 15--23 (2020; Zbl 07453968) Full Text: arXiv Link
Bremner, Murray R.; Elgendy, Hader A. Special identities for comtrans algebras. (English) Zbl 1478.17004 Linear Multilinear Algebra 68, No. 6, 1140-1159 (2020). Reviewer: Wiesław A. Dudek (Wrocław) MSC: 17A40 15-04 15A21 15A69 15B36 18M60 20C30 68W30 PDFBibTeX XMLCite \textit{M. R. Bremner} and \textit{H. A. Elgendy}, Linear Multilinear Algebra 68, No. 6, 1140--1159 (2020; Zbl 1478.17004) Full Text: DOI arXiv
Bodlaender, Hans L.; Hanaka, Tesshu; Kobayashi, Yasuaki; Kobayashi, Yusuke; Okamoto, Yoshio; Otachi, Yota; van der Zanden, Tom C. Subgraph isomorphism on graph classes that exclude a substructure. (English) Zbl 1492.68102 Algorithmica 82, No. 12, 3566-3587 (2020). MSC: 68R10 05C60 05C83 68Q27 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Algorithmica 82, No. 12, 3566--3587 (2020; Zbl 1492.68102) Full Text: DOI arXiv
Grigoryan, Oleg; Makarov, Mikhail; Zhukovskii, Maksim First-order definitions of subgraph isomorphism through the adjacency and order relations. (English) Zbl 1472.03026 Mosc. J. Comb. Number Theory 9, No. 3, 293-302 (2020). Reviewer: Gregory Loren McColm (Tampa) MSC: 03C13 05C60 68Q19 PDFBibTeX XMLCite \textit{O. Grigoryan} et al., Mosc. J. Comb. Number Theory 9, No. 3, 293--302 (2020; Zbl 1472.03026) Full Text: DOI
Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Rzążewski, Paweł On cycle transversals and their connected variants in the absence of a small linear forest. (English) Zbl 1459.05332 Algorithmica 82, No. 10, 2841-2866 (2020). MSC: 05D15 05C38 68Q17 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., Algorithmica 82, No. 10, 2841--2866 (2020; Zbl 1459.05332) Full Text: DOI
Gehrke, Mai; Jakl, Tomáš; Reggio, Luca A duality theoretic view on limits of finite structures. (English) Zbl 07250944 Goubault-Larrecq, Jean (ed.) et al., Foundations of software science and computation structures. 23rd international conference, FOSSACS 2020, held as part of the European joint conferences on theory and practice of software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12077, 299-318 (2020). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{M. Gehrke} et al., Lect. Notes Comput. Sci. 12077, 299--318 (2020; Zbl 07250944) Full Text: DOI arXiv
Bonchi, Filippo; Piedeleu, Robin; Sobociński, Paweł; Zanasi, Fabio Contextual equivalence for signal flow graphs. (English) Zbl 07250933 Goubault-Larrecq, Jean (ed.) et al., Foundations of software science and computation structures. 23rd international conference, FOSSACS 2020, held as part of the European joint conferences on theory and practice of software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12077, 77-96 (2020). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{F. Bonchi} et al., Lect. Notes Comput. Sci. 12077, 77--96 (2020; Zbl 07250933) Full Text: DOI arXiv
Altmanová, Kateřina; Kolman, Petr; Voborník, Jan On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow. (English) Zbl 1447.05192 J. Graph Algorithms Appl. 24, No. 3, 303-322 (2020). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{K. Altmanová} et al., J. Graph Algorithms Appl. 24, No. 3, 303--322 (2020; Zbl 1447.05192) Full Text: DOI arXiv
Arvanitoyeorgos, Andreas; Sakane, Yusuke; Statha, Marina Invariant Einstein metrics on \(\text{SU}(n)\) and complex Stiefel manifolds. (English) Zbl 1509.53052 Tôhoku Math. J. (2) 72, No. 2, 161-210 (2020). MSC: 53C25 53C30 13P10 65H10 68W30 PDFBibTeX XMLCite \textit{A. Arvanitoyeorgos} et al., Tôhoku Math. J. (2) 72, No. 2, 161--210 (2020; Zbl 1509.53052) Full Text: DOI arXiv Euclid
Eden, Talya; Ron, Dana; Seshadhri, C. On approximating the number of \(k\)-cliques in sublinear time. (English) Zbl 1452.68276 SIAM J. Comput. 49, No. 4, 747-771 (2020). MSC: 68W25 05C69 68Q25 68R10 68W20 PDFBibTeX XMLCite \textit{T. Eden} et al., SIAM J. Comput. 49, No. 4, 747--771 (2020; Zbl 1452.68276) Full Text: DOI
Bonnet, Édouard; Bousquet, Nicolas; Charbit, Pierre; Thomassé, Stéphan; Watrigant, Rémi Parameterized complexity of independent set in H-free graphs. (English) Zbl 1452.68090 Algorithmica 82, No. 8, 2360-2394 (2020). MSC: 68Q27 05C69 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{É. Bonnet} et al., Algorithmica 82, No. 8, 2360--2394 (2020; Zbl 1452.68090) Full Text: DOI arXiv